fond
Model Checking Contest 2025
15th edition, Paris, France, June 24, 2025
Execution of r030-smll-174853814100540
Last Updated
June 24, 2025

About the Execution of ITS-Tools for ClientsAndServers-PT-N0020P4

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
0.000 3600000.00 0.00 0.00 FFT?TF?TFFFFFFFT normal

Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r030-smll-174853814100540.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 ClientsAndServers-PT-N0020P4, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853814100540
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 412K
-rw-r--r-- 1 mcc users 8.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 93K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.9K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K 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.6K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.4K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.3K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 68K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 8 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 9.2K 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 ClientsAndServers-PT-N0020P4-LTLFireability-00
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-01
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-02
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-03
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-04
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-05
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-06
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-07
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-08
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-09
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-10
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-11
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-12
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-13
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-14
FORMULA_NAME ClientsAndServers-PT-N0020P4-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748988818128

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ClientsAndServers-PT-N0020P4
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-03 22:13:40] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-03 22:13:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-03 22:13:40] [INFO ] Load time of PNML (sax parser for PT used): 66 ms
[2025-06-03 22:13:40] [INFO ] Transformed 25 places.
[2025-06-03 22:13:40] [INFO ] Transformed 18 transitions.
[2025-06-03 22:13:40] [INFO ] Parsed PT model containing 25 places and 18 transitions and 54 arcs in 266 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 23 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 21 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Applied a total of 0 rules in 10 ms. Remains 25 /25 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 25 cols
[2025-06-03 22:13:41] [INFO ] Computed 8 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:41] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-06-03 22:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:41] [INFO ] Implicit Places using invariants and state equation in 115 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:13:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/43 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 43/43 variables, and 33 constraints, problems are : Problem set: 0 solved, 17 unsolved in 1203 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/25 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/25 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/43 variables, 25/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/43 variables, 17/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/43 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 43/43 variables, and 50 constraints, problems are : Problem set: 0 solved, 17 unsolved in 609 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1852ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1872ms
Finished structural reductions in LTL mode , in 1 iterations and 2317 ms. Remains : 25/25 places, 18/18 transitions.
Support contains 21 out of 25 places after structural reductions.
[2025-06-03 22:13:43] [INFO ] Flatten gal took : 33 ms
[2025-06-03 22:13:43] [INFO ] Flatten gal took : 11 ms
[2025-06-03 22:13:43] [INFO ] Input system was already deterministic with 18 transitions.
Reduction of identical properties reduced properties to check from 16 to 15
RANDOM walk for 6184 steps (1 resets) in 82 ms. (74 steps per ms) remains 0/15 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||G(p1))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 10 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 22:13:44] [INFO ] Computed 4 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:44] [INFO ] Implicit Places using invariants in 43 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 47 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 59 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 392 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-00
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 2 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-00 finished in 546 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(((X(X(X(p0)))&&(p0 U X(p1)))||G(p0)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
[2025-06-03 22:13:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:44] [INFO ] Implicit Places using invariants in 48 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 51 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 615 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-01
Product exploration explored 100000 steps with 4568 reset in 415 ms.
Product exploration explored 100000 steps with 4627 reset in 225 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 171 ms. Reduced automaton from 14 states, 34 edges and 2 AP (stutter sensitive) to 14 states, 33 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 786 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 3029 steps (0 resets) in 19 ms. (151 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p1 p0))), (F (NOT p0)), (F (NOT (AND (NOT p1) p0)))]
Knowledge based reduction with 6 factoid took 397 ms. Reduced automaton from 14 states, 33 edges and 2 AP (stutter sensitive) to 14 states, 33 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 664 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 584 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 3 out of 20 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 20 cols
[2025-06-03 22:13:48] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:48] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 22:13:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:49] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:13:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/38 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 38/38 variables, and 23 constraints, problems are : Problem set: 0 solved, 17 unsolved in 443 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/19 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/38 variables, 20/23 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/38 variables, 17/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/38 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 38/38 variables, and 40 constraints, problems are : Problem set: 0 solved, 17 unsolved in 438 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 20/20 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 888ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 889ms
Finished structural reductions in LTL mode , in 1 iterations and 983 ms. Remains : 20/20 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 14 states, 33 edges and 2 AP (stutter sensitive) to 14 states, 33 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 641 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
RANDOM walk for 2459 steps (0 resets) in 7 ms. (307 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 (NOT p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p1) p0))), (X (X p0)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT (OR p0 p1))), (F (NOT (AND p0 (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 269 ms. Reduced automaton from 14 states, 33 edges and 2 AP (stutter sensitive) to 14 states, 33 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 628 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 654 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 605 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 4667 reset in 154 ms.
Product exploration explored 100000 steps with 4634 reset in 221 ms.
Built C files in :
/tmp/ltsmin3267783784383326878
[2025-06-03 22:13:53] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3267783784383326878
Running compilation step : cd /tmp/ltsmin3267783784383326878;'/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 336 ms.
Running link step : cd /tmp/ltsmin3267783784383326878;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 56 ms.
Running LTSmin : cd /tmp/ltsmin3267783784383326878;'/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/stateBased4385922066394491323.hoa' '--buchi-type=spotba'
LTSmin run took 461 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-01 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-01 finished in 9703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 2 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-03 22:13:54] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:54] [INFO ] Implicit Places using invariants in 43 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 44 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 47 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 178 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-03
Product exploration explored 100000 steps with 1321 reset in 115 ms.
Product exploration explored 100000 steps with 1372 reset in 149 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 153 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4438 steps (0 resets) in 10 ms. (403 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 202 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 22:13:55] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:13:55] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2025-06-03 22:13:55] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 22:13:55] [INFO ] [Real]Absence check using state equation in 24 ms returned sat
[2025-06-03 22:13:55] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:13:56] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:13:56] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 22:13:56] [INFO ] [Nat]Absence check using state equation in 24 ms returned sat
[2025-06-03 22:13:56] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 22:13:56] [INFO ] Added : 13 causal constraints over 3 iterations in 27 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 22 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-03 22:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:56] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 22:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:13:56] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:13:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 354 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 320 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 680ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 681ms
Finished structural reductions in LTL mode , in 1 iterations and 753 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 5127 steps (1 resets) in 10 ms. (466 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 104 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-03 22:13:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:13:57] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 22:13:57] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 22:13:57] [INFO ] [Real]Absence check using state equation in 13 ms returned sat
[2025-06-03 22:13:57] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:13:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:13:57] [INFO ] [Nat]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 22:13:57] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-03 22:13:57] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 22:13:57] [INFO ] Added : 13 causal constraints over 3 iterations in 16 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 1346 reset in 100 ms.
Product exploration explored 100000 steps with 1371 reset in 106 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 128 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 18
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 7 place count 22 transition count 18
Deduced a syphon composed of 9 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 22 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 19 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 19 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 19 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 18 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 25 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:13:58] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 18 cols
[2025-06-03 22:13:58] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 6 (OVERLAPS) 14/32 variables, 18/23 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/23 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 23 constraints, problems are : Problem set: 7 solved, 6 unsolved in 303 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 7/17 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 2/5 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 14/32 variables, 18/23 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 6/29 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/29 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 29 constraints, problems are : Problem set: 7 solved, 6 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 6/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 517ms problems are : Problem set: 7 solved, 6 unsolved
Search for dead transitions found 7 dead transitions in 517ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 18/22 places, 7/18 transitions.
Graph (complete) has 19 edges and 18 vertex of which 11 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.1 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 11 /18 variables (removed 7) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 11/22 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 11/22 places, 7/18 transitions.
Built C files in :
/tmp/ltsmin11658405491610284618
[2025-06-03 22:13:58] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11658405491610284618
Running compilation step : cd /tmp/ltsmin11658405491610284618;'/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 118 ms.
Running link step : cd /tmp/ltsmin11658405491610284618;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin11658405491610284618;'/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/stateBased3945933940268616150.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 22:14:13] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:14:13] [INFO ] Implicit Places using invariants in 48 ms returned [20]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 49 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 52 ms. Remains : 21/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin4673652980667021675
[2025-06-03 22:14:13] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4673652980667021675
Running compilation step : cd /tmp/ltsmin4673652980667021675;'/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 94 ms.
Running link step : cd /tmp/ltsmin4673652980667021675;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin4673652980667021675;'/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/stateBased6448045611714837582.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 22:14:29] [INFO ] Flatten gal took : 4 ms
[2025-06-03 22:14:29] [INFO ] Flatten gal took : 2 ms
[2025-06-03 22:14:29] [INFO ] Time to serialize gal into /tmp/LTL39837128811097235.gal : 2 ms
[2025-06-03 22:14:29] [INFO ] Time to serialize properties into /tmp/LTL3265221393392787582.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/LTL39837128811097235.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6403520535438867646.hoa' '-atoms' '/tmp/LTL3265221393392787582.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...315
Loading property file /tmp/LTL3265221393392787582.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6403520535438867646.hoa
Detected timeout of ITS tools.
[2025-06-03 22:14:44] [INFO ] Flatten gal took : 4 ms
[2025-06-03 22:14:44] [INFO ] Flatten gal took : 2 ms
[2025-06-03 22:14:44] [INFO ] Time to serialize gal into /tmp/LTL13435087502108815135.gal : 1 ms
[2025-06-03 22:14:44] [INFO ] Time to serialize properties into /tmp/LTL16612708864441491947.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13435087502108815135.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16612708864441491947.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((F("(((CG<1)||(CwG<1))&&(MpG<1))"))&&(F("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : X(G!"(((CG<1)||(CwG<1))&&(MpG<1))" | G!"((SA>=1)&&(SwA>=1))")
Detected timeout of ITS tools.
[2025-06-03 22:14:59] [INFO ] Flatten gal took : 3 ms
[2025-06-03 22:14:59] [INFO ] Applying decomposition
[2025-06-03 22:14:59] [INFO ] Flatten gal took : 2 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/graph9095416695882151851.txt' '-o' '/tmp/graph9095416695882151851.bin' '-w' '/tmp/graph9095416695882151851.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9095416695882151851.bin' '-l' '-1' '-v' '-w' '/tmp/graph9095416695882151851.weights' '-q' '0' '-e' '0.001'
[2025-06-03 22:14:59] [INFO ] Decomposing Gal with order
[2025-06-03 22:14:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 22:14:59] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 22:14:59] [INFO ] Flatten gal took : 50 ms
[2025-06-03 22:14:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 22:14:59] [INFO ] Time to serialize gal into /tmp/LTL14240150454175859657.gal : 2 ms
[2025-06-03 22:14:59] [INFO ] Time to serialize properties into /tmp/LTL6968329611094977514.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/LTL14240150454175859657.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6968329611094977514.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !((X((F("(((u2.CG<1)||(u2.CwG<1))&&(u4.MpG<1))"))&&(F("((i0.u3.SA>=1)&&(i4.u6.SwA>=1))")))))
Formula 0 simplified : X(G!"(((u2.CG<1)||(u2.CwG<1))&&(u4.MpG<1))" | G!"((i0.u3.SA>=1)&&(i4.u6.SwA>=1))")
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-03 finished in 79873 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 10 place count 19 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 12 place count 17 transition count 14
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 4 Pre rules applied. Total rules applied 12 place count 17 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 13 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2025-06-03 22:15:14] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:14] [INFO ] Implicit Places using invariants in 41 ms returned [8, 10]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 43 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 9/25 places, 8/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 9 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 7 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 7 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 6 transition count 5
Applied a total of 6 rules in 2 ms. Remains 6 /9 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 6 cols
[2025-06-03 22:15:14] [INFO ] Computed 2 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-03 22:15:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:14] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 125 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-05
Product exploration explored 100000 steps with 13959 reset in 95 ms.
Product exploration explored 100000 steps with 13158 reset in 322 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 618 steps (0 resets) in 5 ms. (103 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
[2025-06-03 22:15:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:15] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 22:15:15] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 22:15:15] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:15] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 22:15:15] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 22:15:15] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:15:15] [INFO ] Added : 3 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 6 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 6/6 places, 5/5 transitions.
Applied a total of 0 rules in 2 ms. Remains 6 /6 variables (removed 0) and now considering 5/5 (removed 0) transitions.
[2025-06-03 22:15:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:15] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-03 22:15:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:15] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 66 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:15:15] [INFO ] Redundant transitions in 0 ms returned []
Running 4 sub problems to find dead transitions.
[2025-06-03 22:15: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/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (OVERLAPS) 0/11 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 11/11 variables, and 8 constraints, problems are : Problem set: 0 solved, 4 unsolved in 97 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/6 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 5/11 variables, 6/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/11 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 0/11 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 11/11 variables, and 12 constraints, problems are : Problem set: 0 solved, 4 unsolved in 89 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 6/6 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 189ms problems are : Problem set: 0 solved, 4 unsolved
Search for dead transitions found 0 dead transitions in 190ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 264 ms. Remains : 6/6 places, 5/5 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 414 steps (0 resets) in 5 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
[2025-06-03 22:15:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:16] [INFO ] [Real]Absence check using 2 positive place invariants in 2 ms returned sat
[2025-06-03 22:15:16] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 22:15:16] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:16] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2025-06-03 22:15:16] [INFO ] [Nat]Absence check using state equation in 4 ms returned sat
[2025-06-03 22:15:16] [INFO ] Computed and/alt/rep : 4/4/4 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:15:16] [INFO ] Added : 3 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13719 reset in 66 ms.
Product exploration explored 100000 steps with 13902 reset in 117 ms.
Built C files in :
/tmp/ltsmin2624776574375169004
[2025-06-03 22:15:16] [INFO ] Computing symmetric may disable matrix : 5 transitions.
[2025-06-03 22:15:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:15:16] [INFO ] Computing symmetric may enable matrix : 5 transitions.
[2025-06-03 22:15:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:15:16] [INFO ] Computing Do-Not-Accords matrix : 5 transitions.
[2025-06-03 22:15:16] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:15:16] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2624776574375169004
Running compilation step : cd /tmp/ltsmin2624776574375169004;'/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 96 ms.
Running link step : cd /tmp/ltsmin2624776574375169004;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin2624776574375169004;'/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/stateBased9599162176284861203.hoa' '--buchi-type=spotba'
LTSmin run took 99 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-05 finished in 2571 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(F(p0)))))&&F(p1)))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 23 transition count 18
Applied a total of 2 rules in 1 ms. Remains 23 /25 variables (removed 2) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 23 cols
[2025-06-03 22:15:17] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:17] [INFO ] Implicit Places using invariants in 51 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 55 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-06
Product exploration explored 100000 steps with 4451 reset in 142 ms.
Product exploration explored 100000 steps with 4492 reset in 142 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 118 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 278 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1632 steps (0 resets) in 5 ms. (272 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 159 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 235 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 22:15:18] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 22:15:18] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-03 22:15:18] [INFO ] [Real]Absence check using state equation in 19 ms returned sat
[2025-06-03 22:15:18] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:18] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 22:15:18] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 22:15:18] [INFO ] [Nat]Absence check using state equation in 15 ms returned sat
[2025-06-03 22:15:18] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-03 22:15:18] [INFO ] Added : 9 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 22:15:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:18] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 22:15:18] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 22:15:18] [INFO ] [Real]Absence check using state equation in 18 ms returned sat
[2025-06-03 22:15:18] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 22:15:18] [INFO ] Added : 6 causal constraints over 2 iterations in 27 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
[2025-06-03 22:15:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:18] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-03 22:15:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:19] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:15:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 540 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 503 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1050ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1051ms
Finished structural reductions in LTL mode , in 1 iterations and 1139 ms. Remains : 22/22 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 110 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1632 steps (0 resets) in 6 ms. (233 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 157 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 22:15:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:21] [INFO ] [Real]Absence check using 4 positive place invariants in 3 ms returned sat
[2025-06-03 22:15:21] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-03 22:15:21] [INFO ] [Real]Absence check using state equation in 23 ms returned sat
[2025-06-03 22:15:21] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:21] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 22:15:21] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-03 22:15:21] [INFO ] [Nat]Absence check using state equation in 13 ms returned sat
[2025-06-03 22:15:21] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 22:15:21] [INFO ] Added : 9 causal constraints over 2 iterations in 17 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 22:15:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:15:21] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 22:15:21] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 22:15:21] [INFO ] [Real]Absence check using state equation in 10 ms returned sat
[2025-06-03 22:15:21] [INFO ] Computed and/alt/rep : 17/19/17 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-03 22:15:21] [INFO ] Added : 6 causal constraints over 2 iterations in 18 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 257 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4429 reset in 90 ms.
Product exploration explored 100000 steps with 4518 reset in 107 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 262 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 22 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 4 place count 22 transition count 18
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 7 place count 22 transition count 18
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 9 place count 20 transition count 16
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 11 place count 20 transition count 16
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 14 place count 20 transition count 16
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 16 place count 18 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 18 place count 18 transition count 14
Deduced a syphon composed of 6 places in 0 ms
Applied a total of 18 rules in 4 ms. Remains 18 /22 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:15:22] [INFO ] Redundant transitions in 1 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 18 cols
[2025-06-03 22:15:22] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/17 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/32 variables, 18/23 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/32 variables, 0/23 constraints. Problems are: Problem set: 6 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 32/32 variables, and 23 constraints, problems are : Problem set: 6 solved, 7 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 0/0 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 6/17 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/18 variables, 1/5 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/5 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 14/32 variables, 18/23 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/32 variables, 7/30 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/32 variables, 0/30 constraints. Problems are: Problem set: 6 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/32 variables, 0/30 constraints. Problems are: Problem set: 6 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 32/32 variables, and 30 constraints, problems are : Problem set: 6 solved, 7 unsolved in 230 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 18/18 constraints, PredecessorRefiner: 7/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 506ms problems are : Problem set: 6 solved, 7 unsolved
Search for dead transitions found 6 dead transitions in 507ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 18/22 places, 8/18 transitions.
Graph (complete) has 20 edges and 18 vertex of which 12 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 12 /18 variables (removed 6) and now considering 8/8 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 12/22 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 518 ms. Remains : 12/22 places, 8/18 transitions.
Built C files in :
/tmp/ltsmin13331607848038719972
[2025-06-03 22:15:22] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13331607848038719972
Running compilation step : cd /tmp/ltsmin13331607848038719972;'/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 107 ms.
Running link step : cd /tmp/ltsmin13331607848038719972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin13331607848038719972;'/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/stateBased2994344249508887517.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 22 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 22/22 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 22 /22 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 22:15:37] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:37] [INFO ] Implicit Places using invariants in 38 ms returned []
[2025-06-03 22:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:15:37] [INFO ] Implicit Places using invariants and state equation in 51 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:15:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 365 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 690ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 690ms
Finished structural reductions in LTL mode , in 1 iterations and 783 ms. Remains : 22/22 places, 18/18 transitions.
Built C files in :
/tmp/ltsmin9043016804037216902
[2025-06-03 22:15:38] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9043016804037216902
Running compilation step : cd /tmp/ltsmin9043016804037216902;'/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 108 ms.
Running link step : cd /tmp/ltsmin9043016804037216902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin9043016804037216902;'/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/stateBased149563293202424514.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 22:15:53] [INFO ] Flatten gal took : 5 ms
[2025-06-03 22:15:53] [INFO ] Flatten gal took : 2 ms
[2025-06-03 22:15:53] [INFO ] Time to serialize gal into /tmp/LTL13664111185517579130.gal : 3 ms
[2025-06-03 22:15:53] [INFO ] Time to serialize properties into /tmp/LTL10288102019860495090.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/LTL13664111185517579130.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2127345476452609380.hoa' '-atoms' '/tmp/LTL10288102019860495090.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL10288102019860495090.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2127345476452609380.hoa
Detected timeout of ITS tools.
[2025-06-03 22:16:08] [INFO ] Flatten gal took : 3 ms
[2025-06-03 22:16:08] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:16:08] [INFO ] Time to serialize gal into /tmp/LTL13362665914980725252.gal : 1 ms
[2025-06-03 22:16:08] [INFO ] Time to serialize properties into /tmp/LTL2056539096115874585.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/LTL13362665914980725252.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2056539096115874585.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(X(X(X(F("((SG>=1)&&(SwG>=1))"))))))&&(F("((CG>=1)&&(CwG>=1))"))))
Formula 0 simplified : XXXXG!"((SG>=1)&&(SwG>=1))" | G!"((CG>=1)&&(CwG>=1))"
Detected timeout of ITS tools.
[2025-06-03 22:16:23] [INFO ] Flatten gal took : 2 ms
[2025-06-03 22:16:23] [INFO ] Applying decomposition
[2025-06-03 22:16:23] [INFO ] Flatten gal took : 2 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/graph3065718135211814225.txt' '-o' '/tmp/graph3065718135211814225.bin' '-w' '/tmp/graph3065718135211814225.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3065718135211814225.bin' '-l' '-1' '-v' '-w' '/tmp/graph3065718135211814225.weights' '-q' '0' '-e' '0.001'
[2025-06-03 22:16:23] [INFO ] Decomposing Gal with order
[2025-06-03 22:16:23] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 22:16:23] [INFO ] Flatten gal took : 6 ms
[2025-06-03 22:16:23] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 22:16:23] [INFO ] Time to serialize gal into /tmp/LTL15688513818863618718.gal : 2 ms
[2025-06-03 22:16:23] [INFO ] Time to serialize properties into /tmp/LTL1990008328710893140.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/LTL15688513818863618718.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1990008328710893140.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(X(F("((i4.u4.SG>=1)&&(u6.SwG>=1))"))))))&&(F("((u1.CG>=1)&&(u1.CwG>=1))"))))
Formula 0 simplified : XXXXG!"((i4.u4.SG>=1)&&(u6.SwG>=1))" | G!"((u1.CG>=1)&&(u1.CwG>=1))"
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-06 finished in 81971 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((p1&&F(G(p2))))||p0)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 2 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 22:16:39] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:39] [INFO ] Implicit Places using invariants in 37 ms returned []
[2025-06-03 22:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:39] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:16:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 0/40 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 40/40 variables, and 27 constraints, problems are : Problem set: 0 solved, 17 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/21 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/21 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 1/22 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (OVERLAPS) 18/40 variables, 22/27 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/40 variables, 17/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/40 variables, 0/44 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 40/40 variables, and 44 constraints, problems are : Problem set: 0 solved, 17 unsolved in 343 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, State Equation: 22/22 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 704ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 704ms
Starting structural reductions in LTL mode, iteration 1 : 22/25 places, 18/18 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 784 ms. Remains : 22/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 206 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 81 ms.
Product exploration explored 100000 steps with 50000 reset in 110 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X p0), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 3 factoid took 13 ms. Reduced automaton from 5 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-07 finished in 1220 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 G(p1))&&X(F(!p0)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 1 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 22:16:40] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:40] [INFO ] Implicit Places using invariants in 39 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 2 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 46 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 214 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), (OR (NOT p1) p0), true]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-08 finished in 277 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((p1||F((!p2 U (G(!p2)||(!p2&&G(p3))))))) U (!p2&&X((p1||F((!p2 U (G(!p2)||(!p2&&G(p3))))))))))||p0)))'
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 22:16:40] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:40] [INFO ] Implicit Places using invariants in 34 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 35 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 36 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-09
Product exploration explored 100000 steps with 3 reset in 230 ms.
Product exploration explored 100000 steps with 32 reset in 336 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) (NOT p3))))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 273 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 28678 steps (9 resets) in 61 ms. (462 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND p2 (NOT p1)) (AND (NOT p1) (NOT p3))))))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p1) p3))), (X (X (NOT (AND (NOT p2) (NOT p1) p3)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR p2 p3))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (OR p1 (NOT p2)) (OR p1 p3)))), (F (NOT p3)), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 665 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 240 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 22:16:43] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:43] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 22:16:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:43] [INFO ] Implicit Places using invariants and state equation in 55 ms returned []
Implicit Place search using SMT with State Equation took 93 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:16:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 466 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 401 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 872ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 873ms
Finished structural reductions in LTL mode , in 1 iterations and 967 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p3))))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 297 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 15460 steps (4 resets) in 18 ms. (813 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1) p3), (X (NOT p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT (OR (AND (NOT p1) p2) (AND (NOT p1) (NOT p3))))))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p2) p3))), (X (X (NOT (AND (NOT p1) (NOT p2) p3)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND (NOT p2) p3))), (F (NOT (OR p2 p3))), (F (NOT (AND (NOT p1) (NOT p2) p3))), (F p2), (F (NOT (AND (OR p1 (NOT p2)) (OR p1 p3)))), (F (NOT p3)), (F (NOT (OR (NOT p2) (NOT p3)))), (F (NOT p0)), (F p1)]
Knowledge based reduction with 5 factoid took 667 ms. Reduced automaton from 5 states, 13 edges and 4 AP (stutter sensitive) to 5 states, 13 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 264 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Stuttering acceptance computed with spot in 229 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Product exploration explored 100000 steps with 2 reset in 344 ms.
Product exploration explored 100000 steps with 2 reset in 377 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 221 ms :[(AND (NOT p0) p2), p2, (AND (NOT p1) p2), p2, (AND p2 (NOT p3))]
Support contains 5 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 21 transition count 18
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 5 place count 21 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 6 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 9 place count 18 transition count 15
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 12 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 17 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 17 transition count 14
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 16 rules in 4 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:16:47] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-03 22:16:47] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (OVERLAPS) 1/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 21 constraints, problems are : Problem set: 4 solved, 9 unsolved in 291 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 5/17 variables, 3/3 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 9/30 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/30 constraints. Problems are: Problem set: 4 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 30 constraints, problems are : Problem set: 4 solved, 9 unsolved in 185 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 9/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 480ms problems are : Problem set: 4 solved, 9 unsolved
Search for dead transitions found 4 dead transitions in 480ms
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 : 17/21 places, 10/18 transitions.
Graph (complete) has 19 edges and 17 vertex of which 13 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 13 /17 variables (removed 4) and now considering 10/10 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 13/21 places, 10/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 492 ms. Remains : 13/21 places, 10/18 transitions.
Built C files in :
/tmp/ltsmin5436022875486384495
[2025-06-03 22:16:47] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5436022875486384495
Running compilation step : cd /tmp/ltsmin5436022875486384495;'/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 114 ms.
Running link step : cd /tmp/ltsmin5436022875486384495;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin5436022875486384495;'/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/stateBased3387043515851942005.hoa' '--buchi-type=spotba'
LTSmin run took 243 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-09 finished in 7642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 2 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 21 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 5 rules applied. Total rules applied 12 place count 18 transition count 13
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 16 transition count 10
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 11 transition count 8
Applied a total of 24 rules in 3 ms. Remains 11 /25 variables (removed 14) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 11 cols
[2025-06-03 22:16:48] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:48] [INFO ] Implicit Places using invariants in 39 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 40 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 10 transition count 6
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 8 transition count 5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 7 transition count 5
Applied a total of 6 rules in 1 ms. Remains 7 /10 variables (removed 3) and now considering 5/8 (removed 3) transitions.
// Phase 1: matrix 5 rows 7 cols
[2025-06-03 22:16:48] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:48] [INFO ] Implicit Places using invariants in 32 ms returned []
[2025-06-03 22:16:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:48] [INFO ] Implicit Places using invariants and state equation in 27 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 7/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 7/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 93 ms :[p0, true, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-10 finished in 225 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(!p0) U X(X(X(!p1)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 22 transition count 18
Applied a total of 3 rules in 1 ms. Remains 22 /25 variables (removed 3) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 22 cols
[2025-06-03 22:16:48] [INFO ] Computed 5 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:48] [INFO ] Implicit Places using invariants in 60 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 62 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 21/25 places, 18/18 transitions.
Applied a total of 0 rules in 3 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 66 ms. Remains : 21/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 588 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-11
Product exploration explored 100000 steps with 16632 reset in 63 ms.
Product exploration explored 100000 steps with 16687 reset in 70 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 151 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 565 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
RANDOM walk for 4701 steps (0 resets) in 10 ms. (427 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 232 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 541 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 556 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Applied a total of 0 rules in 0 ms. Remains 21 /21 variables (removed 0) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 22:16:51] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:51] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 22:16:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:16:51] [INFO ] Implicit Places using invariants and state equation in 40 ms returned []
Implicit Place search using SMT with State Equation took 76 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-03 22:16:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 0/39 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 39/39 variables, and 25 constraints, problems are : Problem set: 0 solved, 17 unsolved in 392 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/20 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/20 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 1/21 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/21 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 18/39 variables, 21/25 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/39 variables, 17/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 0/39 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 39/39 variables, and 42 constraints, problems are : Problem set: 0 solved, 17 unsolved in 349 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 21/21 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 747ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 747ms
Finished structural reductions in LTL mode , in 1 iterations and 825 ms. Remains : 21/21 places, 18/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 106 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 565 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
RANDOM walk for 7280 steps (2 resets) in 14 ms. (485 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 3 factoid took 244 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 12 states, 17 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 519 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 604 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Stuttering acceptance computed with spot in 560 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Product exploration explored 100000 steps with 16667 reset in 59 ms.
Product exploration explored 100000 steps with 16670 reset in 76 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 490 ms :[p1, p1, p1, (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), p1, (AND p0 p1), (AND p0 p1), (AND p0 p1), p0]
Support contains 3 out of 21 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 21/21 places, 18/18 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 21 transition count 18
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 6 place count 21 transition count 18
Deduced a syphon composed of 9 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 21 transition count 18
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 12 place count 18 transition count 15
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 15 place count 18 transition count 15
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 17 place count 18 transition count 15
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 17 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 17 transition count 14
Deduced a syphon composed of 7 places in 0 ms
Applied a total of 19 rules in 6 ms. Remains 17 /21 variables (removed 4) and now considering 14/18 (removed 4) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:16:55] [INFO ] Redundant transitions in 0 ms returned []
Running 13 sub problems to find dead transitions.
// Phase 1: matrix 14 rows 17 cols
[2025-06-03 22:16:55] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/16 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/16 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 2 (OVERLAPS) 1/17 variables, 2/3 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 13 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD10 is UNSAT
At refinement iteration 5 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/21 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 31/31 variables, and 21 constraints, problems are : Problem set: 7 solved, 6 unsolved in 180 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 13/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 8/17 variables, 3/3 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/17 variables, 1/4 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/17 variables, 0/4 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 14/31 variables, 17/21 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/31 variables, 6/27 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/31 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/31 variables, 0/27 constraints. Problems are: Problem set: 7 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 31/31 variables, and 27 constraints, problems are : Problem set: 7 solved, 6 unsolved in 122 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 17/17 constraints, PredecessorRefiner: 6/13 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 306ms problems are : Problem set: 7 solved, 6 unsolved
Search for dead transitions found 7 dead transitions in 306ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 17/21 places, 7/18 transitions.
Graph (complete) has 16 edges and 17 vertex of which 10 are kept as prefixes of interest. Removing 7 places using SCC suffix rule.0 ms
Discarding 7 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 1 ms. Remains 10 /17 variables (removed 7) and now considering 7/7 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/21 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 319 ms. Remains : 10/21 places, 7/18 transitions.
Built C files in :
/tmp/ltsmin10484754302572418957
[2025-06-03 22:16:55] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10484754302572418957
Running compilation step : cd /tmp/ltsmin10484754302572418957;'/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 108 ms.
Running link step : cd /tmp/ltsmin10484754302572418957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10484754302572418957;'/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/stateBased14803294721032288786.hoa' '--buchi-type=spotba'
LTSmin run took 4846 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-11 finished in 12477 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||F(p1)))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 3 places :
Implicit places reduction removed 3 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 7 rules applied. Total rules applied 7 place count 22 transition count 14
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 18 transition count 14
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 3 Pre rules applied. Total rules applied 11 place count 18 transition count 11
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 17 place count 15 transition count 11
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 23 place count 12 transition count 8
Applied a total of 23 rules in 2 ms. Remains 12 /25 variables (removed 13) and now considering 8/18 (removed 10) transitions.
// Phase 1: matrix 8 rows 12 cols
[2025-06-03 22:17:00] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:00] [INFO ] Implicit Places using invariants in 31 ms returned [6, 11]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 32 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 10/25 places, 8/18 transitions.
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 1 rules applied. Total rules applied 1 place count 10 transition count 7
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 9 transition count 7
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 9 transition count 6
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 8 transition count 6
Applied a total of 4 rules in 1 ms. Remains 8 /10 variables (removed 2) and now considering 6/8 (removed 2) transitions.
// Phase 1: matrix 6 rows 8 cols
[2025-06-03 22:17:00] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:00] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 22:17:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:00] [INFO ] Implicit Places using invariants and state equation in 23 ms returned []
Implicit Place search using SMT with State Equation took 45 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 8/25 places, 6/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 80 ms. Remains : 8/25 places, 6/18 transitions.
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-12
Product exploration explored 100000 steps with 6962 reset in 80 ms.
Product exploration explored 100000 steps with 6299 reset in 157 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 496 steps (0 resets) in 4 ms. (99 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 277 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-03 22:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:02] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:17:02] [INFO ] [Real]Absence check using state equation in 4 ms returned sat
[2025-06-03 22:17:02] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:02] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:17:02] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 22:17:02] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:17:02] [INFO ] Added : 1 causal constraints over 1 iterations in 6 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 3 out of 8 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 8/8 places, 6/6 transitions.
Applied a total of 0 rules in 1 ms. Remains 8 /8 variables (removed 0) and now considering 6/6 (removed 0) transitions.
[2025-06-03 22:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:02] [INFO ] Implicit Places using invariants in 21 ms returned []
[2025-06-03 22:17:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:02] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 55 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:17:02] [INFO ] Redundant transitions in 0 ms returned []
Running 5 sub problems to find dead transitions.
[2025-06-03 22:17: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/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 0/14 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 14/14 variables, and 11 constraints, problems are : Problem set: 0 solved, 5 unsolved in 98 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 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 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 6/14 variables, 8/11 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/14 variables, 5/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 0/14 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 14/14 variables, and 16 constraints, problems are : Problem set: 0 solved, 5 unsolved in 75 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 8/8 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 177ms problems are : Problem set: 0 solved, 5 unsolved
Search for dead transitions found 0 dead transitions in 177ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 238 ms. Remains : 8/8 places, 6/6 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 496 steps (0 resets) in 4 ms. (99 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (OR (NOT p0) p1))), (F (NOT (AND (NOT p0) (NOT p1)))), (F p1), (F p0)]
Knowledge based reduction with 9 factoid took 280 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-06-03 22:17:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:03] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:17:03] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 22:17:03] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:03] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:17:03] [INFO ] [Nat]Absence check using state equation in 5 ms returned sat
[2025-06-03 22:17:03] [INFO ] Computed and/alt/rep : 5/6/5 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:17:03] [INFO ] Added : 1 causal constraints over 1 iterations in 5 ms. Result :sat
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5572 reset in 140 ms.
Product exploration explored 100000 steps with 6404 reset in 206 ms.
Built C files in :
/tmp/ltsmin4593059132897952406
[2025-06-03 22:17:03] [INFO ] Computing symmetric may disable matrix : 6 transitions.
[2025-06-03 22:17:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:03] [INFO ] Computing symmetric may enable matrix : 6 transitions.
[2025-06-03 22:17:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:03] [INFO ] Computing Do-Not-Accords matrix : 6 transitions.
[2025-06-03 22:17:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:03] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4593059132897952406
Running compilation step : cd /tmp/ltsmin4593059132897952406;'/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 86 ms.
Running link step : cd /tmp/ltsmin4593059132897952406;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin4593059132897952406;'/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/stateBased17044182619043043818.hoa' '--buchi-type=spotba'
LTSmin run took 685 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-12 finished in 3481 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(G(!p0))))'
Support contains 1 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 21 transition count 12
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 16 place count 15 transition count 10
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 20 place count 13 transition count 10
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 10 transition count 7
Applied a total of 26 rules in 1 ms. Remains 10 /25 variables (removed 15) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 10 cols
[2025-06-03 22:17:04] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:04] [INFO ] Implicit Places using invariants in 38 ms returned [6, 9]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 39 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 8/25 places, 7/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 8 transition count 5
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 6 transition count 5
Applied a total of 4 rules in 1 ms. Remains 6 /8 variables (removed 2) and now considering 5/7 (removed 2) transitions.
// Phase 1: matrix 5 rows 6 cols
[2025-06-03 22:17:04] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:04] [INFO ] Implicit Places using invariants in 20 ms returned []
[2025-06-03 22:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:04] [INFO ] Implicit Places using invariants and state equation in 24 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 6/25 places, 5/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 87 ms. Remains : 6/25 places, 5/18 transitions.
Stuttering acceptance computed with spot in 80 ms :[p0, true, p0]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-13
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-13 finished in 186 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&&(p1||G((F(!p2)&&F(p0)))))))'
Support contains 3 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 21 transition count 13
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 14 place count 16 transition count 13
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 14 place count 16 transition count 12
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 15 transition count 12
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 22 place count 12 transition count 9
Applied a total of 22 rules in 3 ms. Remains 12 /25 variables (removed 13) and now considering 9/18 (removed 9) transitions.
// Phase 1: matrix 9 rows 12 cols
[2025-06-03 22:17:04] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:04] [INFO ] Implicit Places using invariants in 29 ms returned [9]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 30 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 11/25 places, 9/18 transitions.
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 1 rules applied. Total rules applied 1 place count 11 transition count 8
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 10 transition count 8
Applied a total of 2 rules in 0 ms. Remains 10 /11 variables (removed 1) and now considering 8/9 (removed 1) transitions.
// Phase 1: matrix 8 rows 10 cols
[2025-06-03 22:17:04] [INFO ] Computed 3 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:04] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 22:17:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 10/25 places, 8/18 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 10/25 places, 8/18 transitions.
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-14
Product exploration explored 100000 steps with 5658 reset in 79 ms.
Product exploration explored 100000 steps with 5676 reset in 94 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 171 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
RANDOM walk for 17480 steps (7 resets) in 18 ms. (920 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 15 factoid took 445 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 190 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
[2025-06-03 22:17:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:06] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:17:06] [INFO ] [Real]Absence check using state equation in 7 ms returned sat
[2025-06-03 22:17:06] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:06] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 22:17:06] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 22:17:06] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-03 22:17:06] [INFO ] Added : 4 causal constraints over 1 iterations in 10 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 10 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 10/10 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 10 /10 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-03 22:17:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:06] [INFO ] Implicit Places using invariants in 23 ms returned []
[2025-06-03 22:17:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:06] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:17:06] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 22:17: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/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/18 variables, and 13 constraints, problems are : Problem set: 0 solved, 7 unsolved in 142 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/9 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 1/10 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/10 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 8/18 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/18 variables, and 20 constraints, problems are : Problem set: 0 solved, 7 unsolved in 131 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 10/10 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 279ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 280ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 343 ms. Remains : 10/10 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 173 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
RANDOM walk for 11646 steps (5 resets) in 13 ms. (831 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND (NOT p0) p1 p2), (X p2), (X (NOT (AND p0 p2 (NOT p1)))), (X (OR (NOT p0) (NOT p1))), (X (NOT p0)), (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X p1), (X (X p2)), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (OR (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p1))]
False Knowledge obtained : [(F (NOT (OR (AND (NOT p0) p2) (AND p2 (NOT p1))))), (F p0), (F (NOT p1)), (F (NOT (OR (NOT p0) p1))), (F (NOT p2)), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1)))]
Knowledge based reduction with 15 factoid took 536 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 4 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
[2025-06-03 22:17:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:08] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 22:17:08] [INFO ] [Real]Absence check using state equation in 8 ms returned sat
[2025-06-03 22:17:08] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:08] [INFO ] [Nat]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 22:17:08] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 22:17:08] [INFO ] Computed and/alt/rep : 7/7/7 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 22:17:08] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 187 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (AND (NOT p0) p2) (AND (NOT p1) p2)), (NOT p0)]
Product exploration explored 100000 steps with 5714 reset in 135 ms.
Product exploration explored 100000 steps with 5711 reset in 159 ms.
Built C files in :
/tmp/ltsmin4146377477320429791
[2025-06-03 22:17:08] [INFO ] Computing symmetric may disable matrix : 8 transitions.
[2025-06-03 22:17:08] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:08] [INFO ] Computing symmetric may enable matrix : 8 transitions.
[2025-06-03 22:17:08] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:08] [INFO ] Computing Do-Not-Accords matrix : 8 transitions.
[2025-06-03 22:17:08] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:08] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4146377477320429791
Running compilation step : cd /tmp/ltsmin4146377477320429791;'/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 95 ms.
Running link step : cd /tmp/ltsmin4146377477320429791;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin4146377477320429791;'/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/stateBased2196957480190322249.hoa' '--buchi-type=spotba'
LTSmin run took 234 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-14 finished in 4491 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U (G(!p1) U p2))||X(F(p0))))'
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 4 places :
Implicit places reduction removed 4 places
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 21 transition count 18
Applied a total of 4 rules in 0 ms. Remains 21 /25 variables (removed 4) and now considering 18/18 (removed 0) transitions.
// Phase 1: matrix 18 rows 21 cols
[2025-06-03 22:17:09] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:09] [INFO ] Implicit Places using invariants in 33 ms returned [14]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 34 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 20/25 places, 18/18 transitions.
Applied a total of 0 rules in 1 ms. Remains 20 /20 variables (removed 0) and now considering 18/18 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 37 ms. Remains : 20/25 places, 18/18 transitions.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-15
Product exploration explored 100000 steps with 8231 reset in 151 ms.
Product exploration explored 100000 steps with 8390 reset in 111 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 13 factoid took 370 ms. Reduced automaton from 4 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 216 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 25338 steps (6 resets) in 33 ms. (745 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) (NOT p0)), (X p2), (X (NOT (AND (NOT p2) p1 (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND (NOT p2) p1 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (F p1), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 614 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 234 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Support contains 2 out of 20 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 20/20 places, 18/18 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 20 transition count 13
Reduce places removed 5 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 7 rules applied. Total rules applied 12 place count 15 transition count 11
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 13 transition count 11
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 14 place count 13 transition count 8
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 20 place count 10 transition count 8
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 3 with 2 rules applied. Total rules applied 22 place count 9 transition count 7
Applied a total of 22 rules in 2 ms. Remains 9 /20 variables (removed 11) and now considering 7/18 (removed 11) transitions.
// Phase 1: matrix 7 rows 9 cols
[2025-06-03 22:17:11] [INFO ] Computed 3 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:11] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 22:17:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:11] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:17:11] [INFO ] Redundant transitions in 0 ms returned []
Running 6 sub problems to find dead transitions.
[2025-06-03 22:17:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (OVERLAPS) 0/16 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 16/16 variables, and 12 constraints, problems are : Problem set: 0 solved, 6 unsolved in 96 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (OVERLAPS) 1/9 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 7/16 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/16 variables, 6/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/16 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 16/16 variables, and 18 constraints, problems are : Problem set: 0 solved, 6 unsolved in 143 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 243ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 243ms
Starting structural reductions in SI_LTL mode, iteration 1 : 9/20 places, 7/18 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 328 ms. Remains : 9/20 places, 7/18 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 172 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 223 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
RANDOM walk for 10307 steps (4 resets) in 11 ms. (858 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 p1))), (X (NOT (AND (NOT p0) p1))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND p0 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1)))), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 13 factoid took 426 ms. Reduced automaton from 5 states, 13 edges and 2 AP (stutter insensitive) to 5 states, 13 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 199 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 208 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Stuttering acceptance computed with spot in 217 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0)]
Product exploration explored 100000 steps with 15131 reset in 76 ms.
Product exploration explored 100000 steps with 15115 reset in 149 ms.
Built C files in :
/tmp/ltsmin3503456717895754049
[2025-06-03 22:17:13] [INFO ] Computing symmetric may disable matrix : 7 transitions.
[2025-06-03 22:17:13] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:13] [INFO ] Computing symmetric may enable matrix : 7 transitions.
[2025-06-03 22:17:13] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:13] [INFO ] Computing Do-Not-Accords matrix : 7 transitions.
[2025-06-03 22:17:13] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:17:13] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3503456717895754049
Running compilation step : cd /tmp/ltsmin3503456717895754049;'/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 95 ms.
Running link step : cd /tmp/ltsmin3503456717895754049;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3503456717895754049;'/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/stateBased16298964899437477342.hoa' '--buchi-type=spotba'
LTSmin run took 133 ms.
FORMULA ClientsAndServers-PT-N0020P4-LTLFireability-15 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-15 finished in 4524 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(p1))))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLFireability-03
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0), (OR (NOT p0) (NOT p1))]
Support contains 5 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 23 transition count 16
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 21 transition count 14
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 18 transition count 13
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 3 with 2 rules applied. Total rules applied 14 place count 17 transition count 12
Applied a total of 14 rules in 3 ms. Remains 17 /25 variables (removed 8) and now considering 12/18 (removed 6) transitions.
// Phase 1: matrix 12 rows 17 cols
[2025-06-03 22:17:13] [INFO ] Computed 6 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:13] [INFO ] Implicit Places using invariants in 52 ms returned [12]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 16/25 places, 12/18 transitions.
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 1 rules applied. Total rules applied 1 place count 16 transition count 11
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 15 transition count 11
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 2 with 2 rules applied. Total rules applied 4 place count 14 transition count 10
Applied a total of 4 rules in 2 ms. Remains 14 /16 variables (removed 2) and now considering 10/12 (removed 2) transitions.
// Phase 1: matrix 10 rows 14 cols
[2025-06-03 22:17:13] [INFO ] Computed 5 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:13] [INFO ] Implicit Places using invariants in 36 ms returned []
[2025-06-03 22:17:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:13] [INFO ] Implicit Places using invariants and state equation in 33 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 14/25 places, 10/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 131 ms. Remains : 14/25 places, 10/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-03
Product exploration explored 100000 steps with 3078 reset in 145 ms.
Product exploration explored 100000 steps with 3067 reset in 185 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 139 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 4206 steps (2 resets) in 7 ms. (525 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (AND p0 (NOT p1))), (X (NOT p1)), (X (X (NOT p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (AND p0 (NOT p1))))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 11 factoid took 192 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-03 22:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:15] [INFO ] [Real]Absence check using 3 positive place invariants in 2 ms returned sat
[2025-06-03 22:17:15] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 2 ms returned sat
[2025-06-03 22:17:15] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 22:17:15] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:17:15] [INFO ] Added : 7 causal constraints over 2 iterations in 13 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 2 out of 14 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Applied a total of 0 rules in 9 ms. Remains 14 /14 variables (removed 0) and now considering 10/10 (removed 0) transitions.
[2025-06-03 22:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:15] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-03 22:17:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:15] [INFO ] Implicit Places using invariants and state equation in 45 ms returned []
Implicit Place search using SMT with State Equation took 78 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-06-03 22:17: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/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 24/24 variables, and 19 constraints, problems are : Problem set: 0 solved, 9 unsolved in 263 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/13 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/14 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/14 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/14 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 10/24 variables, 14/19 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/24 variables, 9/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/24 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 24/24 variables, and 28 constraints, problems are : Problem set: 0 solved, 9 unsolved in 214 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 14/14 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 482ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 482ms
Finished structural reductions in LTL mode , in 1 iterations and 569 ms. Remains : 14/14 places, 10/10 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 131 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 2573 steps (1 resets) in 4 ms. (514 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p1), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1)]
Knowledge based reduction with 2 factoid took 98 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-06-03 22:17:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:17:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-03 22:17:16] [INFO ] [Real]Absence check using 3 positive and 2 generalized place invariants in 1 ms returned sat
[2025-06-03 22:17:16] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 22:17:16] [INFO ] Computed and/alt/rep : 9/11/9 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-03 22:17:16] [INFO ] Added : 7 causal constraints over 2 iterations in 23 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 100 ms :[(NOT p1), (NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 3091 reset in 143 ms.
Product exploration explored 100000 steps with 3050 reset in 168 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (NOT p1)]
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 13 transition count 10
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 3 place count 13 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 13 transition count 10
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 12 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 12 transition count 9
Deduced a syphon composed of 3 places in 0 ms
Applied a total of 7 rules in 2 ms. Remains 12 /14 variables (removed 2) and now considering 9/10 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:17:16] [INFO ] Redundant transitions in 0 ms returned []
Running 8 sub problems to find dead transitions.
// Phase 1: matrix 9 rows 12 cols
[2025-06-03 22:17:16] [INFO ] Computed 4 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
At refinement iteration 5 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/16 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 21/21 variables, and 16 constraints, problems are : Problem set: 3 solved, 5 unsolved in 115 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 5 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 1/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/8 variables, 0/1 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 2 (OVERLAPS) 4/12 variables, 3/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/12 variables, 0/4 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 9/21 variables, 12/16 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/21 variables, 5/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/21 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 0/21 variables, 0/21 constraints. Problems are: Problem set: 3 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 21/21 variables, and 21 constraints, problems are : Problem set: 3 solved, 5 unsolved in 113 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 5/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 232ms problems are : Problem set: 3 solved, 5 unsolved
Search for dead transitions found 3 dead transitions in 232ms
Found 3 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 3 transitions
Dead transitions reduction (with SMT) removed 3 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 12/14 places, 6/10 transitions.
Graph (complete) has 16 edges and 12 vertex of which 9 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 9 /12 variables (removed 3) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 9/14 places, 6/10 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 240 ms. Remains : 9/14 places, 6/10 transitions.
Built C files in :
/tmp/ltsmin12631456662533917178
[2025-06-03 22:17:17] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12631456662533917178
Running compilation step : cd /tmp/ltsmin12631456662533917178;'/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 91 ms.
Running link step : cd /tmp/ltsmin12631456662533917178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12631456662533917178;'/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/stateBased7231147493790853206.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 14 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 14/14 places, 10/10 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 13 transition count 10
Applied a total of 1 rules in 1 ms. Remains 13 /14 variables (removed 1) and now considering 10/10 (removed 0) transitions.
// Phase 1: matrix 10 rows 13 cols
[2025-06-03 22:17:32] [INFO ] Computed 4 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:32] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-03 22:17:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:17:32] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 9 sub problems to find dead transitions.
[2025-06-03 22:17:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/23 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/23 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 23/23 variables, and 17 constraints, problems are : Problem set: 0 solved, 9 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/12 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 1/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 10/23 variables, 13/17 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/23 variables, 9/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 0/23 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 23/23 variables, and 26 constraints, problems are : Problem set: 0 solved, 9 unsolved in 236 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 13/13 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 429ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 429ms
Starting structural reductions in LTL mode, iteration 1 : 13/14 places, 10/10 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 491 ms. Remains : 13/14 places, 10/10 transitions.
Built C files in :
/tmp/ltsmin15014911990371573608
[2025-06-03 22:17:32] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15014911990371573608
Running compilation step : cd /tmp/ltsmin15014911990371573608;'/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 128 ms.
Running link step : cd /tmp/ltsmin15014911990371573608;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15014911990371573608;'/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/stateBased7946095429936720421.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 22:17:47] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:17:47] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:17:47] [INFO ] Time to serialize gal into /tmp/LTL17772006139367262439.gal : 1 ms
[2025-06-03 22:17:47] [INFO ] Time to serialize properties into /tmp/LTL5679450636593553415.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/LTL17772006139367262439.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6475137393689033808.hoa' '-atoms' '/tmp/LTL5679450636593553415.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/LTL5679450636593553415.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6475137393689033808.hoa
Detected timeout of ITS tools.
[2025-06-03 22:18:03] [INFO ] Flatten gal took : 2 ms
[2025-06-03 22:18:03] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:18:03] [INFO ] Time to serialize gal into /tmp/LTL6306001410816045776.gal : 0 ms
[2025-06-03 22:18:03] [INFO ] Time to serialize properties into /tmp/LTL9186237943582024223.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/LTL6306001410816045776.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9186237943582024223.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 : !((X((F("(((CG<1)||(CwG<1))&&(MpG<1))"))&&(F("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : X(G!"(((CG<1)||(CwG<1))&&(MpG<1))" | G!"((SA>=1)&&(SwA>=1))")
Detected timeout of ITS tools.
[2025-06-03 22:18:18] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:18:18] [INFO ] Applying decomposition
[2025-06-03 22:18:18] [INFO ] Flatten gal took : 1 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/graph9585897528422835992.txt' '-o' '/tmp/graph9585897528422835992.bin' '-w' '/tmp/graph9585897528422835992.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph9585897528422835992.bin' '-l' '-1' '-v' '-w' '/tmp/graph9585897528422835992.weights' '-q' '0' '-e' '0.001'
[2025-06-03 22:18:18] [INFO ] Decomposing Gal with order
[2025-06-03 22:18:18] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 22:18:18] [INFO ] Flatten gal took : 2 ms
[2025-06-03 22:18:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 22:18:18] [INFO ] Time to serialize gal into /tmp/LTL3388910773761340157.gal : 1 ms
[2025-06-03 22:18:18] [INFO ] Time to serialize properties into /tmp/LTL6624877858683373964.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/LTL3388910773761340157.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6624877858683373964.ltl' '-c' '-stutter-deadlock'

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...254
Read 1 LTL properties
Checking formula 0 : !((X((F("(((u0.CG<1)||(i4.u5.CwG<1))&&(u3.MpG<1))"))&&(F("((u2.SA>=1)&&(u4.SwA>=1))")))))
Formula 0 simplified : X(G!"(((u0.CG<1)||(i4.u5.CwG<1))&&(u3.MpG<1))" | G!"((u2.SA>=1)&&(u4.SwA>=1))")
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-03 finished in 79550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(X(F(p0)))))&&F(p1)))'
Found a Shortening insensitive property : ClientsAndServers-PT-N0020P4-LTLFireability-06
Stuttering acceptance computed with spot in 234 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 25 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 25/25 places, 18/18 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 23 transition count 15
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 9 place count 20 transition count 14
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 19 transition count 14
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 19 transition count 13
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 18 transition count 13
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 18 place count 15 transition count 10
Applied a total of 18 rules in 6 ms. Remains 15 /25 variables (removed 10) and now considering 10/18 (removed 8) transitions.
// Phase 1: matrix 10 rows 15 cols
[2025-06-03 22:18:33] [INFO ] Computed 6 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:18:33] [INFO ] Implicit Places using invariants in 39 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 41 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 14/25 places, 10/18 transitions.
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 1 rules applied. Total rules applied 1 place count 14 transition count 9
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 13 transition count 9
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 13 transition count 8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 12 transition count 8
Applied a total of 4 rules in 3 ms. Remains 12 /14 variables (removed 2) and now considering 8/10 (removed 2) transitions.
// Phase 1: matrix 8 rows 12 cols
[2025-06-03 22:18:33] [INFO ] Computed 5 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:18:33] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 22:18:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:18:33] [INFO ] Implicit Places using invariants and state equation in 34 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 12/25 places, 8/18 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 110 ms. Remains : 12/25 places, 8/18 transitions.
Running random walk in product with property : ClientsAndServers-PT-N0020P4-LTLFireability-06
Product exploration explored 100000 steps with 7303 reset in 122 ms.
Product exploration explored 100000 steps with 7306 reset in 147 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 120 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1304 steps (0 resets) in 5 ms. (217 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 173 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 258 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 22:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Real]Absence check using state equation in 5 ms returned sat
[2025-06-03 22:18:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 22:18:35] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:18:35] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 22:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:35] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 22:18:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:35] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 22:18:35] [INFO ] [Nat]Absence check using state equation in 8 ms returned sat
[2025-06-03 22:18:35] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:18:35] [INFO ] Added : 4 causal constraints over 1 iterations in 7 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-03 22:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:18:35] [INFO ] Implicit Places using invariants in 27 ms returned []
[2025-06-03 22:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:18:35] [INFO ] Implicit Places using invariants and state equation in 31 ms returned []
Implicit Place search using SMT with State Equation took 60 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2025-06-03 22:18:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 163 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 147 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 315ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 316ms
Finished structural reductions in LTL mode , in 1 iterations and 377 ms. Remains : 12/12 places, 8/8 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 90 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 212 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1304 steps (0 resets) in 4 ms. (260 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (NOT p1)), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0)]
Knowledge based reduction with 3 factoid took 124 ms. Reduced automaton from 6 states, 7 edges and 2 AP (stutter sensitive) to 6 states, 7 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 223 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-03 22:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:36] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 0 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Real]Absence check using state equation in 6 ms returned sat
[2025-06-03 22:18:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 2 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 22:18:36] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:18:36] [INFO ] Added : 6 causal constraints over 2 iterations in 9 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-03 22:18:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:36] [INFO ] [Real]Absence check using 4 positive place invariants in 2 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Real]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Real]Absence check using state equation in 9 ms returned sat
[2025-06-03 22:18:36] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-03 22:18:36] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Nat]Absence check using 4 positive and 1 generalized place invariants in 1 ms returned sat
[2025-06-03 22:18:36] [INFO ] [Nat]Absence check using state equation in 7 ms returned sat
[2025-06-03 22:18:36] [INFO ] Computed and/alt/rep : 7/9/7 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-03 22:18:36] [INFO ] Added : 4 causal constraints over 1 iterations in 8 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 259 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 7348 reset in 71 ms.
Product exploration explored 100000 steps with 7408 reset in 80 ms.
Applying partial POR strategy [false, false, true, false, false, true]
Stuttering acceptance computed with spot in 240 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 1 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-03 22:18:37] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
[2025-06-03 22:18:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 141 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 287ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 295 ms. Remains : 12/12 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin8258713312952979078
[2025-06-03 22:18:37] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8258713312952979078
Running compilation step : cd /tmp/ltsmin8258713312952979078;'/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 135 ms.
Running link step : cd /tmp/ltsmin8258713312952979078;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin8258713312952979078;'/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/stateBased2068205726910009936.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 12 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 12/12 places, 8/8 transitions.
Applied a total of 0 rules in 0 ms. Remains 12 /12 variables (removed 0) and now considering 8/8 (removed 0) transitions.
[2025-06-03 22:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:18:52] [INFO ] Implicit Places using invariants in 25 ms returned []
[2025-06-03 22:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-03 22:18:52] [INFO ] Implicit Places using invariants and state equation in 30 ms returned []
Implicit Place search using SMT with State Equation took 56 ms to find 0 implicit places.
Running 7 sub problems to find dead transitions.
[2025-06-03 22:18:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 0/20 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 20/20 variables, and 17 constraints, problems are : Problem set: 0 solved, 7 unsolved in 123 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/11 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/11 variables, 1/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/11 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 1/12 variables, 2/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/12 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 8/20 variables, 12/17 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/20 variables, 7/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 0/20 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 20/20 variables, and 24 constraints, problems are : Problem set: 0 solved, 7 unsolved in 134 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 12/12 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 261ms problems are : Problem set: 0 solved, 7 unsolved
Search for dead transitions found 0 dead transitions in 265ms
Finished structural reductions in LTL mode , in 1 iterations and 321 ms. Remains : 12/12 places, 8/8 transitions.
Built C files in :
/tmp/ltsmin9060115345972875340
[2025-06-03 22:18:53] [INFO ] Built C files in 0ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9060115345972875340
Running compilation step : cd /tmp/ltsmin9060115345972875340;'/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 92 ms.
Running link step : cd /tmp/ltsmin9060115345972875340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9060115345972875340;'/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/stateBased7643895198180246538.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-03 22:19:08] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:19:08] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:19:08] [INFO ] Time to serialize gal into /tmp/LTL14203542536267827324.gal : 0 ms
[2025-06-03 22:19:08] [INFO ] Time to serialize properties into /tmp/LTL13541663145538413803.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/LTL14203542536267827324.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9292449442812291405.hoa' '-atoms' '/tmp/LTL13541663145538413803.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13541663145538413803.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9292449442812291405.hoa
Detected timeout of ITS tools.
[2025-06-03 22:19:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:19:23] [INFO ] Flatten gal took : 1 ms
[2025-06-03 22:19:23] [INFO ] Time to serialize gal into /tmp/LTL3189009716090781041.gal : 1 ms
[2025-06-03 22:19:23] [INFO ] Time to serialize properties into /tmp/LTL11996470927333544896.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/LTL3189009716090781041.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11996470927333544896.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(X(X(X(F("((SG>=1)&&(SwG>=1))"))))))&&(F("((CG>=1)&&(CwG>=1))"))))
Formula 0 simplified : XXXXG!"((SG>=1)&&(SwG>=1))" | G!"((CG>=1)&&(CwG>=1))"
Detected timeout of ITS tools.
[2025-06-03 22:19:38] [INFO ] Flatten gal took : 2 ms
[2025-06-03 22:19:38] [INFO ] Applying decomposition
[2025-06-03 22:19:38] [INFO ] Flatten gal took : 2 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/graph8184433827638830601.txt' '-o' '/tmp/graph8184433827638830601.bin' '-w' '/tmp/graph8184433827638830601.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8184433827638830601.bin' '-l' '-1' '-v' '-w' '/tmp/graph8184433827638830601.weights' '-q' '0' '-e' '0.001'
[2025-06-03 22:19:38] [INFO ] Decomposing Gal with order
[2025-06-03 22:19:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 22:19:38] [INFO ] Flatten gal took : 3 ms
[2025-06-03 22:19:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-03 22:19:38] [INFO ] Time to serialize gal into /tmp/LTL13673913787968490808.gal : 1 ms
[2025-06-03 22:19:38] [INFO ] Time to serialize properties into /tmp/LTL1147847573853453958.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/LTL13673913787968490808.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1147847573853453958.ltl' '-c' '-stutter-deadlock'

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...255
Read 1 LTL properties
Checking formula 0 : !(((X(X(X(X(F("((u1.SG>=1)&&(u0.SwG>=1))"))))))&&(F("((u0.CG>=1)&&(u2.CwG>=1))"))))
Formula 0 simplified : XXXXG!"((u1.SG>=1)&&(u0.SwG>=1))" | G!"((u0.CG>=1)&&(u2.CwG>=1))"
Detected timeout of ITS tools.
Treatment of property ClientsAndServers-PT-N0020P4-LTLFireability-06 finished in 80343 ms.
[2025-06-03 22:19:53] [INFO ] Flatten gal took : 4 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15469449691533115426
[2025-06-03 22:19:53] [INFO ] Computing symmetric may disable matrix : 18 transitions.
[2025-06-03 22:19:53] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:19:53] [INFO ] Computing symmetric may enable matrix : 18 transitions.
[2025-06-03 22:19:53] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:19:53] [INFO ] Computing Do-Not-Accords matrix : 18 transitions.
[2025-06-03 22:19:53] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-03 22:19:53] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15469449691533115426
Running compilation step : cd /tmp/ltsmin15469449691533115426;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '360' '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'
[2025-06-03 22:19:53] [INFO ] Applying decomposition
[2025-06-03 22:19:53] [INFO ] Flatten gal took : 4 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/graph12255467149780022528.txt' '-o' '/tmp/graph12255467149780022528.bin' '-w' '/tmp/graph12255467149780022528.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12255467149780022528.bin' '-l' '-1' '-v' '-w' '/tmp/graph12255467149780022528.weights' '-q' '0' '-e' '0.001'
[2025-06-03 22:19:53] [INFO ] Decomposing Gal with order
[2025-06-03 22:19:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-03 22:19:53] [INFO ] Removed a total of 1 redundant transitions.
[2025-06-03 22:19:53] [INFO ] Flatten gal took : 4 ms
[2025-06-03 22:19:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-03 22:19:53] [INFO ] Time to serialize gal into /tmp/LTLFireability13851748211872700285.gal : 1 ms
[2025-06-03 22:19:53] [INFO ] Time to serialize properties into /tmp/LTLFireability7229533889211571429.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/LTLFireability13851748211872700285.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7229533889211571429.ltl' '-c' '-stutter-deadlock'

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 2 LTL properties
Checking formula 0 : !((X((F("(((i2.u4.CG<1)||(u6.CwG<1))&&(i1.u2.MpG<1))"))&&(F("((u5.SA>=1)&&(u5.SwA>=1))")))))
Formula 0 simplified : X(G!"(((i2.u4.CG<1)||(u6.CwG<1))&&(i1.u2.MpG<1))" | G!"((u5.SA>=1)&&(u5.SwA>=1))")
Compilation finished in 201 ms.
Running link step : cd /tmp/ltsmin15469449691533115426;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin15469449691533115426;'/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((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: LTL layer: formula: X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: "X((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.008: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.008: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.016: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.094: DFS-FIFO for weak LTL, using special progress label 23
pins2lts-mc-linux64( 0/ 8), 0.094: There are 24 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.094: State length is 26, there are 24 groups
pins2lts-mc-linux64( 0/ 8), 0.094: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.094: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.094: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.094: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.219: ~112 levels ~960 states ~5416 transitions
pins2lts-mc-linux64( 7/ 8), 0.367: ~221 levels ~1920 states ~14496 transitions
pins2lts-mc-linux64( 5/ 8), 0.728: ~434 levels ~3840 states ~31232 transitions
pins2lts-mc-linux64( 7/ 8), 1.011: ~826 levels ~7680 states ~51480 transitions
pins2lts-mc-linux64( 7/ 8), 1.094: ~826 levels ~15360 states ~64272 transitions
pins2lts-mc-linux64( 7/ 8), 1.270: ~889 levels ~30720 states ~91664 transitions
pins2lts-mc-linux64( 7/ 8), 1.506: ~1675 levels ~61440 states ~168112 transitions
pins2lts-mc-linux64( 7/ 8), 1.835: ~1675 levels ~122880 states ~342840 transitions
pins2lts-mc-linux64( 7/ 8), 2.444: ~1675 levels ~245760 states ~696928 transitions
pins2lts-mc-linux64( 7/ 8), 3.503: ~1675 levels ~491520 states ~1434824 transitions
pins2lts-mc-linux64( 2/ 8), 5.176: ~1674 levels ~983040 states ~2951320 transitions
pins2lts-mc-linux64( 6/ 8), 7.610: ~1676 levels ~1966080 states ~5849160 transitions
pins2lts-mc-linux64( 2/ 8), 10.837: ~1674 levels ~3932160 states ~11763120 transitions
pins2lts-mc-linux64( 7/ 8), 16.910: ~1675 levels ~7864320 states ~22066384 transitions
pins2lts-mc-linux64( 2/ 8), 31.595: ~1680 levels ~15728640 states ~50327128 transitions
pins2lts-mc-linux64( 2/ 8), 58.284: ~1680 levels ~31457280 states ~102711584 transitions
pins2lts-mc-linux64( 2/ 8), 113.034: ~1680 levels ~62914560 states ~206365432 transitions
pins2lts-mc-linux64( 2/ 8), 226.248: ~1680 levels ~125829120 states ~405919392 transitions
pins2lts-mc-linux64( 1/ 8), 271.428: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 271.485:
pins2lts-mc-linux64( 0/ 8), 271.485: mean standard work distribution: 2.9% (states) 5.1% (transitions)
pins2lts-mc-linux64( 0/ 8), 271.486:
pins2lts-mc-linux64( 0/ 8), 271.486: Explored 136736730 states 457370727 transitions, fanout: 3.345
pins2lts-mc-linux64( 0/ 8), 271.486: Total exploration time 271.380 sec (271.320 sec minimum, 271.354 sec on average)
pins2lts-mc-linux64( 0/ 8), 271.486: States per second: 503857, Transitions per second: 1685352
pins2lts-mc-linux64( 0/ 8), 271.486:
pins2lts-mc-linux64( 0/ 8), 271.486: Progress states detected: 0
pins2lts-mc-linux64( 0/ 8), 271.486: Redundant explorations: 72.7011
pins2lts-mc-linux64( 0/ 8), 271.486:
pins2lts-mc-linux64( 0/ 8), 271.486: Queue width: 8B, total height: 13389, memory: 0.10MB
pins2lts-mc-linux64( 0/ 8), 271.486: Tree memory: 860.1MB, 11.4 B/state, compr.: 10.7%
pins2lts-mc-linux64( 0/ 8), 271.486: Tree fill ratio (roots/leafs): 58.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 271.486: Stored 19 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 271.486: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 271.486: Est. total memory use: 860.2MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15469449691533115426;'/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((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15469449691533115426;'/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((<>((LTLAPp0==true))&&<>((LTLAPp1==true))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-03 22:41:57] [INFO ] Flatten gal took : 3 ms
[2025-06-03 22:41:57] [INFO ] Time to serialize gal into /tmp/LTLFireability5761480251065216633.gal : 1 ms
[2025-06-03 22:41:57] [INFO ] Time to serialize properties into /tmp/LTLFireability15933456491930220743.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/LTLFireability5761480251065216633.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15933456491930220743.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 : !((X((F("(((CG<1)||(CwG<1))&&(MpG<1))"))&&(F("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : X(G!"(((CG<1)||(CwG<1))&&(MpG<1))" | G!"((SA>=1)&&(SwA>=1))")
Detected timeout of ITS tools.
[2025-06-03 23:04:01] [INFO ] Flatten gal took : 3 ms
[2025-06-03 23:04:01] [INFO ] Input system was already deterministic with 18 transitions.
[2025-06-03 23:04:01] [INFO ] Transformed 25 places.
[2025-06-03 23:04:01] [INFO ] Transformed 18 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-03 23:04:01] [INFO ] Time to serialize gal into /tmp/LTLFireability7340314496984977356.gal : 1 ms
[2025-06-03 23:04:01] [INFO ] Time to serialize properties into /tmp/LTLFireability10172995318350535221.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/LTLFireability7340314496984977356.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10172995318350535221.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((F("(((CG<1)||(CwG<1))&&(MpG<1))"))&&(F("((SA>=1)&&(SwA>=1))")))))
Formula 0 simplified : X(G!"(((CG<1)||(CwG<1))&&(MpG<1))" | G!"((SA>=1)&&(SwA>=1))")

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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ClientsAndServers-PT-N0020P4"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is ClientsAndServers-PT-N0020P4, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853814100540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ClientsAndServers-PT-N0020P4.tgz
mv ClientsAndServers-PT-N0020P4 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;