About the Execution of ITS-Tools for EGFr-PT-02010
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 24611.00 | 0.00 | 0.00 | FFTFFFTTFTFTFFTT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r072-tall-174860068000732.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 EGFr-PT-02010, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r072-tall-174860068000732
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 608K
-rw-r--r-- 1 mcc users 9.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 22K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 134K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 22K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 87K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 6 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 59K May 29 14:32 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 EGFr-PT-02010-LTLFireability-00
FORMULA_NAME EGFr-PT-02010-LTLFireability-01
FORMULA_NAME EGFr-PT-02010-LTLFireability-02
FORMULA_NAME EGFr-PT-02010-LTLFireability-03
FORMULA_NAME EGFr-PT-02010-LTLFireability-04
FORMULA_NAME EGFr-PT-02010-LTLFireability-05
FORMULA_NAME EGFr-PT-02010-LTLFireability-06
FORMULA_NAME EGFr-PT-02010-LTLFireability-07
FORMULA_NAME EGFr-PT-02010-LTLFireability-08
FORMULA_NAME EGFr-PT-02010-LTLFireability-09
FORMULA_NAME EGFr-PT-02010-LTLFireability-10
FORMULA_NAME EGFr-PT-02010-LTLFireability-11
FORMULA_NAME EGFr-PT-02010-LTLFireability-12
FORMULA_NAME EGFr-PT-02010-LTLFireability-13
FORMULA_NAME EGFr-PT-02010-LTLFireability-14
FORMULA_NAME EGFr-PT-02010-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748832962198
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=EGFr-PT-02010
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 02:56:03] [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-02 02:56:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 02:56:03] [INFO ] Load time of PNML (sax parser for PT used): 50 ms
[2025-06-02 02:56:03] [INFO ] Transformed 40 places.
[2025-06-02 02:56:03] [INFO ] Transformed 68 transitions.
[2025-06-02 02:56:03] [INFO ] Found NUPN structural information;
[2025-06-02 02:56:03] [INFO ] Parsed PT model containing 40 places and 68 transitions and 338 arcs in 135 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA EGFr-PT-02010-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 68/68 transitions.
Applied a total of 0 rules in 7 ms. Remains 40 /40 variables (removed 0) and now considering 68/68 (removed 0) transitions.
[2025-06-02 02:56:03] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
// Phase 1: matrix 39 rows 40 cols
[2025-06-02 02:56:03] [INFO ] Computed 20 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:03] [INFO ] Implicit Places using invariants in 164 ms returned []
[2025-06-02 02:56:03] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2025-06-02 02:56:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:03] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:56:03] [INFO ] Implicit Places using invariants and state equation in 82 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
Running 65 sub problems to find dead transitions.
[2025-06-02 02:56:03] [INFO ] Flow matrix only has 39 transitions (discarded 29 similar events)
[2025-06-02 02:56:03] [INFO ] Invariant cache hit.
[2025-06-02 02:56:03] [INFO ] State equation strengthened by 19 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, 40/40 constraints. Problems are: Problem set: 0 solved, 65 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 20/60 constraints. Problems are: Problem set: 0 solved, 65 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:04] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:04] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:04] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:04] [INFO ] Deduced a trap composed of 2 places in 15 ms of which 1 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:04] [INFO ] Deduced a trap composed of 5 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:04] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:04] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/40 variables, 7/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/40 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 39/79 variables, 40/107 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/79 variables, 19/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/79 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 0/79 variables, 0/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
No progress, stopping.
After SMT solving in domain Real declared 79/79 variables, and 126 constraints, problems are : Problem set: 9 solved, 56 unsolved in 1482 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 65/65 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 56 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/39 variables, 39/39 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/39 variables, 19/58 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/39 variables, 7/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/39 variables, 0/65 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 4 (OVERLAPS) 1/40 variables, 1/66 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 1/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 7 (OVERLAPS) 39/79 variables, 40/107 constraints. Problems are: Problem set: 9 solved, 56 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/79 variables, 19/126 constraints. Problems are: Problem set: 9 solved, 56 unsolved
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/79 variables, 56/182 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/79 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 50 unsolved
At refinement iteration 11 (OVERLAPS) 0/79 variables, 0/182 constraints. Problems are: Problem set: 15 solved, 50 unsolved
No progress, stopping.
After SMT solving in domain Int declared 79/79 variables, and 182 constraints, problems are : Problem set: 15 solved, 50 unsolved in 1027 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 56/65 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2544ms problems are : Problem set: 15 solved, 50 unsolved
Search for dead transitions found 15 dead transitions in 2555ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 40/40 places, 53/68 transitions.
Applied a total of 0 rules in 1 ms. Remains 40 /40 variables (removed 0) and now considering 53/53 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2881 ms. Remains : 40/40 places, 53/68 transitions.
Support contains 36 out of 40 places after structural reductions.
[2025-06-02 02:56:06] [INFO ] Flatten gal took : 17 ms
[2025-06-02 02:56:06] [INFO ] Flatten gal took : 7 ms
[2025-06-02 02:56:06] [INFO ] Input system was already deterministic with 53 transitions.
Reduction of identical properties reduced properties to check from 32 to 29
RANDOM walk for 40000 steps (1788 resets) in 1399 ms. (28 steps per ms) remains 15/29 properties
BEST_FIRST walk for 4003 steps (41 resets) in 39 ms. (100 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (36 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (38 resets) in 22 ms. (173 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (40 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (41 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (48 resets) in 26 ms. (148 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (40 resets) in 10 ms. (364 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (40 resets) in 22 ms. (174 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (43 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (36 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (43 resets) in 12 ms. (307 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4001 steps (41 resets) in 20 ms. (190 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (37 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (39 resets) in 23 ms. (166 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4002 steps (45 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
[2025-06-02 02:56:07] [INFO ] Flow matrix only has 33 transitions (discarded 20 similar events)
// Phase 1: matrix 33 rows 40 cols
[2025-06-02 02:56:07] [INFO ] Computed 20 invariants in 1 ms
[2025-06-02 02:56:07] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp5 is UNSAT
At refinement iteration 1 (INCLUDED_ONLY) 0/27 variables, 8/35 constraints. Problems are: Problem set: 1 solved, 14 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
Problem AtomicPropp1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/27 variables, 2/37 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/27 variables, 0/37 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 4 (OVERLAPS) 11/38 variables, 11/48 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 11/59 constraints. Problems are: Problem set: 2 solved, 13 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 2 ms to minimize.
Problem AtomicPropp14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Problem AtomicPropp15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:07] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp20 is UNSAT
Problem AtomicPropp27 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 8/67 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/38 variables, 0/67 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 31/69 variables, 38/105 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/69 variables, 15/120 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/69 variables, 0/120 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 1/70 variables, 4/124 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/70 variables, 0/124 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 3/73 variables, 2/126 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/73 variables, 2/128 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/73 variables, 1/129 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/73 variables, 0/129 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 0/73 variables, 0/129 constraints. Problems are: Problem set: 9 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 73/73 variables, and 129 constraints, problems are : Problem set: 9 solved, 6 unsolved in 425 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 15/15 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 9 solved, 6 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 15/15 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/15 variables, 5/20 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 1/21 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/15 variables, 0/21 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 5/20 variables, 5/26 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/20 variables, 5/31 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/31 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 19/39 variables, 20/51 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/39 variables, 6/57 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/39 variables, 1/58 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/39 variables, 0/58 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 9/48 variables, 8/66 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/48 variables, 2/68 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/48 variables, 0/68 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 14 (OVERLAPS) 22/70 variables, 18/86 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/70 variables, 18/104 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/70 variables, 9/113 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/70 variables, 5/118 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/70 variables, 7/125 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/70 variables, 0/125 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 20 (OVERLAPS) 1/71 variables, 3/128 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/71 variables, 0/128 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 22 (OVERLAPS) 2/73 variables, 2/130 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/73 variables, 2/132 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 24 (INCLUDED_ONLY) 0/73 variables, 1/133 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 25 (INCLUDED_ONLY) 0/73 variables, 2/135 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 26 (INCLUDED_ONLY) 0/73 variables, 0/135 constraints. Problems are: Problem set: 9 solved, 6 unsolved
At refinement iteration 27 (OVERLAPS) 0/73 variables, 0/135 constraints. Problems are: Problem set: 9 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 73/73 variables, and 135 constraints, problems are : Problem set: 9 solved, 6 unsolved in 236 ms.
Refiners :[Domain max(s): 40/40 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 40/40 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 6/15 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 669ms problems are : Problem set: 9 solved, 6 unsolved
Parikh walk visited 0 properties in 220 ms.
Support contains 15 out of 40 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 38 transition count 50
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 6 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 8 place count 33 transition count 48
Applied a total of 8 rules in 14 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 33/40 places, 48/53 transitions.
RANDOM walk for 40000 steps (2249 resets) in 166 ms. (239 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (536 resets) in 85 ms. (465 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (537 resets) in 78 ms. (506 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40001 steps (536 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (528 resets) in 98 ms. (404 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (552 resets) in 93 ms. (425 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (577 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
Probably explored full state space saw : 2639 states, properties seen :0
Probabilistic random walk after 15191 steps, saw 2639 distinct states, run finished after 57 ms. (steps per millisecond=266 ) properties seen :0
Explored full state space saw : 2639 states, properties seen :0
Exhaustive walk after 15191 steps, saw 2639 distinct states, run finished after 36 ms. (steps per millisecond=421 ) properties seen :0
FORMULA EGFr-PT-02010-LTLFireability-10 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 17 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA EGFr-PT-02010-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 14 stabilizing places and 7 stable transitions
FORMULA EGFr-PT-02010-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA EGFr-PT-02010-LTLFireability-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 33 transition count 48
Applied a total of 7 rules in 7 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
[2025-06-02 02:56:08] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
// Phase 1: matrix 30 rows 33 cols
[2025-06-02 02:56:08] [INFO ] Computed 16 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:08] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-02 02:56:08] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2025-06-02 02:56:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:09] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 02:56:09] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 106 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:09] [INFO ] Redundant transitions in 0 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-02 02:56:09] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2025-06-02 02:56:09] [INFO ] Invariant cache hit.
[2025-06-02 02:56:09] [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/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:09] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:09] [INFO ] Deduced a trap composed of 5 places in 29 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:09] [INFO ] Deduced a trap composed of 3 places in 15 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:09] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 33/53 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 15/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:09] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/63 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 69 constraints, problems are : Problem set: 1 solved, 43 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 33/54 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 15/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 43/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 112 constraints, problems are : Problem set: 1 solved, 43 unsolved in 562 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 43/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1305ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 1306ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/40 places, 47/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:10] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1439 ms. Remains : 33/40 places, 47/53 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-00
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 2 ms.
FORMULA EGFr-PT-02010-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-00 finished in 1689 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' '!((!p0 U G(p1)))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 35 transition count 48
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 7 place count 33 transition count 48
Applied a total of 7 rules in 10 ms. Remains 33 /40 variables (removed 7) and now considering 48/53 (removed 5) transitions.
[2025-06-02 02:56:10] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2025-06-02 02:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:10] [INFO ] Implicit Places using invariants in 44 ms returned []
[2025-06-02 02:56:10] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2025-06-02 02:56:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:10] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 02:56:10] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 94 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:10] [INFO ] Redundant transitions in 1 ms returned []
Running 44 sub problems to find dead transitions.
[2025-06-02 02:56:10] [INFO ] Flow matrix only has 30 transitions (discarded 18 similar events)
[2025-06-02 02:56:10] [INFO ] Invariant cache hit.
[2025-06-02 02:56:10] [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/33 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:10] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:10] [INFO ] Deduced a trap composed of 5 places in 25 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:10] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:10] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 33/53 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 15/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 0/68 constraints. Problems are: Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:11] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 1 ms to minimize.
At refinement iteration 6 (OVERLAPS) 0/63 variables, 1/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/63 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 8 (OVERLAPS) 0/63 variables, 0/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 63/63 variables, and 69 constraints, problems are : Problem set: 1 solved, 43 unsolved in 798 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 44/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 43 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/33 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/33 variables, 5/21 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/21 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 3 (OVERLAPS) 30/63 variables, 33/54 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/63 variables, 15/69 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/63 variables, 43/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/63 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/63 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 63/63 variables, and 112 constraints, problems are : Problem set: 1 solved, 43 unsolved in 559 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, State Equation: 33/33 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 43/44 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1369ms problems are : Problem set: 1 solved, 43 unsolved
Search for dead transitions found 1 dead transitions in 1369ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 33/40 places, 47/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 33 /33 variables (removed 0) and now considering 47/47 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:12] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1488 ms. Remains : 33/40 places, 47/53 transitions.
Stuttering acceptance computed with spot in 921 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-01
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 0 ms.
FORMULA EGFr-PT-02010-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-01 finished in 2430 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(p0))'
Support contains 5 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 37 transition count 50
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 37 transition count 50
Applied a total of 3 rules in 7 ms. Remains 37 /40 variables (removed 3) and now considering 50/53 (removed 3) transitions.
[2025-06-02 02:56:13] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 37 cols
[2025-06-02 02:56:13] [INFO ] Computed 18 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:13] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-02 02:56:13] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2025-06-02 02:56:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:13] [INFO ] State equation strengthened by 16 read => feed constraints.
[2025-06-02 02:56:13] [INFO ] Implicit Places using invariants and state equation in 46 ms returned []
Implicit Place search using SMT with State Equation took 84 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:13] [INFO ] Redundant transitions in 0 ms returned []
Running 45 sub problems to find dead transitions.
[2025-06-02 02:56:13] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2025-06-02 02:56:13] [INFO ] Invariant cache hit.
[2025-06-02 02:56:13] [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/35 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:13] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:13] [INFO ] Deduced a trap composed of 5 places in 27 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:13] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:13] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/59 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 8 (OVERLAPS) 0/69 variables, 0/75 constraints. Problems are: Problem set: 1 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Real declared 69/69 variables, and 75 constraints, problems are : Problem set: 1 solved, 44 unsolved in 660 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 37/37 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 45/45 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 44 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 16/16 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/35 variables, 4/20 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/35 variables, 0/20 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 3 (OVERLAPS) 2/37 variables, 2/22 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/37 variables, 0/22 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 5 (OVERLAPS) 32/69 variables, 37/59 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/69 variables, 16/75 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/69 variables, 44/119 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/69 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 44 unsolved
At refinement iteration 9 (OVERLAPS) 0/69 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 44 unsolved
No progress, stopping.
After SMT solving in domain Int declared 69/69 variables, and 119 constraints, problems are : Problem set: 1 solved, 44 unsolved in 665 ms.
Refiners :[Positive P Invariants (semi-flows): 18/18 constraints, State Equation: 37/37 constraints, ReadFeed: 16/16 constraints, PredecessorRefiner: 44/45 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1333ms problems are : Problem set: 1 solved, 44 unsolved
Search for dead transitions found 1 dead transitions in 1333ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 37/40 places, 49/53 transitions.
Applied a total of 0 rules in 7 ms. Remains 37 /37 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:14] [INFO ] Redundant transitions in 0 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1444 ms. Remains : 37/40 places, 49/53 transitions.
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-03
Stuttering criterion allowed to conclude after 49 steps with 4 reset in 2 ms.
FORMULA EGFr-PT-02010-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-03 finished in 1493 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(p0))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2025-06-02 02:56:14] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2025-06-02 02:56:14] [INFO ] Computed 19 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:14] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-02 02:56:14] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:56:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:14] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:56:14] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 02:56:14] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:56:14] [INFO ] Invariant cache hit.
[2025-06-02 02:56:14] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:14] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:14] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:14] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:14] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:14] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:14] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:14] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:15] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:15] [INFO ] Deduced a trap composed of 2 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:15] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:15] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:15] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 5/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:15] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 90 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1176 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 13/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 137 constraints, problems are : Problem set: 1 solved, 47 unsolved in 789 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1972ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 1974ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2060 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA EGFr-PT-02010-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-05 finished in 2163 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((p0||G(p1))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 38 transition count 52
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 36 transition count 50
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 5 place count 34 transition count 50
Applied a total of 5 rules in 11 ms. Remains 34 /40 variables (removed 6) and now considering 50/53 (removed 3) transitions.
[2025-06-02 02:56:16] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
// Phase 1: matrix 30 rows 34 cols
[2025-06-02 02:56:16] [INFO ] Computed 17 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:16] [INFO ] Implicit Places using invariants in 43 ms returned []
[2025-06-02 02:56:16] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-02 02:56:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:16] [INFO ] State equation strengthened by 15 read => feed constraints.
[2025-06-02 02:56:16] [INFO ] Implicit Places using invariants and state equation in 41 ms returned []
Implicit Place search using SMT with State Equation took 85 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:16] [INFO ] Redundant transitions in 0 ms returned []
Running 46 sub problems to find dead transitions.
[2025-06-02 02:56:16] [INFO ] Flow matrix only has 30 transitions (discarded 20 similar events)
[2025-06-02 02:56:16] [INFO ] Invariant cache hit.
[2025-06-02 02:56:16] [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/34 variables, 34/34 constraints. Problems are: Problem set: 0 solved, 46 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 0 solved, 46 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:16] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:16] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:16] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:17] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:17] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 5/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/90 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 15/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 7 (OVERLAPS) 0/64 variables, 0/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Real declared 64/64 variables, and 105 constraints, problems are : Problem set: 1 solved, 45 unsolved in 688 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 46/46 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 45 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 34/34 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 17/51 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/34 variables, 5/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/34 variables, 0/56 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 4 (OVERLAPS) 30/64 variables, 34/90 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 15/105 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/64 variables, 45/150 constraints. Problems are: Problem set: 1 solved, 45 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:17] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/64 variables, 1/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/64 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
At refinement iteration 9 (OVERLAPS) 0/64 variables, 0/151 constraints. Problems are: Problem set: 1 solved, 45 unsolved
No progress, stopping.
After SMT solving in domain Int declared 64/64 variables, and 151 constraints, problems are : Problem set: 1 solved, 45 unsolved in 744 ms.
Refiners :[Domain max(s): 34/34 constraints, Positive P Invariants (semi-flows): 17/17 constraints, State Equation: 34/34 constraints, ReadFeed: 15/15 constraints, PredecessorRefiner: 45/46 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1440ms problems are : Problem set: 1 solved, 45 unsolved
Search for dead transitions found 1 dead transitions in 1440ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 34/40 places, 49/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 34 /34 variables (removed 0) and now considering 49/49 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:18] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 1552 ms. Remains : 34/40 places, 49/53 transitions.
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-08
Entered a terminal (fully accepting) state of product in 40 steps with 2 reset in 1 ms.
FORMULA EGFr-PT-02010-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-08 finished in 1664 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(X((G(!p0) U !p1)))))'
Support contains 4 out of 40 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 1 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2025-06-02 02:56:18] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
// Phase 1: matrix 33 rows 39 cols
[2025-06-02 02:56:18] [INFO ] Computed 19 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:18] [INFO ] Implicit Places using invariants in 40 ms returned []
[2025-06-02 02:56:18] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:56:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:18] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:56:18] [INFO ] Implicit Places using invariants and state equation in 52 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 48 sub problems to find dead transitions.
[2025-06-02 02:56:18] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:56:18] [INFO ] Invariant cache hit.
[2025-06-02 02:56:18] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 5 places in 32 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 5 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 5 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:18] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 5/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:19] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 90 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1189 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 13/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 137 constraints, problems are : Problem set: 1 solved, 47 unsolved in 779 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1977ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 1978ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 1 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2076 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 215 ms :[p1, p1, p1, p1, true, p0]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-12
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA EGFr-PT-02010-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property EGFr-PT-02010-LTLFireability-12 finished in 2313 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(p0))'
Support contains 2 out of 40 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 40/40 places, 53/53 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 39 transition count 51
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 39 transition count 51
Applied a total of 2 rules in 4 ms. Remains 39 /40 variables (removed 1) and now considering 51/53 (removed 2) transitions.
[2025-06-02 02:56:20] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:20] [INFO ] Implicit Places using invariants in 47 ms returned []
[2025-06-02 02:56:20] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:56:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:20] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:56:20] [INFO ] Implicit Places using invariants and state equation in 56 ms returned []
Implicit Place search using SMT with State Equation took 105 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:20] [INFO ] Redundant transitions in 1 ms returned []
Running 48 sub problems to find dead transitions.
[2025-06-02 02:56:20] [INFO ] Flow matrix only has 33 transitions (discarded 18 similar events)
[2025-06-02 02:56:20] [INFO ] Invariant cache hit.
[2025-06-02 02:56:20] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 48 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:20] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:20] [INFO ] Deduced a trap composed of 2 places in 18 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:20] [INFO ] Deduced a trap composed of 5 places in 28 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 7/25 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 5 places in 16 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 5/30 constraints. Problems are: Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:21] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/38 variables, 1/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 10 (OVERLAPS) 0/72 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 72/72 variables, and 90 constraints, problems are : Problem set: 1 solved, 47 unsolved in 1216 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 48/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 13/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/31 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/32 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 33/72 variables, 39/71 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/72 variables, 19/90 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/72 variables, 47/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/72 variables, 0/137 constraints. Problems are: Problem set: 1 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 72/72 variables, and 137 constraints, problems are : Problem set: 1 solved, 47 unsolved in 775 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/48 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1998ms problems are : Problem set: 1 solved, 47 unsolved
Search for dead transitions found 1 dead transitions in 1998ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 39/40 places, 50/53 transitions.
Applied a total of 0 rules in 5 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:22] [INFO ] Redundant transitions in 1 ms returned []
Finished structural reductions in SI_LTL mode , in 2 iterations and 2124 ms. Remains : 39/40 places, 50/53 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : EGFr-PT-02010-LTLFireability-15
Product exploration explored 100000 steps with 33362 reset in 146 ms.
Product exploration explored 100000 steps with 33424 reset in 130 ms.
Computed a total of 15 stabilizing places and 11 stable transitions
Computed a total of 15 stabilizing places and 11 stable transitions
Detected a total of 15/39 stabilizing places and 11/50 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 204 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 5 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 202 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
[2025-06-02 02:56:23] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
// Phase 1: matrix 32 rows 39 cols
[2025-06-02 02:56:23] [INFO ] Computed 19 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 02:56:23] [INFO ] [Real]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-02 02:56:23] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-02 02:56:23] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:56:23] [INFO ] [Real]Added 19 Read/Feed constraints in 1 ms returned sat
[2025-06-02 02:56:23] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 02:56:23] [INFO ] [Nat]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-06-02 02:56:23] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-02 02:56:23] [INFO ] [Nat]Added 19 Read/Feed constraints in 1 ms returned sat
[2025-06-02 02:56:23] [INFO ] Computed and/alt/rep : 47/63/29 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 02:56:23] [INFO ] Added : 10 causal constraints over 2 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 39 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 39/39 places, 50/50 transitions.
Applied a total of 0 rules in 2 ms. Remains 39 /39 variables (removed 0) and now considering 50/50 (removed 0) transitions.
[2025-06-02 02:56:23] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2025-06-02 02:56:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:23] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-02 02:56:23] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2025-06-02 02:56:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 02:56:23] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:56:23] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 02:56:23] [INFO ] Redundant transitions in 0 ms returned []
Running 47 sub problems to find dead transitions.
[2025-06-02 02:56:23] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2025-06-02 02:56:23] [INFO ] Invariant cache hit.
[2025-06-02 02:56:23] [INFO ] State equation strengthened by 19 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 7 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 5 places in 23 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 5 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 02:56:24] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (OVERLAPS) 0/71 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Real declared 71/71 variables, and 87 constraints, problems are : Problem set: 0 solved, 47 unsolved in 894 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 47 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/38 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/38 variables, 10/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 3 (OVERLAPS) 1/39 variables, 1/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/39 variables, 0/29 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 5 (OVERLAPS) 32/71 variables, 39/68 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/71 variables, 19/87 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/71 variables, 47/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
At refinement iteration 9 (OVERLAPS) 0/71 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 47 unsolved
No progress, stopping.
After SMT solving in domain Int declared 71/71 variables, and 134 constraints, problems are : Problem set: 0 solved, 47 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 19/19 constraints, State Equation: 39/39 constraints, ReadFeed: 19/19 constraints, PredecessorRefiner: 47/47 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1624ms problems are : Problem set: 0 solved, 47 unsolved
Search for dead transitions found 0 dead transitions in 1625ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1725 ms. Remains : 39/39 places, 50/50 transitions.
Computed a total of 15 stabilizing places and 11 stable transitions
Computed a total of 15 stabilizing places and 11 stable transitions
Detected a total of 15/39 stabilizing places and 11/50 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 179 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
RANDOM walk for 8 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 187 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
[2025-06-02 02:56:26] [INFO ] Flow matrix only has 32 transitions (discarded 18 similar events)
[2025-06-02 02:56:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 02:56:26] [INFO ] [Real]Absence check using 19 positive place invariants in 2 ms returned sat
[2025-06-02 02:56:26] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-02 02:56:26] [INFO ] State equation strengthened by 19 read => feed constraints.
[2025-06-02 02:56:26] [INFO ] [Real]Added 19 Read/Feed constraints in 2 ms returned sat
[2025-06-02 02:56:26] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 02:56:26] [INFO ] [Nat]Absence check using 19 positive place invariants in 3 ms returned sat
[2025-06-02 02:56:26] [INFO ] [Nat]Absence check using state equation in 9 ms returned sat
[2025-06-02 02:56:26] [INFO ] [Nat]Added 19 Read/Feed constraints in 2 ms returned sat
[2025-06-02 02:56:26] [INFO ] Computed and/alt/rep : 47/63/29 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-02 02:56:26] [INFO ] Added : 5 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 33289 reset in 79 ms.
Product exploration explored 100000 steps with 33249 reset in 98 ms.
Built C files in :
/tmp/ltsmin4744883164240039280
[2025-06-02 02:56:26] [INFO ] Computing symmetric may disable matrix : 50 transitions.
[2025-06-02 02:56:26] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 02:56:26] [INFO ] Computing symmetric may enable matrix : 50 transitions.
[2025-06-02 02:56:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 02:56:26] [INFO ] Computing Do-Not-Accords matrix : 50 transitions.
[2025-06-02 02:56:26] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 02:56:26] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4744883164240039280
Running compilation step : cd /tmp/ltsmin4744883164240039280;'/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 250 ms.
Running link step : cd /tmp/ltsmin4744883164240039280;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin4744883164240039280;'/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/stateBased6161797407354727996.hoa' '--buchi-type=spotba'
LTSmin run took 72 ms.
FORMULA EGFr-PT-02010-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property EGFr-PT-02010-LTLFireability-15 finished in 6111 ms.
All properties solved by simple procedures.
Total runtime 23413 ms.
BK_STOP 1748832986809
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.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="EGFr-PT-02010"
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 EGFr-PT-02010, 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 r072-tall-174860068000732"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/EGFr-PT-02010.tgz
mv EGFr-PT-02010 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 '
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 ;