Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r156-tall-174881254600739.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-COL-10, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r156-tall-174881254600739
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 488K
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 60K 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 4.2K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.7K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 29 14:32 equiv_pt
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 5 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 72K 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-COL-10-LTLCardinality-00
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-01
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-02
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-03
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-04
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-05
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-06
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-07
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-08
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-09
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-10
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-11
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-12
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-13
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-14
FORMULA_NAME QuasiCertifProtocol-COL-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1749123170021

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=QuasiCertifProtocol-COL-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is COL
LTLCardinality COL
Running Version 202505121319
[2025-06-05 11:32:51] [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 11:32:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-05 11:32:51] [INFO ] Detected file is not PT type :http://www.pnml.org/version-2009/grammar/symmetricnet
log4j:WARN No appenders could be found for logger (org.apache.axiom.locator.DefaultOMMetaFactoryLocator).
log4j:WARN Please initialize the log4j system properly.
log4j:WARN See http://logging.apache.org/log4j/1.2/faq.html#noconfig for more info.
[2025-06-05 11:32:51] [WARNING] Using fallBack plugin, rng conformance not checked
[2025-06-05 11:32:51] [INFO ] Load time of PNML (colored model parsed with PNMLFW) : 590 ms
[2025-06-05 11:32:51] [INFO ] Imported 30 HL places and 26 HL transitions for a total of 550 PT places and 176.0 transition bindings in 18 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
[2025-06-05 11:32:52] [INFO ] Built PT skeleton of HLPN with 30 places and 26 transitions 77 arcs in 5 ms.
[2025-06-05 11:32:52] [INFO ] Skeletonized 16 HLPN properties in 2 ms.
Initial state reduction rules removed 4 formulas.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Remains 12 properties that can be checked using skeleton over-approximation.
Computed a total of 30 stabilizing places and 26 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 30 transition count 26
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
RANDOM walk for 40009 steps (2228 resets) in 887 ms. (45 steps per ms) remains 12/35 properties
BEST_FIRST walk for 40003 steps (894 resets) in 231 ms. (172 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (836 resets) in 460 ms. (86 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (844 resets) in 253 ms. (157 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (834 resets) in 141 ms. (281 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (833 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (707 resets) in 134 ms. (296 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (829 resets) in 115 ms. (344 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (879 resets) in 91 ms. (434 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (839 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (830 resets) in 114 ms. (347 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (842 resets) in 86 ms. (459 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (834 resets) in 119 ms. (333 steps per ms) remains 12/12 properties
// Phase 1: matrix 26 rows 30 cols
[2025-06-05 11:32:53] [INFO ] Computed 5 invariants in 4 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/11 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 1 (OVERLAPS) 13/24 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 26/51 variables, 25/30 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/51 variables, 0/30 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 5/56 variables, 5/35 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/56 variables, 0/35 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 56/56 variables, and 35 constraints, problems are : Problem set: 3 solved, 9 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/24 variables, 4/4 constraints. Problems are: Problem set: 3 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:32:53] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 1/5 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/24 variables, 0/5 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 1/25 variables, 1/6 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/25 variables, 0/6 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 26/51 variables, 25/31 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/51 variables, 9/40 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/51 variables, 0/40 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 5/56 variables, 5/45 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/56 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 9 unsolved
At refinement iteration 11 (OVERLAPS) 0/56 variables, 0/45 constraints. Problems are: Problem set: 3 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 56/56 variables, and 45 constraints, problems are : Problem set: 3 solved, 9 unsolved in 400 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 9/12 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 871ms problems are : Problem set: 3 solved, 9 unsolved
Fused 9 Parikh solutions to 3 different solutions.
Finished Parikh walk after 66 steps, including 0 resets, run visited all 9 properties in 2 ms. (steps per millisecond=33 )
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 9 properties in 6 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
[2025-06-05 11:32:54] [INFO ] Flatten gal took : 16 ms
[2025-06-05 11:32:54] [INFO ] Flatten gal took : 5 ms
Domain [tsid(11), tsid(11)] of place n9 breaks symmetries in sort tsid
[2025-06-05 11:32:54] [INFO ] Unfolded HLPN to a Petri net with 550 places and 176 transitions 1287 arcs in 39 ms.
[2025-06-05 11:32:54] [INFO ] Unfolded 12 HLPN properties in 0 ms.
Support contains 526 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Applied a total of 0 rules in 16 ms. Remains 550 /550 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 550 cols
[2025-06-05 11:32:54] [INFO ] Computed 375 invariants in 35 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:32:54] [INFO ] Implicit Places using invariants in 418 ms returned []
[2025-06-05 11:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:32:54] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 771 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:32:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 27/550 variables, 15/265 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 110/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 0 solved, 164 unsolved in 17682 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 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/523 variables, 250/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/250 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 27/550 variables, 15/265 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/550 variables, 110/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/550 variables, 0/375 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (OVERLAPS) 176/726 variables, 550/925 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/726 variables, 164/1089 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/726 variables, 0/1089 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 726/726 variables, and 1089 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 47809ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47812ms
Finished structural reductions in LTL mode , in 1 iterations and 48622 ms. Remains : 550/550 places, 176/176 transitions.
Support contains 526 out of 550 places after structural reductions.
[2025-06-05 11:33:42] [INFO ] Flatten gal took : 90 ms
[2025-06-05 11:33:42] [INFO ] Flatten gal took : 67 ms
[2025-06-05 11:33:43] [INFO ] Input system was already deterministic with 176 transitions.
RANDOM walk for 40000 steps (2766 resets) in 2944 ms. (13 steps per ms) remains 32/35 properties
BEST_FIRST walk for 4004 steps (30 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (29 resets) in 32 ms. (121 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (34 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (27 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (30 resets) in 59 ms. (66 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (32 resets) in 39 ms. (100 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (32 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (40 resets) in 26 ms. (148 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 46 ms. (85 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (31 resets) in 29 ms. (133 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (33 resets) in 34 ms. (114 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 16 ms. (235 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (33 resets) in 21 ms. (181 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4001 steps (25 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4000 steps (40 resets) in 23 ms. (166 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (29 resets) in 15 ms. (250 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (32 resets) in 51 ms. (76 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (32 resets) in 20 ms. (190 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (29 resets) in 24 ms. (160 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (28 resets) in 27 ms. (143 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4002 steps (29 resets) in 19 ms. (200 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (30 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (32 resets) in 25 ms. (153 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (33 resets) in 31 ms. (125 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (34 resets) in 30 ms. (129 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4003 steps (31 resets) in 37 ms. (105 steps per ms) remains 32/32 properties
BEST_FIRST walk for 4004 steps (16 resets) in 18 ms. (210 steps per ms) remains 32/32 properties
Interrupted probabilistic random walk after 539432 steps, run timeout after 3001 ms. (steps per millisecond=179 ) properties seen :28 out of 32
Probabilistic random walk after 539432 steps, saw 75204 distinct states, run finished after 3004 ms. (steps per millisecond=179 ) properties seen :28
[2025-06-05 11:33:47] [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/146 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/146 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp20 is UNSAT
At refinement iteration 2 (OVERLAPS) 5/151 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/162 variables, 110/121 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/185 variables, 1/122 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 0/122 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 89/274 variables, 12/134 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/274 variables, 0/134 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 1/275 variables, 1/135 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/275 variables, 0/135 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 231/506 variables, 220/355 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/506 variables, 0/355 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 176/682 variables, 506/861 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/682 variables, 0/861 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 44/726 variables, 44/905 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/726 variables, 20/925 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/726 variables, 0/925 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/726 variables, 0/925 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 726/726 variables, and 925 constraints, problems are : Problem set: 3 solved, 1 unsolved in 639 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/144 variables, 10/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/144 variables, 0/10 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 7/151 variables, 1/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/151 variables, 0/11 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 11/162 variables, 110/121 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/162 variables, 0/121 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 23/185 variables, 1/122 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 139 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 46 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 25 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 42 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 37 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 1 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 4 places in 22 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/185 variables, 10/132 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/185 variables, 0/132 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 89/274 variables, 12/144 constraints. Problems are: Problem set: 3 solved, 1 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 5 places in 111 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:48] [INFO ] Deduced a trap composed of 5 places in 112 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 5 places in 118 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 5 places in 96 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 5 places in 81 ms of which 7 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 5 places in 75 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 5 places in 72 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 5 places in 66 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 8 places in 56 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 8 places in 97 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:49] [INFO ] Deduced a trap composed of 8 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 11:33:49] [INFO ] Deduced a trap composed of 8 places in 65 ms of which 10 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:50] [INFO ] Deduced a trap composed of 8 places in 64 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:50] [INFO ] Deduced a trap composed of 8 places in 55 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-05 11:33:50] [INFO ] Deduced a trap composed of 8 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 11:33:50] [INFO ] Deduced a trap composed of 8 places in 46 ms of which 2 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/274 variables, 19/163 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/274 variables, 0/163 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 1/275 variables, 1/164 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/275 variables, 0/164 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 231/506 variables, 220/384 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/506 variables, 0/384 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 176/682 variables, 506/890 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/682 variables, 1/891 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/682 variables, 0/891 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 44/726 variables, 44/935 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/726 variables, 20/955 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/726 variables, 0/955 constraints. Problems are: Problem set: 3 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/726 variables, 0/955 constraints. Problems are: Problem set: 3 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 726/726 variables, and 955 constraints, problems are : Problem set: 3 solved, 1 unsolved in 3421 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 360/360 constraints, State Equation: 550/550 constraints, PredecessorRefiner: 1/4 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4093ms problems are : Problem set: 3 solved, 1 unsolved
Finished Parikh walk after 50 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=50 )
Parikh walk visited 1 properties in 0 ms.
Successfully simplified 3 atomic propositions for a total of 12 simplifications.
Computed a total of 550 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 550 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 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 525 transition count 176
Applied a total of 25 rules in 44 ms. Remains 525 /550 variables (removed 25) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2025-06-05 11:33:52] [INFO ] Computed 351 invariants in 39 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:52] [INFO ] Implicit Places using invariants in 499 ms returned []
[2025-06-05 11:33:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:53] [INFO ] Implicit Places using invariants and state equation in 1051 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1581 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/550 places, 176/176 transitions.
Applied a total of 0 rules in 35 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 1662 ms. Remains : 514/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 287 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-00
Stuttering criterion allowed to conclude after 14 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-00 finished in 2008 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 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 391 are kept as prefixes of interest. Removing 159 places using SCC suffix rule.5 ms
Discarding 159 places :
Also discarding 13 output transitions
Drop transitions (Output transitions of discarded places.) removed 13 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 390 transition count 152
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 8 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 389 transition count 151
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 14 place count 389 transition count 151
Applied a total of 14 rules in 85 ms. Remains 389 /550 variables (removed 161) and now considering 151/176 (removed 25) transitions.
// Phase 1: matrix 151 rows 389 cols
[2025-06-05 11:33:54] [INFO ] Computed 240 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:54] [INFO ] Implicit Places using invariants in 453 ms returned []
[2025-06-05 11:33:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:55] [INFO ] Implicit Places using invariants and state equation in 544 ms returned [287, 288, 289, 290, 291, 292, 293, 294, 295, 296, 297, 298, 299, 300, 301, 302, 303, 304, 305, 306, 307, 308]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1017 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 367/550 places, 151/176 transitions.
Applied a total of 0 rules in 24 ms. Remains 367 /367 variables (removed 0) and now considering 151/151 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1127 ms. Remains : 367/550 places, 151/176 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-01
Product exploration explored 100000 steps with 6652 reset in 378 ms.
Product exploration explored 100000 steps with 6652 reset in 235 ms.
Computed a total of 367 stabilizing places and 151 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 367 transition count 151
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 85 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 28 ms :[(NOT p0)]
RANDOM walk for 31064 steps (1910 resets) in 79 ms. (388 steps per ms) remains 0/1 properties
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 101 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 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Support contains 12 out of 367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 367/367 places, 151/151 transitions.
Applied a total of 0 rules in 10 ms. Remains 367 /367 variables (removed 0) and now considering 151/151 (removed 0) transitions.
// Phase 1: matrix 151 rows 367 cols
[2025-06-05 11:33:56] [INFO ] Computed 220 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:56] [INFO ] Implicit Places using invariants in 368 ms returned []
[2025-06-05 11:33:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:33:57] [INFO ] Implicit Places using invariants and state equation in 451 ms returned []
Implicit Place search using SMT with State Equation took 829 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:33:57] [INFO ] Redundant transitions in 27 ms returned []
Running 127 sub problems to find dead transitions.
[2025-06-05 11:33:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 151/496 variables, 345/565 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 22/518 variables, 22/587 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/518 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 587 constraints, problems are : Problem set: 0 solved, 127 unsolved in 11042 ms.
Refiners :[Generalized P Invariants (flows): 220/220 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 151/496 variables, 345/565 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 105/670 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 22/518 variables, 22/692 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 22/714 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 714 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 220/220 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41136ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 41137ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 42022 ms. Remains : 367/367 places, 151/151 transitions.
Computed a total of 367 stabilizing places and 151 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 367 transition count 151
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 69 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)]
RANDOM walk for 40000 steps (2467 resets) in 105 ms. (377 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (193 resets) in 71 ms. (555 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 120390 steps, run visited all 1 properties in 267 ms. (steps per millisecond=450 )
Probabilistic random walk after 120390 steps, saw 22164 distinct states, run finished after 300 ms. (steps per millisecond=401 ) 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 138 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6648 reset in 194 ms.
Product exploration explored 100000 steps with 6651 reset in 187 ms.
Built C files in :
/tmp/ltsmin4453396588791345886
[2025-06-05 11:34:39] [INFO ] Computing symmetric may disable matrix : 151 transitions.
[2025-06-05 11:34:39] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:34:39] [INFO ] Computing symmetric may enable matrix : 151 transitions.
[2025-06-05 11:34:39] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:34:39] [INFO ] Computing Do-Not-Accords matrix : 151 transitions.
[2025-06-05 11:34:39] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:34:39] [INFO ] Built C files in 53ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4453396588791345886
Running compilation step : cd /tmp/ltsmin4453396588791345886;'/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 529 ms.
Running link step : cd /tmp/ltsmin4453396588791345886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin4453396588791345886;'/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/stateBased10985803372208228002.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 12 out of 367 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 367/367 places, 151/151 transitions.
Applied a total of 0 rules in 27 ms. Remains 367 /367 variables (removed 0) and now considering 151/151 (removed 0) transitions.
[2025-06-05 11:34:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:34:54] [INFO ] Implicit Places using invariants in 247 ms returned []
[2025-06-05 11:34:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:34:55] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 663 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:34:55] [INFO ] Redundant transitions in 21 ms returned []
Running 127 sub problems to find dead transitions.
[2025-06-05 11:34: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/345 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 151/496 variables, 345/565 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 0/565 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (OVERLAPS) 22/518 variables, 22/587 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/518 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (OVERLAPS) 0/518 variables, 0/587 constraints. Problems are: Problem set: 0 solved, 127 unsolved
No progress, stopping.
After SMT solving in domain Real declared 518/518 variables, and 587 constraints, problems are : Problem set: 0 solved, 127 unsolved in 10613 ms.
Refiners :[Generalized P Invariants (flows): 220/220 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 127 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 220/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/345 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 2 (OVERLAPS) 151/496 variables, 345/565 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/496 variables, 105/670 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/496 variables, 0/670 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 5 (OVERLAPS) 22/518 variables, 22/692 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/518 variables, 22/714 constraints. Problems are: Problem set: 0 solved, 127 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/518 variables, 0/714 constraints. Problems are: Problem set: 0 solved, 127 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 518/518 variables, and 714 constraints, problems are : Problem set: 0 solved, 127 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 220/220 constraints, State Equation: 367/367 constraints, PredecessorRefiner: 127/127 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 40655ms problems are : Problem set: 0 solved, 127 unsolved
Search for dead transitions found 0 dead transitions in 40657ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 41373 ms. Remains : 367/367 places, 151/151 transitions.
Built C files in :
/tmp/ltsmin12758171260193208374
[2025-06-05 11:35:36] [INFO ] Computing symmetric may disable matrix : 151 transitions.
[2025-06-05 11:35:36] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:35:36] [INFO ] Computing symmetric may enable matrix : 151 transitions.
[2025-06-05 11:35:36] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:35:36] [INFO ] Computing Do-Not-Accords matrix : 151 transitions.
[2025-06-05 11:35:36] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:35:36] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12758171260193208374
Running compilation step : cd /tmp/ltsmin12758171260193208374;'/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 409 ms.
Running link step : cd /tmp/ltsmin12758171260193208374;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin12758171260193208374;'/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/stateBased9189006546515077598.hoa' '--buchi-type=spotba'
LTSmin run took 6323 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-01 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-01 finished in 108901 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 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 106 are kept as prefixes of interest. Removing 444 places using SCC suffix rule.3 ms
Discarding 444 places :
Also discarding 55 output transitions
Drop transitions (Output transitions of discarded places.) removed 55 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 43 transitions
Reduce isomorphic transitions removed 43 transitions.
Iterating post reduction 0 with 43 rules applied. Total rules applied 44 place count 105 transition count 77
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 46 place count 104 transition count 76
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 47 place count 104 transition count 76
Applied a total of 47 rules in 14 ms. Remains 104 /550 variables (removed 446) and now considering 76/176 (removed 100) transitions.
// Phase 1: matrix 76 rows 104 cols
[2025-06-05 11:35:42] [INFO ] Computed 30 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:35:42] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-05 11:35:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:35:43] [INFO ] Implicit Places using invariants and state equation in 96 ms returned [56, 57, 58, 59, 60, 61, 62, 63, 64, 65, 66]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 164 ms to find 11 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 93/550 places, 76/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 93 /93 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 180 ms. Remains : 93/550 places, 76/176 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-02
Product exploration explored 100000 steps with 6646 reset in 150 ms.
Product exploration explored 100000 steps with 6643 reset in 148 ms.
Computed a total of 93 stabilizing places and 76 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 93 transition count 76
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 17 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-COL-10-LTLCardinality-02 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-02 finished in 645 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 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 26 places and 0 transitions.
Iterating post reduction 0 with 26 rules applied. Total rules applied 26 place count 524 transition count 176
Applied a total of 26 rules in 8 ms. Remains 524 /550 variables (removed 26) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 524 cols
[2025-06-05 11:35:43] [INFO ] Computed 350 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:35:43] [INFO ] Implicit Places using invariants in 222 ms returned []
[2025-06-05 11:35:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:35:44] [INFO ] Implicit Places using invariants and state equation in 502 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 726 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 513/550 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 737 ms. Remains : 513/550 places, 176/176 transitions.
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)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-03
Product exploration explored 100000 steps with 6924 reset in 661 ms.
Product exploration explored 100000 steps with 6931 reset in 660 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 (NOT (AND (NOT p0) (NOT p3)))), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (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 1339 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 310 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 (2771 resets) in 877 ms. (45 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (326 resets) in 262 ms. (152 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (323 resets) in 346 ms. (115 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (327 resets) in 123 ms. (322 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (317 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (321 resets) in 351 ms. (113 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (318 resets) in 74 ms. (533 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (316 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 829441 steps, run timeout after 3001 ms. (steps per millisecond=276 ) properties seen :4 out of 7
Probabilistic random walk after 829441 steps, saw 112061 distinct states, run finished after 3001 ms. (steps per millisecond=276 ) properties seen :4
// Phase 1: matrix 176 rows 513 cols
[2025-06-05 11:35:51] [INFO ] Computed 340 invariants in 20 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/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 596 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5021 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 512/513 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5656ms 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.3 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 0 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 0 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 23 ms. Remains : 290/513 places, 59/176 transitions.
RANDOM walk for 841 steps (37 resets) in 25 ms. (32 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (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 p3 p1))), (F (NOT p3)), (F (NOT (OR p3 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT p2)), (F (NOT (OR p0 p3 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 4204 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 315 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 323 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 7 ms. Remains 513 /513 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 11:36:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:36:02] [INFO ] Implicit Places using invariants in 211 ms returned []
[2025-06-05 11:36:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:36:02] [INFO ] Implicit Places using invariants and state equation in 483 ms returned []
Implicit Place search using SMT with State Equation took 694 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:36: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 18487 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
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30019 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]
After SMT, in 48558ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 48558ms
Finished structural reductions in LTL mode , in 1 iterations and 49267 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 (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p2)), (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 1320 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 286 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 (2764 resets) in 717 ms. (55 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (321 resets) in 240 ms. (165 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (325 resets) in 200 ms. (199 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (323 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (324 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (324 resets) in 192 ms. (207 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (324 resets) in 58 ms. (678 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (312 resets) in 92 ms. (430 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 823921 steps, run timeout after 3001 ms. (steps per millisecond=274 ) properties seen :4 out of 7
Probabilistic random walk after 823921 steps, saw 111504 distinct states, run finished after 3001 ms. (steps per millisecond=274 ) properties seen :4
[2025-06-05 11:36:56] [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 607 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/689 variables, and 853 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5014 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 512/513 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5633ms 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.3 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 0 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 0 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 19 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 19 ms. Remains : 290/513 places, 59/176 transitions.
RANDOM walk for 603 steps (25 resets) in 8 ms. (67 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p2)), (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 p3 p1))), (F (NOT p3)), (F (NOT (OR p3 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT p2)), (F (NOT (OR p0 p3 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 4191 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)]
Stuttering acceptance computed with spot in 282 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 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)]
Product exploration explored 100000 steps with 6926 reset in 588 ms.
Product exploration explored 100000 steps with 6924 reset in 598 ms.
Applying partial POR strategy [true, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 318 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 0 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 22 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 11:37:09] [INFO ] Redundant transitions in 20 ms returned []
Running 165 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 513 cols
[2025-06-05 11:37:09] [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 TDEAD80 is UNSAT
Problem TDEAD173 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 18360 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
At refinement iteration 5 (OVERLAPS) 3/690 variables, 2/1016 constraints. Problems are: Problem set: 2 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 690/690 variables, and 1016 constraints, problems are : Problem set: 2 solved, 163 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 163/165 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48452ms problems are : Problem set: 2 solved, 163 unsolved
Search for dead transitions found 2 dead transitions in 48453ms
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.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 16 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 48523 ms. Remains : 512/513 places, 175/176 transitions.
Built C files in :
/tmp/ltsmin4747984853393556733
[2025-06-05 11:37:57] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4747984853393556733
Running compilation step : cd /tmp/ltsmin4747984853393556733;'/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 470 ms.
Running link step : cd /tmp/ltsmin4747984853393556733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin4747984853393556733;'/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/stateBased6145047225164589540.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 5 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 11:38:12] [INFO ] Computed 340 invariants in 40 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:38:12] [INFO ] Implicit Places using invariants in 238 ms returned []
[2025-06-05 11:38:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:38:13] [INFO ] Implicit Places using invariants and state equation in 482 ms returned []
Implicit Place search using SMT with State Equation took 723 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:38:13] [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 18285 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
At refinement iteration 5 (OVERLAPS) 1/689 variables, 1/1017 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 689/689 variables, and 1017 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30015 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]
After SMT, in 48332ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 48333ms
Finished structural reductions in LTL mode , in 1 iterations and 49061 ms. Remains : 513/513 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin13275905469038213633
[2025-06-05 11:39:01] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13275905469038213633
Running compilation step : cd /tmp/ltsmin13275905469038213633;'/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 485 ms.
Running link step : cd /tmp/ltsmin13275905469038213633;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin13275905469038213633;'/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/stateBased6633374371912438563.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:39:16] [INFO ] Flatten gal took : 21 ms
[2025-06-05 11:39:16] [INFO ] Flatten gal took : 20 ms
[2025-06-05 11:39:16] [INFO ] Time to serialize gal into /tmp/LTL3865486882531801563.gal : 5 ms
[2025-06-05 11:39:17] [INFO ] Time to serialize properties into /tmp/LTL18045275163355166243.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/LTL3865486882531801563.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5016213960886704439.hoa' '-atoms' '/tmp/LTL18045275163355166243.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/LTL18045275163355166243.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5016213960886704439.hoa
Detected timeout of ITS tools.
[2025-06-05 11:39:32] [INFO ] Flatten gal took : 19 ms
[2025-06-05 11:39:32] [INFO ] Flatten gal took : 18 ms
[2025-06-05 11:39:32] [INFO ] Time to serialize gal into /tmp/LTL16162381423808289115.gal : 3 ms
[2025-06-05 11:39:32] [INFO ] Time to serialize properties into /tmp/LTL17014332809353161038.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16162381423808289115.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17014332809353161038.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_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+((n6_8+n6_9)+n6_10))<=((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+...3393
Formula 0 simplified : ((G!"(((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+((n6_8+n6_9)+n6_10))<=((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5...3383
Detected timeout of ITS tools.
[2025-06-05 11:39:47] [INFO ] Flatten gal took : 23 ms
[2025-06-05 11:39:47] [INFO ] Applying decomposition
[2025-06-05 11:39:47] [INFO ] Flatten gal took : 16 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/graph5789519800871559822.txt' '-o' '/tmp/graph5789519800871559822.bin' '-w' '/tmp/graph5789519800871559822.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5789519800871559822.bin' '-l' '-1' '-v' '-w' '/tmp/graph5789519800871559822.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:39:47] [INFO ] Decomposing Gal with order
[2025-06-05 11:39:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:39:47] [INFO ] Removed a total of 114 redundant transitions.
[2025-06-05 11:39:47] [INFO ] Flatten gal took : 56 ms
[2025-06-05 11:39:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 53 labels/synchronizations in 12 ms.
[2025-06-05 11:39:47] [INFO ] Time to serialize gal into /tmp/LTL5460602954949396775.gal : 4 ms
[2025-06-05 11:39:47] [INFO ] Time to serialize properties into /tmp/LTL12007973409854063420.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/LTL5460602954949396775.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12007973409854063420.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("(((((gi3.gi4.gu3.n6_0+gi3.gi4.gu3.n6_1)+(gi3.gi4.gu3.n6_2+gi3.gi4.gu3.n6_3))+((gi3.gi4.gu3.n6_4+gi3.gi4.gu3.n6_5)+(gi3.gi4.gu...5557
Formula 0 simplified : ((G!"(((((gi3.gi4.gu3.n6_0+gi3.gi4.gu3.n6_1)+(gi3.gi4.gu3.n6_2+gi3.gi4.gu3.n6_3))+((gi3.gi4.gu3.n6_4+gi3.gi4.gu3.n6_5)+(gi3.gi4.gu3....5547
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-03 finished in 259181 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 550 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 512 are kept as prefixes of interest. Removing 38 places using SCC suffix rule.2 ms
Discarding 38 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 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 5 place count 509 transition count 171
Applied a total of 5 rules in 16 ms. Remains 509 /550 variables (removed 41) and now considering 171/176 (removed 5) transitions.
// Phase 1: matrix 171 rows 509 cols
[2025-06-05 11:40:02] [INFO ] Computed 340 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:40:03] [INFO ] Implicit Places using invariants in 320 ms returned []
[2025-06-05 11:40:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:40:03] [INFO ] Implicit Places using invariants and state equation in 682 ms returned [408, 409, 410, 411, 412, 413, 414, 415, 416, 417, 418, 430, 431, 432, 433, 434, 435, 436, 437, 438, 439, 440]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 1007 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 487/550 places, 171/176 transitions.
Applied a total of 0 rules in 10 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 1034 ms. Remains : 487/550 places, 171/176 transitions.
Stuttering acceptance computed with spot in 46 ms :[(NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-04
Product exploration explored 100000 steps with 6770 reset in 515 ms.
Product exploration explored 100000 steps with 6794 reset in 518 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 92 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)]
RANDOM walk for 40000 steps (2708 resets) in 216 ms. (184 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (209 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1163 steps, run visited all 1 properties in 9 ms. (steps per millisecond=129 )
Probabilistic random walk after 1163 steps, saw 1107 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 97 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 45 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 15 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 11:40:05] [INFO ] Computed 320 invariants in 18 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:40:05] [INFO ] Implicit Places using invariants in 284 ms returned []
[2025-06-05 11:40:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:40:06] [INFO ] Implicit Places using invariants and state equation in 738 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:40:06] [INFO ] Redundant transitions in 45 ms returned []
Running 148 sub problems to find dead transitions.
[2025-06-05 11:40: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/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 15418 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 30013 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 45482ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 45483ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46584 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 83 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 28 ms :[(NOT p0)]
RANDOM walk for 40000 steps (2708 resets) in 276 ms. (144 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (209 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1163 steps, run visited all 1 properties in 10 ms. (steps per millisecond=116 )
Probabilistic random walk after 1163 steps, saw 1107 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 135 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 27 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 30 ms :[(NOT p0)]
Product exploration explored 100000 steps with 6783 reset in 496 ms.
Product exploration explored 100000 steps with 6777 reset in 508 ms.
Built C files in :
/tmp/ltsmin17247835893101257396
[2025-06-05 11:40:53] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2025-06-05 11:40:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:40:53] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2025-06-05 11:40:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:40:53] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2025-06-05 11:40:53] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:40:53] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17247835893101257396
Running compilation step : cd /tmp/ltsmin17247835893101257396;'/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 505 ms.
Running link step : cd /tmp/ltsmin17247835893101257396;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17247835893101257396;'/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/stateBased7607071706955983972.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 16 ms. Remains 487 /487 variables (removed 0) and now considering 171/171 (removed 0) transitions.
[2025-06-05 11:41:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:41:09] [INFO ] Implicit Places using invariants in 283 ms returned []
[2025-06-05 11:41:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:41:09] [INFO ] Implicit Places using invariants and state equation in 712 ms returned []
Implicit Place search using SMT with State Equation took 995 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:41:09] [INFO ] Redundant transitions in 17 ms returned []
Running 148 sub problems to find dead transitions.
[2025-06-05 11:41:09] [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 15107 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 30019 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 45174ms problems are : Problem set: 0 solved, 148 unsolved
Search for dead transitions found 0 dead transitions in 45174ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46207 ms. Remains : 487/487 places, 171/171 transitions.
Built C files in :
/tmp/ltsmin11292916955734932236
[2025-06-05 11:41:54] [INFO ] Computing symmetric may disable matrix : 171 transitions.
[2025-06-05 11:41:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:41:54] [INFO ] Computing symmetric may enable matrix : 171 transitions.
[2025-06-05 11:41:54] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:41:54] [INFO ] Computing Do-Not-Accords matrix : 171 transitions.
[2025-06-05 11:41:54] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 11:41:54] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11292916955734932236
Running compilation step : cd /tmp/ltsmin11292916955734932236;'/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 509 ms.
Running link step : cd /tmp/ltsmin11292916955734932236;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin11292916955734932236;'/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/stateBased326045801522224608.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:42:10] [INFO ] Flatten gal took : 27 ms
[2025-06-05 11:42:10] [INFO ] Flatten gal took : 17 ms
[2025-06-05 11:42:10] [INFO ] Time to serialize gal into /tmp/LTL2983332630606443243.gal : 2 ms
[2025-06-05 11:42:10] [INFO ] Time to serialize properties into /tmp/LTL14371812186177464473.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/LTL2983332630606443243.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4942632659932046286.hoa' '-atoms' '/tmp/LTL14371812186177464473.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/LTL14371812186177464473.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4942632659932046286.hoa
Detected timeout of ITS tools.
[2025-06-05 11:42:25] [INFO ] Flatten gal took : 17 ms
[2025-06-05 11:42:25] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:42:25] [INFO ] Time to serialize gal into /tmp/LTL4045059117916013653.gal : 2 ms
[2025-06-05 11:42:25] [INFO ] Time to serialize properties into /tmp/LTL14298173753580014207.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/LTL4045059117916013653.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14298173753580014207.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_0+n9_1)+(n9_2+n9_3))+((n9_4+n9_5)+(n9_6+n9_7)))+(((n9_8+n9_9)+(n9_10+n9_11))+((n9_12+n9_13)+(n9_14+n9_15))))+((((n9...1133
Formula 0 simplified : GF!"((((((((n9_0+n9_1)+(n9_2+n9_3))+((n9_4+n9_5)+(n9_6+n9_7)))+(((n9_8+n9_9)+(n9_10+n9_11))+((n9_12+n9_13)+(n9_14+n9_15))))+((((n9_1...1127
Detected timeout of ITS tools.
[2025-06-05 11:42:40] [INFO ] Flatten gal took : 15 ms
[2025-06-05 11:42:40] [INFO ] Applying decomposition
[2025-06-05 11:42:40] [INFO ] Flatten gal took : 11 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/graph181343691477694905.txt' '-o' '/tmp/graph181343691477694905.bin' '-w' '/tmp/graph181343691477694905.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph181343691477694905.bin' '-l' '-1' '-v' '-w' '/tmp/graph181343691477694905.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:42:40] [INFO ] Decomposing Gal with order
[2025-06-05 11:42:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:42:40] [INFO ] Removed a total of 131 redundant transitions.
[2025-06-05 11:42:40] [INFO ] Flatten gal took : 31 ms
[2025-06-05 11:42:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 90 labels/synchronizations in 16 ms.
[2025-06-05 11:42:40] [INFO ] Time to serialize gal into /tmp/LTL8792576259850112986.gal : 15 ms
[2025-06-05 11:42:40] [INFO ] Time to serialize properties into /tmp/LTL5968520300057367984.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/LTL8792576259850112986.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5968520300057367984.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("((((((((gu1.n9_0+gu1.n9_1)+(gu1.n9_2+gu1.n9_3))+((gu1.n9_4+gu1.n9_5)+(gu1.n9_6+gu1.n9_7)))+(((gu1.n9_8+gu1.n9_9)+(gu1.n9_10+gu...1661
Formula 0 simplified : GF!"((((((((gu1.n9_0+gu1.n9_1)+(gu1.n9_2+gu1.n9_3))+((gu1.n9_4+gu1.n9_5)+(gu1.n9_6+gu1.n9_7)))+(((gu1.n9_8+gu1.n9_9)+(gu1.n9_10+gu1....1655
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-04 finished in 173002 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 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 526 transition count 176
Applied a total of 24 rules in 7 ms. Remains 526 /550 variables (removed 24) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 526 cols
[2025-06-05 11:42:55] [INFO ] Computed 351 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:55] [INFO ] Implicit Places using invariants in 263 ms returned []
[2025-06-05 11:42:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:56] [INFO ] Implicit Places using invariants and state equation in 545 ms returned [443, 444, 445, 446, 447, 448, 449, 450, 451, 452, 453]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 824 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/550 places, 176/176 transitions.
Applied a total of 0 rules in 4 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 835 ms. Remains : 515/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 307 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-COL-10-LTLCardinality-05
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-05 finished in 1175 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 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 525 transition count 176
Applied a total of 25 rules in 5 ms. Remains 525 /550 variables (removed 25) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2025-06-05 11:42:56] [INFO ] Computed 351 invariants in 20 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:57] [INFO ] Implicit Places using invariants in 462 ms returned []
[2025-06-05 11:42:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:42:58] [INFO ] Implicit Places using invariants and state equation in 990 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1454 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 514/550 places, 176/176 transitions.
Applied a total of 0 rules in 12 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 1484 ms. Remains : 514/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 392 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-COL-10-LTLCardinality-06
Product exploration explored 100000 steps with 20482 reset in 247 ms.
Product exploration explored 100000 steps with 20489 reset in 334 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 (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (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 1953 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 317 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 195 ms. (204 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (436 resets) in 72 ms. (548 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (312 resets) in 106 ms. (373 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (195 resets) in 48 ms. (816 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (436 resets) in 60 ms. (655 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (330 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
// Phase 1: matrix 176 rows 514 cols
[2025-06-05 11:43:01] [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 372 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 apf3 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 821 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 1220ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=30 )
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 20 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (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 p0 p1)), (G (OR (NOT p2) p1))]
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 p0)), (F (NOT (AND (NOT p2) p0))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 14 factoid took 2192 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 184 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 253 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 11:43:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:43:06] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 139 ms returned sat
[2025-06-05 11:43:07] [INFO ] [Real]Absence check using state equation in 982 ms returned sat
[2025-06-05 11:43:07] [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 11:43:07] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 140 ms returned sat
[2025-06-05 11:43:11] [INFO ] [Nat]Absence check using state equation in 3592 ms returned sat
[2025-06-05 11:43:11] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 10 ms.
[2025-06-05 11:43:11] [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 4 ms. Remains 514 /514 variables (removed 0) and now considering 176/176 (removed 0) transitions.
[2025-06-05 11:43:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:43:11] [INFO ] Implicit Places using invariants in 328 ms returned []
[2025-06-05 11:43:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:43:12] [INFO ] Implicit Places using invariants and state equation in 1047 ms returned []
Implicit Place search using SMT with State Equation took 1379 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:43:12] [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 18210 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
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 77/1018 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 30017 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 48278ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 48279ms
Finished structural reductions in LTL mode , in 1 iterations and 49662 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 784 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 229 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 (2766 resets) in 131 ms. (303 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (436 resets) in 39 ms. (1000 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (320 resets) in 28 ms. (1379 steps per ms) remains 1/2 properties
[2025-06-05 11:44:02] [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) 72/679 variables, 66/818 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/679 variables, 30/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 0/848 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 11/690 variables, 6/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/690 variables, 0/854 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 690/690 variables, and 854 constraints, problems are : Problem set: 0 solved, 1 unsolved in 404 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 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) 72/679 variables, 66/819 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/679 variables, 30/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/679 variables, 0/849 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 11/690 variables, 6/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/690 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/690 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 690/690 variables, and 855 constraints, problems are : Problem set: 0 solved, 1 unsolved in 320 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 514/514 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 737ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 55 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=18 )
Parikh walk visited 1 properties in 3 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 p1)), (F p2), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 1162 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 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)]
Stuttering acceptance computed with spot in 241 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 11:44:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:44:04] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 130 ms returned sat
[2025-06-05 11:44:05] [INFO ] [Real]Absence check using state equation in 981 ms returned sat
[2025-06-05 11:44:05] [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 11:44:06] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 138 ms returned sat
[2025-06-05 11:44:09] [INFO ] [Nat]Absence check using state equation in 3542 ms returned sat
[2025-06-05 11:44:09] [INFO ] Computed and/alt/rep : 128/150/128 causal constraints (skipped 36 transitions) in 12 ms.
[2025-06-05 11:44:09] [INFO ] Added : 0 causal constraints over 0 iterations in 73 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 25184 reset in 193 ms.
Product exploration explored 100000 steps with 25221 reset in 205 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 225 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 1 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 32 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 11:44:10] [INFO ] Redundant transitions in 18 ms returned []
Running 165 sub problems to find dead transitions.
// Phase 1: matrix 177 rows 514 cols
[2025-06-05 11:44:10] [INFO ] Computed 340 invariants in 16 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 TDEAD80 is UNSAT
Problem TDEAD173 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 18180 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 30042 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 48279ms problems are : Problem set: 2 solved, 163 unsolved
Search for dead transitions found 2 dead transitions in 48281ms
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.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 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 48345 ms. Remains : 513/514 places, 175/176 transitions.
Built C files in :
/tmp/ltsmin7454029721841514636
[2025-06-05 11:44:59] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7454029721841514636
Running compilation step : cd /tmp/ltsmin7454029721841514636;'/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 419 ms.
Running link step : cd /tmp/ltsmin7454029721841514636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin7454029721841514636;'/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/stateBased6846962897203716929.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 12 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 11:45:14] [INFO ] Computed 340 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:45:14] [INFO ] Implicit Places using invariants in 354 ms returned []
[2025-06-05 11:45:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:45:15] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1374 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:45:15] [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 17716 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
At refinement iteration 6 (INCLUDED_ONLY) 0/690 variables, 77/1018 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 30025 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 47780ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 47781ms
Finished structural reductions in LTL mode , in 1 iterations and 49168 ms. Remains : 514/514 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin18136889425600675187
[2025-06-05 11:46:03] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18136889425600675187
Running compilation step : cd /tmp/ltsmin18136889425600675187;'/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 417 ms.
Running link step : cd /tmp/ltsmin18136889425600675187;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin18136889425600675187;'/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/stateBased4603497239038241197.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:46:18] [INFO ] Flatten gal took : 15 ms
[2025-06-05 11:46:18] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:46:18] [INFO ] Time to serialize gal into /tmp/LTL17635122470142475726.gal : 3 ms
[2025-06-05 11:46:18] [INFO ] Time to serialize properties into /tmp/LTL992659435543745691.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/LTL17635122470142475726.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17110816951650017690.hoa' '-atoms' '/tmp/LTL992659435543745691.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/LTL992659435543745691.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17110816951650017690.hoa
Detected timeout of ITS tools.
[2025-06-05 11:46:33] [INFO ] Flatten gal took : 11 ms
[2025-06-05 11:46:33] [INFO ] Flatten gal took : 14 ms
[2025-06-05 11:46:33] [INFO ] Time to serialize gal into /tmp/LTL16200879111473263088.gal : 2 ms
[2025-06-05 11:46:33] [INFO ] Time to serialize properties into /tmp/LTL2894261395492097002.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/LTL16200879111473263088.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2894261395492097002.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("(((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+((s2_8+s2_9)+s2_10))<=a5)"))&&(F((G(F("(CstopAbort<1)")))||(("(((((s2_...356
Formula 0 simplified : (G!"(((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+((s2_8+s2_9)+s2_10))<=a5)" | G(FG!"(CstopAbort<1)" & (!"(((((s2_0+s2_1)+...337
Detected timeout of ITS tools.
[2025-06-05 11:46:48] [INFO ] Flatten gal took : 12 ms
[2025-06-05 11:46:48] [INFO ] Applying decomposition
[2025-06-05 11:46:48] [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/graph10093360754872916911.txt' '-o' '/tmp/graph10093360754872916911.bin' '-w' '/tmp/graph10093360754872916911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph10093360754872916911.bin' '-l' '-1' '-v' '-w' '/tmp/graph10093360754872916911.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:46:48] [INFO ] Decomposing Gal with order
[2025-06-05 11:46:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:46:48] [INFO ] Removed a total of 87 redundant transitions.
[2025-06-05 11:46:48] [INFO ] Flatten gal took : 59 ms
[2025-06-05 11:46:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 46 labels/synchronizations in 6 ms.
[2025-06-05 11:46:48] [INFO ] Time to serialize gal into /tmp/LTL17754822616391163347.gal : 5 ms
[2025-06-05 11:46:48] [INFO ] Time to serialize properties into /tmp/LTL7082574549024682151.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/LTL17754822616391163347.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7082574549024682151.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("(((((gu56.s2_0+gu56.s2_1)+(gu56.s2_2+gu56.s2_3))+((gu56.s2_4+gu56.s2_5)+(gu56.s2_6+gu56.s2_7)))+((gu56.s2_8+gu56.s2_9)+gu56.s2...562
Formula 0 simplified : (G!"(((((gu56.s2_0+gu56.s2_1)+(gu56.s2_2+gu56.s2_3))+((gu56.s2_4+gu56.s2_5)+(gu56.s2_6+gu56.s2_7)))+((gu56.s2_8+gu56.s2_9)+gu56.s2_1...543
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-06 finished in 247105 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (p1 U (G(p0)&&X(F(p2))))))'
Support contains 144 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 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 535 transition count 176
Applied a total of 15 rules in 7 ms. Remains 535 /550 variables (removed 15) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 535 cols
[2025-06-05 11:47:03] [INFO ] Computed 361 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:04] [INFO ] Implicit Places using invariants in 405 ms returned []
[2025-06-05 11:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:05] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1494 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 524/550 places, 176/176 transitions.
Applied a total of 0 rules in 4 ms. Remains 524 /524 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1505 ms. Remains : 524/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 352 ms :[(OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (NOT p0), (NOT p2), true, (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-08
Stuttering criterion allowed to conclude after 21 steps with 3 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-08 finished in 1883 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(G(p0))||(X(p1)&&(p2||F(p3)||G(p4))))))'
Support contains 38 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 24 place count 526 transition count 176
Applied a total of 24 rules in 10 ms. Remains 526 /550 variables (removed 24) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 526 cols
[2025-06-05 11:47:05] [INFO ] Computed 351 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:06] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-05 11:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:06] [INFO ] Implicit Places using invariants and state equation in 640 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 981 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 515/550 places, 176/176 transitions.
Applied a total of 0 rules in 6 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 997 ms. Remains : 515/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 370 ms :[(OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p0)), (AND (NOT p3) (NOT p0) (NOT p4)), true, (NOT p0), (NOT p3), (AND (NOT p3) (NOT p4))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 180 ms.
Product exploration explored 100000 steps with 33333 reset in 184 ms.
Computed a total of 515 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 515 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 (NOT p2) p3 p4 p1 p0), (X (NOT p2)), (X p3), (X p4), (X (NOT (AND (NOT p2) (NOT p3) p4))), (X (NOT (AND (NOT p2) (NOT p3) (NOT p4)))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p4) p0)))), (X (X p4)), (X (X (NOT (AND (NOT p3) p4 p0)))), (X (X (NOT (AND (NOT p3) p0)))), (X (X (NOT (AND (NOT p3) (NOT p4) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p3) p4 (NOT p0))))), (X (X p1)), (X (X (NOT (AND (NOT p1) p0)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p4) (G (NOT p4)))), (F (G p1)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 23 factoid took 20 ms. Reduced automaton from 9 states, 18 edges and 5 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-11 finished in 1868 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(((X(p1) U (X(G(p1))||(p2&&X(p1)))) U (G((X(p1) U (X(G(p1))||(p2&&X(p1)))))||(p3&&(X(p1) U (X(G(p1))||(p2&&X(p1))))))))))))'
Support contains 45 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 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 536 transition count 176
Applied a total of 14 rules in 9 ms. Remains 536 /550 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2025-06-05 11:47:07] [INFO ] Computed 361 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:08] [INFO ] Implicit Places using invariants in 324 ms returned []
[2025-06-05 11:47:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:09] [INFO ] Implicit Places using invariants and state equation in 1441 ms returned [441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1784 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/550 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1802 ms. Remains : 525/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-13
Product exploration explored 100000 steps with 16692 reset in 183 ms.
Product exploration explored 100000 steps with 16652 reset in 188 ms.
Computed a total of 525 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 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 (NOT p0) p3 (NOT p2) p1), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 344 ms. Reduced automaton from 7 states, 11 edges and 4 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (2765 resets) in 182 ms. (218 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (324 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (324 resets) in 41 ms. (952 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (323 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (331 resets) in 64 ms. (615 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (318 resets) in 50 ms. (784 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 1238 steps, run visited all 5 properties in 13 ms. (steps per millisecond=95 )
Probabilistic random walk after 1238 steps, saw 1178 distinct states, run finished after 13 ms. (steps per millisecond=95 ) properties seen :5
Knowledge obtained : [(AND (NOT p0) p3 (NOT p2) p1), (X (NOT p0)), (F (OR (G p0) (G (NOT p0)))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p2), (F (NOT p1))]
Knowledge based reduction with 6 factoid took 828 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 249 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 23 out of 525 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 176/176 transitions.
Applied a total of 0 rules in 8 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2025-06-05 11:47:12] [INFO ] Computed 350 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:12] [INFO ] Implicit Places using invariants in 345 ms returned []
[2025-06-05 11:47:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:47:13] [INFO ] Implicit Places using invariants and state equation in 905 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:47:13] [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, 240/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 11/523 variables, 110/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 2/701 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/701 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 875 constraints, problems are : Problem set: 0 solved, 164 unsolved in 20371 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 525/525 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, 240/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 11/523 variables, 110/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 162/1035 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 2/701 variables, 2/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 1039 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30016 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50422ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 50423ms
Finished structural reductions in LTL mode , in 1 iterations and 51711 ms. Remains : 525/525 places, 176/176 transitions.
Computed a total of 525 stabilizing places and 176 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 525 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 p3 (NOT p2) p1), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 153 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 287 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
RANDOM walk for 40000 steps (2761 resets) in 195 ms. (204 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (329 resets) in 44 ms. (888 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (328 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (316 resets) in 37 ms. (1052 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (325 resets) in 45 ms. (869 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (317 resets) in 28 ms. (1379 steps per ms) remains 5/5 properties
Finished probabilistic random walk after 1238 steps, run visited all 5 properties in 16 ms. (steps per millisecond=77 )
Probabilistic random walk after 1238 steps, saw 1178 distinct states, run finished after 17 ms. (steps per millisecond=72 ) properties seen :5
Knowledge obtained : [(AND p3 (NOT p2) p1), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (NOT p3)), (F (NOT (AND (NOT p2) p1))), (F (NOT (OR p2 p1))), (F p2), (F (NOT p1))]
Knowledge based reduction with 4 factoid took 405 ms. Reduced automaton from 7 states, 11 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 282 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 278 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 16660 reset in 178 ms.
Product exploration explored 100000 steps with 16622 reset in 181 ms.
Applying partial POR strategy [false, false, false, false, true, false, true]
Stuttering acceptance computed with spot in 297 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), true]
Support contains 23 out of 525 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 525/525 places, 176/176 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 525 transition count 178
Deduced a syphon composed of 2 places in 0 ms
Applied a total of 2 rules in 21 ms. Remains 525 /525 variables (removed 0) and now considering 178/176 (removed -2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-05 11:48:07] [INFO ] Redundant transitions in 16 ms returned []
Running 166 sub problems to find dead transitions.
// Phase 1: matrix 178 rows 525 cols
[2025-06-05 11:48:07] [INFO ] Computed 350 invariants in 16 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/512 variables, 240/240 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 2 (OVERLAPS) 11/523 variables, 110/350 constraints. Problems are: Problem set: 0 solved, 166 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 166 unsolved
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
At refinement iteration 4 (OVERLAPS) 178/701 variables, 523/873 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/701 variables, 0/873 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 2/703 variables, 2/875 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/703 variables, 0/875 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 8 (OVERLAPS) 0/703 variables, 0/875 constraints. Problems are: Problem set: 4 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 703/703 variables, and 875 constraints, problems are : Problem set: 4 solved, 162 unsolved in 20058 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 166/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/510 variables, 240/240 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/510 variables, 0/240 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 11/521 variables, 110/350 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/521 variables, 0/350 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 4 (OVERLAPS) 176/697 variables, 521/871 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/697 variables, 160/1031 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/697 variables, 0/1031 constraints. Problems are: Problem set: 4 solved, 162 unsolved
At refinement iteration 7 (OVERLAPS) 6/703 variables, 4/1035 constraints. Problems are: Problem set: 4 solved, 162 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 703/703 variables, and 1037 constraints, problems are : Problem set: 4 solved, 162 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 162/166 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50159ms problems are : Problem set: 4 solved, 162 unsolved
Search for dead transitions found 4 dead transitions in 50161ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 525/525 places, 174/176 transitions.
Graph (complete) has 2292 edges and 525 vertex of which 523 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 18 ms. Remains 523 /525 variables (removed 2) and now considering 174/174 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 523/525 places, 174/176 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 50227 ms. Remains : 523/525 places, 174/176 transitions.
Built C files in :
/tmp/ltsmin18324470413186972883
[2025-06-05 11:48:57] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18324470413186972883
Running compilation step : cd /tmp/ltsmin18324470413186972883;'/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 430 ms.
Running link step : cd /tmp/ltsmin18324470413186972883;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin18324470413186972883;'/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/stateBased16863302524107442494.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 23 out of 525 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 525/525 places, 176/176 transitions.
Applied a total of 0 rules in 9 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2025-06-05 11:49:12] [INFO ] Computed 350 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:49:12] [INFO ] Implicit Places using invariants in 352 ms returned []
[2025-06-05 11:49:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:49:13] [INFO ] Implicit Places using invariants and state equation in 923 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:49:13] [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, 240/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 11/523 variables, 110/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 0/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 2/701 variables, 2/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/701 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 875 constraints, problems are : Problem set: 0 solved, 164 unsolved in 20116 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 525/525 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, 240/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/512 variables, 0/240 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 11/523 variables, 110/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/523 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 176/699 variables, 523/873 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/699 variables, 162/1035 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/699 variables, 0/1035 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 2/701 variables, 2/1037 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 1039 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 350/350 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50186ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 50186ms
Finished structural reductions in LTL mode , in 1 iterations and 51478 ms. Remains : 525/525 places, 176/176 transitions.
Built C files in :
/tmp/ltsmin4985512768111490855
[2025-06-05 11:50:03] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4985512768111490855
Running compilation step : cd /tmp/ltsmin4985512768111490855;'/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 432 ms.
Running link step : cd /tmp/ltsmin4985512768111490855;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4985512768111490855;'/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/stateBased17309343990524847595.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:50:19] [INFO ] Flatten gal took : 21 ms
[2025-06-05 11:50:19] [INFO ] Flatten gal took : 14 ms
[2025-06-05 11:50:19] [INFO ] Time to serialize gal into /tmp/LTL10133324960878380563.gal : 3 ms
[2025-06-05 11:50:19] [INFO ] Time to serialize properties into /tmp/LTL6512235579245516474.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/LTL10133324960878380563.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9445467444961367920.hoa' '-atoms' '/tmp/LTL6512235579245516474.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/LTL6512235579245516474.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9445467444961367920.hoa
Detected timeout of ITS tools.
[2025-06-05 11:50:34] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:50:34] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:50:34] [INFO ] Time to serialize gal into /tmp/LTL3801747217553628505.gal : 3 ms
[2025-06-05 11:50:34] [INFO ] Time to serialize properties into /tmp/LTL11046236988763636734.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/LTL3801747217553628505.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11046236988763636734.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 : !((X(("(((((n4_0+n4_1)+(n4_2+n4_3))+((n4_4+n4_5)+(n4_6+n4_7)))+((n4_8+n4_9)+n4_10))>((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_...1786
Formula 0 simplified : X(!"(((((n4_0+n4_1)+(n4_2+n4_3))+((n4_4+n4_5)+(n4_6+n4_7)))+((n4_8+n4_9)+n4_10))>((((s6_0+s6_1)+(s6_2+s6_3))+((s6_4+s6_5)+(s6_6+s6_7...719
Detected timeout of ITS tools.
[2025-06-05 11:50:49] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:50:49] [INFO ] Applying decomposition
[2025-06-05 11:50:49] [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/graph1538182449470968741.txt' '-o' '/tmp/graph1538182449470968741.bin' '-w' '/tmp/graph1538182449470968741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1538182449470968741.bin' '-l' '-1' '-v' '-w' '/tmp/graph1538182449470968741.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:50:49] [INFO ] Decomposing Gal with order
[2025-06-05 11:50:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:50:49] [INFO ] Removed a total of 120 redundant transitions.
[2025-06-05 11:50:49] [INFO ] Flatten gal took : 56 ms
[2025-06-05 11:50:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 12 ms.
[2025-06-05 11:50:49] [INFO ] Time to serialize gal into /tmp/LTL13299229872422908303.gal : 3 ms
[2025-06-05 11:50:49] [INFO ] Time to serialize properties into /tmp/LTL17192637247661704962.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/LTL13299229872422908303.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17192637247661704962.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 : !((X(("(((((gu14.n4_0+gu14.n4_1)+(gu14.n4_2+gu14.n4_3))+((gu14.n4_4+gu14.n4_5)+(gu14.n4_6+gu14.n4_7)))+((gu14.n4_8+gu14.n4_9)+gu14.n4_...2697
Formula 0 simplified : X(!"(((((gu14.n4_0+gu14.n4_1)+(gu14.n4_2+gu14.n4_3))+((gu14.n4_4+gu14.n4_5)+(gu14.n4_6+gu14.n4_7)))+((gu14.n4_8+gu14.n4_9)+gu14.n4_1...1102
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-13 finished in 236856 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0) U (X(G(p0))||(p1&&X(p2)))))'
Support contains 265 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 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 536 transition count 176
Applied a total of 14 rules in 3 ms. Remains 536 /550 variables (removed 14) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 536 cols
[2025-06-05 11:51:04] [INFO ] Computed 362 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:04] [INFO ] Implicit Places using invariants in 273 ms returned []
[2025-06-05 11:51:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:05] [INFO ] Implicit Places using invariants and state equation in 842 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1145 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 525/550 places, 176/176 transitions.
Applied a total of 0 rules in 2 ms. Remains 525 /525 variables (removed 0) and now considering 176/176 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1150 ms. Remains : 525/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-14 finished in 1281 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(p1)) U X(!p2)))'
Support contains 24 out of 550 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Reduce places removed 25 places and 0 transitions.
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 525 transition count 176
Applied a total of 25 rules in 13 ms. Remains 525 /550 variables (removed 25) and now considering 176/176 (removed 0) transitions.
// Phase 1: matrix 176 rows 525 cols
[2025-06-05 11:51:05] [INFO ] Computed 351 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:06] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-06-05 11:51:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:07] [INFO ] Implicit Places using invariants and state equation in 960 ms returned []
Implicit Place search using SMT with State Equation took 1350 ms to find 0 implicit places.
Running 164 sub problems to find dead transitions.
[2025-06-05 11:51:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/523 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/524 variables, 11/351 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 176/700 variables, 524/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 0/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (OVERLAPS) 1/701 variables, 1/876 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/701 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 8 (OVERLAPS) 0/701 variables, 0/876 constraints. Problems are: Problem set: 0 solved, 164 unsolved
No progress, stopping.
After SMT solving in domain Real declared 701/701 variables, and 876 constraints, problems are : Problem set: 0 solved, 164 unsolved in 21224 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 525/525 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/523 variables, 340/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/523 variables, 0/340 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 2 (OVERLAPS) 1/524 variables, 11/351 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/524 variables, 0/351 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 4 (OVERLAPS) 176/700 variables, 524/875 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/700 variables, 164/1039 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/700 variables, 0/1039 constraints. Problems are: Problem set: 0 solved, 164 unsolved
At refinement iteration 7 (OVERLAPS) 1/701 variables, 1/1040 constraints. Problems are: Problem set: 0 solved, 164 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 701/701 variables, and 1040 constraints, problems are : Problem set: 0 solved, 164 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 351/351 constraints, State Equation: 525/525 constraints, PredecessorRefiner: 164/164 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 51276ms problems are : Problem set: 0 solved, 164 unsolved
Search for dead transitions found 0 dead transitions in 51277ms
Starting structural reductions in LTL mode, iteration 1 : 525/550 places, 176/176 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 52640 ms. Remains : 525/550 places, 176/176 transitions.
Stuttering acceptance computed with spot in 199 ms :[p2, (AND (NOT p0) p2), (AND (NOT p1) p2), p2, (NOT p0), (NOT p1)]
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-15
Stuttering criterion allowed to conclude after 13 steps with 0 reset in 0 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-15 finished in 52856 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))))'
Found a Lengthening insensitive property : QuasiCertifProtocol-COL-10-LTLCardinality-03
Stuttering acceptance computed with spot in 220 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 550 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 524 are kept as prefixes of interest. Removing 26 places using SCC suffix rule.3 ms
Discarding 26 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 522 transition count 174
Applied a total of 3 rules in 16 ms. Remains 522 /550 variables (removed 28) and now considering 174/176 (removed 2) transitions.
// Phase 1: matrix 174 rows 522 cols
[2025-06-05 11:51:59] [INFO ] Computed 350 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:51:59] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-05 11:51:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:52:00] [INFO ] Implicit Places using invariants and state equation in 676 ms returned [419, 420, 421, 422, 423, 424, 425, 426, 427, 428, 429, 441, 442, 443, 444, 445, 446, 447, 448, 449, 450, 451]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 911 ms to find 22 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 500/550 places, 174/176 transitions.
Applied a total of 0 rules in 8 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 935 ms. Remains : 500/550 places, 174/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-03
Product exploration explored 100000 steps with 6780 reset in 769 ms.
Product exploration explored 100000 steps with 6772 reset in 737 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 (NOT (AND (NOT p0) (NOT p3)))), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (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 1312 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 251 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 (2707 resets) in 505 ms. (79 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (205 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (207 resets) in 284 ms. (140 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (206 resets) in 147 ms. (270 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (206 resets) in 145 ms. (274 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (207 resets) in 246 ms. (161 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (206 resets) in 66 ms. (597 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (205 resets) in 122 ms. (325 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 821482 steps, run timeout after 3001 ms. (steps per millisecond=273 ) properties seen :4 out of 7
Probabilistic random walk after 821482 steps, saw 110790 distinct states, run finished after 3004 ms. (steps per millisecond=273 ) properties seen :4
// Phase 1: matrix 174 rows 500 cols
[2025-06-05 11:52:06] [INFO ] Computed 330 invariants in 28 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 516 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 5014 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 5577ms problems are : Problem set: 0 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 276 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 174/174 transitions.
Graph (complete) has 2115 edges and 500 vertex of which 357 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
Iterating post reduction 0 with 92 rules applied. Total rules applied 93 place count 335 transition count 82
Performed 22 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 22 Pre rules applied. Total rules applied 93 place count 335 transition count 60
Deduced a syphon composed of 22 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 1 with 66 rules applied. Total rules applied 159 place count 291 transition count 60
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 159 place count 291 transition count 59
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 161 place count 290 transition count 59
Applied a total of 161 rules in 15 ms. Remains 290 /500 variables (removed 210) and now considering 59/174 (removed 115) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 290/500 places, 59/174 transitions.
RANDOM walk for 1353 steps (50 resets) in 28 ms. (46 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p1 p0 p3 p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X p2), (X p3), (X (NOT (AND (NOT p1) (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p2) (NOT p3)))), (X (NOT (AND p1 (NOT p0) p3))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT (AND (NOT p1) (NOT p3)))), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X p3)), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (X (X (NOT (AND p1 (NOT p0) p3)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p2)), (X (X p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X p1)), (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 p3 p1))), (F (NOT p3)), (F (NOT (OR p3 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT p2)), (F (NOT (OR p0 p3 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 4070 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 255 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 222 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 5 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-06-05 11:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:52:17] [INFO ] Implicit Places using invariants in 193 ms returned []
[2025-06-05 11:52:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:52:17] [INFO ] Implicit Places using invariants and state equation in 610 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-05 11:52: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/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 16333 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
At refinement iteration 5 (OVERLAPS) 11/674 variables, 11/981 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 981 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30027 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]
After SMT, in 46419ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 46420ms
Finished structural reductions in LTL mode , in 1 iterations and 47256 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 (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p2)), (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 1334 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 247 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 (2707 resets) in 554 ms. (72 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (203 resets) in 183 ms. (217 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (205 resets) in 294 ms. (135 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (205 resets) in 180 ms. (221 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (206 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (207 resets) in 257 ms. (155 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (204 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (206 resets) in 151 ms. (263 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 827691 steps, run timeout after 3001 ms. (steps per millisecond=275 ) properties seen :4 out of 7
Probabilistic random walk after 827691 steps, saw 111401 distinct states, run finished after 3003 ms. (steps per millisecond=275 ) properties seen :4
[2025-06-05 11:53:09] [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 470 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 4536 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 5028ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 806 steps, including 15 resets, run visited all 3 properties in 7 ms. (steps per millisecond=115 )
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 11 ms.
Knowledge obtained : [(AND p0 p3 p1 p2), (X (NOT (AND (NOT p0) (NOT p3)))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p1)))), (X p2), (X p3), (X (NOT (AND (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p2)))), (X (NOT (AND (NOT p0) p3 p1))), (X p0), (X p1), (X (X (NOT (AND (NOT p0) (NOT p3))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p1))))), (X (X p3)), (X (X (NOT (AND (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p2))))), (X (X (NOT (AND (NOT p0) p3 p1)))), (X (X p2)), (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 p3 p1))), (F (NOT p3)), (F (NOT (OR p3 p2))), (F (NOT (OR p0 p1))), (F (NOT (OR p0 p3))), (F (NOT p2)), (F (NOT (OR p0 p3 p1))), (F (NOT p0)), (F (NOT (OR p0 (NOT p3) (NOT p1)))), (F (NOT p1))]
Knowledge based reduction with 25 factoid took 4152 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 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 300 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 270 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 6779 reset in 587 ms.
Product exploration explored 100000 steps with 6777 reset in 592 ms.
Applying partial POR strategy [true, true, true, false, true, true, true]
Stuttering acceptance computed with spot in 281 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 11:53:21] [INFO ] Redundant transitions in 16 ms returned []
Running 151 sub problems to find dead transitions.
[2025-06-05 11:53:21] [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 16372 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
At refinement iteration 5 (OVERLAPS) 11/674 variables, 11/981 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 981 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30013 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]
After SMT, in 46422ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 46422ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 46457 ms. Remains : 500/500 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin7314841279058635733
[2025-06-05 11:54:07] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7314841279058635733
Running compilation step : cd /tmp/ltsmin7314841279058635733;'/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 484 ms.
Running link step : cd /tmp/ltsmin7314841279058635733;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin7314841279058635733;'/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/stateBased7997150294241799073.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 10 ms. Remains 500 /500 variables (removed 0) and now considering 174/174 (removed 0) transitions.
[2025-06-05 11:54:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:54:23] [INFO ] Implicit Places using invariants in 189 ms returned []
[2025-06-05 11:54:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:54:23] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 785 ms to find 0 implicit places.
Running 151 sub problems to find dead transitions.
[2025-06-05 11:54:23] [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 16269 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
At refinement iteration 5 (OVERLAPS) 11/674 variables, 11/981 constraints. Problems are: Problem set: 0 solved, 151 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 674/674 variables, and 981 constraints, problems are : Problem set: 0 solved, 151 unsolved in 30013 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]
After SMT, in 46323ms problems are : Problem set: 0 solved, 151 unsolved
Search for dead transitions found 0 dead transitions in 46323ms
Finished structural reductions in LTL mode , in 1 iterations and 47119 ms. Remains : 500/500 places, 174/174 transitions.
Built C files in :
/tmp/ltsmin12168782142987159350
[2025-06-05 11:55:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12168782142987159350
Running compilation step : cd /tmp/ltsmin12168782142987159350;'/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/ltsmin12168782142987159350;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin12168782142987159350;'/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/stateBased3254459069054696420.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:55:25] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:55:25] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:55:25] [INFO ] Time to serialize gal into /tmp/LTL8132815292009940121.gal : 2 ms
[2025-06-05 11:55:25] [INFO ] Time to serialize properties into /tmp/LTL3189549990806192740.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/LTL8132815292009940121.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15384134704659367926.hoa' '-atoms' '/tmp/LTL3189549990806192740.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/LTL3189549990806192740.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15384134704659367926.hoa
Detected timeout of ITS tools.
[2025-06-05 11:55:40] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:55:40] [INFO ] Flatten gal took : 8 ms
[2025-06-05 11:55:40] [INFO ] Time to serialize gal into /tmp/LTL12833472165467274180.gal : 1 ms
[2025-06-05 11:55:40] [INFO ] Time to serialize properties into /tmp/LTL17110915962114440036.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/LTL12833472165467274180.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17110915962114440036.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_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+((n6_8+n6_9)+n6_10))<=((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+...3393
Formula 0 simplified : ((G!"(((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+((n6_8+n6_9)+n6_10))<=((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5...3383
Detected timeout of ITS tools.
[2025-06-05 11:55:55] [INFO ] Flatten gal took : 9 ms
[2025-06-05 11:55:55] [INFO ] Applying decomposition
[2025-06-05 11:55:55] [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/graph16255910851232241521.txt' '-o' '/tmp/graph16255910851232241521.bin' '-w' '/tmp/graph16255910851232241521.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16255910851232241521.bin' '-l' '-1' '-v' '-w' '/tmp/graph16255910851232241521.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:55:55] [INFO ] Decomposing Gal with order
[2025-06-05 11:55:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:55:55] [INFO ] Removed a total of 131 redundant transitions.
[2025-06-05 11:55:55] [INFO ] Flatten gal took : 18 ms
[2025-06-05 11:55:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 55 labels/synchronizations in 2 ms.
[2025-06-05 11:55:55] [INFO ] Time to serialize gal into /tmp/LTL12498444788892427323.gal : 3 ms
[2025-06-05 11:55:55] [INFO ] Time to serialize properties into /tmp/LTL14273965699943956397.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/LTL12498444788892427323.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14273965699943956397.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("(((((gi5.gi0.gu5.n6_0+gi5.gi0.gu5.n6_1)+(gi5.gi0.gu5.n6_2+gi5.gi0.gu5.n6_3))+((gi5.gi0.gu5.n6_4+gi5.gi0.gu5.n6_5)+(gi5.gi0.gu...5557
Formula 0 simplified : ((G!"(((((gi5.gi0.gu5.n6_0+gi5.gi0.gu5.n6_1)+(gi5.gi0.gu5.n6_2+gi5.gi0.gu5.n6_3))+((gi5.gi0.gu5.n6_4+gi5.gi0.gu5.n6_5)+(gi5.gi0.gu5....5547
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-03 finished in 251808 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-COL-10-LTLCardinality-06
Stuttering acceptance computed with spot in 375 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 550 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 550/550 places, 176/176 transitions.
Graph (complete) has 2400 edges and 550 vertex of which 525 are kept as prefixes of interest. Removing 25 places using SCC suffix rule.1 ms
Discarding 25 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 524 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 524 transition count 175
Applied a total of 4 rules in 21 ms. Remains 524 /550 variables (removed 26) and now considering 175/176 (removed 1) transitions.
// Phase 1: matrix 175 rows 524 cols
[2025-06-05 11:56:11] [INFO ] Computed 351 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:56:11] [INFO ] Implicit Places using invariants in 375 ms returned []
[2025-06-05 11:56:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:56:12] [INFO ] Implicit Places using invariants and state equation in 917 ms returned [442, 443, 444, 445, 446, 447, 448, 449, 450, 451, 452]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 1304 ms to find 11 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 513/550 places, 175/176 transitions.
Applied a total of 0 rules in 9 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 1334 ms. Remains : 513/550 places, 175/176 transitions.
Running random walk in product with property : QuasiCertifProtocol-COL-10-LTLCardinality-06
Product exploration explored 100000 steps with 20398 reset in 210 ms.
Product exploration explored 100000 steps with 20400 reset in 227 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 (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (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 1960 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 443 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 (2771 resets) in 154 ms. (258 steps per ms) remains 5/9 properties
BEST_FIRST walk for 40004 steps (436 resets) in 57 ms. (689 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (315 resets) in 39 ms. (1000 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (194 resets) in 36 ms. (1081 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (436 resets) in 42 ms. (930 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (330 resets) in 31 ms. (1250 steps per ms) remains 5/5 properties
// Phase 1: matrix 175 rows 513 cols
[2025-06-05 11:56:15] [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 389 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 apf3 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 891 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 1293ms problems are : Problem set: 2 solved, 3 unsolved
Finished Parikh walk after 58 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=29 )
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 23 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p1) p2)))), (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 p0 p1)), (G (OR (NOT p2) p1))]
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 p0)), (F (NOT (AND (NOT p2) p0))), (F p2), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) (NOT p0)))), (F (NOT p1)), (F (NOT (OR p2 p1)))]
Knowledge based reduction with 14 factoid took 2327 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 178 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 202 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 11:56:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:56:19] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 126 ms returned sat
[2025-06-05 11:56:20] [INFO ] [Real]Absence check using state equation in 795 ms returned sat
[2025-06-05 11:56:20] [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 11:56:20] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 136 ms returned sat
[2025-06-05 11:56:22] [INFO ] [Nat]Absence check using state equation in 1238 ms returned sat
[2025-06-05 11:56:22] [INFO ] Computed and/alt/rep : 125/147/125 causal constraints (skipped 38 transitions) in 9 ms.
[2025-06-05 11:56:22] [INFO ] Added : 0 causal constraints over 0 iterations in 64 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 5 ms. Remains 513 /513 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-06-05 11:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:56:22] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-05 11:56:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:56:23] [INFO ] Implicit Places using invariants and state equation in 794 ms returned []
Implicit Place search using SMT with State Equation took 1137 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-05 11:56:23] [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 16678 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
At refinement iteration 5 (OVERLAPS) 2/688 variables, 2/939 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 77/1016 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/688 variables, and 1016 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30016 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]
After SMT, in 46744ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 46745ms
Finished structural reductions in LTL mode , in 1 iterations and 47887 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 723 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 191 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 (2768 resets) in 159 ms. (250 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (436 resets) in 43 ms. (909 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (325 resets) in 29 ms. (1333 steps per ms) remains 2/2 properties
[2025-06-05 11:57:11] [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) 50/86 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 0/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 173/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) 429/688 variables, 396/543 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/688 variables, 310/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/688 variables, 0/853 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 688/688 variables, and 853 constraints, problems are : Problem set: 0 solved, 2 unsolved in 279 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 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) 50/86 variables, 36/46 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/86 variables, 1/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/86 variables, 0/47 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 173/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) 429/688 variables, 396/545 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/688 variables, 310/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/688 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/688 variables, 0/855 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 688/688 variables, and 855 constraints, problems are : Problem set: 0 solved, 2 unsolved in 574 ms.
Refiners :[Generalized P Invariants (flows): 340/340 constraints, State Equation: 513/513 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 859ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 60 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=30 )
Parikh walk visited 2 properties in 7 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 p1)), (F p2), (F (NOT p0)), (F (NOT (OR p2 p0)))]
Knowledge based reduction with 7 factoid took 1167 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 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)]
Stuttering acceptance computed with spot in 246 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 11:57:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-05 11:57:14] [INFO ] [Real]Absence check using 0 positive and 340 generalized place invariants in 134 ms returned sat
[2025-06-05 11:57:14] [INFO ] [Real]Absence check using state equation in 808 ms returned sat
[2025-06-05 11:57:14] [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 11:57:15] [INFO ] [Nat]Absence check using 0 positive and 340 generalized place invariants in 145 ms returned sat
[2025-06-05 11:57:16] [INFO ] [Nat]Absence check using state equation in 1212 ms returned sat
[2025-06-05 11:57:16] [INFO ] Computed and/alt/rep : 125/147/125 causal constraints (skipped 38 transitions) in 9 ms.
[2025-06-05 11:57:16] [INFO ] Added : 0 causal constraints over 0 iterations in 64 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 222 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 25288 reset in 203 ms.
Product exploration explored 100000 steps with 25239 reset in 201 ms.
Applying partial POR strategy [false, true, true, false, true, true]
Stuttering acceptance computed with spot in 168 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 7 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 11:57:17] [INFO ] Redundant transitions in 112 ms returned []
Running 163 sub problems to find dead transitions.
[2025-06-05 11:57: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/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 17482 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
At refinement iteration 5 (OVERLAPS) 2/688 variables, 2/939 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 77/1016 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/688 variables, and 1016 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30024 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]
After SMT, in 47552ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 47553ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 47683 ms. Remains : 513/513 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin15686138646792037453
[2025-06-05 11:58:05] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15686138646792037453
Running compilation step : cd /tmp/ltsmin15686138646792037453;'/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 429 ms.
Running link step : cd /tmp/ltsmin15686138646792037453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15686138646792037453;'/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/stateBased13311398868365937046.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 8 ms. Remains 513 /513 variables (removed 0) and now considering 175/175 (removed 0) transitions.
[2025-06-05 11:58:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:58:20] [INFO ] Implicit Places using invariants in 309 ms returned []
[2025-06-05 11:58:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-05 11:58:21] [INFO ] Implicit Places using invariants and state equation in 772 ms returned []
Implicit Place search using SMT with State Equation took 1097 ms to find 0 implicit places.
Running 163 sub problems to find dead transitions.
[2025-06-05 11:58:21] [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 17051 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
At refinement iteration 5 (OVERLAPS) 2/688 variables, 2/939 constraints. Problems are: Problem set: 0 solved, 163 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/688 variables, 77/1016 constraints. Problems are: Problem set: 0 solved, 163 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/688 variables, and 1016 constraints, problems are : Problem set: 0 solved, 163 unsolved in 30029 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]
After SMT, in 47122ms problems are : Problem set: 0 solved, 163 unsolved
Search for dead transitions found 0 dead transitions in 47122ms
Finished structural reductions in LTL mode , in 1 iterations and 48229 ms. Remains : 513/513 places, 175/175 transitions.
Built C files in :
/tmp/ltsmin11024892569969892002
[2025-06-05 11:59:08] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11024892569969892002
Running compilation step : cd /tmp/ltsmin11024892569969892002;'/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/ltsmin11024892569969892002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin11024892569969892002;'/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/stateBased17086146075225934183.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-05 11:59:23] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:59:23] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:59:23] [INFO ] Time to serialize gal into /tmp/LTL9626134505894863363.gal : 2 ms
[2025-06-05 11:59:23] [INFO ] Time to serialize properties into /tmp/LTL1675898057564606487.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/LTL9626134505894863363.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5951117714442050358.hoa' '-atoms' '/tmp/LTL1675898057564606487.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/LTL1675898057564606487.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5951117714442050358.hoa
Detected timeout of ITS tools.
[2025-06-05 11:59:38] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:59:38] [INFO ] Flatten gal took : 14 ms
[2025-06-05 11:59:38] [INFO ] Time to serialize gal into /tmp/LTL10294939683842039296.gal : 2 ms
[2025-06-05 11:59:38] [INFO ] Time to serialize properties into /tmp/LTL432970757273586707.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/LTL10294939683842039296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL432970757273586707.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("(((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+((s2_8+s2_9)+s2_10))<=a5)"))&&(F((G(F("(CstopAbort<1)")))||(("(((((s2_...356
Formula 0 simplified : (G!"(((((s2_0+s2_1)+(s2_2+s2_3))+((s2_4+s2_5)+(s2_6+s2_7)))+((s2_8+s2_9)+s2_10))<=a5)" | G(FG!"(CstopAbort<1)" & (!"(((((s2_0+s2_1)+...337
Detected timeout of ITS tools.
[2025-06-05 11:59:53] [INFO ] Flatten gal took : 10 ms
[2025-06-05 11:59:53] [INFO ] Applying decomposition
[2025-06-05 11:59:53] [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/graph14489876459133485449.txt' '-o' '/tmp/graph14489876459133485449.bin' '-w' '/tmp/graph14489876459133485449.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph14489876459133485449.bin' '-l' '-1' '-v' '-w' '/tmp/graph14489876459133485449.weights' '-q' '0' '-e' '0.001'
[2025-06-05 11:59:53] [INFO ] Decomposing Gal with order
[2025-06-05 11:59:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 11:59:53] [INFO ] Removed a total of 109 redundant transitions.
[2025-06-05 11:59:53] [INFO ] Flatten gal took : 25 ms
[2025-06-05 11:59:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 60 labels/synchronizations in 13 ms.
[2025-06-05 11:59:53] [INFO ] Time to serialize gal into /tmp/LTL3061706306452602745.gal : 4 ms
[2025-06-05 11:59:53] [INFO ] Time to serialize properties into /tmp/LTL4814839162117859430.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/LTL3061706306452602745.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4814839162117859430.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("(((((gu55.s2_0+gu55.s2_1)+(gu55.s2_2+gu55.s2_3))+((gu55.s2_4+gu55.s2_5)+(gu55.s2_6+gu55.s2_7)))+((gu55.s2_8+gu55.s2_9)+gu55.s2...568
Formula 0 simplified : (G!"(((((gu55.s2_0+gu55.s2_1)+(gu55.s2_2+gu55.s2_3))+((gu55.s2_4+gu55.s2_5)+(gu55.s2_6+gu55.s2_7)))+((gu55.s2_8+gu55.s2_9)+gu55.s2_1...549
Detected timeout of ITS tools.
Treatment of property QuasiCertifProtocol-COL-10-LTLCardinality-06 finished in 238482 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(X(((X(p1) U (X(G(p1))||(p2&&X(p1)))) U (G((X(p1) U (X(G(p1))||(p2&&X(p1)))))||(p3&&(X(p1) U (X(G(p1))||(p2&&X(p1))))))))))))'
[2025-06-05 12:00:09] [INFO ] Flatten gal took : 12 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin8215004127786229257
[2025-06-05 12:00:09] [INFO ] Applying decomposition
[2025-06-05 12:00:09] [INFO ] Computing symmetric may disable matrix : 176 transitions.
[2025-06-05 12:00:09] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:00:09] [INFO ] Computing symmetric may enable matrix : 176 transitions.
[2025-06-05 12:00:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:00:09] [INFO ] Flatten gal took : 10 ms
[2025-06-05 12:00:09] [INFO ] Computing Do-Not-Accords matrix : 176 transitions.
[2025-06-05 12:00:09] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-05 12:00:09] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8215004127786229257
Running compilation step : cd /tmp/ltsmin8215004127786229257;'/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/graph12839858498590985736.txt' '-o' '/tmp/graph12839858498590985736.bin' '-w' '/tmp/graph12839858498590985736.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12839858498590985736.bin' '-l' '-1' '-v' '-w' '/tmp/graph12839858498590985736.weights' '-q' '0' '-e' '0.001'
[2025-06-05 12:00:09] [INFO ] Decomposing Gal with order
[2025-06-05 12:00:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:00:09] [INFO ] Removed a total of 112 redundant transitions.
[2025-06-05 12:00:09] [INFO ] Flatten gal took : 26 ms
[2025-06-05 12:00:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-05 12:00:09] [INFO ] Time to serialize gal into /tmp/LTLCardinality2725370759024797904.gal : 2 ms
[2025-06-05 12:00:09] [INFO ] Time to serialize properties into /tmp/LTLCardinality14911095407672106537.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/LTLCardinality2725370759024797904.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality14911095407672106537.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 4 LTL properties
Checking formula 0 : !(((((F("(((((gu5.n6_0+gu5.n6_1)+(gu5.n6_2+gu5.n6_3))+((gu5.n6_4+gu5.n6_5)+(gu5.n6_6+gu5.n6_7)))+((gu5.n6_8+gu5.n6_9)+gu5.n6_10))<=(((...5073
Formula 0 simplified : ((G!"(((((gu5.n6_0+gu5.n6_1)+(gu5.n6_2+gu5.n6_3))+((gu5.n6_4+gu5.n6_5)+(gu5.n6_6+gu5.n6_7)))+((gu5.n6_8+gu5.n6_9)+gu5.n6_10))<=((((g...5063
Compilation finished in 572 ms.
Running link step : cd /tmp/ltsmin8215004127786229257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin8215004127786229257;'/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' '(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&<>((LTLAPp2==true))) U X([]((LTLAPp3==true))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin8215004127786229257;'/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' '(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&<>((LTLAPp2==true))) U X([]((LTLAPp3==true))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8215004127786229257;'/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' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>225 s) on command cd /tmp/ltsmin8215004127786229257;'/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' '<>([]((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin8215004127786229257;'/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' '((<>((LTLAPp5==true))&&<>(([](<>((LTLAPp6==true)))||(!(LTLAPp5==true)&&<>((LTLAPp6==true)))))) U X(X([]((LTLAPp7==true)))))' '--buchi-type=spotba'
LTSmin run took 106318 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-06 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin8215004127786229257;'/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' 'X(((LTLAPp8==true)||X(X(((X((LTLAPp9==true)) U (X([]((LTLAPp9==true)))||((LTLAPp10==true)&&X((LTLAPp9==true))))) U ([]((X((LTLAPp9==true)) U (X([]((LTLAPp9==true)))||((LTLAPp10==true)&&X((LTLAPp9==true))))))||((LTLAPp11==true)&&(X((LTLAPp9==true)) U (X([]((LTLAPp9==true)))||((LTLAPp10==true)&&X((LTLAPp9==true))))))))))))' '--buchi-type=spotba'
LTSmin run took 122885 ms.
FORMULA QuasiCertifProtocol-COL-10-LTLCardinality-13 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Retrying LTSmin with larger timeout 7200 s
Running LTSmin : cd /tmp/ltsmin8215004127786229257;'/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' '(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&<>((LTLAPp2==true))) U X([]((LTLAPp3==true))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2025-06-05 12:29:16] [INFO ] Applying decomposition
[2025-06-05 12:29:16] [INFO ] Flatten gal took : 33 ms
[2025-06-05 12:29:16] [INFO ] Decomposing Gal with order
[2025-06-05 12:29:16] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-05 12:29:16] [WARNING] Could not apply decomposition. Using flat GAL structure.
java.lang.RuntimeException: Could not find partition element corresponding to malicious_reservoir in partition [n6_0, n5_0, n4_0, n3_0, n2_0, n1_0, c1_0, Cstart_0, Sstart_0, s2_0, s3_0, s4_0, s5_0, s6_0, SstopOK_0, CstopOK_0],[n6_1, n5_1, n4_1, n3_1, n2_1, n1_1, c1_1, Cstart_1, Sstart_1, s2_1, s3_1, s4_1, s5_1, s6_1, SstopOK_1, CstopOK_1],[n6_2, n5_2, n4_2, n3_2, n2_2, n1_2, c1_2, Cstart_2, Sstart_2, s2_2, s3_2, s4_2, s5_2, s6_2, SstopOK_2, CstopOK_2],[n6_3, n5_3, n4_3, n3_3, n2_3, n1_3, c1_3, Cstart_3, Sstart_3, s2_3, s3_3, s4_3, s5_3, s6_3, SstopOK_3, CstopOK_3],[n6_4, n5_4, n4_4, n3_4, n2_4, n1_4, c1_4, Cstart_4, Sstart_4, s2_4, s3_4, s4_4, s5_4, s6_4, SstopOK_4, CstopOK_4],[n6_5, n5_5, n4_5, n3_5, n2_5, n1_5, c1_5, Cstart_5, Sstart_5, s2_5, s3_5, s4_5, s5_5, s6_5, SstopOK_5, CstopOK_5],[n6_6, n5_6, n4_6, n3_6, n2_6, n1_6, c1_6, Cstart_6, Sstart_6, s2_6, s3_6, s4_6, s5_6, s6_6, SstopOK_6, CstopOK_6],[n6_7, n5_7, n4_7, n3_7, n2_7, n1_7, c1_7, Cstart_7, Sstart_7, s2_7, s3_7, s4_7, s5_7, s6_7, SstopOK_7, CstopOK_7],[n6_8, n5_8, n4_8, n3_8, n2_8, n1_8, c1_8, Cstart_8, Sstart_8, s2_8, s3_8, s4_8, s5_8, s6_8, SstopOK_8, CstopOK_8],[n6_9, n5_9, n4_9, n3_9, n2_9, n1_9, c1_9, Cstart_9, Sstart_9, s2_9, s3_9, s4_9, s5_9, s6_9, SstopOK_9, CstopOK_9],[n6_10, n5_10, n4_10, n3_10, n2_10, n1_10, c1_10, Cstart_10, Sstart_10, s2_10, s3_10, s4_10, s5_10, s6_10, SstopOK_10, CstopOK_10],[n9_0, n8_0, n7_0],[n9_1, n8_1, n7_1],[n9_2, n8_2, n7_2],[n9_3, n8_3, n7_3],[n9_4, n8_4, n7_4],[n9_5, n8_5, n7_5],[n9_6, n8_6, n7_6],[n9_7, n8_7, n7_7],[n9_8, n8_8, n7_8],[n9_9, n8_9, n7_9],[n9_10, n8_10, n7_10],[n9_11, n8_11, n7_11],[n9_12, n8_12, n7_12],[n9_13, n8_13, n7_13],[n9_14, n8_14, n7_14],[n9_15, n8_15, n7_15],[n9_16, n8_16, n7_16],[n9_17, n8_17, n7_17],[n9_18, n8_18, n7_18],[n9_19, n8_19, n7_19],[n9_20, n8_20, n7_20],[n9_21, n8_21, n7_21],[n9_22, n8_22, n7_22],[n9_23, n8_23, n7_23],[n9_24, n8_24, n7_24],[n9_25, n8_25, n7_25],[n9_26, n8_26, n7_26],[n9_27, n8_27, n7_27],[n9_28, n8_28, n7_28],[n9_29, n8_29, n7_29],[n9_30, n8_30, n7_30],[n9_31, n8_31, n7_31],[n9_32, n8_32, n7_32],[n9_33, n8_33, n7_33],[n9_34, n8_34, n7_34],[n9_35, n8_35, n7_35],[n9_36, n8_36, n7_36],[n9_37, n8_37, n7_37],[n9_38, n8_38, n7_38],[n9_39, n8_39, n7_39],[n9_40, n8_40, n7_40],[n9_41, n8_41, n7_41],[n9_42, n8_42, n7_42],[n9_43, n8_43, n7_43],[n9_44, n8_44, n7_44],[n9_45, n8_45, n7_45],[n9_46, n8_46, n7_46],[n9_47, n8_47, n7_47],[n9_48, n8_48, n7_48],[n9_49, n8_49, n7_49],[n9_50, n8_50, n7_50],[n9_51, n8_51, n7_51],[n9_52, n8_52, n7_52],[n9_53, n8_53, n7_53],[n9_54, n8_54, n7_54],[n9_55, n8_55, n7_55],[n9_56, n8_56, n7_56],[n9_57, n8_57, n7_57],[n9_58, n8_58, n7_58],[n9_59, n8_59, n7_59],[n9_60, n8_60, n7_60],[n9_61, n8_61, n7_61],[n9_62, n8_62, n7_62],[n9_63, n8_63, n7_63],[n9_64, n8_64, n7_64],[n9_65, n8_65, n7_65],[n9_66, n8_66, n7_66],[n9_67, n8_67, n7_67],[n9_68, n8_68, n7_68],[n9_69, n8_69, n7_69],[n9_70, n8_70, n7_70],[n9_71, n8_71, n7_71],[n9_72, n8_72, n7_72],[n9_73, n8_73, n7_73],[n9_74, n8_74, n7_74],[n9_75, n8_75, n7_75],[n9_76, n8_76, n7_76],[n9_77, n8_77, n7_77],[n9_78, n8_78, n7_78],[n9_79, n8_79, n7_79],[n9_80, n8_80, n7_80],[n9_81, n8_81, n7_81],[n9_82, n8_82, n7_82],[n9_83, n8_83, n7_83],[n9_84, n8_84, n7_84],[n9_85, n8_85, n7_85],[n9_86, n8_86, n7_86],[n9_87, n8_87, n7_87],[n9_88, n8_88, n7_88],[n9_89, n8_89, n7_89],[n9_90, n8_90, n7_90],[n9_91, n8_91, n7_91],[n9_92, n8_92, n7_92],[n9_93, n8_93, n7_93],[n9_94, n8_94, n7_94],[n9_95, n8_95, n7_95],[n9_96, n8_96, n7_96],[n9_97, n8_97, n7_97],[n9_98, n8_98, n7_98],[n9_99, n8_99, n7_99],[n9_100, n8_100, n7_100],[n9_101, n8_101, n7_101],[n9_102, n8_102, n7_102],[n9_103, n8_103, n7_103],[n9_104, n8_104, n7_104],[n9_105, n8_105, n7_105],[n9_106, n8_106, n7_106],[n9_107, n8_107, n7_107],[n9_108, n8_108, n7_108],[n9_109, n8_109, n7_109],[n9_110, n8_110, n7_110],[n9_111, n8_111, n7_111],[n9_112, n8_112, n7_112],[n9_113, n8_113, n7_113],[n9_114, n8_114, n7_114],[n9_115, n8_115, n7_115],[n9_116, n8_116, n7_116],[n9_117, n8_117, n7_117],[n9_118, n8_118, n7_118],[n9_119, n8_119, n7_119],[n9_120, n8_120, n7_120],

at fr.lip6.move.gal.instantiate.CompositeBuilder$Partition.getIndex(CompositeBuilder.java:1421)
at fr.lip6.move.gal.instantiate.CompositeBuilder.galToCompositeWithPartition(CompositeBuilder.java:556)
at fr.lip6.move.gal.instantiate.CompositeBuilder.decomposeWithOrder(CompositeBuilder.java:147)
at fr.lip6.move.gal.application.mcc.MccTranslator.applyOrder(MccTranslator.java:133)
at fr.lip6.move.gal.application.mcc.MccTranslator.flattenSpec(MccTranslator.java:230)
at fr.lip6.move.gal.application.runner.its.MultiOrderRunner.runMultiITS(MultiOrderRunner.java:124)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:1028)
at fr.lip6.move.gal.application.Application.start(Application.java:193)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:208)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:670)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:607)
at org.eclipse.equinox.launcher.Main.run(Main.java:1492)
at org.eclipse.equinox.launcher.Main.main(Main.java:1465)
[2025-06-05 12:29:16] [INFO ] Flatten gal took : 26 ms
[2025-06-05 12:29:16] [INFO ] Time to serialize gal into /tmp/LTLCardinality17868008559845502530.gal : 2 ms
[2025-06-05 12:29:16] [INFO ] Time to serialize properties into /tmp/LTLCardinality1448602667783341799.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/LTLCardinality17868008559845502530.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality1448602667783341799.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 2 LTL properties
Checking formula 0 : !(((((F("(((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+((n6_8+n6_9)+n6_10))<=((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+...3393
Formula 0 simplified : ((G!"(((((n6_0+n6_1)+(n6_2+n6_3))+((n6_4+n6_5)+(n6_6+n6_7)))+((n6_8+n6_9)+n6_10))<=((((n5_0+n5_1)+(n5_2+n5_3))+((n5_4+n5_5)+(n5_6+n5...3383

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-COL-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-COL-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-174881254600739"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/QuasiCertifProtocol-COL-10.tgz
mv QuasiCertifProtocol-COL-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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;