Execution Chart

Sorry, for this execution, no execution chart could be reported.

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r212-tall-174901994200356.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is SieveSingleMsgMbox-PT-d0m04, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r212-tall-174901994200356
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 468K
-rw-r--r-- 1 mcc users 5.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 47K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 143K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rw-r--r-- 1 mcc users 57K May 29 14:33 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 SieveSingleMsgMbox-PT-d0m04-LTLFireability-00
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-01
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-02
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-03
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-04
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-05
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-06
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-07
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-08
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-09
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-10
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-11
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-12
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-13
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-14
FORMULA_NAME SieveSingleMsgMbox-PT-d0m04-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749146960693

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=SieveSingleMsgMbox-PT-d0m04
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-05 18:09:21] [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]
[2025-06-05 18:09:21] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 18:09:21] [INFO ] Load time of PNML (sax parser for PT used): 61 ms
[2025-06-05 18:09:21] [INFO ] Transformed 262 places.
[2025-06-05 18:09:21] [INFO ] Transformed 73 transitions.
[2025-06-05 18:09:21] [INFO ] Parsed PT model containing 262 places and 73 transitions and 292 arcs in 141 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 190 places in 1 ms
Reduce places removed 190 places and 0 transitions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 25 out of 72 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 72/72 places, 73/73 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 70 transition count 73
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 7 place count 65 transition count 68
Iterating global reduction 1 with 5 rules applied. Total rules applied 12 place count 65 transition count 68
Applied a total of 12 rules in 17 ms. Remains 65 /72 variables (removed 7) and now considering 68/73 (removed 5) transitions.
// Phase 1: matrix 68 rows 65 cols
[2025-06-05 18:09:22] [INFO ] Computed 5 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:22] [INFO ] Implicit Places using invariants in 180 ms returned []
[2025-06-05 18:09:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:22] [INFO ] State equation strengthened by 28 read => feed constraints.
[2025-06-05 18:09:22] [INFO ] Implicit Places using invariants and state equation in 213 ms returned []
Implicit Place search using SMT with State Equation took 430 ms to find 0 implicit places.
Running 67 sub problems to find dead transitions.
[2025-06-05 18:09:22] [INFO ] Invariant cache hit.
[2025-06-05 18:09:22] [INFO ] State equation strengthened by 28 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/64 variables, 3/4 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 13 places in 95 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 12 places in 50 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/64 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/64 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 4 (OVERLAPS) 1/65 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 12 places in 47 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 13 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 12 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 21 places in 31 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:23] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/65 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:24] [INFO ] Deduced a trap composed of 23 places in 38 ms of which 4 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/65 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:24] [INFO ] Deduced a trap composed of 21 places in 30 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/65 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 67 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/65 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 67 unsolved
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
At refinement iteration 9 (OVERLAPS) 68/133 variables, 65/80 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/133 variables, 28/108 constraints. Problems are: Problem set: 5 solved, 62 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:25] [INFO ] Deduced a trap composed of 19 places in 92 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:25] [INFO ] Deduced a trap composed of 21 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:25] [INFO ] Deduced a trap composed of 21 places in 43 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:25] [INFO ] Deduced a trap composed of 21 places in 47 ms of which 5 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/133 variables, 4/112 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/133 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 13 (OVERLAPS) 0/133 variables, 0/112 constraints. Problems are: Problem set: 5 solved, 62 unsolved
No progress, stopping.
After SMT solving in domain Real declared 133/133 variables, and 112 constraints, problems are : Problem set: 5 solved, 62 unsolved in 4959 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 67/67 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 62 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/57 variables, 1/1 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/57 variables, 2/3 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/57 variables, 5/8 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/57 variables, 0/8 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 4 (OVERLAPS) 1/58 variables, 1/9 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/58 variables, 1/10 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/58 variables, 0/10 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 7 (OVERLAPS) 4/62 variables, 1/11 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 4/15 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 10 (OVERLAPS) 68/130 variables, 62/77 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/130 variables, 28/105 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/130 variables, 11/116 constraints. Problems are: Problem set: 5 solved, 62 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/130 variables, 0/116 constraints. Problems are: Problem set: 5 solved, 62 unsolved
Problem TDEAD61 is UNSAT
Problem TDEAD64 is UNSAT
At refinement iteration 14 (OVERLAPS) 3/133 variables, 3/119 constraints. Problems are: Problem set: 7 solved, 60 unsolved
Problem TDEAD62 is UNSAT
Problem TDEAD65 is UNSAT
At refinement iteration 15 (INCLUDED_ONLY) 0/133 variables, 51/170 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/133 variables, 4/174 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/133 variables, 0/174 constraints. Problems are: Problem set: 9 solved, 58 unsolved
At refinement iteration 18 (OVERLAPS) 0/133 variables, 0/174 constraints. Problems are: Problem set: 9 solved, 58 unsolved
No progress, stopping.
After SMT solving in domain Int declared 133/133 variables, and 174 constraints, problems are : Problem set: 9 solved, 58 unsolved in 8134 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 65/65 constraints, ReadFeed: 28/28 constraints, PredecessorRefiner: 62/67 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 13178ms problems are : Problem set: 9 solved, 58 unsolved
Search for dead transitions found 9 dead transitions in 13193ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 65/72 places, 59/73 transitions.
Reduce places removed 7 places and 8 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 58 transition count 51
Reduce places removed 4 places and 5 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 54 transition count 46
Reduce places removed 0 places and 1 transitions.
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 53 transition count 45
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 12 rules in 5 ms. Remains 53 /65 variables (removed 12) and now considering 45/59 (removed 14) transitions.
// Phase 1: matrix 45 rows 53 cols
[2025-06-05 18:09:35] [INFO ] Computed 10 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:35] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-05 18:09:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:35] [INFO ] State equation strengthened by 18 read => feed constraints.
[2025-06-05 18:09:35] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 53/72 places, 45/73 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 13763 ms. Remains : 53/72 places, 45/73 transitions.
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Support contains 12 out of 46 places after structural reductions.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:09:36] [INFO ] Initial state reduction rules for LTL removed 2 formulas.
[2025-06-05 18:09:36] [INFO ] Flatten gal took : 19 ms
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
[2025-06-05 18:09:36] [INFO ] Flatten gal took : 8 ms
[2025-06-05 18:09:36] [INFO ] Input system was already deterministic with 45 transitions.
Support contains 9 out of 46 places (down from 12) after GAL structural reductions.
RANDOM walk for 40000 steps (8947 resets) in 1089 ms. (36 steps per ms) remains 3/8 properties
BEST_FIRST walk for 40002 steps (1868 resets) in 164 ms. (242 steps per ms) remains 1/3 properties
BEST_FIRST walk for 40004 steps (1860 resets) in 88 ms. (449 steps per ms) remains 1/1 properties
// Phase 1: matrix 45 rows 46 cols
[2025-06-05 18:09:36] [INFO ] Computed 3 invariants in 1 ms
[2025-06-05 18:09:36] [INFO ] State equation strengthened by 18 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 32/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/37 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:36] [INFO ] Deduced a trap composed of 22 places in 34 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/80 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 11/91 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/91 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 91/91 variables, and 68 constraints, problems are : Problem set: 0 solved, 1 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
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) 32/34 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 3/37 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/37 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 43/80 variables, 37/41 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/80 variables, 16/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/80 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 11/91 variables, 9/66 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/91 variables, 2/68 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/91 variables, 1/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/91 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/91 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 91/91 variables, and 69 constraints, problems are : Problem set: 0 solved, 1 unsolved in 81 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 46/46 constraints, ReadFeed: 18/18 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 192ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 46/46 places, 45/45 transitions.
Graph (complete) has 114 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 44
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 4 place count 42 transition count 42
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 9 place count 41 transition count 40
Applied a total of 9 rules in 14 ms. Remains 41 /46 variables (removed 5) and now considering 40/45 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 41/46 places, 40/45 transitions.
RANDOM walk for 40000 steps (9002 resets) in 98 ms. (404 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (1954 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 249 steps, run visited all 1 properties in 6 ms. (steps per millisecond=41 )
Probabilistic random walk after 249 steps, saw 137 distinct states, run finished after 11 ms. (steps per millisecond=22 ) properties seen :1
Computed a total of 9 stabilizing places and 13 stable transitions
Graph (complete) has 131 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0||X(X(X(G(p0))))))))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 45/45 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 41 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 40 transition count 39
Applied a total of 12 rules in 10 ms. Remains 40 /46 variables (removed 6) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 40 cols
[2025-06-05 18:09:37] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:37] [INFO ] Implicit Places using invariants in 45 ms returned []
[2025-06-05 18:09:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:37] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:09:37] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 116 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2025-06-05 18:09:37] [INFO ] Invariant cache hit.
[2025-06-05 18:09:37] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:37] [INFO ] Deduced a trap composed of 9 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:37] [INFO ] Deduced a trap composed of 9 places in 33 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:37] [INFO ] Deduced a trap along path composed of 3 places in 31 ms of which 6 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1499 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2492 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4002ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4003ms
Starting structural reductions in LTL mode, iteration 1 : 40/46 places, 39/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4130 ms. Remains : 40/46 places, 39/45 transitions.
Stuttering acceptance computed with spot in 532 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-01
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 3 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-01 finished in 4727 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 45/45 transitions.
Graph (complete) has 131 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 41 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 40 transition count 39
Applied a total of 11 rules in 13 ms. Remains 40 /46 variables (removed 6) and now considering 39/45 (removed 6) transitions.
[2025-06-05 18:09:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:41] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-05 18:09:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:41] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:09:41] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:09:41] [INFO ] Redundant transitions in 1 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-05 18:09:41] [INFO ] Invariant cache hit.
[2025-06-05 18:09:41] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:42] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:42] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:42] [INFO ] Deduced a trap along path composed of 3 places in 28 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1437 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2518 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3966ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3966ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/46 places, 39/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4074 ms. Remains : 40/46 places, 39/45 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-02
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-02 finished in 4132 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 45/45 transitions.
Graph (complete) has 131 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 41 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 11 place count 40 transition count 39
Applied a total of 11 rules in 11 ms. Remains 40 /46 variables (removed 6) and now considering 39/45 (removed 6) transitions.
[2025-06-05 18:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:45] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-05 18:09:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:09:45] [INFO ] Implicit Places using invariants and state equation in 64 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:09:45] [INFO ] Redundant transitions in 0 ms returned []
Running 38 sub problems to find dead transitions.
[2025-06-05 18:09:45] [INFO ] Invariant cache hit.
[2025-06-05 18:09:45] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:46] [INFO ] Deduced a trap composed of 9 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:46] [INFO ] Deduced a trap composed of 9 places in 30 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:46] [INFO ] Deduced a trap along path composed of 3 places in 27 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1439 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2547 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 3998ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 3998ms
Starting structural reductions in SI_LTL mode, iteration 1 : 40/46 places, 39/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4117 ms. Remains : 40/46 places, 39/45 transitions.
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-04
Stuttering criterion allowed to conclude after 3 steps with 0 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-04 finished in 4174 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 46/46 places, 45/45 transitions.
Graph (complete) has 131 edges and 46 vertex of which 44 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 44 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 5 place count 41 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 8 place count 41 transition count 41
Applied a total of 8 rules in 6 ms. Remains 41 /46 variables (removed 5) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 41 cols
[2025-06-05 18:09:50] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:50] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 18:09:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:50] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 18:09:50] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 90 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:09:50] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-05 18:09:50] [INFO ] Invariant cache hit.
[2025-06-05 18:09:50] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:50] [INFO ] Deduced a trap along path composed of 5 places in 22 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 61 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1261 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 40 unsolved in 3560 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4831ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 4832ms
Starting structural reductions in SI_LTL mode, iteration 1 : 41/46 places, 41/45 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4933 ms. Remains : 41/46 places, 41/45 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-05
Product exploration explored 100000 steps with 22317 reset in 217 ms.
Product exploration explored 100000 steps with 22331 reset in 145 ms.
Computed a total of 7 stabilizing places and 12 stable transitions
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9000 resets) in 277 ms. (143 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (1936 resets) in 138 ms. (287 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 226 steps, run visited all 1 properties in 4 ms. (steps per millisecond=56 )
Probabilistic random walk after 226 steps, saw 122 distinct states, run finished after 4 ms. (steps per millisecond=56 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 41 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 41/41 places, 41/41 transitions.
Applied a total of 0 rules in 5 ms. Remains 41 /41 variables (removed 0) and now considering 41/41 (removed 0) transitions.
[2025-06-05 18:09:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:55] [INFO ] Implicit Places using invariants in 42 ms returned []
[2025-06-05 18:09:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:09:56] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 18:09:56] [INFO ] Implicit Places using invariants and state equation in 58 ms returned []
Implicit Place search using SMT with State Equation took 102 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 18:09:56] [INFO ] Redundant transitions in 0 ms returned []
Running 40 sub problems to find dead transitions.
[2025-06-05 18:09:56] [INFO ] Invariant cache hit.
[2025-06-05 18:09:56] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:09:56] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 61 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1278 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 40 unsolved in 3617 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4906ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 4906ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 5019 ms. Remains : 41/41 places, 41/41 transitions.
Computed a total of 7 stabilizing places and 12 stable transitions
Computed a total of 7 stabilizing places and 12 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 86 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (9007 resets) in 74 ms. (533 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (1837 resets) in 65 ms. (606 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 226 steps, run visited all 1 properties in 4 ms. (steps per millisecond=56 )
Probabilistic random walk after 226 steps, saw 122 distinct states, run finished after 4 ms. (steps per millisecond=56 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 61 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 22435 reset in 89 ms.
Product exploration explored 100000 steps with 22260 reset in 190 ms.
Built C files in :
/tmp/ltsmin9378361001061202105
[2025-06-05 18:10:01] [INFO ] Computing symmetric may disable matrix : 41 transitions.
[2025-06-05 18:10:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:10:01] [INFO ] Computing symmetric may enable matrix : 41 transitions.
[2025-06-05 18:10:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:10:01] [INFO ] Computing Do-Not-Accords matrix : 41 transitions.
[2025-06-05 18:10:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 18:10:01] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9378361001061202105
Running compilation step : cd /tmp/ltsmin9378361001061202105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 268 ms.
Running link step : cd /tmp/ltsmin9378361001061202105;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin9378361001061202105;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7896910140565236012.hoa' '--buchi-type=spotba'
LTSmin run took 110 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-05 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-05 finished in 12233 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 45/45 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 41 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 41 transition count 41
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 40 transition count 40
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 40 transition count 40
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 12 place count 40 transition count 39
Applied a total of 12 rules in 5 ms. Remains 40 /46 variables (removed 6) and now considering 39/45 (removed 6) transitions.
// Phase 1: matrix 39 rows 40 cols
[2025-06-05 18:10:02] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:10:02] [INFO ] Implicit Places using invariants in 41 ms returned []
[2025-06-05 18:10:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:10:02] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-05 18:10:02] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 38 sub problems to find dead transitions.
[2025-06-05 18:10:02] [INFO ] Invariant cache hit.
[2025-06-05 18:10:02] [INFO ] State equation strengthened by 15 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/43 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 15/58 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:10:02] [INFO ] Deduced a trap composed of 9 places in 38 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:10:02] [INFO ] Deduced a trap composed of 9 places in 36 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 2/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:10:03] [INFO ] Deduced a trap along path composed of 3 places in 25 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (OVERLAPS) 0/79 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 61 constraints, problems are : Problem set: 0 solved, 38 unsolved in 1450 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 38 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 2 (OVERLAPS) 1/40 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/40 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 5 (OVERLAPS) 39/79 variables, 40/45 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 15/60 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/79 variables, 38/98 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 1/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
At refinement iteration 10 (OVERLAPS) 0/79 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 38 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 99 constraints, problems are : Problem set: 0 solved, 38 unsolved in 2592 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 40/40 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 38/38 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4050ms problems are : Problem set: 0 solved, 38 unsolved
Search for dead transitions found 0 dead transitions in 4050ms
Starting structural reductions in LTL mode, iteration 1 : 40/46 places, 39/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4146 ms. Remains : 40/46 places, 39/45 transitions.
Stuttering acceptance computed with spot in 86 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-07 finished in 4248 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(!p0)) U (!p1 U p2)))'
Support contains 3 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 45/45 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 44
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 6 place count 41 transition count 41
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 41 transition count 41
Applied a total of 9 rules in 2 ms. Remains 41 /46 variables (removed 5) and now considering 41/45 (removed 4) transitions.
// Phase 1: matrix 41 rows 41 cols
[2025-06-05 18:10:06] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:10:06] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-05 18:10:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:10:06] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 18:10:06] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 88 ms to find 0 implicit places.
Running 40 sub problems to find dead transitions.
[2025-06-05 18:10:06] [INFO ] Invariant cache hit.
[2025-06-05 18:10:06] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:10:07] [INFO ] Deduced a trap along path composed of 5 places in 23 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (OVERLAPS) 0/82 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 82/82 variables, and 61 constraints, problems are : Problem set: 0 solved, 40 unsolved in 1273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 41/82 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/82 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/82 variables, 40/100 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/82 variables, 1/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
At refinement iteration 9 (OVERLAPS) 0/82 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 82/82 variables, and 101 constraints, problems are : Problem set: 0 solved, 40 unsolved in 3542 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 40/40 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4824ms problems are : Problem set: 0 solved, 40 unsolved
Search for dead transitions found 0 dead transitions in 4824ms
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 41/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4915 ms. Remains : 41/46 places, 41/45 transitions.
Stuttering acceptance computed with spot in 193 ms :[(NOT p2), p0, (AND p0 (NOT p2)), true, (NOT p2)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-10
Stuttering criterion allowed to conclude after 6 steps with 1 reset in 1 ms.
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-10 finished in 5124 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 46 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 46/46 places, 45/45 transitions.
Reduce places removed 2 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 44 transition count 44
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 5 place count 42 transition count 42
Iterating global reduction 1 with 2 rules applied. Total rules applied 7 place count 42 transition count 42
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 41 transition count 41
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 41 transition count 41
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 41 transition count 40
Applied a total of 10 rules in 6 ms. Remains 41 /46 variables (removed 5) and now considering 40/45 (removed 5) transitions.
// Phase 1: matrix 40 rows 41 cols
[2025-06-05 18:10:11] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:10:11] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-05 18:10:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 18:10:11] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-05 18:10:11] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 112 ms to find 0 implicit places.
Running 39 sub problems to find dead transitions.
[2025-06-05 18:10:11] [INFO ] Invariant cache hit.
[2025-06-05 18:10:11] [INFO ] State equation strengthened by 16 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (OVERLAPS) 1/41 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/41 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 4 (OVERLAPS) 40/81 variables, 41/44 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/81 variables, 16/60 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:10:12] [INFO ] Deduced a trap composed of 8 places in 41 ms of which 3 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (OVERLAPS) 0/81 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Real declared 81/81 variables, and 61 constraints, problems are : Problem set: 0 solved, 39 unsolved in 1099 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 3 (OVERLAPS) 1/41 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:10:13] [INFO ] Deduced a trap composed of 20 places in 33 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/41 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 6 (OVERLAPS) 40/81 variables, 41/46 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 16/62 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/81 variables, 39/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/81 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 39 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 18:10:14] [INFO ] Deduced a trap along path composed of 3 places in 21 ms of which 0 ms to minimize.
At refinement iteration 10 (OVERLAPS) 0/81 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/81 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
At refinement iteration 12 (OVERLAPS) 0/81 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 39 unsolved
No progress, stopping.
After SMT solving in domain Int declared 81/81 variables, and 102 constraints, problems are : Problem set: 0 solved, 39 unsolved in 3228 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 41/41 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 39/39 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4336ms problems are : Problem set: 0 solved, 39 unsolved
Search for dead transitions found 0 dead transitions in 4336ms
Starting structural reductions in LTL mode, iteration 1 : 41/46 places, 40/45 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4454 ms. Remains : 41/46 places, 40/45 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : SieveSingleMsgMbox-PT-d0m04-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 120 ms.
Product exploration explored 100000 steps with 50000 reset in 124 ms.
Computed a total of 8 stabilizing places and 13 stable transitions
Computed a total of 8 stabilizing places and 13 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 16 ms. Reduced automaton from 2 states, 2 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA SieveSingleMsgMbox-PT-d0m04-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property SieveSingleMsgMbox-PT-d0m04-LTLFireability-12 finished in 4805 ms.
All properties solved by simple procedures.
Total runtime 54625 ms.

BK_STOP 1749147016517

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="SieveSingleMsgMbox-PT-d0m04"
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-5832"
echo " Executing tool itstools"
echo " Input is SieveSingleMsgMbox-PT-d0m04, 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 r212-tall-174901994200356"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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