About the Execution of ITS-Tools for QuasiCertifProtocol-PT-10
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 0.000 | 3600000.00 | 0.00 | 0.00 | F?T??FFFFTFTFTFT | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254700795.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 QuasiCertifProtocol-PT-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254700795
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 27K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 216K 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 87K 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.8K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 39K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 298K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 15K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 102K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 3.1K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 8.2K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 149K 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 QuasiCertifProtocol-PT-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-PT-10-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1749141614838
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-05 16:40:15] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-05 16:40:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 16:40:16] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2025-06-05 16:40:16] [INFO ] Transformed 550 places.
[2025-06-05 16:40:16] [INFO ] Transformed 176 transitions.
[2025-06-05 16:40:16] [INFO ] Parsed PT model containing 550 places and 176 transitions and 1287 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 15 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 468 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 539 transition count 176
Applied a total of 11 rules in 20 ms. Remains 539 /550 variables (removed 11) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 539 cols
[2025-06-05 16:40:16] [INFO ] Computed 364 invariants in 41 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:16] [INFO ] Implicit Places using invariants in 417 ms returned []
[2025-06-05 16:40:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:17] [INFO ] Implicit Places using invariants and state equation in 426 ms returned [306, 307, 314, 316, 317, 318, 319, 320, 321, 358]
Discarding 10 places :
Implicit Place search using SMT with State Equation took 876 ms to find 10 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/550 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 529 /529 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 913 ms. Remains : 529/550 places, 176/176 transitions.
Support contains 468 out of 529 places after structural reductions.
[2025-06-05 16:40:17] [INFO ] Flatten gal took : 56 ms
[2025-06-05 16:40:17] [INFO ] Flatten gal took : 28 ms
[2025-06-05 16:40:17] [INFO ] Input system was already deterministic with 176 transitions.
Support contains 467 out of 529 places (down from 468) after GAL structural reductions.
RANDOM walk for 40000 steps (2766 resets) in 2153 ms. (18 steps per ms) remains 29/34 properties
BEST_FIRST walk for 4004 steps (29 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (32 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 30 ms. (129 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (33 resets) in 40 ms. (97 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (33 resets) in 28 ms. (138 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4002 steps (27 resets) in 25 ms. (153 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (27 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 34 ms. (114 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (34 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (40 resets) in 27 ms. (142 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (27 resets) in 36 ms. (108 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 19 ms. (200 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 18 ms. (210 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (40 resets) in 26 ms. (148 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 38 ms. (102 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4000 steps (40 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (31 resets) in 21 ms. (181 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 24 ms. (160 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (29 resets) in 22 ms. (174 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 14 ms. (266 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (31 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (30 resets) in 15 ms. (250 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4003 steps (27 resets) in 13 ms. (285 steps per ms) remains 29/29 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 29/29 properties
// Phase 1: matrix 176 rows 529 cols
[2025-06-05 16:40:18] [INFO ] Computed 354 invariants in 22 ms
Excessive predecessor constraint size, skipping predecessor.
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/434 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/434 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp32 is UNSAT
At refinement iteration 2 (OVERLAPS) 44/478 variables, 3/333 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/478 variables, 0/333 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 4 (OVERLAPS) 17/495 variables, 4/337 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/337 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 6 (OVERLAPS) 34/529 variables, 17/354 constraints. Problems are: Problem set: 3 solved, 26 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/529 variables, 0/354 constraints. Problems are: Problem set: 3 solved, 26 unsolved
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 8 (OVERLAPS) 176/705 variables, 529/883 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/705 variables, 0/883 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 0/705 variables, 0/883 constraints. Problems are: Problem set: 5 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 705/705 variables, and 883 constraints, problems are : Problem set: 5 solved, 24 unsolved in 3512 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 351/351 constraints, State Equation: 529/529 constraints, PredecessorRefiner: 29/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 24 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/432 variables, 330/330 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/432 variables, 0/330 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 2 (OVERLAPS) 45/477 variables, 3/333 constraints. Problems are: Problem set: 5 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:22] [INFO ] Deduced a trap composed of 8 places in 84 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:22] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 8 places in 90 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 8 places in 76 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 12 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 8 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-05 16:40:23] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 6 places in 57 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 6 places in 55 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 6 places in 60 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:23] [INFO ] Deduced a trap composed of 6 places in 71 ms of which 5 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/477 variables, 14/347 constraints. Problems are: Problem set: 5 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:24] [INFO ] Deduced a trap composed of 6 places in 63 ms of which 3 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 1/348 constraints. Problems are: Problem set: 5 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:24] [INFO ] Deduced a trap composed of 6 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:24] [INFO ] Deduced a trap composed of 12 places in 60 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:24] [INFO ] Deduced a trap composed of 12 places in 64 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:24] [INFO ] Deduced a trap composed of 12 places in 56 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:24] [INFO ] Deduced a trap composed of 6 places in 59 ms of which 3 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 5/353 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/477 variables, 0/353 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 7 (OVERLAPS) 14/491 variables, 3/356 constraints. Problems are: Problem set: 5 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:25] [INFO ] Deduced a trap composed of 11 places in 54 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:25] [INFO ] Deduced a trap composed of 5 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:25] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:25] [INFO ] Deduced a trap composed of 11 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-05 16:40:26] [INFO ] Deduced a trap composed of 12 places in 68 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:26] [INFO ] Deduced a trap composed of 12 places in 63 ms of which 3 ms to minimize.
At refinement iteration 8 (INCLUDED_ONLY) 0/491 variables, 6/362 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/491 variables, 0/362 constraints. Problems are: Problem set: 5 solved, 24 unsolved
At refinement iteration 10 (OVERLAPS) 16/507 variables, 8/370 constraints. Problems are: Problem set: 5 solved, 24 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:26] [INFO ] Deduced a trap composed of 11 places in 71 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:27] [INFO ] Deduced a trap composed of 8 places in 73 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:27] [INFO ] Deduced a trap composed of 8 places in 69 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 16:40:27] [INFO ] Deduced a trap composed of 8 places in 67 ms of which 5 ms to minimize.
SMT process timed out in 8670ms, After SMT, problems are : Problem set: 5 solved, 24 unsolved
Fused 24 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 432 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 176/176 transitions.
Graph (complete) has 2148 edges and 529 vertex of which 528 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 25 ms. Remains 528 /529 variables (removed 1) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 528/529 places, 176/176 transitions.
RANDOM walk for 40000 steps (2766 resets) in 694 ms. (57 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 15 ms. (250 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (29 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (31 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (34 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (36 resets) in 20 ms. (190 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 22 ms. (174 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (40 resets) in 24 ms. (160 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (27 resets) in 17 ms. (222 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (28 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (32 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4002 steps (30 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (40 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 14 ms. (266 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (33 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4000 steps (40 resets) in 13 ms. (285 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (33 resets) in 13 ms. (286 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (31 resets) in 12 ms. (308 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4004 steps (26 resets) in 9 ms. (400 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (29 resets) in 12 ms. (307 steps per ms) remains 24/24 properties
BEST_FIRST walk for 4003 steps (30 resets) in 10 ms. (363 steps per ms) remains 24/24 properties
Interrupted probabilistic random walk after 977758 steps, run timeout after 3001 ms. (steps per millisecond=325 ) properties seen :22 out of 24
Probabilistic random walk after 977758 steps, saw 130538 distinct states, run finished after 3005 ms. (steps per millisecond=325 ) properties seen :22
// Phase 1: matrix 176 rows 528 cols
[2025-06-05 16:40:30] [INFO ] Computed 353 invariants in 7 ms
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/153 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 225/378 variables, 113/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 128/506 variables, 119/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 176/682 variables, 506/849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/682 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 22/704 variables, 22/871 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/704 variables, 10/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/704 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/704 variables, 0/881 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 704/704 variables, and 881 constraints, problems are : Problem set: 0 solved, 2 unsolved in 453 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 352/352 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/146 variables, 110/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 7/153 variables, 1/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/153 variables, 0/111 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 225/378 variables, 113/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/378 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 128/506 variables, 119/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 0/343 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 176/682 variables, 506/849 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/682 variables, 2/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/682 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 22/704 variables, 22/873 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/704 variables, 10/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/704 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/704 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 704/704 variables, and 883 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2862 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 352/352 constraints, State Equation: 528/528 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3340ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 26 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=13 )
Parikh walk visited 2 properties in 31 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
Initial state reduction rules removed 2 formulas.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 529 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 529 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0&&(p1||X(p1))))))'
Support contains 23 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 515 transition count 176
Applied a total of 14 rules in 37 ms. Remains 515 /529 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 515 cols
[2025-06-05 16:40:34] [INFO ] Computed 341 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:34] [INFO ] Implicit Places using invariants in 359 ms returned []
[2025-06-05 16:40:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:35] [INFO ] Implicit Places using invariants and state equation in 996 ms returned [310]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/529 places, 176/176 transitions.
Applied a total of 0 rules in 18 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1420 ms. Remains : 514/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 252 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-00 finished in 1735 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 12 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Graph (complete) has 2148 edges and 529 vertex of which 429 are kept as prefixes of interest. Removing 100 places using SCC suffix rule.6 ms
Discarding 100 places :
Also discarding 9 output transitions
Drop transitions (Output transitions of discarded places.) removed 9 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 7 place count 428 transition count 160
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 427 transition count 159
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 427 transition count 159
Applied a total of 10 rules in 81 ms. Remains 427 /529 variables (removed 102) and now considering 159/176 (removed 17) transitions.
// Phase 1: matrix 159 rows 427 cols
[2025-06-05 16:40:36] [INFO ] Computed 270 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:36] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-05 16:40:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:37] [INFO ] Implicit Places using invariants and state equation in 554 ms returned [223, 335, 336, 337, 338, 339, 340, 392, 395, 396, 397, 398]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 842 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 415/529 places, 159/176 transitions.
Applied a total of 0 rules in 15 ms. Remains 415 /415 variables (removed 0) and now considering 159/159 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 938 ms. Remains : 415/529 places, 159/176 transitions.
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-01
Product exploration explored 100000 steps with 6650 reset in 325 ms.
Product exploration explored 100000 steps with 6640 reset in 245 ms.
Computed a total of 415 stabilizing places and 159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 415 transition count 159
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 106 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2471 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (189 resets) in 108 ms. (367 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 120413 steps, run visited all 1 properties in 195 ms. (steps per millisecond=617 )
Probabilistic random walk after 120413 steps, saw 22150 distinct states, run finished after 198 ms. (steps per millisecond=608 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 118 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
Support contains 12 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 159/159 transitions.
Applied a total of 0 rules in 16 ms. Remains 415 /415 variables (removed 0) and now considering 159/159 (removed 0) transitions.
// Phase 1: matrix 159 rows 415 cols
[2025-06-05 16:40:38] [INFO ] Computed 260 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:38] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-05 16:40:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:40:39] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 788 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:40:39] [INFO ] Redundant transitions in 24 ms returned []
Running 135 sub problems to find dead transitions.
[2025-06-05 16:40:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 11/404 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 159/563 variables, 404/664 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 11/574 variables, 11/675 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 675 constraints, problems are : Problem set: 0 solved, 135 unsolved in 14407 ms.
Refiners :[Generalized P Invariants (flows): 260/260 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 11/404 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 159/563 variables, 404/664 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 135/799 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 11/574 variables, 11/810 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 810 constraints, problems are : Problem set: 0 solved, 135 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 260/260 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44521ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 44523ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45360 ms. Remains : 415/415 places, 159/159 transitions.
Computed a total of 415 stabilizing places and 159 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 415 transition count 159
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2467 resets) in 89 ms. (444 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (188 resets) in 27 ms. (1428 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 120413 steps, run visited all 1 properties in 151 ms. (steps per millisecond=797 )
Probabilistic random walk after 120413 steps, saw 22150 distinct states, run finished after 151 ms. (steps per millisecond=797 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6646 reset in 214 ms.
Product exploration explored 100000 steps with 6647 reset in 262 ms.
Built C files in :
/tmp/ltsmin4279715315619440763
[2025-06-05 16:41:25] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2025-06-05 16:41:25] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:41:25] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2025-06-05 16:41:25] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:41:25] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2025-06-05 16:41:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:41:25] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4279715315619440763
Running compilation step : cd /tmp/ltsmin4279715315619440763;'/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 547 ms.
Running link step : cd /tmp/ltsmin4279715315619440763;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4279715315619440763;'/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/stateBased2731348487047194980.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 415 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 415/415 places, 159/159 transitions.
Applied a total of 0 rules in 14 ms. Remains 415 /415 variables (removed 0) and now considering 159/159 (removed 0) transitions.
[2025-06-05 16:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:41:40] [INFO ] Implicit Places using invariants in 246 ms returned []
[2025-06-05 16:41:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:41:41] [INFO ] Implicit Places using invariants and state equation in 597 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:41:41] [INFO ] Redundant transitions in 31 ms returned []
Running 135 sub problems to find dead transitions.
[2025-06-05 16:41:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 11/404 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 159/563 variables, 404/664 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 0/664 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (OVERLAPS) 11/574 variables, 11/675 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/574 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 8 (OVERLAPS) 0/574 variables, 0/675 constraints. Problems are: Problem set: 0 solved, 135 unsolved
No progress, stopping.
After SMT solving in domain Real declared 574/574 variables, and 675 constraints, problems are : Problem set: 0 solved, 135 unsolved in 14501 ms.
Refiners :[Generalized P Invariants (flows): 260/260 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 135 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/393 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/393 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 2 (OVERLAPS) 11/404 variables, 40/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/404 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 4 (OVERLAPS) 159/563 variables, 404/664 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/563 variables, 135/799 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/563 variables, 0/799 constraints. Problems are: Problem set: 0 solved, 135 unsolved
At refinement iteration 7 (OVERLAPS) 11/574 variables, 11/810 constraints. Problems are: Problem set: 0 solved, 135 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 574/574 variables, and 810 constraints, problems are : Problem set: 0 solved, 135 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 260/260 constraints, State Equation: 415/415 constraints, PredecessorRefiner: 135/135 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 44605ms problems are : Problem set: 0 solved, 135 unsolved
Search for dead transitions found 0 dead transitions in 44606ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 45521 ms. Remains : 415/415 places, 159/159 transitions.
Built C files in :
/tmp/ltsmin1376962428522180845
[2025-06-05 16:42:25] [INFO ] Computing symmetric may disable matrix : 159 transitions.
[2025-06-05 16:42:25] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:42:25] [INFO ] Computing symmetric may enable matrix : 159 transitions.
[2025-06-05 16:42:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:42:25] [INFO ] Computing Do-Not-Accords matrix : 159 transitions.
[2025-06-05 16:42:25] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:42:25] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1376962428522180845
Running compilation step : cd /tmp/ltsmin1376962428522180845;'/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 421 ms.
Running link step : cd /tmp/ltsmin1376962428522180845;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin1376962428522180845;'/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/stateBased2403365133739688363.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:42:41] [INFO ] Flatten gal took : 28 ms
[2025-06-05 16:42:41] [INFO ] Flatten gal took : 32 ms
[2025-06-05 16:42:41] [INFO ] Time to serialize gal into /tmp/LTL17602038398145764783.gal : 23 ms
[2025-06-05 16:42:41] [INFO ] Time to serialize properties into /tmp/LTL14244378282614527651.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17602038398145764783.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1910195729546083114.hoa' '-atoms' '/tmp/LTL14244378282614527651.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL14244378282614527651.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1910195729546083114.hoa
Detected timeout of ITS tools.
[2025-06-05 16:42:56] [INFO ] Flatten gal took : 37 ms
[2025-06-05 16:42:56] [INFO ] Flatten gal took : 44 ms
[2025-06-05 16:42:56] [INFO ] Time to serialize gal into /tmp/LTL15635391626542465062.gal : 2 ms
[2025-06-05 16:42:56] [INFO ] Time to serialize properties into /tmp/LTL637801397311583818.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15635391626542465062.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL637801397311583818.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((SstopOK_10+SstopOK_8)+(SstopOK_9+SstopOK_6))+((SstopOK_7+SstopOK_4)+(SstopOK_5+SstopOK_1)))+((SstopOK_0+SstopOK_3)+SstopO...170
Formula 0 simplified : GF!"(((((SstopOK_10+SstopOK_8)+(SstopOK_9+SstopOK_6))+((SstopOK_7+SstopOK_4)+(SstopOK_5+SstopOK_1)))+((SstopOK_0+SstopOK_3)+SstopOK_...164
Detected timeout of ITS tools.
[2025-06-05 16:43:11] [INFO ] Flatten gal took : 20 ms
[2025-06-05 16:43:11] [INFO ] Applying decomposition
[2025-06-05 16:43:11] [INFO ] Flatten gal took : 14 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph4800466833444836482.txt' '-o' '/tmp/graph4800466833444836482.bin' '-w' '/tmp/graph4800466833444836482.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph4800466833444836482.bin' '-l' '-1' '-v' '-w' '/tmp/graph4800466833444836482.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:43:11] [INFO ] Decomposing Gal with order
[2025-06-05 16:43:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:43:11] [INFO ] Removed a total of 107 redundant transitions.
[2025-06-05 16:43:12] [INFO ] Flatten gal took : 445 ms
[2025-06-05 16:43:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 174 labels/synchronizations in 43 ms.
[2025-06-05 16:43:12] [INFO ] Time to serialize gal into /tmp/LTL16522858299021723610.gal : 6 ms
[2025-06-05 16:43:12] [INFO ] Time to serialize properties into /tmp/LTL3204459077526190076.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16522858299021723610.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3204459077526190076.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(((((gu19.SstopOK_10+gu19.SstopOK_8)+(gu19.SstopOK_9+gu19.SstopOK_6))+((gu19.SstopOK_7+gu19.SstopOK_4)+(gu19.SstopOK_5+gu19.Ss...230
Formula 0 simplified : GF!"(((((gu19.SstopOK_10+gu19.SstopOK_8)+(gu19.SstopOK_9+gu19.SstopOK_6))+((gu19.SstopOK_7+gu19.SstopOK_4)+(gu19.SstopOK_5+gu19.Ssto...224
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-01 finished in 171184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Graph (complete) has 2148 edges and 529 vertex of which 359 are kept as prefixes of interest. Removing 170 places using SCC suffix rule.2 ms
Discarding 170 places :
Also discarding 23 output transitions
Drop transitions (Output transitions of discarded places.) removed 23 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 22 transitions
Reduce isomorphic transitions removed 22 transitions.
Iterating post reduction 0 with 22 rules applied. Total rules applied 23 place count 358 transition count 130
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 25 place count 357 transition count 129
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 26 place count 357 transition count 129
Applied a total of 26 rules in 40 ms. Remains 357 /529 variables (removed 172) and now considering 129/176 (removed 47) transitions.
// Phase 1: matrix 129 rows 357 cols
[2025-06-05 16:43:27] [INFO ] Computed 230 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:43:27] [INFO ] Implicit Places using invariants in 449 ms returned []
[2025-06-05 16:43:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:43:28] [INFO ] Implicit Places using invariants and state equation in 563 ms returned [164, 267, 268, 269, 270, 271, 272, 322, 325, 326, 327, 328]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 1022 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 345/529 places, 129/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 345 /345 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1107 ms. Remains : 345/529 places, 129/176 transitions.
Stuttering acceptance computed with spot in 124 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-02
Product exploration explored 100000 steps with 6646 reset in 164 ms.
Product exploration explored 100000 steps with 6653 reset in 165 ms.
Computed a total of 345 stabilizing places and 129 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 345 transition count 129
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (G p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 4 factoid took 10 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-02 finished in 1717 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) U p1)&&F(p2)) U X(G(p3))))'
Support contains 276 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 514 transition count 176
Applied a total of 15 rules in 4 ms. Remains 514 /529 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2025-06-05 16:43:29] [INFO ] Computed 340 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:43:29] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-05 16:43:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:43:29] [INFO ] Implicit Places using invariants and state equation in 509 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 722 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/529 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 729 ms. Remains : 513/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 303 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 6924 reset in 650 ms.
Product exploration explored 100000 steps with 6922 reset in 640 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0 p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1322 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 10 to 7
RANDOM walk for 40000 steps (2772 resets) in 868 ms. (46 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (323 resets) in 167 ms. (238 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (323 resets) in 323 ms. (123 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (324 resets) in 369 ms. (108 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (323 resets) in 209 ms. (190 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (318 resets) in 339 ms. (117 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (327 resets) in 119 ms. (333 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (319 resets) in 211 ms. (188 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 758435 steps, run timeout after 3001 ms. (steps per millisecond=252 ) properties seen :4 out of 7
Probabilistic random walk after 758435 steps, saw 104042 distinct states, run finished after 3001 ms. (steps per millisecond=252 ) properties seen :4
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 16:43:37] [INFO ] Computed 340 invariants in 18 ms
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/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/506 variables, 10/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 11/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 157/663 variables, 144/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 100/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 25/688 variables, 23/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 10/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1024 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/506 variables, 10/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 11/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 157/663 variables, 144/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 100/820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 25/688 variables, 23/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 10/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 854 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5011 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6076ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 370 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 348 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 347 transition count 83
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 95 place count 347 transition count 61
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 32 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 171 place count 293 transition count 61
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 171 place count 293 transition count 59
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 176 place count 290 transition count 59
Applied a total of 176 rules in 23 ms. Remains 290 /513 variables (removed 223) and now considering 59/176 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 290/513 places, 59/176 transitions.
RANDOM walk for 1088 steps (37 resets) in 31 ms. (34 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0 p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p3 p1))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p3 p2))), (F (NOT p2)), (F (NOT (OR p3 p1))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 4031 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:43:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:43:48] [INFO ] Implicit Places using invariants in 278 ms returned []
[2025-06-05 16:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:43:48] [INFO ] Implicit Places using invariants and state equation in 598 ms returned []
Implicit Place search using SMT with State Equation took 901 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:43:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19656 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49757ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49758ms
Finished structural reductions in LTL mode , in 1 iterations and 50663 ms. Remains : 513/513 places, 176/176 transitions.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p3 p1 p2), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1329 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 10 to 7
RANDOM walk for 40000 steps (2767 resets) in 1053 ms. (37 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (330 resets) in 152 ms. (261 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (321 resets) in 190 ms. (209 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (309 resets) in 302 ms. (132 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (322 resets) in 353 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (327 resets) in 178 ms. (223 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (323 resets) in 93 ms. (425 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (322 resets) in 189 ms. (210 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 838599 steps, run timeout after 3001 ms. (steps per millisecond=279 ) properties seen :4 out of 7
Probabilistic random walk after 838599 steps, saw 113000 distinct states, run finished after 3001 ms. (steps per millisecond=279 ) properties seen :4
[2025-06-05 16:44:44] [INFO ] Invariant cache hit.
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/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/506 variables, 10/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 11/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 157/663 variables, 144/719 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/663 variables, 100/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 25/688 variables, 23/842 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 10/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 3 unsolved in 739 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/506 variables, 10/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 11/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 157/663 variables, 144/720 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/663 variables, 100/820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/663 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 25/688 variables, 23/843 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 5777ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 513/513 places, 176/176 transitions.
Graph (complete) has 2029 edges and 513 vertex of which 370 are kept as prefixes of interest. Removing 143 places using SCC suffix rule.1 ms
Discarding 143 places :
Also discarding 22 output transitions
Drop transitions (Output transitions of discarded places.) removed 22 transitions
Drop transitions (Empty/Sink Transition effects.) removed 70 transitions
Reduce isomorphic transitions removed 70 transitions.
Discarding 22 places :
Implicit places reduction removed 22 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 93 rules applied. Total rules applied 94 place count 348 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 95 place count 347 transition count 83
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 22 Pre rules applied. Total rules applied 95 place count 347 transition count 61
Deduced a syphon composed of 22 places in 1 ms
Ensure Unique test removed 32 places
Reduce places removed 54 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 171 place count 293 transition count 61
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 171 place count 293 transition count 59
Deduced a syphon composed of 2 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 5 rules applied. Total rules applied 176 place count 290 transition count 59
Applied a total of 176 rules in 17 ms. Remains 290 /513 variables (removed 223) and now considering 59/176 (removed 117) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 290/513 places, 59/176 transitions.
RANDOM walk for 1028 steps (39 resets) in 17 ms. (57 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p3 p1 p2), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p3) p0))), (F (NOT p0)), (F (NOT (OR p3 p2))), (F (NOT p2)), (F (NOT (OR p1 p3 p0))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p3 p0))), (F (NOT (OR p1 p3)))]
Knowledge based reduction with 25 factoid took 4064 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 250 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 249 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 214 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 6912 reset in 668 ms.
Product exploration explored 100000 steps with 6924 reset in 651 ms.
Applying partial POR strategy [true, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 1 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 513 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 45 ms. Remains 513 /513 variables (removed 0) and now considering 177/176 (removed -1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:44:56] [INFO ] Redundant transitions in 43 ms returned []
Running 165 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 513 cols
[2025-06-05 16:44:56] [INFO ] Computed 340 invariants in 17 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 2 (OVERLAPS) 177/689 variables, 512/852 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/852 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 1/690 variables, 1/853 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/853 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/853 constraints. Problems are: Problem set: 2 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 853 constraints, problems are : Problem set: 2 solved, 163 unsolved in 19694 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 176/687 variables, 511/851 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/687 variables, 163/1014 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 0/1014 constraints. Problems are: Problem set: 2 solved, 163 unsolved
SMT process timed out in 49764ms, After SMT, problems are : Problem set: 2 solved, 163 unsolved
Search for dead transitions found 2 dead transitions in 49765ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 513/513 places, 175/176 transitions.
Graph (complete) has 2149 edges and 513 vertex of which 512 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 512 /513 variables (removed 1) and now considering 175/175 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 512/513 places, 175/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49878 ms. Remains : 512/513 places, 175/176 transitions.
Built C files in :
/tmp/ltsmin14467593140628248357
[2025-06-05 16:45:46] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14467593140628248357
Running compilation step : cd /tmp/ltsmin14467593140628248357;'/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 462 ms.
Running link step : cd /tmp/ltsmin14467593140628248357;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin14467593140628248357;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5974996042564718357.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 276 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 16:46:01] [INFO ] Computed 340 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:46:02] [INFO ] Implicit Places using invariants in 286 ms returned []
[2025-06-05 16:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:46:02] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 890 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 1/689 variables, 1/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 689/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19174 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 164/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/1016 constraints. Problems are: Problem set: 0 solved, 164 unsolved
SMT process timed out in 49234ms, After SMT, problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49234ms
Finished structural reductions in LTL mode , in 1 iterations and 50128 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin13977230787165294186
[2025-06-05 16:46:51] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13977230787165294186
Running compilation step : cd /tmp/ltsmin13977230787165294186;'/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 475 ms.
Running link step : cd /tmp/ltsmin13977230787165294186;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin13977230787165294186;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8884449941684964829.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:47:07] [INFO ] Flatten gal took : 37 ms
[2025-06-05 16:47:07] [INFO ] Flatten gal took : 36 ms
[2025-06-05 16:47:07] [INFO ] Time to serialize gal into /tmp/LTL7463613303557327346.gal : 2 ms
[2025-06-05 16:47:07] [INFO ] Time to serialize properties into /tmp/LTL16794770192268537181.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7463613303557327346.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3217566605593459871.hoa' '-atoms' '/tmp/LTL16794770192268537181.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16794770192268537181.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3217566605593459871.hoa
Detected timeout of ITS tools.
[2025-06-05 16:47:22] [INFO ] Flatten gal took : 23 ms
[2025-06-05 16:47:22] [INFO ] Flatten gal took : 29 ms
[2025-06-05 16:47:22] [INFO ] Time to serialize gal into /tmp/LTL16044422831258315338.gal : 3 ms
[2025-06-05 16:47:22] [INFO ] Time to serialize properties into /tmp/LTL14310759251070690863.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16044422831258315338.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14310759251070690863.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((((F("(((((n6_4+n6_3)+(n6_6+n6_5))+((n6_0+n6_2)+(n6_1+n6_8)))+((n6_7+n6_10)+n6_9))<=((((n5_0+n5_1)+(n5_6+n5_7))+((n5_8+n5_9)+(n5_2+...3789
Formula 0 simplified : ((G!"(((((n6_4+n6_3)+(n6_6+n6_5))+((n6_0+n6_2)+(n6_1+n6_8)))+((n6_7+n6_10)+n6_9))<=((((n5_0+n5_1)+(n5_6+n5_7))+((n5_8+n5_9)+(n5_2+n5...3779
Detected timeout of ITS tools.
[2025-06-05 16:47:37] [INFO ] Flatten gal took : 16 ms
[2025-06-05 16:47:37] [INFO ] Applying decomposition
[2025-06-05 16:47:37] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12995556183815528224.txt' '-o' '/tmp/graph12995556183815528224.bin' '-w' '/tmp/graph12995556183815528224.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12995556183815528224.bin' '-l' '-1' '-v' '-w' '/tmp/graph12995556183815528224.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:47:37] [INFO ] Decomposing Gal with order
[2025-06-05 16:47:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:47:37] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-05 16:47:37] [INFO ] Flatten gal took : 54 ms
[2025-06-05 16:47:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 75 labels/synchronizations in 15 ms.
[2025-06-05 16:47:37] [INFO ] Time to serialize gal into /tmp/LTL413535987772559242.gal : 3 ms
[2025-06-05 16:47:37] [INFO ] Time to serialize properties into /tmp/LTL9152227648919197834.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL413535987772559242.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9152227648919197834.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((((F("(((((gi13.gi0.gi1.gu47.n6_4+gi13.gi0.gi1.gu47.n6_3)+(gi13.gi0.gi1.gu47.n6_6+gi13.gi0.gi1.gu47.n6_5))+((gi13.gi0.gi1.gu47.n6_0...6461
Formula 0 simplified : ((G!"(((((gi13.gi0.gi1.gu47.n6_4+gi13.gi0.gi1.gu47.n6_3)+(gi13.gi0.gi1.gu47.n6_6+gi13.gi0.gi1.gu47.n6_5))+((gi13.gi0.gi1.gu47.n6_0+g...6451
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-03 finished in 263720 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 132 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Graph (complete) has 2148 edges and 529 vertex of which 502 are kept as prefixes of interest. Removing 27 places using SCC suffix rule.1 ms
Discarding 27 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 499 transition count 171
Applied a total of 5 rules in 17 ms. Remains 499 /529 variables (removed 30) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2025-06-05 16:47:52] [INFO ] Computed 330 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:53] [INFO ] Implicit Places using invariants in 592 ms returned []
[2025-06-05 16:47:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:54] [INFO ] Implicit Places using invariants and state equation in 744 ms returned [306, 418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 1354 ms to find 12 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/529 places, 171/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1382 ms. Remains : 487/529 places, 171/176 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-04
Product exploration explored 100000 steps with 6778 reset in 453 ms.
Product exploration explored 100000 steps with 6781 reset in 457 ms.
Computed a total of 487 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2706 resets) in 211 ms. (188 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (211 resets) in 99 ms. (400 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1164 steps, run visited all 1 properties in 9 ms. (steps per millisecond=129 )
Probabilistic random walk after 1164 steps, saw 1108 distinct states, run finished after 9 ms. (steps per millisecond=129 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 99 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Support contains 132 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 171/171 transitions.
Applied a total of 0 rules in 8 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
// Phase 1: matrix 171 rows 487 cols
[2025-06-05 16:47:55] [INFO ] Computed 320 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:56] [INFO ] Implicit Places using invariants in 279 ms returned []
[2025-06-05 16:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:47:56] [INFO ] Implicit Places using invariants and state equation in 649 ms returned []
Implicit Place search using SMT with State Equation took 959 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:47:56] [INFO ] Redundant transitions in 25 ms returned []
Running 148 sub problems to find dead transitions.
[2025-06-05 16:47:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 11/658 variables, 11/807 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/658 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 807 constraints, problems are : Problem set: 0 solved, 148 unsolved in 16000 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 148/944 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 11/658 variables, 11/955 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/658 variables, and 955 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46064ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 46064ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47066 ms. Remains : 487/487 places, 171/171 transitions.
Computed a total of 487 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 487 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 77 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2714 resets) in 217 ms. (183 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (210 resets) in 151 ms. (263 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1164 steps, run visited all 1 properties in 9 ms. (steps per millisecond=129 )
Probabilistic random walk after 1164 steps, saw 1108 distinct states, run finished after 10 ms. (steps per millisecond=116 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6792 reset in 451 ms.
Product exploration explored 100000 steps with 6781 reset in 459 ms.
Built C files in :
/tmp/ltsmin13331910046126736567
[2025-06-05 16:48:44] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2025-06-05 16:48:44] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:48:44] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2025-06-05 16:48:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:48:44] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2025-06-05 16:48:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:48:44] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13331910046126736567
Running compilation step : cd /tmp/ltsmin13331910046126736567;'/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 498 ms.
Running link step : cd /tmp/ltsmin13331910046126736567;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13331910046126736567;'/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/stateBased16557382552440252228.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 132 out of 487 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 487/487 places, 171/171 transitions.
Applied a total of 0 rules in 17 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2025-06-05 16:48:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:48:59] [INFO ] Implicit Places using invariants in 276 ms returned []
[2025-06-05 16:48:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:49:00] [INFO ] Implicit Places using invariants and state equation in 688 ms returned []
Implicit Place search using SMT with State Equation took 965 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:49:00] [INFO ] Redundant transitions in 22 ms returned []
Running 148 sub problems to find dead transitions.
[2025-06-05 16:49:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 0/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (OVERLAPS) 11/658 variables, 11/807 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/658 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 6 (OVERLAPS) 0/658 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 148 unsolved
No progress, stopping.
After SMT solving in domain Real declared 658/658 variables, and 807 constraints, problems are : Problem set: 0 solved, 148 unsolved in 16509 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 148 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/476 variables, 320/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/476 variables, 0/320 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 2 (OVERLAPS) 171/647 variables, 476/796 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/647 variables, 148/944 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/647 variables, 0/944 constraints. Problems are: Problem set: 0 solved, 148 unsolved
At refinement iteration 5 (OVERLAPS) 11/658 variables, 11/955 constraints. Problems are: Problem set: 0 solved, 148 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/658 variables, and 955 constraints, problems are : Problem set: 0 solved, 148 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 320/320 constraints, State Equation: 487/487 constraints, PredecessorRefiner: 148/148 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 46571ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 46572ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47584 ms. Remains : 487/487 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin10696274839993728743
[2025-06-05 16:49:47] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2025-06-05 16:49:47] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:49:47] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2025-06-05 16:49:47] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:49:47] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2025-06-05 16:49:47] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:49:47] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10696274839993728743
Running compilation step : cd /tmp/ltsmin10696274839993728743;'/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 520 ms.
Running link step : cd /tmp/ltsmin10696274839993728743;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin10696274839993728743;'/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/stateBased14593594648729175554.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:50:02] [INFO ] Flatten gal took : 25 ms
[2025-06-05 16:50:02] [INFO ] Flatten gal took : 10 ms
[2025-06-05 16:50:02] [INFO ] Time to serialize gal into /tmp/LTL3500133274780357206.gal : 3 ms
[2025-06-05 16:50:02] [INFO ] Time to serialize properties into /tmp/LTL9993062558357490800.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3500133274780357206.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16693207846975677920.hoa' '-atoms' '/tmp/LTL9993062558357490800.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9993062558357490800.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16693207846975677920.hoa
Detected timeout of ITS tools.
[2025-06-05 16:50:17] [INFO ] Flatten gal took : 10 ms
[2025-06-05 16:50:17] [INFO ] Flatten gal took : 9 ms
[2025-06-05 16:50:17] [INFO ] Time to serialize gal into /tmp/LTL9903743514445318900.gal : 2 ms
[2025-06-05 16:50:17] [INFO ] Time to serialize properties into /tmp/LTL11077106981225413649.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9903743514445318900.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11077106981225413649.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((n9_4_0+n9_3_0)+(n9_6_0+n9_5_0))+((n9_0_0+n9_2_0)+(n9_1_0+n9_2_1)))+(((n9_3_1+n9_0_1)+(n9_1_1+n9_9_0))+((n9_10_0+n9_7_0...1265
Formula 0 simplified : GF!"((((((((n9_4_0+n9_3_0)+(n9_6_0+n9_5_0))+((n9_0_0+n9_2_0)+(n9_1_0+n9_2_1)))+(((n9_3_1+n9_0_1)+(n9_1_1+n9_9_0))+((n9_10_0+n9_7_0)+...1259
Detected timeout of ITS tools.
[2025-06-05 16:50:32] [INFO ] Flatten gal took : 10 ms
[2025-06-05 16:50:32] [INFO ] Applying decomposition
[2025-06-05 16:50:32] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16393159146943834146.txt' '-o' '/tmp/graph16393159146943834146.bin' '-w' '/tmp/graph16393159146943834146.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16393159146943834146.bin' '-l' '-1' '-v' '-w' '/tmp/graph16393159146943834146.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:50:32] [INFO ] Decomposing Gal with order
[2025-06-05 16:50:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:50:32] [INFO ] Removed a total of 131 redundant transitions.
[2025-06-05 16:50:32] [INFO ] Flatten gal took : 21 ms
[2025-06-05 16:50:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 92 labels/synchronizations in 8 ms.
[2025-06-05 16:50:32] [INFO ] Time to serialize gal into /tmp/LTL16137647477769507036.gal : 3 ms
[2025-06-05 16:50:32] [INFO ] Time to serialize properties into /tmp/LTL7466673698602804888.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16137647477769507036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7466673698602804888.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("((((((((gu25.n9_4_0+gu25.n9_3_0)+(gu25.n9_6_0+gu25.n9_5_0))+((gu25.n9_0_0+gu25.n9_2_0)+(gu25.n9_1_0+gu25.n9_2_1)))+(((gu25.n9_...1925
Formula 0 simplified : GF!"((((((((gu25.n9_4_0+gu25.n9_3_0)+(gu25.n9_6_0+gu25.n9_5_0))+((gu25.n9_0_0+gu25.n9_2_0)+(gu25.n9_1_0+gu25.n9_2_1)))+(((gu25.n9_3_...1919
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-04 finished in 174850 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((X(X(F(p0))) U (p1 U p2))) U p3))'
Support contains 147 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 0 with 13 rules applied. Total rules applied 13 place count 516 transition count 176
Applied a total of 13 rules in 7 ms. Remains 516 /529 variables (removed 13) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 516 cols
[2025-06-05 16:50:47] [INFO ] Computed 341 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:48] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-05 16:50:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:48] [INFO ] Implicit Places using invariants and state equation in 789 ms returned [311]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1086 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/529 places, 176/176 transitions.
Applied a total of 0 rules in 3 ms. Remains 515 /515 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1096 ms. Remains : 515/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 326 ms :[(NOT p3), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-05
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-05 finished in 1459 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)&&F((G(F(p1))||(!p0&&F(p1))))) U X(X(G(p2)))))'
Support contains 25 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 515 transition count 176
Applied a total of 14 rules in 10 ms. Remains 515 /529 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 515 cols
[2025-06-05 16:50:49] [INFO ] Computed 341 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:49] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-06-05 16:50:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:50:50] [INFO ] Implicit Places using invariants and state equation in 951 ms returned [310]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1338 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/529 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1353 ms. Remains : 514/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 458 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 20465 reset in 249 ms.
Product exploration explored 100000 steps with 20408 reset in 261 ms.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 1967 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 10 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 441 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (2769 resets) in 153 ms. (259 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40003 steps (316 resets) in 94 ms. (421 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (436 resets) in 112 ms. (354 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (194 resets) in 49 ms. (800 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (328 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (436 resets) in 33 ms. (1176 steps per ms) remains 5/5 properties
// Phase 1: matrix 176 rows 514 cols
[2025-06-05 16:50:54] [INFO ] Computed 340 invariants in 6 ms
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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 49/85 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 174/259 variables, 81/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 431/690 variables, 397/544 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 310/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 854 constraints, problems are : Problem set: 0 solved, 5 unsolved in 375 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 49/85 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 174/259 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 10 (OVERLAPS) 431/690 variables, 397/549 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 310/859 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/859 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/690 variables, 0/859 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 859 constraints, problems are : Problem set: 2 solved, 3 unsolved in 975 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1363ms problems are : Problem set: 2 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 67 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=22 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p2) p1)), (G (OR p1 p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p2 p1))), (F p2), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 2413 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 237 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 262 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
[2025-06-05 16:50:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:50:58] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 142 ms returned sat
[2025-06-05 16:51:04] [INFO ] [Real]Absence check using state equation in 5729 ms returned sat
[2025-06-05 16:51:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:51:04] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 142 ms returned sat
[2025-06-05 16:51:06] [INFO ] [Nat]Absence check using state equation in 2068 ms returned sat
[2025-06-05 16:51:06] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2025-06-05 16:51:06] [INFO ] Added : 0 causal constraints over 0 iterations in 72 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 25 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:51:07] [INFO ] Implicit Places using invariants in 353 ms returned []
[2025-06-05 16:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:51:08] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1428 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:51:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 2/690 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 854 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19584 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 87/939 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 2/690 variables, 2/941 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 1018 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49657ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49658ms
Finished structural reductions in LTL mode , in 1 iterations and 51093 ms. Remains : 514/514 places, 176/176 transitions.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 788 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 251 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (2769 resets) in 224 ms. (177 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (436 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (318 resets) in 26 ms. (1481 steps per ms) remains 2/2 properties
[2025-06-05 16:51:59] [INFO ] Invariant cache hit.
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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/85 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 174/259 variables, 81/127 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 431/690 variables, 397/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/690 variables, 310/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 854 constraints, problems are : Problem set: 0 solved, 2 unsolved in 252 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 11/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 49/85 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/85 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/85 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 174/259 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 1/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 431/690 variables, 397/546 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/690 variables, 310/856 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/690 variables, 0/856 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 856 constraints, problems are : Problem set: 0 solved, 2 unsolved in 710 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 970ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=60 )
Parikh walk visited 2 properties in 11 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 1165 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 257 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
[2025-06-05 16:52:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:52:02] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 136 ms returned sat
[2025-06-05 16:52:07] [INFO ] [Real]Absence check using state equation in 5673 ms returned sat
[2025-06-05 16:52:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:52:08] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 139 ms returned sat
[2025-06-05 16:52:10] [INFO ] [Nat]Absence check using state equation in 2048 ms returned sat
[2025-06-05 16:52:10] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 15 ms.
[2025-06-05 16:52:10] [INFO ] Added : 0 causal constraints over 0 iterations in 75 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 248 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 25138 reset in 196 ms.
Product exploration explored 100000 steps with 25117 reset in 297 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Support contains 25 out of 514 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 514 transition count 177
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 1 rules in 20 ms. Remains 514 /514 variables (removed 0) and now considering 177/176 (removed -1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:52:11] [INFO ] Redundant transitions in 17 ms returned []
Running 165 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 514 cols
[2025-06-05 16:52:11] [INFO ] Computed 340 invariants in 19 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 165 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 165 unsolved
Problem TDEAD49 is UNSAT
Problem TDEAD174 is UNSAT
At refinement iteration 2 (OVERLAPS) 177/689 variables, 512/852 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/689 variables, 0/852 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 2/691 variables, 2/854 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/691 variables, 0/854 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/691 variables, 0/854 constraints. Problems are: Problem set: 2 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 691/691 variables, and 854 constraints, problems are : Problem set: 2 solved, 163 unsolved in 19397 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 165/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 176/687 variables, 511/851 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/687 variables, 86/937 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/687 variables, 0/937 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 5 (OVERLAPS) 4/691 variables, 3/940 constraints. Problems are: Problem set: 2 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/691 variables, 77/1017 constraints. Problems are: Problem set: 2 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 691/691 variables, and 1017 constraints, problems are : Problem set: 2 solved, 163 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 163/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49471ms problems are : Problem set: 2 solved, 163 unsolved
Search for dead transitions found 2 dead transitions in 49473ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 514/514 places, 175/176 transitions.
Graph (complete) has 2161 edges and 514 vertex of which 513 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 513 /514 variables (removed 1) and now considering 175/175 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 513/514 places, 175/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 49530 ms. Remains : 513/514 places, 175/176 transitions.
Built C files in :
/tmp/ltsmin18174594131723161448
[2025-06-05 16:53:01] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18174594131723161448
Running compilation step : cd /tmp/ltsmin18174594131723161448;'/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 440 ms.
Running link step : cd /tmp/ltsmin18174594131723161448;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18174594131723161448;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9327021916593912875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 25 out of 514 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2025-06-05 16:53:16] [INFO ] Computed 340 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:53:16] [INFO ] Implicit Places using invariants in 361 ms returned []
[2025-06-05 16:53:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:53:17] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned []
Implicit Place search using SMT with State Equation took 1413 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 16:53:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 0/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 2/690 variables, 2/854 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 854 constraints, problems are : Problem set: 0 solved, 164 unsolved in 19463 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 164 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 176/688 variables, 512/852 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 87/939 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/688 variables, 0/939 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 2/690 variables, 2/941 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 1018 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30041 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 49544ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 49545ms
Finished structural reductions in LTL mode , in 1 iterations and 50964 ms. Remains : 514/514 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin10505587363213900972
[2025-06-05 16:54:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10505587363213900972
Running compilation step : cd /tmp/ltsmin10505587363213900972;'/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 436 ms.
Running link step : cd /tmp/ltsmin10505587363213900972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10505587363213900972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7190696715188867118.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:54:22] [INFO ] Flatten gal took : 10 ms
[2025-06-05 16:54:22] [INFO ] Flatten gal took : 10 ms
[2025-06-05 16:54:22] [INFO ] Time to serialize gal into /tmp/LTL10664302752703872100.gal : 2 ms
[2025-06-05 16:54:22] [INFO ] Time to serialize properties into /tmp/LTL1432774537710198916.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10664302752703872100.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10411697186967144828.hoa' '-atoms' '/tmp/LTL1432774537710198916.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL1432774537710198916.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10411697186967144828.hoa
Detected timeout of ITS tools.
[2025-06-05 16:54:37] [INFO ] Flatten gal took : 9 ms
[2025-06-05 16:54:37] [INFO ] Flatten gal took : 14 ms
[2025-06-05 16:54:37] [INFO ] Time to serialize gal into /tmp/LTL948231255731506253.gal : 2 ms
[2025-06-05 16:54:37] [INFO ] Time to serialize properties into /tmp/LTL1120895948889894945.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL948231255731506253.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1120895948889894945.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((((F("(((((s2_2+s2_1)+(s2_0+s2_7))+((s2_8+s2_9)+(s2_10+s2_3)))+((s2_4+s2_5)+s2_6))<=a5)"))&&(F((G(F("(CstopAbort<1)")))||(("(((((s2_...356
Formula 0 simplified : (G!"(((((s2_2+s2_1)+(s2_0+s2_7))+((s2_8+s2_9)+(s2_10+s2_3)))+((s2_4+s2_5)+s2_6))<=a5)" | G(FG!"(CstopAbort<1)" & (!"(((((s2_2+s2_1)+...337
Detected timeout of ITS tools.
[2025-06-05 16:54:52] [INFO ] Flatten gal took : 12 ms
[2025-06-05 16:54:52] [INFO ] Applying decomposition
[2025-06-05 16:54:52] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph5530344726161433421.txt' '-o' '/tmp/graph5530344726161433421.bin' '-w' '/tmp/graph5530344726161433421.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5530344726161433421.bin' '-l' '-1' '-v' '-w' '/tmp/graph5530344726161433421.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:54:52] [INFO ] Decomposing Gal with order
[2025-06-05 16:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:54:52] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-05 16:54:52] [INFO ] Flatten gal took : 35 ms
[2025-06-05 16:54:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 11 ms.
[2025-06-05 16:54:52] [INFO ] Time to serialize gal into /tmp/LTL16812080888983827615.gal : 6 ms
[2025-06-05 16:54:52] [INFO ] Time to serialize properties into /tmp/LTL12991883188925868234.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16812080888983827615.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12991883188925868234.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("(((((gu22.s2_2+gu22.s2_1)+(gu22.s2_0+gu22.s2_7))+((gu22.s2_8+gu22.s2_9)+(gu22.s2_10+gu22.s2_3)))+((gu22.s2_4+gu22.s2_5)+gu22.s...576
Formula 0 simplified : (G!"(((((gu22.s2_2+gu22.s2_1)+(gu22.s2_0+gu22.s2_7))+((gu22.s2_8+gu22.s2_9)+(gu22.s2_10+gu22.s2_3)))+((gu22.s2_4+gu22.s2_5)+gu22.s2_...557
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-06 finished in 258645 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) U G(p1))||X(X(G(p2)))))'
Support contains 4 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 514 transition count 176
Applied a total of 15 rules in 10 ms. Remains 514 /529 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 514 cols
[2025-06-05 16:55:07] [INFO ] Computed 340 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:08] [INFO ] Implicit Places using invariants in 356 ms returned []
[2025-06-05 16:55:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:09] [INFO ] Implicit Places using invariants and state equation in 834 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1196 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/529 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1212 ms. Remains : 513/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 333 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-08
Stuttering criterion allowed to conclude after 32 steps with 8 reset in 1 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-08 finished in 1571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||X(G(p1)))))'
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 514 transition count 176
Applied a total of 15 rules in 7 ms. Remains 514 /529 variables (removed 15) and now considering 176/176 (removed 0) transitions.
[2025-06-05 16:55:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:09] [INFO ] Implicit Places using invariants in 334 ms returned []
[2025-06-05 16:55:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:10] [INFO ] Implicit Places using invariants and state equation in 844 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1185 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/529 places, 176/176 transitions.
Applied a total of 0 rules in 11 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1204 ms. Remains : 513/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-09
Product exploration explored 100000 steps with 50000 reset in 158 ms.
Product exploration explored 100000 steps with 50000 reset in 170 ms.
Computed a total of 513 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p1))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 8 factoid took 19 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-09 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-09 finished in 1839 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 X(p1)))'
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 515 transition count 176
Applied a total of 14 rules in 12 ms. Remains 515 /529 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 515 cols
[2025-06-05 16:55:11] [INFO ] Computed 341 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:11] [INFO ] Implicit Places using invariants in 372 ms returned []
[2025-06-05 16:55:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:12] [INFO ] Implicit Places using invariants and state equation in 872 ms returned [310]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1251 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/529 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1269 ms. Remains : 514/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-10
Product exploration explored 100000 steps with 46165 reset in 183 ms.
Product exploration explored 100000 steps with 46266 reset in 192 ms.
Computed a total of 514 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 514 transition count 176
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 522 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
RANDOM walk for 40000 steps (2770 resets) in 96 ms. (412 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (328 resets) in 113 ms. (350 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (436 resets) in 85 ms. (465 steps per ms) remains 2/2 properties
// Phase 1: matrix 176 rows 514 cols
[2025-06-05 16:55:13] [INFO ] Computed 340 invariants in 3 ms
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/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/24 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/114 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 162/276 variables, 80/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 0/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 413/689 variables, 409/523 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/689 variables, 330/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1/690 variables, 1/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 854 constraints, problems are : Problem set: 0 solved, 2 unsolved in 268 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 3/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 18/24 variables, 9/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 90/114 variables, 24/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/114 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 162/276 variables, 80/114 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/276 variables, 2/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/276 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem apf1 is UNSAT
At refinement iteration 10 (OVERLAPS) 413/689 variables, 409/525 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/689 variables, 330/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/689 variables, 0/855 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 1/690 variables, 1/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/690 variables, 0/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/690 variables, 0/856 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 856 constraints, problems are : Problem set: 1 solved, 1 unsolved in 551 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 828ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 27 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=27 )
Parikh walk visited 1 properties in 1 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (G (OR p1 p0))]
False Knowledge obtained : [(X (AND p0 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (NOT p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT (AND (NOT p1) p0))), (F (NOT p0))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 8 factoid took 731 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 92 ms :[(NOT p1), (NOT p1)]
[2025-06-05 16:55:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:55:15] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 174 ms returned sat
[2025-06-05 16:55:16] [INFO ] [Real]Absence check using state equation in 932 ms returned sat
[2025-06-05 16:55:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:55:17] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 171 ms returned sat
[2025-06-05 16:55:20] [INFO ] [Nat]Absence check using state equation in 3263 ms returned sat
[2025-06-05 16:55:20] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2025-06-05 16:55:20] [INFO ] Added : 24 causal constraints over 5 iterations in 311 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 1 out of 514 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 514/514 places, 176/176 transitions.
Graph (complete) has 2096 edges and 514 vertex of which 502 are kept as prefixes of interest. Removing 12 places using SCC suffix rule.1 ms
Discarding 12 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 499 transition count 171
Applied a total of 5 rules in 15 ms. Remains 499 /514 variables (removed 15) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 499 cols
[2025-06-05 16:55:20] [INFO ] Computed 330 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:21] [INFO ] Implicit Places using invariants in 405 ms returned []
[2025-06-05 16:55:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:22] [INFO ] Implicit Places using invariants and state equation in 769 ms returned [418, 419, 420, 421, 422, 423, 475, 478, 479, 480, 481]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1215 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 488/514 places, 171/176 transitions.
Applied a total of 0 rules in 19 ms. Remains 488 /488 variables (removed 0) and now considering 171/171 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1250 ms. Remains : 488/514 places, 171/176 transitions.
Computed a total of 488 stabilizing places and 171 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 488 transition count 171
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 2 factoid took 172 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1)]
RANDOM walk for 9 steps (0 resets) in 4 ms. (1 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (F p1)]
Knowledge based reduction with 2 factoid took 213 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 66 ms :[(NOT p1), (NOT p1)]
// Phase 1: matrix 171 rows 488 cols
[2025-06-05 16:55:22] [INFO ] Computed 320 invariants in 12 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:55:23] [INFO ] [Real]Absence check using 0 positive and 320 generalized place invariants in 180 ms returned sat
[2025-06-05 16:55:24] [INFO ] [Real]Absence check using state equation in 1254 ms returned sat
[2025-06-05 16:55:24] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:55:24] [INFO ] [Nat]Absence check using 0 positive and 320 generalized place invariants in 179 ms returned sat
[2025-06-05 16:55:26] [INFO ] [Nat]Absence check using state equation in 1949 ms returned sat
[2025-06-05 16:55:26] [INFO ] Computed and/alt/rep : 111/133/111 causal constraints (skipped 37 transitions) in 10 ms.
[2025-06-05 16:55:26] [INFO ] Added : 11 causal constraints over 3 iterations in 158 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 74 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 33298 reset in 199 ms.
Product exploration explored 100000 steps with 33355 reset in 201 ms.
Built C files in :
/tmp/ltsmin10850412773226178924
[2025-06-05 16:55:27] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2025-06-05 16:55:27] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:55:27] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2025-06-05 16:55:27] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:55:27] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2025-06-05 16:55:27] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 16:55:27] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10850412773226178924
Running compilation step : cd /tmp/ltsmin10850412773226178924;'/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 506 ms.
Running link step : cd /tmp/ltsmin10850412773226178924;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin10850412773226178924;'/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/stateBased3813731962015078898.hoa' '--buchi-type=spotba'
LTSmin run took 638 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-10 finished in 17275 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||G(p1)))))))'
Support contains 3 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 515 transition count 176
Applied a total of 14 rules in 10 ms. Remains 515 /529 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 515 cols
[2025-06-05 16:55:28] [INFO ] Computed 340 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:28] [INFO ] Implicit Places using invariants in 377 ms returned []
[2025-06-05 16:55:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:29] [INFO ] Implicit Places using invariants and state equation in 882 ms returned [310]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1267 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/529 places, 176/176 transitions.
Applied a total of 0 rules in 5 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1282 ms. Remains : 514/529 places, 176/176 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-14 finished in 1528 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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) U p1)&&F(p2)) U X(G(p3))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-10-LTLCardinality-03
Stuttering acceptance computed with spot in 301 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Support contains 276 out of 529 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Graph (complete) has 2148 edges and 529 vertex of which 514 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.3 ms
Discarding 15 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 512 transition count 174
Applied a total of 3 rules in 14 ms. Remains 512 /529 variables (removed 17) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 512 cols
[2025-06-05 16:55:30] [INFO ] Computed 340 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:30] [INFO ] Implicit Places using invariants in 232 ms returned []
[2025-06-05 16:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:31] [INFO ] Implicit Places using invariants and state equation in 731 ms returned [308, 420, 421, 422, 423, 424, 425, 477, 480, 481, 482, 483]
Discarding 12 places :
Implicit Place search using SMT with State Equation took 965 ms to find 12 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 500/529 places, 174/176 transitions.
Applied a total of 0 rules in 6 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 985 ms. Remains : 500/529 places, 174/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-03
Product exploration explored 100000 steps with 6776 reset in 679 ms.
Product exploration explored 100000 steps with 6787 reset in 671 ms.
Computed a total of 500 stabilizing places and 174 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 174
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0 p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1344 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 336 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 10 to 7
RANDOM walk for 40000 steps (2713 resets) in 329 ms. (121 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (205 resets) in 98 ms. (404 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (203 resets) in 102 ms. (388 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (207 resets) in 164 ms. (242 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (207 resets) in 110 ms. (360 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (209 resets) in 160 ms. (248 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (203 resets) in 47 ms. (833 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (209 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 921949 steps, run timeout after 3001 ms. (steps per millisecond=307 ) properties seen :4 out of 7
Probabilistic random walk after 921949 steps, saw 123204 distinct states, run finished after 3001 ms. (steps per millisecond=307 ) properties seen :4
// Phase 1: matrix 174 rows 500 cols
[2025-06-05 16:55:38] [INFO ] Computed 330 invariants in 19 ms
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/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/506 variables, 10/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 11/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 168/674 variables, 155/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 100/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 830 constraints, problems are : Problem set: 0 solved, 3 unsolved in 624 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/506 variables, 10/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 11/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/674 variables, 155/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 100/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/674 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 831 constraints, problems are : Problem set: 0 solved, 3 unsolved in 4413 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5073ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 344 steps, including 6 resets, run visited all 3 properties in 4 ms. (steps per millisecond=86 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 6 ms.
Knowledge obtained : [(AND p1 p0 p3 p2), (X p2), (X p3), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X p0), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X p1), (X (NOT (AND (NOT p1) (NOT p3)))), (X (X p3)), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p0 p3 p1))), (F (NOT (OR p0 p3))), (F (NOT (OR p0 p1))), (F (NOT (OR p3 p2))), (F (NOT p2)), (F (NOT (OR p3 p1))), (F (NOT p3)), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 4163 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 324 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 294 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Support contains 276 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 174/174 transitions.
Applied a total of 0 rules in 4 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-06-05 16:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:48] [INFO ] Implicit Places using invariants in 214 ms returned []
[2025-06-05 16:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:55:48] [INFO ] Implicit Places using invariants and state equation in 555 ms returned []
Implicit Place search using SMT with State Equation took 772 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-05 16:55:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 174/663 variables, 489/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 11/674 variables, 11/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 830 constraints, problems are : Problem set: 0 solved, 151 unsolved in 17428 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 174/663 variables, 489/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 151/970 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 151 unsolved
SMT process timed out in 47473ms, After SMT, problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 47473ms
Finished structural reductions in LTL mode , in 1 iterations and 48249 ms. Remains : 500/500 places, 174/174 transitions.
Computed a total of 500 stabilizing places and 174 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 500 transition count 174
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p3 p1 p2), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 25 factoid took 1347 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 306 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Reduction of identical properties reduced properties to check from 10 to 7
RANDOM walk for 40000 steps (2711 resets) in 511 ms. (78 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (207 resets) in 111 ms. (357 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (203 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (205 resets) in 185 ms. (215 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (204 resets) in 174 ms. (228 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (209 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (205 resets) in 61 ms. (645 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (204 resets) in 107 ms. (370 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 812281 steps, run timeout after 3001 ms. (steps per millisecond=270 ) properties seen :4 out of 7
Probabilistic random walk after 812281 steps, saw 109819 distinct states, run finished after 3001 ms. (steps per millisecond=270 ) properties seen :4
[2025-06-05 16:56:41] [INFO ] Invariant cache hit.
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/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 11/506 variables, 10/564 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/506 variables, 11/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 0/575 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 168/674 variables, 155/730 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/674 variables, 100/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 830 constraints, problems are : Problem set: 0 solved, 3 unsolved in 654 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/276 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (OVERLAPS) 59/335 variables, 276/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/335 variables, 0/496 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 160/495 variables, 58/554 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/495 variables, 1/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/495 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 11/506 variables, 10/565 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/506 variables, 11/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/506 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 168/674 variables, 155/731 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/674 variables, 100/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/674 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/674 variables, 0/831 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 674/674 variables, and 831 constraints, problems are : Problem set: 0 solved, 3 unsolved in 3578 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4244ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 1108 steps, including 21 resets, run visited all 3 properties in 13 ms. (steps per millisecond=85 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 12 ms.
Knowledge obtained : [(AND p0 p3 p1 p2), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p2)), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p0)), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (NOT (OR p1 p0))), (F (NOT (OR (NOT p1) (NOT p3) p0))), (F (NOT p0)), (F (NOT (OR p3 p2))), (F (NOT p2)), (F (NOT (OR p1 p3 p0))), (F (NOT p3)), (F (NOT p1)), (F (NOT (OR p3 p0))), (F (NOT (OR p1 p3)))]
Knowledge based reduction with 25 factoid took 4155 ms. Reduced automaton from 7 states, 14 edges and 4 AP (stutter sensitive) to 7 states, 14 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 308 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 277 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Stuttering acceptance computed with spot in 304 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Product exploration explored 100000 steps with 6788 reset in 643 ms.
Product exploration explored 100000 steps with 6778 reset in 655 ms.
Applying partial POR strategy [true, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 289 ms :[(AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), (AND (NOT p2) (NOT p3)), (NOT p3), (NOT p0), (NOT p1), (NOT p2)]
Support contains 276 out of 500 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 500/500 places, 174/174 transitions.
Applied a total of 0 rules in 11 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 16:56:52] [INFO ] Redundant transitions in 15 ms returned []
Running 151 sub problems to find dead transitions.
[2025-06-05 16:56:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 174/663 variables, 489/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 11/674 variables, 11/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 830 constraints, problems are : Problem set: 0 solved, 151 unsolved in 17445 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 174/663 variables, 489/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 151/970 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 151 unsolved
SMT process timed out in 47494ms, After SMT, problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 47495ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47526 ms. Remains : 500/500 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin5673069167710829096
[2025-06-05 16:57:40] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5673069167710829096
Running compilation step : cd /tmp/ltsmin5673069167710829096;'/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 476 ms.
Running link step : cd /tmp/ltsmin5673069167710829096;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5673069167710829096;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5151673926559655032.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 276 out of 500 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 500/500 places, 174/174 transitions.
Applied a total of 0 rules in 5 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-06-05 16:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:57:55] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-06-05 16:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:57:55] [INFO ] Implicit Places using invariants and state equation in 564 ms returned []
Implicit Place search using SMT with State Equation took 787 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-05 16:57:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 174/663 variables, 489/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 0/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (OVERLAPS) 11/674 variables, 11/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 6 (OVERLAPS) 0/674 variables, 0/830 constraints. Problems are: Problem set: 0 solved, 151 unsolved
No progress, stopping.
After SMT solving in domain Real declared 674/674 variables, and 830 constraints, problems are : Problem set: 0 solved, 151 unsolved in 17176 ms.
Refiners :[Generalized P Invariants (flows): 330/330 constraints, State Equation: 500/500 constraints, PredecessorRefiner: 151/151 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 151 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/489 variables, 330/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/489 variables, 0/330 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 2 (OVERLAPS) 174/663 variables, 489/819 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/663 variables, 151/970 constraints. Problems are: Problem set: 0 solved, 151 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/663 variables, 0/970 constraints. Problems are: Problem set: 0 solved, 151 unsolved
SMT process timed out in 47234ms, After SMT, problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 47234ms
Finished structural reductions in LTL mode , in 1 iterations and 48028 ms. Remains : 500/500 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin3677990898991996537
[2025-06-05 16:58:43] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3677990898991996537
Running compilation step : cd /tmp/ltsmin3677990898991996537;'/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 488 ms.
Running link step : cd /tmp/ltsmin3677990898991996537;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin3677990898991996537;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13238637765125981798.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 16:58:58] [INFO ] Flatten gal took : 9 ms
[2025-06-05 16:58:58] [INFO ] Flatten gal took : 9 ms
[2025-06-05 16:58:58] [INFO ] Time to serialize gal into /tmp/LTL639760146199932987.gal : 2 ms
[2025-06-05 16:58:58] [INFO ] Time to serialize properties into /tmp/LTL12239236659032424605.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL639760146199932987.gal' '-t' 'CGAL' '-hoa' '/tmp/aut597619433559762609.hoa' '-atoms' '/tmp/LTL12239236659032424605.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL12239236659032424605.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut597619433559762609.hoa
Detected timeout of ITS tools.
[2025-06-05 16:59:13] [INFO ] Flatten gal took : 9 ms
[2025-06-05 16:59:13] [INFO ] Flatten gal took : 8 ms
[2025-06-05 16:59:13] [INFO ] Time to serialize gal into /tmp/LTL683783498384747586.gal : 2 ms
[2025-06-05 16:59:13] [INFO ] Time to serialize properties into /tmp/LTL9283635733485511270.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL683783498384747586.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9283635733485511270.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !(((((F("(((((n6_4+n6_3)+(n6_6+n6_5))+((n6_0+n6_2)+(n6_1+n6_8)))+((n6_7+n6_10)+n6_9))<=((((n5_0+n5_1)+(n5_6+n5_7))+((n5_8+n5_9)+(n5_2+...3789
Formula 0 simplified : ((G!"(((((n6_4+n6_3)+(n6_6+n6_5))+((n6_0+n6_2)+(n6_1+n6_8)))+((n6_7+n6_10)+n6_9))<=((((n5_0+n5_1)+(n5_6+n5_7))+((n5_8+n5_9)+(n5_2+n5...3779
Detected timeout of ITS tools.
[2025-06-05 16:59:28] [INFO ] Flatten gal took : 10 ms
[2025-06-05 16:59:28] [INFO ] Applying decomposition
[2025-06-05 16:59:28] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12087583280984770974.txt' '-o' '/tmp/graph12087583280984770974.bin' '-w' '/tmp/graph12087583280984770974.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12087583280984770974.bin' '-l' '-1' '-v' '-w' '/tmp/graph12087583280984770974.weights' '-q' '0' '-e' '0.001'
[2025-06-05 16:59:28] [INFO ] Decomposing Gal with order
[2025-06-05 16:59:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 16:59:28] [INFO ] Removed a total of 130 redundant transitions.
[2025-06-05 16:59:28] [INFO ] Flatten gal took : 18 ms
[2025-06-05 16:59:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 2 ms.
[2025-06-05 16:59:28] [INFO ] Time to serialize gal into /tmp/LTL5615926776199827007.gal : 2 ms
[2025-06-05 16:59:28] [INFO ] Time to serialize properties into /tmp/LTL5031259855913030048.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5615926776199827007.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5031259855913030048.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !(((((F("(((((gi13.gi4.gu35.n6_4+gi13.gi4.gu35.n6_3)+(gi13.gi4.gu35.n6_6+gi13.gi4.gu35.n6_5))+((gi13.gi4.gu35.n6_0+gi13.gi4.gu35.n6_2)...6153
Formula 0 simplified : ((G!"(((((gi13.gi4.gu35.n6_4+gi13.gi4.gu35.n6_3)+(gi13.gi4.gu35.n6_6+gi13.gi4.gu35.n6_5))+((gi13.gi4.gu35.n6_0+gi13.gi4.gu35.n6_2)+(...6143
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-03 finished in 253544 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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)&&F((G(F(p1))||(!p0&&F(p1))))) U X(X(G(p2)))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-PT-10-LTLCardinality-06
Stuttering acceptance computed with spot in 354 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
Support contains 25 out of 529 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 529/529 places, 176/176 transitions.
Graph (complete) has 2148 edges and 529 vertex of which 515 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 514 transition count 175
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 514 transition count 175
Applied a total of 4 rules in 22 ms. Remains 514 /529 variables (removed 15) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 514 cols
[2025-06-05 16:59:44] [INFO ] Computed 341 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:59:44] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-06-05 16:59:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:59:45] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned [309]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1389 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 513/529 places, 175/176 transitions.
Applied a total of 0 rules in 7 ms. Remains 513 /513 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1430 ms. Remains : 513/529 places, 175/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-PT-10-LTLCardinality-06
Product exploration explored 100000 steps with 20483 reset in 224 ms.
Product exploration explored 100000 steps with 20469 reset in 218 ms.
Computed a total of 513 stabilizing places and 175 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 1890 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 10 states, 18 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (AND (NOT p1) p2)]
RANDOM walk for 40000 steps (2767 resets) in 237 ms. (168 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (312 resets) in 28 ms. (1379 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (436 resets) in 46 ms. (851 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (193 resets) in 43 ms. (909 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (315 resets) in 59 ms. (666 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (436 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
// Phase 1: matrix 175 rows 513 cols
[2025-06-05 16:59:48] [INFO ] Computed 340 invariants in 6 ms
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/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/86 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 173/259 variables, 81/127 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/259 variables, 20/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 429/688 variables, 396/543 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 310/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 853 constraints, problems are : Problem set: 0 solved, 5 unsolved in 472 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 11/36 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/36 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 50/86 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 173/259 variables, 81/128 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/259 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/259 variables, 4/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/259 variables, 0/152 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem apf4 is UNSAT
Problem apf5 is UNSAT
At refinement iteration 10 (OVERLAPS) 429/688 variables, 396/548 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 310/858 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 0/858 constraints. Problems are: Problem set: 2 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 0/688 variables, 0/858 constraints. Problems are: Problem set: 2 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 688/688 variables, and 858 constraints, problems are : Problem set: 2 solved, 3 unsolved in 853 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1361ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 3 properties in 2 ms. (steps per millisecond=34 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 2 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2)))), (G (OR (NOT p2) p1)), (G (OR p1 p0))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F (NOT (AND (NOT p2) p0))), (F (NOT (OR p2 p1))), (F p2), (F (NOT (OR p2 p0))), (F (NOT p1)), (F (NOT p0)), (F (NOT (OR (NOT p2) (NOT p0))))]
Knowledge based reduction with 14 factoid took 2303 ms. Reduced automaton from 10 states, 18 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 206 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
[2025-06-05 16:59:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:59:53] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 134 ms returned sat
[2025-06-05 16:59:56] [INFO ] [Real]Absence check using state equation in 3226 ms returned sat
[2025-06-05 16:59:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 16:59:56] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 143 ms returned sat
[2025-06-05 16:59:59] [INFO ] [Nat]Absence check using state equation in 2789 ms returned sat
[2025-06-05 16:59:59] [INFO ] Computed and/alt/rep : 125/147/125 causal constraints (skipped 38 transitions) in 10 ms.
[2025-06-05 16:59:59] [INFO ] Added : 0 causal constraints over 0 iterations in 124 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 25 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 175/175 transitions.
Applied a total of 0 rules in 9 ms. Remains 513 /513 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-06-05 16:59:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 16:59:59] [INFO ] Implicit Places using invariants in 370 ms returned []
[2025-06-05 16:59:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:00:00] [INFO ] Implicit Places using invariants and state equation in 937 ms returned []
Implicit Place search using SMT with State Equation took 1310 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-05 17:00:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 175/686 variables, 511/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 2/688 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 853 constraints, problems are : Problem set: 0 solved, 163 unsolved in 19033 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 175/686 variables, 511/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 86/937 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 163 unsolved
SMT process timed out in 49088ms, After SMT, problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 49089ms
Finished structural reductions in LTL mode , in 1 iterations and 50415 ms. Remains : 513/513 places, 175/175 transitions.
Computed a total of 513 stabilizing places and 175 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 513 transition count 175
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 7 factoid took 778 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 194 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
RANDOM walk for 40000 steps (2763 resets) in 126 ms. (314 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40004 steps (328 resets) in 22 ms. (1739 steps per ms) remains 1/1 properties
[2025-06-05 17:00:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 100/112 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 495/607 variables, 429/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/607 variables, 310/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 0/752 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 73/680 variables, 66/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/680 variables, 30/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/680 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/688 variables, 5/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 853 constraints, problems are : Problem set: 0 solved, 1 unsolved in 292 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 11/12 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 100/112 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 495/607 variables, 429/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/607 variables, 310/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/607 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 73/680 variables, 66/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/680 variables, 30/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/680 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 8/688 variables, 5/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/688 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/688 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 688/688 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 308 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 628ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 51 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X p0), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p1)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (X p2)), (X (X (NOT p2))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F p2), (F (NOT p1)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 1099 ms. Reduced automaton from 6 states, 9 edges and 3 AP (stutter sensitive) to 6 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 252 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 267 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
[2025-06-05 17:00:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:00:53] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 139 ms returned sat
[2025-06-05 17:00:56] [INFO ] [Real]Absence check using state equation in 3227 ms returned sat
[2025-06-05 17:00:56] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 17:00:57] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 147 ms returned sat
[2025-06-05 17:01:00] [INFO ] [Nat]Absence check using state equation in 2803 ms returned sat
[2025-06-05 17:01:00] [INFO ] Computed and/alt/rep : 125/147/125 causal constraints (skipped 38 transitions) in 10 ms.
[2025-06-05 17:01:00] [INFO ] Added : 0 causal constraints over 0 iterations in 126 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 244 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 25216 reset in 200 ms.
Product exploration explored 100000 steps with 25136 reset in 203 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) (NOT p2)), (AND p0 (NOT p1)), (AND (NOT p0) (NOT p2)), (OR (NOT p2) (AND p0 (NOT p1))), (NOT p0), (NOT p1)]
Support contains 25 out of 513 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 513/513 places, 175/175 transitions.
Applied a total of 0 rules in 15 ms. Remains 513 /513 variables (removed 0) and now considering 175/175 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 17:01:01] [INFO ] Redundant transitions in 15 ms returned []
Running 163 sub problems to find dead transitions.
[2025-06-05 17:01:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 175/686 variables, 511/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 2/688 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 853 constraints, problems are : Problem set: 0 solved, 163 unsolved in 18554 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 175/686 variables, 511/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 86/937 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 163 unsolved
SMT process timed out in 48616ms, After SMT, problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 48618ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48661 ms. Remains : 513/513 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin11002429097478554508
[2025-06-05 17:01:49] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11002429097478554508
Running compilation step : cd /tmp/ltsmin11002429097478554508;'/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 475 ms.
Running link step : cd /tmp/ltsmin11002429097478554508;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11002429097478554508;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11261901083789833630.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 25 out of 513 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 513/513 places, 175/175 transitions.
Applied a total of 0 rules in 10 ms. Remains 513 /513 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-06-05 17:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:05] [INFO ] Implicit Places using invariants in 360 ms returned []
[2025-06-05 17:02:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 17:02:06] [INFO ] Implicit Places using invariants and state equation in 926 ms returned []
Implicit Place search using SMT with State Equation took 1288 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-05 17:02:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 175/686 variables, 511/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 0/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (OVERLAPS) 2/688 variables, 2/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (OVERLAPS) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 163 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 853 constraints, problems are : Problem set: 0 solved, 163 unsolved in 18769 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 163/163 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 163 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/511 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/511 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 2 (OVERLAPS) 175/686 variables, 511/851 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/686 variables, 86/937 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/686 variables, 0/937 constraints. Problems are: Problem set: 0 solved, 163 unsolved
SMT process timed out in 48830ms, After SMT, problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 48831ms
Finished structural reductions in LTL mode , in 1 iterations and 50131 ms. Remains : 513/513 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin4290047024956743638
[2025-06-05 17:02:55] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4290047024956743638
Running compilation step : cd /tmp/ltsmin4290047024956743638;'/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 456 ms.
Running link step : cd /tmp/ltsmin4290047024956743638;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin4290047024956743638;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10817164341980174728.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 17:03:10] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:03:10] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:03:10] [INFO ] Time to serialize gal into /tmp/LTL4087582467166359204.gal : 1 ms
[2025-06-05 17:03:10] [INFO ] Time to serialize properties into /tmp/LTL397981746124986682.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4087582467166359204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15704409574503056400.hoa' '-atoms' '/tmp/LTL397981746124986682.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL397981746124986682.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15704409574503056400.hoa
Detected timeout of ITS tools.
[2025-06-05 17:03:25] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:03:25] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:03:25] [INFO ] Time to serialize gal into /tmp/LTL12551841371188693807.gal : 2 ms
[2025-06-05 17:03:25] [INFO ] Time to serialize properties into /tmp/LTL14454422171397083428.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12551841371188693807.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14454422171397083428.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((((F("(((((s2_2+s2_1)+(s2_0+s2_7))+((s2_8+s2_9)+(s2_10+s2_3)))+((s2_4+s2_5)+s2_6))<=a5)"))&&(F((G(F("(CstopAbort<1)")))||(("(((((s2_...356
Formula 0 simplified : (G!"(((((s2_2+s2_1)+(s2_0+s2_7))+((s2_8+s2_9)+(s2_10+s2_3)))+((s2_4+s2_5)+s2_6))<=a5)" | G(FG!"(CstopAbort<1)" & (!"(((((s2_2+s2_1)+...337
Detected timeout of ITS tools.
[2025-06-05 17:03:40] [INFO ] Flatten gal took : 11 ms
[2025-06-05 17:03:40] [INFO ] Applying decomposition
[2025-06-05 17:03:40] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph6162510009132381178.txt' '-o' '/tmp/graph6162510009132381178.bin' '-w' '/tmp/graph6162510009132381178.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6162510009132381178.bin' '-l' '-1' '-v' '-w' '/tmp/graph6162510009132381178.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:03:40] [INFO ] Decomposing Gal with order
[2025-06-05 17:03:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:03:40] [INFO ] Removed a total of 110 redundant transitions.
[2025-06-05 17:03:40] [INFO ] Flatten gal took : 55 ms
[2025-06-05 17:03:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 48 labels/synchronizations in 30 ms.
[2025-06-05 17:03:40] [INFO ] Time to serialize gal into /tmp/LTL7936159303636826132.gal : 4 ms
[2025-06-05 17:03:40] [INFO ] Time to serialize properties into /tmp/LTL1299333684072224438.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7936159303636826132.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1299333684072224438.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((((F("(((((gu29.s2_2+gu29.s2_1)+(gu29.s2_0+gu29.s2_7))+((gu29.s2_8+gu29.s2_9)+(gu29.s2_10+gu29.s2_3)))+((gu29.s2_4+gu29.s2_5)+gu29.s...568
Formula 0 simplified : (G!"(((((gu29.s2_2+gu29.s2_1)+(gu29.s2_0+gu29.s2_7))+((gu29.s2_8+gu29.s2_9)+(gu29.s2_10+gu29.s2_3)))+((gu29.s2_4+gu29.s2_5)+gu29.s2_...549
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-PT-10-LTLCardinality-06 finished in 251994 ms.
[2025-06-05 17:03:55] [INFO ] Flatten gal took : 10 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7028426751729928703
[2025-06-05 17:03:55] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-06-05 17:03:55] [INFO ] Applying decomposition
[2025-06-05 17:03:55] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:03:55] [INFO ] Flatten gal took : 9 ms
[2025-06-05 17:03:55] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-06-05 17:03:55] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:03:55] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-06-05 17:03:55] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 17:03:55] [INFO ] Built C files in 60ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7028426751729928703
Running compilation step : cd /tmp/ltsmin7028426751729928703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' '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'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph17211366746525794132.txt' '-o' '/tmp/graph17211366746525794132.bin' '-w' '/tmp/graph17211366746525794132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph17211366746525794132.bin' '-l' '-1' '-v' '-w' '/tmp/graph17211366746525794132.weights' '-q' '0' '-e' '0.001'
[2025-06-05 17:03:55] [INFO ] Decomposing Gal with order
[2025-06-05 17:03:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 17:03:56] [INFO ] Removed a total of 80 redundant transitions.
[2025-06-05 17:03:56] [INFO ] Flatten gal took : 35 ms
[2025-06-05 17:03:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 11 labels/synchronizations in 17 ms.
[2025-06-05 17:03:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality11014010439390253850.gal : 3 ms
[2025-06-05 17:03:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality11155968106024423087.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11014010439390253850.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11155968106024423087.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 4 LTL properties
Checking formula 0 : !((F(G("(((((gi0.gu14.SstopOK_10+gi0.gu14.SstopOK_8)+(gi0.gu14.SstopOK_9+gi0.gu14.SstopOK_6))+((gi0.gu14.SstopOK_7+gi0.gu14.SstopOK_4)...278
Formula 0 simplified : GF!"(((((gi0.gu14.SstopOK_10+gi0.gu14.SstopOK_8)+(gi0.gu14.SstopOK_9+gi0.gu14.SstopOK_6))+((gi0.gu14.SstopOK_7+gi0.gu14.SstopOK_4)+(...272
Compilation finished in 694 ms.
Running link step : cd /tmp/ltsmin7028426751729928703;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7028426751729928703;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin7028426751729928703;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7028426751729928703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((<>((LTLAPp1==true)) U (LTLAPp2==true))&&<>((LTLAPp3==true))) U X([]((LTLAPp4==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin7028426751729928703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((<>((LTLAPp1==true)) U (LTLAPp2==true))&&<>((LTLAPp3==true))) U X([]((LTLAPp4==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7028426751729928703;'/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' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin7028426751729928703;'/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' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin7028426751729928703;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '((<>((LTLAPp6==true))&&<>(([](<>((LTLAPp7==true)))||(!(LTLAPp6==true)&&<>((LTLAPp7==true)))))) U X(X([]((LTLAPp8==true)))))' '--buchi-type=spotba'
LTSmin run took 148540 ms.
FORMULA QuasiCertifProtocol-PT-10-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin7028426751729928703;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.009: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.013: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.013: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.067: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.068: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.075: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.084: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.084: Initializing POR dependencies: labels 185, guards 176
pins2lts-mc-linux64( 3/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.382: LTL layer: formula: <>([]((LTLAPp0==true)))
pins2lts-mc-linux64( 2/ 8), 0.382: "<>([]((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.383: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.539: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 0.548: There are 186 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.548: State length is 530, there are 180 groups
pins2lts-mc-linux64( 0/ 8), 0.548: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.548: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.548: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.548: Visible groups: 0 / 180, labels: 1 / 186
pins2lts-mc-linux64( 0/ 8), 0.548: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 0.548: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 4/ 8), 0.608: [Blue] ~17 levels ~960 states ~2928 transitions
pins2lts-mc-linux64( 4/ 8), 0.630: [Blue] ~17 levels ~1920 states ~5632 transitions
pins2lts-mc-linux64( 4/ 8), 0.672: [Blue] ~18 levels ~3840 states ~11280 transitions
pins2lts-mc-linux64( 4/ 8), 0.755: [Blue] ~18 levels ~7680 states ~24944 transitions
pins2lts-mc-linux64( 4/ 8), 0.921: [Blue] ~18 levels ~15360 states ~54704 transitions
pins2lts-mc-linux64( 3/ 8), 1.276: [Blue] ~17 levels ~30720 states ~107016 transitions
pins2lts-mc-linux64( 1/ 8), 1.977: [Blue] ~18 levels ~61440 states ~223344 transitions
pins2lts-mc-linux64( 0/ 8), 3.256: [Blue] ~19 levels ~122880 states ~494520 transitions
pins2lts-mc-linux64( 1/ 8), 5.793: [Blue] ~19 levels ~245760 states ~1065120 transitions
pins2lts-mc-linux64( 0/ 8), 10.976: [Blue] ~19 levels ~491520 states ~2407088 transitions
pins2lts-mc-linux64( 3/ 8), 21.194: [Blue] ~18 levels ~983040 states ~5213328 transitions
pins2lts-mc-linux64( 2/ 8), 41.314: [Blue] ~31 levels ~1966080 states ~10657304 transitions
pins2lts-mc-linux64( 7/ 8), 85.300: [Blue] ~31 levels ~3932160 states ~23311312 transitions
pins2lts-mc-linux64( 2/ 8), 166.954: [Blue] ~51 levels ~7864320 states ~45904872 transitions
pins2lts-mc-linux64( 2/ 8), 310.710: [Blue] ~51 levels ~15728640 states ~84031920 transitions
pins2lts-mc-linux64( 4/ 8), 626.889: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 626.971:
pins2lts-mc-linux64( 0/ 8), 626.971: Explored 28520350 states 165771946 transitions, fanout: 5.812
pins2lts-mc-linux64( 0/ 8), 626.971: Total exploration time 626.390 sec (626.320 sec minimum, 626.354 sec on average)
pins2lts-mc-linux64( 0/ 8), 626.971: States per second: 45531, Transitions per second: 264647
pins2lts-mc-linux64( 0/ 8), 626.971:
pins2lts-mc-linux64( 0/ 8), 626.971: State space has 28348228 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 626.971: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 626.971: blue states: 28520350 (100.61%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 626.971: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 626.971: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 626.971:
pins2lts-mc-linux64( 0/ 8), 626.971: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 626.971:
pins2lts-mc-linux64( 0/ 8), 626.971: Queue width: 8B, total height: 422, memory: 0.00MB
pins2lts-mc-linux64( 0/ 8), 626.971: Tree memory: 472.3MB, 17.5 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 626.971: Tree fill ratio (roots/leafs): 21.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 626.971: Stored 176 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 626.971: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 626.971: Est. total memory use: 472.3MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7028426751729928703;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7028426751729928703;'/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' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:121)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-05 17:31:50] [INFO ] Flatten gal took : 125 ms
[2025-06-05 17:31:50] [INFO ] Time to serialize gal into /tmp/LTLCardinality3096602344071639806.gal : 49 ms
[2025-06-05 17:31:51] [INFO ] Time to serialize properties into /tmp/LTLCardinality17399203645259891808.ltl : 28 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3096602344071639806.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17399203645259891808.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 3 LTL properties
Checking formula 0 : !((F(G("(((((SstopOK_10+SstopOK_8)+(SstopOK_9+SstopOK_6))+((SstopOK_7+SstopOK_4)+(SstopOK_5+SstopOK_1)))+((SstopOK_0+SstopOK_3)+SstopO...170
Formula 0 simplified : GF!"(((((SstopOK_10+SstopOK_8)+(SstopOK_9+SstopOK_6))+((SstopOK_7+SstopOK_4)+(SstopOK_5+SstopOK_1)))+((SstopOK_0+SstopOK_3)+SstopOK_...164
BK_TIME_CONFINEMENT_REACHED
--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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 LTLCardinality -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="QuasiCertifProtocol-PT-10"
export BK_EXAMINATION="LTLCardinality"
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 QuasiCertifProtocol-PT-10, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r156-tall-174881254700795"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-PT-10.tgz
mv QuasiCertifProtocol-PT-10 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;