About the Execution of ITS-Tools for HirschbergSinclair-PT-30
| 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 | ?TFFFFFTFFFFF??? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r114-tall-174876422000099.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 HirschbergSinclair-PT-30, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r114-tall-174876422000099
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 12K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 94K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 8.0K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 5.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 32K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 20K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 142K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 100K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 2.0K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 4.1K 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 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 357K 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 HirschbergSinclair-PT-30-LTLCardinality-00
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-01
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-02
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-03
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-04
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-05
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-06
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-07
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-08
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-09
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-10
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-11
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-12
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-13
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-14
FORMULA_NAME HirschbergSinclair-PT-30-LTLCardinality-15
=== Now, execution of the tool begins
BK_START 1748780417403
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=HirschbergSinclair-PT-30
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202505121319
[2025-06-01 12:20:18] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-01 12:20:18] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 12:20:19] [INFO ] Load time of PNML (sax parser for PT used): 138 ms
[2025-06-01 12:20:19] [INFO ] Transformed 670 places.
[2025-06-01 12:20:19] [INFO ] Transformed 605 transitions.
[2025-06-01 12:20:19] [INFO ] Parsed PT model containing 670 places and 605 transitions and 1849 arcs in 294 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 670 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 670/670 places, 605/605 transitions.
Reduce places removed 29 places and 0 transitions.
Iterating post reduction 0 with 29 rules applied. Total rules applied 29 place count 641 transition count 605
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 51 place count 619 transition count 583
Iterating global reduction 1 with 22 rules applied. Total rules applied 73 place count 619 transition count 583
Discarding 22 places :
Symmetric choice reduction at 1 with 22 rule applications. Total rules 95 place count 597 transition count 561
Iterating global reduction 1 with 22 rules applied. Total rules applied 117 place count 597 transition count 561
Applied a total of 117 rules in 192 ms. Remains 597 /670 variables (removed 73) and now considering 561/605 (removed 44) transitions.
// Phase 1: matrix 561 rows 597 cols
[2025-06-01 12:20:19] [INFO ] Computed 36 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:20:20] [INFO ] Implicit Places using invariants in 559 ms returned []
[2025-06-01 12:20:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:20:28] [INFO ] Implicit Places using invariants and state equation in 7816 ms returned []
Implicit Place search using SMT with State Equation took 8424 ms to find 0 implicit places.
Running 531 sub problems to find dead transitions.
[2025-06-01 12:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (OVERLAPS) 2/568 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (OVERLAPS) 29/597 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1158 variables, and 36 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 531 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/566 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/566 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 2 (OVERLAPS) 2/568 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/568 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 4 (OVERLAPS) 29/597 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/597 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 6 (OVERLAPS) 561/1158 variables, 597/633 constraints. Problems are: Problem set: 0 solved, 531 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1158 variables, 531/1164 constraints. Problems are: Problem set: 0 solved, 531 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1158/1158 variables, and 1164 constraints, problems are : Problem set: 0 solved, 531 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 531/531 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60271ms problems are : Problem set: 0 solved, 531 unsolved
Search for dead transitions found 0 dead transitions in 60297ms
Starting structural reductions in LTL mode, iteration 1 : 597/670 places, 561/605 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68957 ms. Remains : 597/670 places, 561/605 transitions.
Support contains 50 out of 597 places after structural reductions.
[2025-06-01 12:21:28] [INFO ] Flatten gal took : 106 ms
[2025-06-01 12:21:28] [INFO ] Flatten gal took : 68 ms
[2025-06-01 12:21:29] [INFO ] Input system was already deterministic with 561 transitions.
Support contains 48 out of 597 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (64 resets) in 2185 ms. (18 steps per ms) remains 12/36 properties
BEST_FIRST walk for 40004 steps (8 resets) in 284 ms. (140 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 132 ms. (300 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 213 ms. (186 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 150 ms. (264 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 167 ms. (238 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 157 ms. (253 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 100 ms. (396 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 122 ms. (325 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 90 ms. (439 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (8 resets) in 121 ms. (327 steps per ms) remains 12/12 properties
[2025-06-01 12:21:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/12 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 1 (OVERLAPS) 502/514 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/514 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 3 (OVERLAPS) 3/517 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 5 (OVERLAPS) 17/534 variables, 3/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 12 unsolved
Problem AtomicPropp6 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp16 is UNSAT
Problem AtomicPropp17 is UNSAT
Problem AtomicPropp19 is UNSAT
Problem AtomicPropp22 is UNSAT
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp25 is UNSAT
Problem AtomicPropp33 is UNSAT
After SMT solving in domain Real declared 1095/1158 variables, and 570 constraints, problems are : Problem set: 12 solved, 0 unsolved in 1798 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 534/597 constraints, PredecessorRefiner: 12/12 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1816ms problems are : Problem set: 12 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 12 atomic propositions for a total of 13 simplifications.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 597 stabilizing places and 561 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 597 transition count 561
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
FORMULA HirschbergSinclair-PT-30-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA HirschbergSinclair-PT-30-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G((p0||X(p1)))||((p0||X(p1))&&F(p2))))||((G((p0||X(p1)))||((p0||X(p1))&&F(p2)))&&(F(!p0) U X(p3)))))'
Support contains 7 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 596 transition count 561
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 590 transition count 555
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 590 transition count 555
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 19 place count 584 transition count 549
Iterating global reduction 1 with 6 rules applied. Total rules applied 25 place count 584 transition count 549
Applied a total of 25 rules in 88 ms. Remains 584 /597 variables (removed 13) and now considering 549/561 (removed 12) transitions.
// Phase 1: matrix 549 rows 584 cols
[2025-06-01 12:21:32] [INFO ] Computed 35 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:21:33] [INFO ] Implicit Places using invariants in 296 ms returned []
[2025-06-01 12:21:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:21:40] [INFO ] Implicit Places using invariants and state equation in 7882 ms returned []
Implicit Place search using SMT with State Equation took 8201 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2025-06-01 12:21:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 30/584 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 619 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 30/584 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1133 variables, 519/1138 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 1138 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30033 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60186ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60188ms
Starting structural reductions in LTL mode, iteration 1 : 584/597 places, 549/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68479 ms. Remains : 584/597 places, 549/561 transitions.
Stuttering acceptance computed with spot in 551 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p0) (NOT p1)), true, (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p3)), (NOT p2), (NOT p3), (AND p0 (NOT p3)), p0]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-00
Product exploration explored 100000 steps with 37848 reset in 430 ms.
Product exploration explored 100000 steps with 37726 reset in 349 ms.
Computed a total of 584 stabilizing places and 549 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 584 transition count 549
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 p3), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p3)), (X p3), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3)))))]
Knowledge based reduction with 12 factoid took 3388 ms. Reduced automaton from 11 states, 17 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 233 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
RANDOM walk for 40000 steps (64 resets) in 1095 ms. (36 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 170 ms. (233 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 131 ms. (303 steps per ms) remains 2/2 properties
[2025-06-01 12:22:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 513/518 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/526 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/1075 variables, 526/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1075 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/1133 variables, 58/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1133 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1133 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 922 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 513/518 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/526 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/1075 variables, 526/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1075 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/1133 variables, 58/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1133 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1133 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1133 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 621 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1514 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2448ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 133 ms.
Support contains 5 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 549/549 transitions.
Graph (complete) has 1105 edges and 584 vertex of which 574 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.2 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 574 transition count 308
Reduce places removed 231 places and 0 transitions.
Graph (complete) has 593 edges and 343 vertex of which 288 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.1 ms
Discarding 55 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 234 rules applied. Total rules applied 476 place count 288 transition count 306
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 57 rules applied. Total rules applied 533 place count 286 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 534 place count 285 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 535 place count 285 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 536 place count 284 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 537 place count 284 transition count 249
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 557 place count 284 transition count 229
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 577 place count 264 transition count 229
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 605 place count 236 transition count 201
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 39 rules applied. Total rules applied 644 place count 228 transition count 170
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 675 place count 197 transition count 170
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 27 Pre rules applied. Total rules applied 675 place count 197 transition count 143
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 729 place count 170 transition count 143
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 730 place count 169 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 730 place count 169 transition count 142
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 732 place count 168 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 738 place count 165 transition count 139
Applied a total of 738 rules in 123 ms. Remains 165 /584 variables (removed 419) and now considering 139/549 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 138 ms. Remains : 165/584 places, 139/549 transitions.
RANDOM walk for 40000 steps (284 resets) in 655 ms. (60 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (96 resets) in 245 ms. (162 steps per ms) remains 1/2 properties
BEST_FIRST walk for 551 steps (0 resets) in 5 ms. (91 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) p1 p3), (X p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p3))))), (X (X p1)), (F (G (NOT p0))), (F (OR (G p2) (G (NOT p2)))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p3) (G (NOT p3))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p3)), (X p3), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND (NOT p0) (NOT p3))), (X (NOT (AND (NOT p0) (NOT p3)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p0) (NOT p3)))), (X (X (NOT (AND (NOT p0) (NOT p3))))), (F (NOT (OR p1 p3))), (F (NOT (OR p3 p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (NOT p3)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 12 factoid took 4898 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 241 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
Support contains 7 out of 584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 549/549 transitions.
Applied a total of 0 rules in 20 ms. Remains 584 /584 variables (removed 0) and now considering 549/549 (removed 0) transitions.
[2025-06-01 12:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:22:55] [INFO ] Implicit Places using invariants in 492 ms returned []
[2025-06-01 12:22:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:23:03] [INFO ] Implicit Places using invariants and state equation in 7872 ms returned []
Implicit Place search using SMT with State Equation took 8368 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2025-06-01 12:23:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 30/584 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 619 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 30/584 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1133 variables, 519/1138 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 1138 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30036 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60160ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60165ms
Finished structural reductions in LTL mode , in 1 iterations and 68557 ms. Remains : 584/584 places, 549/549 transitions.
Computed a total of 584 stabilizing places and 549 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 584 transition count 549
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p3)), (X p3), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0)))))]
Knowledge based reduction with 10 factoid took 2878 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 253 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
RANDOM walk for 40000 steps (64 resets) in 373 ms. (106 steps per ms) remains 2/8 properties
BEST_FIRST walk for 40004 steps (8 resets) in 120 ms. (330 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 93 ms. (425 steps per ms) remains 2/2 properties
[2025-06-01 12:24:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 513/518 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/526 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/1075 variables, 526/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1075 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/1133 variables, 58/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1133 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1133 variables, 0/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 619 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1186 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 513/518 variables, 33/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/518 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 8/526 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/526 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 549/1075 variables, 526/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1075 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 58/1133 variables, 58/619 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1133 variables, 2/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1133 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1133 variables, 0/621 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 621 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1539 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2754ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 5 out of 584 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 584/584 places, 549/549 transitions.
Graph (complete) has 1105 edges and 584 vertex of which 574 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.1 ms
Discarding 10 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 231 transitions
Trivial Post-agglo rules discarded 231 transitions
Performed 231 trivial Post agglomeration. Transition count delta: 231
Iterating post reduction 0 with 241 rules applied. Total rules applied 242 place count 574 transition count 308
Reduce places removed 231 places and 0 transitions.
Graph (complete) has 593 edges and 343 vertex of which 288 are kept as prefixes of interest. Removing 55 places using SCC suffix rule.0 ms
Discarding 55 places :
Also discarding 0 output transitions
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 234 rules applied. Total rules applied 476 place count 288 transition count 306
Reduce places removed 2 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 55 transitions
Reduce isomorphic transitions removed 55 transitions.
Iterating post reduction 2 with 57 rules applied. Total rules applied 533 place count 286 transition count 251
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 534 place count 285 transition count 250
Iterating global reduction 3 with 1 rules applied. Total rules applied 535 place count 285 transition count 250
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 536 place count 284 transition count 249
Iterating global reduction 3 with 1 rules applied. Total rules applied 537 place count 284 transition count 249
Free-agglomeration rule (complex) applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 557 place count 284 transition count 229
Reduce places removed 20 places and 0 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 577 place count 264 transition count 229
Reduce places removed 28 places and 28 transitions.
Iterating global reduction 4 with 28 rules applied. Total rules applied 605 place count 236 transition count 201
Reduce places removed 8 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 4 with 39 rules applied. Total rules applied 644 place count 228 transition count 170
Reduce places removed 31 places and 0 transitions.
Iterating post reduction 5 with 31 rules applied. Total rules applied 675 place count 197 transition count 170
Performed 27 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 27 Pre rules applied. Total rules applied 675 place count 197 transition count 143
Deduced a syphon composed of 27 places in 0 ms
Reduce places removed 27 places and 0 transitions.
Iterating global reduction 6 with 54 rules applied. Total rules applied 729 place count 170 transition count 143
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 6 with 1 rules applied. Total rules applied 730 place count 169 transition count 143
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 730 place count 169 transition count 142
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 732 place count 168 transition count 142
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 2 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 7 with 6 rules applied. Total rules applied 738 place count 165 transition count 139
Applied a total of 738 rules in 87 ms. Remains 165 /584 variables (removed 419) and now considering 139/549 (removed 410) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 87 ms. Remains : 165/584 places, 139/549 transitions.
RANDOM walk for 40000 steps (284 resets) in 358 ms. (111 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (96 resets) in 122 ms. (325 steps per ms) remains 1/2 properties
BEST_FIRST walk for 545 steps (0 resets) in 5 ms. (90 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p2) (NOT p0) p3 p1), (X (NOT p0)), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p3))))), (X (X (NOT p0))), (X (X p1)), (F (OR (G p2) (G (NOT p2)))), (F (G (NOT p0))), (F (OR (G p3) (G (NOT p3)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (NOT p3)), (X p3), (X (AND (NOT p3) (NOT p0))), (X (NOT (AND (NOT p3) (NOT p0)))), (X (AND (NOT p2) (NOT p0))), (X (NOT (AND (NOT p2) (NOT p0)))), (X (X (NOT p2))), (X (X p2)), (X (X (NOT p3))), (X (X p3)), (X (X (AND (NOT p3) (NOT p0)))), (X (X (NOT (AND (NOT p3) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (F (NOT (OR p1 p3))), (F (NOT (OR p3 p0))), (F p0), (F (NOT (AND (NOT p2) (NOT p0)))), (F p2), (F (NOT p3)), (F (NOT (OR p1 p2))), (F (NOT p1))]
Knowledge based reduction with 10 factoid took 3860 ms. Reduced automaton from 7 states, 10 edges and 4 AP (stutter sensitive) to 7 states, 10 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 244 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
Product exploration explored 100000 steps with 33551 reset in 309 ms.
Product exploration explored 100000 steps with 33627 reset in 336 ms.
Applying partial POR strategy [false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 222 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p3) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p3) (NOT p1)), (NOT p2), (NOT p3)]
Support contains 7 out of 584 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 584/584 places, 549/549 transitions.
Performed 231 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 231 rules applied. Total rules applied 231 place count 584 transition count 549
Deduced a syphon composed of 231 places in 4 ms
Applied a total of 231 rules in 74 ms. Remains 584 /584 variables (removed 0) and now considering 549/549 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:24:16] [INFO ] Redundant transitions in 24 ms returned []
Running 519 sub problems to find dead transitions.
// Phase 1: matrix 549 rows 584 cols
[2025-06-01 12:24:16] [INFO ] Computed 35 invariants in 3 ms
[2025-06-01 12:24:16] [INFO ] State equation strengthened by 231 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 30/584 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD185 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
At refinement iteration 4 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 231 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1133 variables, 231/850 constraints. Problems are: Problem set: 231 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 850 constraints, problems are : Problem set: 231 solved, 288 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 231 solved, 288 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/323 variables, 0/0 constraints. Problems are: Problem set: 231 solved, 288 unsolved
At refinement iteration 1 (OVERLAPS) 261/584 variables, 35/35 constraints. Problems are: Problem set: 231 solved, 288 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 231 solved, 288 unsolved
At refinement iteration 3 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 231 solved, 288 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1133 variables, 231/850 constraints. Problems are: Problem set: 231 solved, 288 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1133 variables, 288/1138 constraints. Problems are: Problem set: 231 solved, 288 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 1138 constraints, problems are : Problem set: 231 solved, 288 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, ReadFeed: 231/231 constraints, PredecessorRefiner: 288/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60120ms problems are : Problem set: 231 solved, 288 unsolved
Search for dead transitions found 231 dead transitions in 60122ms
Found 231 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 231 transitions
Dead transitions reduction (with SMT) removed 231 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 584/584 places, 318/549 transitions.
Graph (complete) has 875 edges and 584 vertex of which 353 are kept as prefixes of interest. Removing 231 places using SCC suffix rule.1 ms
Discarding 231 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 37 ms. Remains 353 /584 variables (removed 231) and now considering 318/318 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 353/584 places, 318/549 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60296 ms. Remains : 353/584 places, 318/549 transitions.
Built C files in :
/tmp/ltsmin10049303337092388854
[2025-06-01 12:25:16] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10049303337092388854
Running compilation step : cd /tmp/ltsmin10049303337092388854;'/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 1268 ms.
Running link step : cd /tmp/ltsmin10049303337092388854;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin10049303337092388854;'/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/stateBased13081925241010405677.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 7 out of 584 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 584/584 places, 549/549 transitions.
Applied a total of 0 rules in 20 ms. Remains 584 /584 variables (removed 0) and now considering 549/549 (removed 0) transitions.
// Phase 1: matrix 549 rows 584 cols
[2025-06-01 12:25:31] [INFO ] Computed 35 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:25:32] [INFO ] Implicit Places using invariants in 258 ms returned []
[2025-06-01 12:25:32] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:25:40] [INFO ] Implicit Places using invariants and state equation in 7900 ms returned []
Implicit Place search using SMT with State Equation took 8169 ms to find 0 implicit places.
Running 519 sub problems to find dead transitions.
[2025-06-01 12:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 30/584 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1133/1133 variables, and 619 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 519 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/554 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/554 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 2 (OVERLAPS) 30/584 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/584 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 4 (OVERLAPS) 549/1133 variables, 584/619 constraints. Problems are: Problem set: 0 solved, 519 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1133 variables, 519/1138 constraints. Problems are: Problem set: 0 solved, 519 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1133/1133 variables, and 1138 constraints, problems are : Problem set: 0 solved, 519 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 584/584 constraints, PredecessorRefiner: 519/519 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60117ms problems are : Problem set: 0 solved, 519 unsolved
Search for dead transitions found 0 dead transitions in 60119ms
Finished structural reductions in LTL mode , in 1 iterations and 68310 ms. Remains : 584/584 places, 549/549 transitions.
Built C files in :
/tmp/ltsmin9642661798632074684
[2025-06-01 12:26:40] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9642661798632074684
Running compilation step : cd /tmp/ltsmin9642661798632074684;'/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 823 ms.
Running link step : cd /tmp/ltsmin9642661798632074684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9642661798632074684;'/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/stateBased4324441008220094843.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:26:55] [INFO ] Flatten gal took : 27 ms
[2025-06-01 12:26:55] [INFO ] Flatten gal took : 24 ms
[2025-06-01 12:26:55] [INFO ] Time to serialize gal into /tmp/LTL11444401057768975707.gal : 7 ms
[2025-06-01 12:26:55] [INFO ] Time to serialize properties into /tmp/LTL444530167391204435.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/LTL11444401057768975707.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2616620940084318023.hoa' '-atoms' '/tmp/LTL444530167391204435.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL444530167391204435.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2616620940084318023.hoa
Detected timeout of ITS tools.
[2025-06-01 12:27:10] [INFO ] Flatten gal took : 55 ms
[2025-06-01 12:27:10] [INFO ] Flatten gal took : 39 ms
[2025-06-01 12:27:10] [INFO ] Time to serialize gal into /tmp/LTL9704795921959826463.gal : 4 ms
[2025-06-01 12:27:10] [INFO ] Time to serialize properties into /tmp/LTL2974265778525506870.ltl : 8 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/LTL9704795921959826463.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2974265778525506870.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 : !(((G((G(("(rcv_left_reply_13_0_13>rcv_right_election_1_0_1_30)")||(X("(reply_30_3_to_right_23<1)"))))||((("(rcv_left_reply_13_0_13>rc...569
Formula 0 simplified : F(F(!"(rcv_left_reply_13_0_13>rcv_right_election_1_0_1_30)" & X!"(reply_30_3_to_right_23<1)") & ((!"(rcv_left_reply_13_0_13>rcv_righ...544
Detected timeout of ITS tools.
[2025-06-01 12:27:25] [INFO ] Flatten gal took : 41 ms
[2025-06-01 12:27:25] [INFO ] Applying decomposition
[2025-06-01 12:27:25] [INFO ] Flatten gal took : 53 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/graph742119007026083911.txt' '-o' '/tmp/graph742119007026083911.bin' '-w' '/tmp/graph742119007026083911.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph742119007026083911.bin' '-l' '-1' '-v' '-w' '/tmp/graph742119007026083911.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:27:25] [INFO ] Decomposing Gal with order
[2025-06-01 12:27:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:27:26] [INFO ] Removed a total of 71 redundant transitions.
[2025-06-01 12:27:26] [INFO ] Flatten gal took : 137 ms
[2025-06-01 12:27:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 33 labels/synchronizations in 23 ms.
[2025-06-01 12:27:26] [INFO ] Time to serialize gal into /tmp/LTL13624612131499330272.gal : 7 ms
[2025-06-01 12:27:26] [INFO ] Time to serialize properties into /tmp/LTL6408624810185305580.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/LTL13624612131499330272.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6408624810185305580.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 : !(((G((G(("(gu28.rcv_left_reply_13_0_13>gu28.rcv_right_election_1_0_1_30)")||(X("(gi0.gi2.gu21.reply_30_3_to_right_23<1)"))))||((("(gu...687
Formula 0 simplified : F(F(!"(gu28.rcv_left_reply_13_0_13>gu28.rcv_right_election_1_0_1_30)" & X!"(gi0.gi2.gu21.reply_30_3_to_right_23<1)") & ((!"(gu28.rcv...662
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-00 finished in 368819 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p1))&&p0)))'
Support contains 5 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 596 transition count 561
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 588 transition count 553
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 588 transition count 553
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 580 transition count 545
Applied a total of 33 rules in 33 ms. Remains 580 /597 variables (removed 17) and now considering 545/561 (removed 16) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:27:41] [INFO ] Computed 35 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:27:42] [INFO ] Implicit Places using invariants in 596 ms returned []
[2025-06-01 12:27:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:27:50] [INFO ] Implicit Places using invariants and state equation in 8284 ms returned []
Implicit Place search using SMT with State Equation took 8904 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:27:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30017 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30034 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60116ms
Starting structural reductions in LTL mode, iteration 1 : 580/597 places, 545/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 69057 ms. Remains : 580/597 places, 545/561 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-02 finished in 69250 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 596 transition count 561
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 588 transition count 553
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 588 transition count 553
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 580 transition count 545
Applied a total of 33 rules in 41 ms. Remains 580 /597 variables (removed 17) and now considering 545/561 (removed 16) transitions.
[2025-06-01 12:28:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:28:51] [INFO ] Implicit Places using invariants in 281 ms returned []
[2025-06-01 12:28:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:28:59] [INFO ] Implicit Places using invariants and state equation in 8315 ms returned []
Implicit Place search using SMT with State Equation took 8607 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:28:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30026 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60107ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 580/597 places, 545/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68761 ms. Remains : 580/597 places, 545/561 transitions.
Stuttering acceptance computed with spot in 209 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-05
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-05 finished in 68992 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)&&X(X(X(F(!p0))))))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 596 transition count 561
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 588 transition count 553
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 588 transition count 553
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 24 place count 581 transition count 546
Iterating global reduction 1 with 7 rules applied. Total rules applied 31 place count 581 transition count 546
Applied a total of 31 rules in 35 ms. Remains 581 /597 variables (removed 16) and now considering 546/561 (removed 15) transitions.
// Phase 1: matrix 546 rows 581 cols
[2025-06-01 12:29:59] [INFO ] Computed 35 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:30:00] [INFO ] Implicit Places using invariants in 295 ms returned []
[2025-06-01 12:30:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:30:08] [INFO ] Implicit Places using invariants and state equation in 8148 ms returned []
Implicit Place search using SMT with State Equation took 8446 ms to find 0 implicit places.
Running 516 sub problems to find dead transitions.
[2025-06-01 12:30:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1127/1127 variables, and 616 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 516 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/551 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/551 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 2 (OVERLAPS) 30/581 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/581 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 4 (OVERLAPS) 546/1127 variables, 581/616 constraints. Problems are: Problem set: 0 solved, 516 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1127 variables, 516/1132 constraints. Problems are: Problem set: 0 solved, 516 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1127/1127 variables, and 1132 constraints, problems are : Problem set: 0 solved, 516 unsolved in 30031 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 581/581 constraints, PredecessorRefiner: 516/516 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60104ms problems are : Problem set: 0 solved, 516 unsolved
Search for dead transitions found 0 dead transitions in 60105ms
Starting structural reductions in LTL mode, iteration 1 : 581/597 places, 546/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68598 ms. Remains : 581/597 places, 546/561 transitions.
Stuttering acceptance computed with spot in 226 ms :[true, (NOT p0), p0, p0, p0]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-06
Stuttering criterion allowed to conclude after 605 steps with 0 reset in 6 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-06 finished in 68856 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(F(p0)))))'
Support contains 1 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 596 transition count 561
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 588 transition count 553
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 588 transition count 553
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 580 transition count 545
Applied a total of 33 rules in 34 ms. Remains 580 /597 variables (removed 17) and now considering 545/561 (removed 16) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:31:08] [INFO ] Computed 35 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:31:08] [INFO ] Implicit Places using invariants in 304 ms returned []
[2025-06-01 12:31:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:31:17] [INFO ] Implicit Places using invariants and state equation in 8354 ms returned []
Implicit Place search using SMT with State Equation took 8674 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:31:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 1.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 1.0)
(s107 0.0)
(s108 0.0)
(s109 1.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 1.0)
(s114 1.0)
(s115 0.0)
(s116 0.0)
(s117 1.0)
(s118 1.0)
(s119 0.0)
(s120 0.0)
(s121 1.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 1.0)
(s126 1.0)
(s127 0.0)
(s128 0.0)
(s129 1.0)
(s130 1.0)
(s131 0.0)
(s132 0.0)
(s133 1.0)
(s134 1.0)
(s135 0.0)
(s136 0.0)
(s137 1.0)
(s138 1.0)
(s139 0.0)
(s140 0.0)
(s141 1.0)
(s142 1.0)
(s143 0.0)
(s144 0.0)
(s145 1.0)
(s146 0.0)
(s147 1.0)
(s148 0.0)
(s149 1.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 1.0)
(s155 0.0)
(s156 1.0)
(s157 0.0)
(s158 1.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 1.0)
(s163 0.0)
(s164 1.0)
(s165 0.0)
(s166 1.0)
(s167 0.0)
(s168 1.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 1.0)
(s173 0.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 0.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 0.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 0.0)
(s239 0.0)
(s240 0.0)
(s241 0.0)
(s242 0.0)
(s243 0.0)
(s244 0.0)
(s245 0.0)
(s246 0.0)
(s247 0.0)
(s248 0.0)
(s249 0.0)
(s250 0.0)
(s251 0.0)
(s252 0.0)
(s253 0.0)
(s254 0.0)
(s255 0.0)
(s256 0.0)
(s257 0.0)
(s258 0.0)
(s259 0.0)
(s260 0.0)
(s261 0.0)
(s262 0.0)
(s263 0.0)
(s264 0.0)
(s265 0.0)
(s266 0.0)
(s267 0.0)
(s268 0.0)
(s269 0.0)
(s270 0.0)
(s271 0.0)
(s272 0.0)
(s273 0.0)
(s274 0.0)
(s275 0.0)
(s276 0.0)
(s277 0.0)
(s278 0.0)
(s279 0.0)
(s280 0.0)
(s281 0.0)
(s282 0.0)
(s283 0.0)
(s284 0.0)
(s285 0.0)
(s286 0.0)
(s287 0.0)
(s288 0.0)
(s289 0.0)
(s290 0.0)
(s291 0.0)
(s292 0.0)
(s293 0.0)
(s294 0.0)
(s295 0.0)
(s296 0.0)
(s297 0.0)
(s298 0.0)
(s299 0.0)
(s300 0.0)
(s301 0.0)
(s302 0.0)
(s303 0.0)
(s304 0.0)
(s305 0.0)
(s306 0.0)
(s307 0.0)
(s308 0.0)
(s309 0.0)
(s310 0.0)
(s311 0.0)
(s312 0.0)
(s313 0.0)
(s314 0.0)
(s315 0.0)
(s316 0.0)
(s317 0.0)
(s318 0.0)
(s319 0.0)
(s320 0.0)
(s321 0.0)
(s322 0.0)
(s323 0.0)
(s324 0.0)
(s325 0.0)
(s326 0.0)
(s327 0.0)
(s328 0.0)
(s329 0.0)
(s330 0.0)
(s331 0.0)
(s332 0.0)
(s333 0.0)
(s334 0.0)
(s335 0.0)
(s336 0.0)
(s337 0.0)
(s338 0.0)
(s339 0.0)
(s340 0.0)
(s341 0.0)
(s342 0.0)
(s343 0.0)
(s344 0.0)
(s345 0.0)
(s346 0.0)
(s347 0.0)
(s348 0.0)
(s349 0.0)
(s350 0.0)
(s351 0.0)
(s352 0.0)
(s353 0.0)
(s354 0.0)
(s355 0.0)
(s356 0.0)
(s357 0.0)
(s358 0.0)
(s359 0.0)
(s360 0.0)
(s361 0.0)
(s362 timeout
0.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30021 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30025 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60112ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60113ms
Starting structural reductions in LTL mode, iteration 1 : 580/597 places, 545/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68823 ms. Remains : 580/597 places, 545/561 transitions.
Stuttering acceptance computed with spot in 161 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-07
Product exploration explored 100000 steps with 296 reset in 361 ms.
Product exploration explored 100000 steps with 296 reset in 385 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 84 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1346 steps (0 resets) in 16 ms. (79 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 96 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 164 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 12:32:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:32:20] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 1129 ms returned sat
[2025-06-01 12:32:34] [INFO ] [Real]Absence check using state equation in 13604 ms returned unknown
Could not prove EG (NOT p0)
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 15 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2025-06-01 12:32:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:32:34] [INFO ] Implicit Places using invariants in 335 ms returned []
[2025-06-01 12:32:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:32:42] [INFO ] Implicit Places using invariants and state equation in 8250 ms returned []
Implicit Place search using SMT with State Equation took 8596 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:32:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 0.0)
(s58 0.0)
(s59 0.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 1.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 1.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 1.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 1.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 1.0)
(s82 1.0)
(s83 0.0)
(s84 0.0)
(s85 1.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 1.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 1.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 1.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)timeout
(s102 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30040 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Finished structural reductions in LTL mode , in 1 iterations and 68751 ms. Remains : 580/580 places, 545/545 transitions.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 71 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 1339 steps (0 resets) in 13 ms. (95 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 81 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 135 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 12:33:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:33:45] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 1123 ms returned sat
[2025-06-01 12:33:58] [INFO ] [Real]Absence check using state equation in 13617 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 127 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 296 reset in 332 ms.
Product exploration explored 100000 steps with 296 reset in 375 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Performed 239 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 239 rules applied. Total rules applied 239 place count 580 transition count 545
Deduced a syphon composed of 239 places in 1 ms
Applied a total of 239 rules in 30 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:33:59] [INFO ] Redundant transitions in 10 ms returned []
Running 515 sub problems to find dead transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:33:59] [INFO ] Computed 35 invariants in 3 ms
[2025-06-01 12:33:59] [INFO ] State equation strengthened by 239 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 239 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 239/854 constraints. Problems are: Problem set: 239 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 854 constraints, problems are : Problem set: 239 solved, 276 unsolved in 30027 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 239 solved, 276 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/311 variables, 0/0 constraints. Problems are: Problem set: 239 solved, 276 unsolved
At refinement iteration 1 (OVERLAPS) 269/580 variables, 35/35 constraints. Problems are: Problem set: 239 solved, 276 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 239 solved, 276 unsolved
At refinement iteration 3 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 239 solved, 276 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 239/854 constraints. Problems are: Problem set: 239 solved, 276 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 276/1130 constraints. Problems are: Problem set: 239 solved, 276 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 239 solved, 276 unsolved in 30047 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, ReadFeed: 239/239 constraints, PredecessorRefiner: 276/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60132ms problems are : Problem set: 239 solved, 276 unsolved
Search for dead transitions found 239 dead transitions in 60134ms
Found 239 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 239 transitions
Dead transitions reduction (with SMT) removed 239 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 580/580 places, 306/545 transitions.
Graph (complete) has 861 edges and 580 vertex of which 341 are kept as prefixes of interest. Removing 239 places using SCC suffix rule.1 ms
Discarding 239 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 11 ms. Remains 341 /580 variables (removed 239) and now considering 306/306 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 341/580 places, 306/545 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60208 ms. Remains : 341/580 places, 306/545 transitions.
Built C files in :
/tmp/ltsmin16854307579148776036
[2025-06-01 12:34:59] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16854307579148776036
Running compilation step : cd /tmp/ltsmin16854307579148776036;'/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 819 ms.
Running link step : cd /tmp/ltsmin16854307579148776036;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin16854307579148776036;'/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/stateBased9663858705940824983.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 26 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:35:15] [INFO ] Computed 35 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:35:15] [INFO ] Implicit Places using invariants in 287 ms returned []
[2025-06-01 12:35:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:35:23] [INFO ] Implicit Places using invariants and state equation in 8388 ms returned []
Implicit Place search using SMT with State Equation took 8677 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:35:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30032 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Finished structural reductions in LTL mode , in 1 iterations and 68823 ms. Remains : 580/580 places, 545/545 transitions.
Built C files in :
/tmp/ltsmin16574935877622720052
[2025-06-01 12:36:23] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16574935877622720052
Running compilation step : cd /tmp/ltsmin16574935877622720052;'/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 841 ms.
Running link step : cd /tmp/ltsmin16574935877622720052;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16574935877622720052;'/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/stateBased18063061374079518535.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:36:38] [INFO ] Flatten gal took : 19 ms
[2025-06-01 12:36:39] [INFO ] Flatten gal took : 18 ms
[2025-06-01 12:36:39] [INFO ] Time to serialize gal into /tmp/LTL13240468692042232282.gal : 3 ms
[2025-06-01 12:36:39] [INFO ] Time to serialize properties into /tmp/LTL18407567515044751888.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/LTL13240468692042232282.gal' '-t' 'CGAL' '-hoa' '/tmp/aut530076998513305736.hoa' '-atoms' '/tmp/LTL18407567515044751888.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/LTL18407567515044751888.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut530076998513305736.hoa
Detected timeout of ITS tools.
[2025-06-01 12:36:54] [INFO ] Flatten gal took : 25 ms
[2025-06-01 12:36:54] [INFO ] Flatten gal took : 31 ms
[2025-06-01 12:36:54] [INFO ] Time to serialize gal into /tmp/LTL2894702243580490889.gal : 11 ms
[2025-06-01 12:36:54] [INFO ] Time to serialize properties into /tmp/LTL2788446111494541893.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/LTL2894702243580490889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2788446111494541893.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(X(X(F("(rcv_left_election_30_4_3_3>=1)"))))))
Formula 0 simplified : XXXG!"(rcv_left_election_30_4_3_3>=1)"
Detected timeout of ITS tools.
[2025-06-01 12:37:09] [INFO ] Flatten gal took : 22 ms
[2025-06-01 12:37:09] [INFO ] Applying decomposition
[2025-06-01 12:37:09] [INFO ] Flatten gal took : 15 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/graph15501010705886825467.txt' '-o' '/tmp/graph15501010705886825467.bin' '-w' '/tmp/graph15501010705886825467.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15501010705886825467.bin' '-l' '-1' '-v' '-w' '/tmp/graph15501010705886825467.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:37:09] [INFO ] Decomposing Gal with order
[2025-06-01 12:37:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:37:09] [INFO ] Removed a total of 66 redundant transitions.
[2025-06-01 12:37:09] [INFO ] Flatten gal took : 38 ms
[2025-06-01 12:37:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2025-06-01 12:37:09] [INFO ] Time to serialize gal into /tmp/LTL7595033561777518162.gal : 7 ms
[2025-06-01 12:37:09] [INFO ] Time to serialize properties into /tmp/LTL9530761229021287356.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/LTL7595033561777518162.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9530761229021287356.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(X(X(F("(i1.u52.rcv_left_election_30_4_3_3>=1)"))))))
Formula 0 simplified : XXXG!"(i1.u52.rcv_left_election_30_4_3_3>=1)"
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-07 finished in 375933 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)&&F(G(p1)))))'
Support contains 3 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Graph (complete) has 1124 edges and 597 vertex of which 596 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 244 transitions
Trivial Post-agglo rules discarded 244 transitions
Performed 244 trivial Post agglomeration. Transition count delta: 244
Iterating post reduction 0 with 244 rules applied. Total rules applied 245 place count 566 transition count 287
Reduce places removed 244 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 245 rules applied. Total rules applied 490 place count 322 transition count 286
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 491 place count 321 transition count 286
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 498 place count 314 transition count 279
Iterating global reduction 3 with 7 rules applied. Total rules applied 505 place count 314 transition count 279
Applied a total of 505 rules in 37 ms. Remains 314 /597 variables (removed 283) and now considering 279/561 (removed 282) transitions.
// Phase 1: matrix 279 rows 314 cols
[2025-06-01 12:37:24] [INFO ] Computed 35 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:37:24] [INFO ] Implicit Places using invariants in 461 ms returned []
[2025-06-01 12:37:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:37:27] [INFO ] Implicit Places using invariants and state equation in 3005 ms returned []
Implicit Place search using SMT with State Equation took 3468 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:37:27] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-01 12:37:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 2/257 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/480 variables, 257/292 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 0/292 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 1/481 variables, 1/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/593 variables, and 293 constraints, problems are : Problem set: 0 solved, 220 unsolved in 27632 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/314 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 2/257 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/257 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/480 variables, 257/292 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/480 variables, 220/512 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 480/593 variables, and 512 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30023 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 257/314 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 57674ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 57675ms
Starting structural reductions in SI_LTL mode, iteration 1 : 314/597 places, 279/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61187 ms. Remains : 314/597 places, 279/561 transitions.
Stuttering acceptance computed with spot in 103 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-10
Stuttering criterion allowed to conclude after 308 steps with 0 reset in 2 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-10 finished in 61310 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&&((p1 U p2)||G(p3))))))'
Support contains 7 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 590 transition count 554
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 590 transition count 554
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 21 place count 583 transition count 547
Iterating global reduction 0 with 7 rules applied. Total rules applied 28 place count 583 transition count 547
Applied a total of 28 rules in 70 ms. Remains 583 /597 variables (removed 14) and now considering 547/561 (removed 14) transitions.
// Phase 1: matrix 547 rows 583 cols
[2025-06-01 12:38:25] [INFO ] Computed 36 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:38:26] [INFO ] Implicit Places using invariants in 445 ms returned []
[2025-06-01 12:38:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:38:34] [INFO ] Implicit Places using invariants and state equation in 7927 ms returned []
Implicit Place search using SMT with State Equation took 8375 ms to find 0 implicit places.
Running 517 sub problems to find dead transitions.
[2025-06-01 12:38:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 2/554 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 29/583 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 583/1130 variables, and 36 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 0/583 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 517 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/552 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/552 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 2 (OVERLAPS) 2/554 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/554 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 4 (OVERLAPS) 29/583 variables, 30/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/583 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 6 (OVERLAPS) 547/1130 variables, 583/619 constraints. Problems are: Problem set: 0 solved, 517 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1130 variables, 517/1136 constraints. Problems are: Problem set: 0 solved, 517 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1130/1130 variables, and 1136 constraints, problems are : Problem set: 0 solved, 517 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 35/35 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 517/517 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60136ms problems are : Problem set: 0 solved, 517 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 583/597 places, 547/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68584 ms. Remains : 583/597 places, 547/561 transitions.
Stuttering acceptance computed with spot in 238 ms :[(OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p2) (NOT p3))), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-12
Stuttering criterion allowed to conclude after 1929 steps with 17 reset in 29 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-12 finished in 68871 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(G(p0)) U p1)))'
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 596 transition count 561
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 9 place count 588 transition count 553
Iterating global reduction 1 with 8 rules applied. Total rules applied 17 place count 588 transition count 553
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 25 place count 580 transition count 545
Iterating global reduction 1 with 8 rules applied. Total rules applied 33 place count 580 transition count 545
Applied a total of 33 rules in 43 ms. Remains 580 /597 variables (removed 17) and now considering 545/561 (removed 16) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:39:34] [INFO ] Computed 35 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:39:35] [INFO ] Implicit Places using invariants in 394 ms returned []
[2025-06-01 12:39:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:39:42] [INFO ] Implicit Places using invariants and state equation in 7878 ms returned []
Implicit Place search using SMT with State Equation took 8281 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:39:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60127ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60129ms
Starting structural reductions in LTL mode, iteration 1 : 580/597 places, 545/561 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68455 ms. Remains : 580/597 places, 545/561 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-13
Product exploration explored 100000 steps with 5163 reset in 372 ms.
Product exploration explored 100000 steps with 5077 reset in 413 ms.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 234 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 183 steps (0 resets) in 6 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 383 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 101 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 13 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
[2025-06-01 12:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:40:45] [INFO ] Implicit Places using invariants in 289 ms returned []
[2025-06-01 12:40:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:40:53] [INFO ] Implicit Places using invariants and state equation in 7906 ms returned []
Implicit Place search using SMT with State Equation took 8214 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:40:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30029 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Finished structural reductions in LTL mode , in 1 iterations and 68343 ms. Remains : 580/580 places, 545/545 transitions.
Computed a total of 580 stabilizing places and 545 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 580 transition count 545
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 289 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(NOT p1), (NOT p1), (NOT p0)]
RANDOM walk for 186 steps (0 resets) in 6 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p1 p0), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X (NOT p1))), (X (X p1)), (X (X p0)), (X (X (NOT p0))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 317 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 3 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p1), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[(NOT p1), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 4504 reset in 311 ms.
Product exploration explored 100000 steps with 5257 reset in 335 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 113 ms :[(NOT p1), (NOT p1), (NOT p0)]
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Performed 222 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 222 rules applied. Total rules applied 222 place count 580 transition count 545
Deduced a syphon composed of 222 places in 2 ms
Applied a total of 222 rules in 29 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:41:55] [INFO ] Redundant transitions in 2 ms returned []
Running 515 sub problems to find dead transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:41:55] [INFO ] Computed 35 invariants in 4 ms
[2025-06-01 12:41:55] [INFO ] State equation strengthened by 222 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD61 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 222/837 constraints. Problems are: Problem set: 222 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 837 constraints, problems are : Problem set: 222 solved, 293 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 222 solved, 293 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/328 variables, 0/0 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 1 (OVERLAPS) 252/580 variables, 35/35 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 3 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1125 variables, 222/837 constraints. Problems are: Problem set: 222 solved, 293 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 293/1130 constraints. Problems are: Problem set: 222 solved, 293 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 222 solved, 293 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, ReadFeed: 222/222 constraints, PredecessorRefiner: 293/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60097ms problems are : Problem set: 222 solved, 293 unsolved
Search for dead transitions found 222 dead transitions in 60099ms
Found 222 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 222 transitions
Dead transitions reduction (with SMT) removed 222 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 580/580 places, 323/545 transitions.
Graph (complete) has 878 edges and 580 vertex of which 358 are kept as prefixes of interest. Removing 222 places using SCC suffix rule.2 ms
Discarding 222 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 10 ms. Remains 358 /580 variables (removed 222) and now considering 323/323 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 358/580 places, 323/545 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 60150 ms. Remains : 358/580 places, 323/545 transitions.
Built C files in :
/tmp/ltsmin10231938999931562372
[2025-06-01 12:42:55] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10231938999931562372
Running compilation step : cd /tmp/ltsmin10231938999931562372;'/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 846 ms.
Running link step : cd /tmp/ltsmin10231938999931562372;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10231938999931562372;'/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/stateBased17944182435744472445.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 580/580 places, 545/545 transitions.
Applied a total of 0 rules in 11 ms. Remains 580 /580 variables (removed 0) and now considering 545/545 (removed 0) transitions.
// Phase 1: matrix 545 rows 580 cols
[2025-06-01 12:43:11] [INFO ] Computed 35 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:11] [INFO ] Implicit Places using invariants in 291 ms returned []
[2025-06-01 12:43:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:43:19] [INFO ] Implicit Places using invariants and state equation in 7770 ms returned []
Implicit Place search using SMT with State Equation took 8089 ms to find 0 implicit places.
Running 515 sub problems to find dead transitions.
[2025-06-01 12:43: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/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1125/1125 variables, and 615 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 515 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/550 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/550 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 2 (OVERLAPS) 30/580 variables, 30/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/580 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 4 (OVERLAPS) 545/1125 variables, 580/615 constraints. Problems are: Problem set: 0 solved, 515 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1125 variables, 515/1130 constraints. Problems are: Problem set: 0 solved, 515 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1125/1125 variables, and 1130 constraints, problems are : Problem set: 0 solved, 515 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 580/580 constraints, PredecessorRefiner: 515/515 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 515 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Finished structural reductions in LTL mode , in 1 iterations and 68201 ms. Remains : 580/580 places, 545/545 transitions.
Built C files in :
/tmp/ltsmin9877266901333489421
[2025-06-01 12:44:19] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9877266901333489421
Running compilation step : cd /tmp/ltsmin9877266901333489421;'/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 839 ms.
Running link step : cd /tmp/ltsmin9877266901333489421;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin9877266901333489421;'/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/stateBased9721709235547984649.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:44:34] [INFO ] Flatten gal took : 17 ms
[2025-06-01 12:44:34] [INFO ] Flatten gal took : 15 ms
[2025-06-01 12:44:34] [INFO ] Time to serialize gal into /tmp/LTL9400303565789433446.gal : 3 ms
[2025-06-01 12:44:34] [INFO ] Time to serialize properties into /tmp/LTL10548997426219560084.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/LTL9400303565789433446.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7795825304104818486.hoa' '-atoms' '/tmp/LTL10548997426219560084.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/LTL10548997426219560084.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7795825304104818486.hoa
Detected timeout of ITS tools.
[2025-06-01 12:44:49] [INFO ] Flatten gal took : 12 ms
[2025-06-01 12:44:49] [INFO ] Flatten gal took : 13 ms
[2025-06-01 12:44:49] [INFO ] Time to serialize gal into /tmp/LTL18002041252854936472.gal : 15 ms
[2025-06-01 12:44:49] [INFO ] Time to serialize properties into /tmp/LTL15615308818851210021.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/LTL18002041252854936472.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15615308818851210021.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(G("((newmsg23<=newmsg7)&&(rcv_left_election_30_5_10_10<=rcv_left_election_30_5_3_3))")))U("(newmsg23<=newmsg7)"))))
Formula 0 simplified : X(GF!"((newmsg23<=newmsg7)&&(rcv_left_election_30_5_10_10<=rcv_left_election_30_5_3_3))" R !"(newmsg23<=newmsg7)")
Detected timeout of ITS tools.
[2025-06-01 12:45:04] [INFO ] Flatten gal took : 12 ms
[2025-06-01 12:45:04] [INFO ] Applying decomposition
[2025-06-01 12:45:04] [INFO ] Flatten gal took : 17 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/graph13881553918248095142.txt' '-o' '/tmp/graph13881553918248095142.bin' '-w' '/tmp/graph13881553918248095142.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13881553918248095142.bin' '-l' '-1' '-v' '-w' '/tmp/graph13881553918248095142.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:45:04] [INFO ] Decomposing Gal with order
[2025-06-01 12:45:04] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:45:04] [INFO ] Removed a total of 97 redundant transitions.
[2025-06-01 12:45:04] [INFO ] Flatten gal took : 44 ms
[2025-06-01 12:45:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 126 labels/synchronizations in 21 ms.
[2025-06-01 12:45:04] [INFO ] Time to serialize gal into /tmp/LTL133981648676362473.gal : 6 ms
[2025-06-01 12:45:04] [INFO ] Time to serialize properties into /tmp/LTL8917500328117299160.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/LTL133981648676362473.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8917500328117299160.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X((F(G("((gu5.newmsg23<=gu5.newmsg7)&&(gu68.rcv_left_election_30_5_10_10<=gu68.rcv_left_election_30_5_3_3))")))U("(gu5.newmsg23<=gu...170
Formula 0 simplified : X(GF!"((gu5.newmsg23<=gu5.newmsg7)&&(gu68.rcv_left_election_30_5_10_10<=gu68.rcv_left_election_30_5_3_3))" R !"(gu5.newmsg23<=gu5.ne...163
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-13 finished in 345307 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 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Graph (complete) has 1124 edges and 597 vertex of which 596 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 29 places and 29 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 248 place count 567 transition count 285
Reduce places removed 247 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 248 rules applied. Total rules applied 496 place count 320 transition count 284
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 497 place count 319 transition count 284
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 505 place count 311 transition count 276
Iterating global reduction 3 with 8 rules applied. Total rules applied 513 place count 311 transition count 276
Applied a total of 513 rules in 20 ms. Remains 311 /597 variables (removed 286) and now considering 276/561 (removed 285) transitions.
// Phase 1: matrix 276 rows 311 cols
[2025-06-01 12:45:19] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:45:20] [INFO ] Implicit Places using invariants in 343 ms returned []
[2025-06-01 12:45:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:45:20] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 12:45:25] [INFO ] Implicit Places using invariants and state equation in 4947 ms returned []
Implicit Place search using SMT with State Equation took 5307 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:45:25] [INFO ] Redundant transitions in 1 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-01 12:45:25] [INFO ] Invariant cache hit.
[2025-06-01 12:45:25] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/587 variables, and 299 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 220/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/587 variables, and 519 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60045ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in SI_LTL mode, iteration 1 : 311/597 places, 276/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65378 ms. Remains : 311/597 places, 276/561 transitions.
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-14
Product exploration explored 100000 steps with 332 reset in 226 ms.
Product exploration explored 100000 steps with 331 reset in 237 ms.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 101 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 82 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1238 steps (0 resets) in 17 ms. (68 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 113 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 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 88 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 11 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 12:46:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:26] [INFO ] Implicit Places using invariants in 297 ms returned []
[2025-06-01 12:46:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:46:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 12:46:31] [INFO ] Implicit Places using invariants and state equation in 5018 ms returned []
Implicit Place search using SMT with State Equation took 5318 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:46:31] [INFO ] Redundant transitions in 0 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-01 12:46:31] [INFO ] Invariant cache hit.
[2025-06-01 12:46:31] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/587 variables, and 299 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 220/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/587 variables, and 519 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60040ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60041ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65381 ms. Remains : 311/311 places, 276/276 transitions.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 81 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 73 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 1238 steps (0 resets) in 15 ms. (77 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0)), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 4 factoid took 138 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 78 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 90 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 332 reset in 217 ms.
Product exploration explored 100000 steps with 332 reset in 239 ms.
Built C files in :
/tmp/ltsmin4356610158893137957
[2025-06-01 12:47:33] [INFO ] Computing symmetric may disable matrix : 276 transitions.
[2025-06-01 12:47:33] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:47:33] [INFO ] Computing symmetric may enable matrix : 276 transitions.
[2025-06-01 12:47:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:47:33] [INFO ] Computing Do-Not-Accords matrix : 276 transitions.
[2025-06-01 12:47:33] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:47:33] [INFO ] Built C files in 33ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4356610158893137957
Running compilation step : cd /tmp/ltsmin4356610158893137957;'/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 550 ms.
Running link step : cd /tmp/ltsmin4356610158893137957;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin4356610158893137957;'/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/stateBased14543632137709811284.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 16 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 12:47:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:47:48] [INFO ] Implicit Places using invariants in 331 ms returned []
[2025-06-01 12:47:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:47:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2025-06-01 12:47:53] [INFO ] Implicit Places using invariants and state equation in 4953 ms returned []
Implicit Place search using SMT with State Equation took 5298 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:47:53] [INFO ] Redundant transitions in 0 ms returned []
Running 220 sub problems to find dead transitions.
[2025-06-01 12:47:53] [INFO ] Invariant cache hit.
[2025-06-01 12:47:53] [INFO ] State equation strengthened by 6 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 0/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 481/587 variables, and 299 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30013 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/255 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/255 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (OVERLAPS) 3/258 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/258 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (OVERLAPS) 223/481 variables, 258/293 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/481 variables, 6/299 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/481 variables, 220/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 481/587 variables, and 519 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/311 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60046ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60046ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65369 ms. Remains : 311/311 places, 276/276 transitions.
Built C files in :
/tmp/ltsmin8697693332829844683
[2025-06-01 12:48:53] [INFO ] Computing symmetric may disable matrix : 276 transitions.
[2025-06-01 12:48:53] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:48:53] [INFO ] Computing symmetric may enable matrix : 276 transitions.
[2025-06-01 12:48:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:48:53] [INFO ] Computing Do-Not-Accords matrix : 276 transitions.
[2025-06-01 12:48:53] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:48:53] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8697693332829844683
Running compilation step : cd /tmp/ltsmin8697693332829844683;'/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 581 ms.
Running link step : cd /tmp/ltsmin8697693332829844683;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin8697693332829844683;'/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/stateBased13154595469956955161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:49:08] [INFO ] Flatten gal took : 15 ms
[2025-06-01 12:49:08] [INFO ] Flatten gal took : 16 ms
[2025-06-01 12:49:08] [INFO ] Time to serialize gal into /tmp/LTL14199568741878453554.gal : 2 ms
[2025-06-01 12:49:08] [INFO ] Time to serialize properties into /tmp/LTL16112551880150007748.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/LTL14199568741878453554.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12033314188188634303.hoa' '-atoms' '/tmp/LTL16112551880150007748.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...320
Loading property file /tmp/LTL16112551880150007748.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12033314188188634303.hoa
Reverse transition relation is NOT exact ! Due to transitions t19, t32.t33, t36.t37, t40.t41, t44.t45, t48.t49, t52.t53, t56.t57, t60.t61, t64.t65, t70.t71...478
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:49:23] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:49:23] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:49:23] [INFO ] Time to serialize gal into /tmp/LTL16525679942152223770.gal : 4 ms
[2025-06-01 12:49:23] [INFO ] Time to serialize properties into /tmp/LTL13104485735731419720.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/LTL16525679942152223770.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13104485735731419720.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 : !((G(F("(elected_30_to_left_10<=election_20_0_1_to_left_20)"))))
Formula 0 simplified : FG!"(elected_30_to_left_10<=election_20_0_1_to_left_20)"
Reverse transition relation is NOT exact ! Due to transitions t19, t32.t33, t36.t37, t40.t41, t44.t45, t48.t49, t52.t53, t56.t57, t60.t61, t64.t65, t70.t71...478
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:49:38] [INFO ] Flatten gal took : 8 ms
[2025-06-01 12:49:38] [INFO ] Applying decomposition
[2025-06-01 12:49:38] [INFO ] Flatten gal took : 9 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3831118132488943292.txt' '-o' '/tmp/graph3831118132488943292.bin' '-w' '/tmp/graph3831118132488943292.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3831118132488943292.bin' '-l' '-1' '-v' '-w' '/tmp/graph3831118132488943292.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:49:38] [INFO ] Decomposing Gal with order
[2025-06-01 12:49:38] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:49:39] [INFO ] Removed a total of 178 redundant transitions.
[2025-06-01 12:49:39] [INFO ] Flatten gal took : 18 ms
[2025-06-01 12:49:39] [INFO ] Fuse similar labels procedure discarded/fused a total of 13 labels/synchronizations in 4 ms.
[2025-06-01 12:49:39] [INFO ] Time to serialize gal into /tmp/LTL10172011442664381963.gal : 3 ms
[2025-06-01 12:49:39] [INFO ] Time to serialize properties into /tmp/LTL11947923035668306581.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/LTL10172011442664381963.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11947923035668306581.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 : !((G(F("(gu124.elected_30_to_left_10<=gu124.election_20_0_1_to_left_20)"))))
Formula 0 simplified : FG!"(gu124.elected_30_to_left_10<=gu124.election_20_0_1_to_left_20)"
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gi0.t80_t81, gi1.gi0.gi0.t74_t75, gi1.gi0.gi0.t70_t71, gi1.gi0.gi0.t64_t65, gi1.gi0.g...878
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-14 finished in 274183 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 3 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Graph (complete) has 1124 edges and 597 vertex of which 596 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 243 transitions
Trivial Post-agglo rules discarded 243 transitions
Performed 243 trivial Post agglomeration. Transition count delta: 243
Iterating post reduction 0 with 243 rules applied. Total rules applied 244 place count 566 transition count 288
Reduce places removed 243 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 245 rules applied. Total rules applied 489 place count 323 transition count 286
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 491 place count 321 transition count 286
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 499 place count 313 transition count 278
Iterating global reduction 3 with 8 rules applied. Total rules applied 507 place count 313 transition count 278
Applied a total of 507 rules in 44 ms. Remains 313 /597 variables (removed 284) and now considering 278/561 (removed 283) transitions.
// Phase 1: matrix 278 rows 313 cols
[2025-06-01 12:49:54] [INFO ] Computed 35 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:54] [INFO ] Implicit Places using invariants in 496 ms returned []
[2025-06-01 12:49:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:49:58] [INFO ] Implicit Places using invariants and state equation in 3318 ms returned []
Implicit Place search using SMT with State Equation took 3835 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:49:58] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-01 12:49:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 3/481 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/591 variables, and 293 constraints, problems are : Problem set: 0 solved, 219 unsolved in 27291 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 211/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SMT process timed out in 57336ms, After SMT, problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 57338ms
Starting structural reductions in SI_LTL mode, iteration 1 : 313/597 places, 278/561 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61224 ms. Remains : 313/597 places, 278/561 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-15
Product exploration explored 100000 steps with 665 reset in 314 ms.
Product exploration explored 100000 steps with 666 reset in 338 ms.
Computed a total of 313 stabilizing places and 278 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 278
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 102 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 659 steps (0 resets) in 12 ms. (50 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 138 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 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0)]
[2025-06-01 12:50:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:50:57] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 793 ms returned sat
[2025-06-01 12:51:11] [INFO ] [Real]Absence check using state equation in 14066 ms returned unknown
Could not prove EG (NOT p0)
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 278/278 transitions.
Applied a total of 0 rules in 7 ms. Remains 313 /313 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-06-01 12:51:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:51:12] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-06-01 12:51:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:51:15] [INFO ] Implicit Places using invariants and state equation in 3294 ms returned []
Implicit Place search using SMT with State Equation took 3616 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:51:15] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-01 12:51: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/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 3/481 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/591 variables, and 293 constraints, problems are : Problem set: 0 solved, 219 unsolved in 28042 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 211/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SMT process timed out in 58074ms, After SMT, problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 58074ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61709 ms. Remains : 313/313 places, 278/278 transitions.
Computed a total of 313 stabilizing places and 278 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 313 transition count 278
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 93 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 661 steps (0 resets) in 9 ms. (66 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 4 factoid took 96 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
[2025-06-01 12:52:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:52:15] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 792 ms returned sat
[2025-06-01 12:52:29] [INFO ] [Real]Absence check using state equation in 14070 ms returned unknown
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 665 reset in 315 ms.
Product exploration explored 100000 steps with 665 reset in 337 ms.
Built C files in :
/tmp/ltsmin6139617684997542345
[2025-06-01 12:52:29] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2025-06-01 12:52:29] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:52:29] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2025-06-01 12:52:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:52:29] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2025-06-01 12:52:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:52:29] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6139617684997542345
Running compilation step : cd /tmp/ltsmin6139617684997542345;'/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 566 ms.
Running link step : cd /tmp/ltsmin6139617684997542345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin6139617684997542345;'/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/stateBased153932914330838855.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 313 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 313/313 places, 278/278 transitions.
Applied a total of 0 rules in 18 ms. Remains 313 /313 variables (removed 0) and now considering 278/278 (removed 0) transitions.
[2025-06-01 12:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:52:45] [INFO ] Implicit Places using invariants in 312 ms returned []
[2025-06-01 12:52:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:52:48] [INFO ] Implicit Places using invariants and state equation in 3288 ms returned []
Implicit Place search using SMT with State Equation took 3601 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:52:48] [INFO ] Redundant transitions in 1 ms returned []
Running 219 sub problems to find dead transitions.
[2025-06-01 12:52:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (OVERLAPS) 3/481 variables, 2/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 0/481 variables, 0/293 constraints. Problems are: Problem set: 0 solved, 219 unsolved
No progress, stopping.
After SMT solving in domain Real declared 481/591 variables, and 293 constraints, problems are : Problem set: 0 solved, 219 unsolved in 27534 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 258/313 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/254 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (OVERLAPS) 2/256 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/256 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (OVERLAPS) 222/478 variables, 256/291 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/478 variables, 211/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/478 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 219 unsolved
SMT process timed out in 57563ms, After SMT, problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 57565ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 61189 ms. Remains : 313/313 places, 278/278 transitions.
Built C files in :
/tmp/ltsmin6557095795840502055
[2025-06-01 12:53:46] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2025-06-01 12:53:46] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:53:46] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2025-06-01 12:53:46] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:53:46] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2025-06-01 12:53:46] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:53:46] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6557095795840502055
Running compilation step : cd /tmp/ltsmin6557095795840502055;'/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 570 ms.
Running link step : cd /tmp/ltsmin6557095795840502055;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin6557095795840502055;'/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/stateBased5222496908612685014.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:54:01] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:54:01] [INFO ] Flatten gal took : 8 ms
[2025-06-01 12:54:01] [INFO ] Time to serialize gal into /tmp/LTL12687316945717303799.gal : 1 ms
[2025-06-01 12:54:01] [INFO ] Time to serialize properties into /tmp/LTL2920512751038057786.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/LTL12687316945717303799.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5328898666549800490.hoa' '-atoms' '/tmp/LTL2920512751038057786.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/LTL2920512751038057786.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5328898666549800490.hoa
Reverse transition relation is NOT exact ! Due to transitions t32.t33, t36.t37, t40.t41, t44.t45, t48.t49, t52.t53, t56.t57, t60.t61, t64.t65, t70.t71, t74...468
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:54:16] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:54:16] [INFO ] Flatten gal took : 7 ms
[2025-06-01 12:54:16] [INFO ] Time to serialize gal into /tmp/LTL7856397323993512222.gal : 4 ms
[2025-06-01 12:54:16] [INFO ] Time to serialize properties into /tmp/LTL15794525552694269196.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/LTL7856397323993512222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15794525552694269196.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 : !((G(F("((reply_30_3_to_left_1>=1)&&(election_30_3_3_to_right_2<=rcv_right_election_25_0_1_24))"))))
Formula 0 simplified : FG!"((reply_30_3_to_left_1>=1)&&(election_30_3_3_to_right_2<=rcv_right_election_25_0_1_24))"
Reverse transition relation is NOT exact ! Due to transitions t32.t33, t36.t37, t40.t41, t44.t45, t48.t49, t52.t53, t56.t57, t60.t61, t64.t65, t70.t71, t74...468
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:54:31] [INFO ] Flatten gal took : 11 ms
[2025-06-01 12:54:31] [INFO ] Applying decomposition
[2025-06-01 12:54:31] [INFO ] Flatten gal took : 6 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/graph8901523383780620206.txt' '-o' '/tmp/graph8901523383780620206.bin' '-w' '/tmp/graph8901523383780620206.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8901523383780620206.bin' '-l' '-1' '-v' '-w' '/tmp/graph8901523383780620206.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:54:31] [INFO ] Decomposing Gal with order
[2025-06-01 12:54:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:54:31] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-01 12:54:31] [INFO ] Flatten gal took : 15 ms
[2025-06-01 12:54:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 28 labels/synchronizations in 5 ms.
[2025-06-01 12:54:31] [INFO ] Time to serialize gal into /tmp/LTL17568183611944861518.gal : 3 ms
[2025-06-01 12:54:31] [INFO ] Time to serialize properties into /tmp/LTL8743474569419301674.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/LTL17568183611944861518.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8743474569419301674.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 : !((G(F("((gi1.gi1.gi0.gi1.gu63.reply_30_3_to_left_1>=1)&&(gu56.election_30_3_3_to_right_2<=gu56.rcv_right_election_25_0_1_24))"))))
Formula 0 simplified : FG!"((gi1.gi1.gi0.gi1.gu63.reply_30_3_to_left_1>=1)&&(gu56.election_30_3_3_to_right_2<=gu56.rcv_right_election_25_0_1_24))"
Reverse transition relation is NOT exact ! Due to transitions gi1.gi0.gi0.gi3.t96_t97, gi1.gi0.gi0.t370_t371, gi1.gi0.gi0.t90_t91, gi1.gi0.gi0.t86_t87, gi1...828
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-15 finished in 292548 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((G((p0||X(p1)))||((p0||X(p1))&&F(p2))))||((G((p0||X(p1)))||((p0||X(p1))&&F(p2)))&&(F(!p0) U X(p3)))))'
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(F(p0)))))'
Found a Shortening insensitive property : HirschbergSinclair-PT-30-LTLCardinality-07
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 597 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 597/597 places, 561/561 transitions.
Graph (complete) has 1124 edges and 597 vertex of which 596 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 0 output transitions
Reduce places removed 30 places and 30 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 247 transitions
Trivial Post-agglo rules discarded 247 transitions
Performed 247 trivial Post agglomeration. Transition count delta: 247
Iterating post reduction 0 with 247 rules applied. Total rules applied 248 place count 566 transition count 284
Reduce places removed 247 places and 0 transitions.
Iterating post reduction 1 with 247 rules applied. Total rules applied 495 place count 319 transition count 284
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 503 place count 311 transition count 276
Iterating global reduction 2 with 8 rules applied. Total rules applied 511 place count 311 transition count 276
Applied a total of 511 rules in 24 ms. Remains 311 /597 variables (removed 286) and now considering 276/561 (removed 285) transitions.
// Phase 1: matrix 276 rows 311 cols
[2025-06-01 12:54:47] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:47] [INFO ] Implicit Places using invariants in 316 ms returned []
[2025-06-01 12:54:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:54:50] [INFO ] Implicit Places using invariants and state equation in 3243 ms returned []
Implicit Place search using SMT with State Equation took 3566 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-01 12:54:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/587 variables, and 289 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20438 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 217/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/587 variables, and 506 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50474ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 50475ms
Starting structural reductions in LI_LTL mode, iteration 1 : 311/597 places, 276/561 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 54066 ms. Remains : 311/597 places, 276/561 transitions.
Running random walk in product with property : HirschbergSinclair-PT-30-LTLCardinality-07
Product exploration explored 100000 steps with 636 reset in 299 ms.
Product exploration explored 100000 steps with 637 reset in 328 ms.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 177 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 695 steps (0 resets) in 9 ms. (69 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 107 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 12:55:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:55:43] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 335 ms returned sat
[2025-06-01 12:55:43] [INFO ] [Real]Absence check using state equation in 167 ms returned sat
[2025-06-01 12:55:43] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:55:43] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 94 ms returned sat
[2025-06-01 12:55:43] [INFO ] [Nat]Absence check using state equation in 157 ms returned sat
[2025-06-01 12:55:43] [INFO ] Computed and/alt/rep : 217/223/217 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-01 12:55:44] [INFO ] Added : 96 causal constraints over 20 iterations in 536 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 9 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 12:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:44] [INFO ] Implicit Places using invariants in 325 ms returned []
[2025-06-01 12:55:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:55:47] [INFO ] Implicit Places using invariants and state equation in 3180 ms returned []
Implicit Place search using SMT with State Equation took 3523 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-01 12:55:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/587 variables, and 289 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20236 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 217/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/587 variables, and 506 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50266ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 50266ms
Finished structural reductions in LTL mode , in 1 iterations and 53800 ms. Remains : 311/311 places, 276/276 transitions.
Computed a total of 311 stabilizing places and 276 stable transitions
Complete graph has no SCC; deadlocks are unavoidable. place count 311 transition count 276
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge (and all enablings converge to false).
Detected that all paths lead to deadlock. Applying this knowledge to assert that all AP eventually converge : F ( (Ga|G!a) & (Gb|G!b)...)
Starting Z3 with timeout 6000.0 s and query timeout 600000.0 ms
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 93 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 178 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 682 steps (0 resets) in 12 ms. (52 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (F (G (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 169 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
[2025-06-01 12:56:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:56:39] [INFO ] [Real]Absence check using 0 positive and 35 generalized place invariants in 337 ms returned sat
[2025-06-01 12:56:39] [INFO ] [Real]Absence check using state equation in 175 ms returned sat
[2025-06-01 12:56:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-01 12:56:39] [INFO ] [Nat]Absence check using 0 positive and 35 generalized place invariants in 97 ms returned sat
[2025-06-01 12:56:39] [INFO ] [Nat]Absence check using state equation in 127 ms returned sat
[2025-06-01 12:56:40] [INFO ] Computed and/alt/rep : 217/223/217 causal constraints (skipped 0 transitions) in 16 ms.
[2025-06-01 12:56:40] [INFO ] Added : 96 causal constraints over 20 iterations in 527 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 168 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 637 reset in 305 ms.
Product exploration explored 100000 steps with 637 reset in 332 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 171 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 14 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 12:56:41] [INFO ] Redundant transitions in 1 ms returned []
Running 217 sub problems to find dead transitions.
[2025-06-01 12:56: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/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/587 variables, and 289 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20239 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 217/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/587 variables, and 506 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50274ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 50274ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 50297 ms. Remains : 311/311 places, 276/276 transitions.
Built C files in :
/tmp/ltsmin4328151276982468563
[2025-06-01 12:57:31] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4328151276982468563
Running compilation step : cd /tmp/ltsmin4328151276982468563;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 440 ms.
Running link step : cd /tmp/ltsmin4328151276982468563;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin4328151276982468563;'/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/stateBased14104145719537831102.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 311 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 311/311 places, 276/276 transitions.
Applied a total of 0 rules in 12 ms. Remains 311 /311 variables (removed 0) and now considering 276/276 (removed 0) transitions.
[2025-06-01 12:57:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:57:47] [INFO ] Implicit Places using invariants in 321 ms returned []
[2025-06-01 12:57:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 12:57:50] [INFO ] Implicit Places using invariants and state equation in 3192 ms returned []
Implicit Place search using SMT with State Equation took 3525 ms to find 0 implicit places.
Running 217 sub problems to find dead transitions.
[2025-06-01 12:57:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (OVERLAPS) 0/473 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
No progress, stopping.
After SMT solving in domain Real declared 473/587 variables, and 289 constraints, problems are : Problem set: 0 solved, 217 unsolved in 20411 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 217 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/252 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 2 (OVERLAPS) 2/254 variables, 31/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/254 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 4 (OVERLAPS) 219/473 variables, 254/289 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/473 variables, 217/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/473 variables, 0/506 constraints. Problems are: Problem set: 0 solved, 217 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 473/587 variables, and 506 constraints, problems are : Problem set: 0 solved, 217 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 35/35 constraints, State Equation: 254/311 constraints, PredecessorRefiner: 217/217 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 50440ms problems are : Problem set: 0 solved, 217 unsolved
Search for dead transitions found 0 dead transitions in 50440ms
Finished structural reductions in LTL mode , in 1 iterations and 53978 ms. Remains : 311/311 places, 276/276 transitions.
Built C files in :
/tmp/ltsmin5525870042817406345
[2025-06-01 12:58:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5525870042817406345
Running compilation step : cd /tmp/ltsmin5525870042817406345;'/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 450 ms.
Running link step : cd /tmp/ltsmin5525870042817406345;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5525870042817406345;'/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/stateBased10805640537131082982.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-01 12:58:56] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:58:56] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:58:56] [INFO ] Time to serialize gal into /tmp/LTL7837796643568189578.gal : 1 ms
[2025-06-01 12:58:56] [INFO ] Time to serialize properties into /tmp/LTL2904432515555386826.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/LTL7837796643568189578.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13230545197155581531.hoa' '-atoms' '/tmp/LTL2904432515555386826.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/LTL2904432515555386826.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13230545197155581531.hoa
Reverse transition relation is NOT exact ! Due to transitions t32.t33, t36.t37, t40.t41, t44.t45, t48.t49, t52.t53, t56.t57, t60.t61, t64.t65, t70.t71, t74...462
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:59:11] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:59:11] [INFO ] Flatten gal took : 6 ms
[2025-06-01 12:59:11] [INFO ] Time to serialize gal into /tmp/LTL1173969898644324133.gal : 1 ms
[2025-06-01 12:59:11] [INFO ] Time to serialize properties into /tmp/LTL10604955159198522615.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/LTL1173969898644324133.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10604955159198522615.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(F("(rcv_left_election_30_4_3_3>=1)"))))))
Formula 0 simplified : XXXG!"(rcv_left_election_30_4_3_3>=1)"
Reverse transition relation is NOT exact ! Due to transitions t32.t33, t36.t37, t40.t41, t44.t45, t48.t49, t52.t53, t56.t57, t60.t61, t64.t65, t70.t71, t74...462
Computing Next relation with stutter on 6.70552e+21 deadlock states
Detected timeout of ITS tools.
[2025-06-01 12:59:26] [INFO ] Flatten gal took : 10 ms
[2025-06-01 12:59:26] [INFO ] Applying decomposition
[2025-06-01 12:59:26] [INFO ] Flatten gal took : 6 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/graph2918573473522420027.txt' '-o' '/tmp/graph2918573473522420027.bin' '-w' '/tmp/graph2918573473522420027.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2918573473522420027.bin' '-l' '-1' '-v' '-w' '/tmp/graph2918573473522420027.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:59:26] [INFO ] Decomposing Gal with order
[2025-06-01 12:59:26] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:59:26] [INFO ] Removed a total of 180 redundant transitions.
[2025-06-01 12:59:26] [INFO ] Flatten gal took : 17 ms
[2025-06-01 12:59:26] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 4 ms.
[2025-06-01 12:59:26] [INFO ] Time to serialize gal into /tmp/LTL17507852815298454688.gal : 4 ms
[2025-06-01 12:59:26] [INFO ] Time to serialize properties into /tmp/LTL9187867936823282094.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/LTL17507852815298454688.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9187867936823282094.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(F("(i6.i4.u78.rcv_left_election_30_4_3_3>=1)"))))))
Formula 0 simplified : XXXG!"(i6.i4.u78.rcv_left_election_30_4_3_3>=1)"
Reverse transition relation is NOT exact ! Due to transitions t64_t65, t90_t91, t110_t111, t126_t127, t146_t147, t259_t260, t469_t470, i0.t104_t105, i0.t10...536
Computing Next relation with stutter on 6.70552e+21 deadlock states
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
556 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.61062,158228,1,0,273834,278,4421,954270,137,1757,275745
no accepting run found
Formula 0 is TRUE no accepting run found.
ITS tools runner thread asked to quit. Dying gracefully.
Treatment of property HirschbergSinclair-PT-30-LTLCardinality-07 finished in 286164 ms.
FORMULA HirschbergSinclair-PT-30-LTLCardinality-07 TRUE TECHNIQUES SHORTENING_INSENSITIVE
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(G(p0)) U p1)))'
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)))'
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)))'
[2025-06-01 12:59:33] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3033486325106767974
[2025-06-01 12:59:33] [INFO ] Applying decomposition
[2025-06-01 12:59:33] [INFO ] Computing symmetric may disable matrix : 561 transitions.
[2025-06-01 12:59:33] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:59:33] [INFO ] Computing symmetric may enable matrix : 561 transitions.
[2025-06-01 12:59:33] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:59:33] [INFO ] Flatten gal took : 12 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16138729617739196603.txt' '-o' '/tmp/graph16138729617739196603.bin' '-w' '/tmp/graph16138729617739196603.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16138729617739196603.bin' '-l' '-1' '-v' '-w' '/tmp/graph16138729617739196603.weights' '-q' '0' '-e' '0.001'
[2025-06-01 12:59:33] [INFO ] Decomposing Gal with order
[2025-06-01 12:59:33] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-01 12:59:33] [INFO ] Computing Do-Not-Accords matrix : 561 transitions.
[2025-06-01 12:59:33] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-01 12:59:33] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3033486325106767974
Running compilation step : cd /tmp/ltsmin3033486325106767974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-01 12:59:33] [INFO ] Removed a total of 60 redundant transitions.
[2025-06-01 12:59:33] [INFO ] Flatten gal took : 81 ms
[2025-06-01 12:59:33] [INFO ] Fuse similar labels procedure discarded/fused a total of 8 labels/synchronizations in 5 ms.
[2025-06-01 12:59:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality8207165931251721579.gal : 4 ms
[2025-06-01 12:59:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality6450130149299544585.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/LTLCardinality8207165931251721579.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6450130149299544585.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...297
Read 4 LTL properties
Checking formula 0 : !(((G((G(("(gu32.rcv_left_reply_13_0_13>gu32.rcv_right_election_1_0_1_30)")||(X("(gi0.gi1.gi2.gu39.reply_30_3_to_right_23<1)"))))||(((...703
Formula 0 simplified : F(F(!"(gu32.rcv_left_reply_13_0_13>gu32.rcv_right_election_1_0_1_30)" & X!"(gi0.gi1.gi2.gu39.reply_30_3_to_right_23<1)") & ((!"(gu32...678
Compilation finished in 1351 ms.
Running link step : cd /tmp/ltsmin3033486325106767974;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3033486325106767974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))||(([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true))))&&(<>(!(LTLAPp0==true)) U X((LTLAPp3==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: 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( 4/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.034: LTL layer: formula: ([](([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))||(([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true))))&&(<>(!(LTLAPp0==true)) U X((LTLAPp3==true)))))
pins2lts-mc-linux64( 3/ 8), 0.034: "([](([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))||(([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true))))&&(<>(!(LTLAPp0==true)) U X((LTLAPp3==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.034: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.037: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.038: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.054: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.062: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.065: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.199: DFS-FIFO for weak LTL, using special progress label 571
pins2lts-mc-linux64( 0/ 8), 0.199: There are 572 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.199: State length is 598, there are 633 groups
pins2lts-mc-linux64( 0/ 8), 0.199: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.199: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.199: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.199: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.434: ~1 levels ~960 states ~25104 transitions
pins2lts-mc-linux64( 2/ 8), 0.569: ~1 levels ~1920 states ~49928 transitions
pins2lts-mc-linux64( 2/ 8), 0.790: ~1 levels ~3840 states ~98312 transitions
pins2lts-mc-linux64( 0/ 8), 1.181: ~1 levels ~7680 states ~187960 transitions
pins2lts-mc-linux64( 4/ 8), 1.789: ~1 levels ~15360 states ~361928 transitions
pins2lts-mc-linux64( 0/ 8), 2.647: ~1 levels ~30720 states ~646024 transitions
pins2lts-mc-linux64( 0/ 8), 4.414: ~1 levels ~61440 states ~1332152 transitions
pins2lts-mc-linux64( 4/ 8), 7.423: ~1 levels ~122880 states ~2641632 transitions
pins2lts-mc-linux64( 4/ 8), 12.547: ~1 levels ~245760 states ~5063120 transitions
pins2lts-mc-linux64( 4/ 8), 23.146: ~1 levels ~491520 states ~10523856 transitions
pins2lts-mc-linux64( 4/ 8), 43.520: ~1 levels ~983040 states ~20397848 transitions
pins2lts-mc-linux64( 2/ 8), 82.660: ~1 levels ~1966080 states ~39590408 transitions
pins2lts-mc-linux64( 1/ 8), 147.395: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 147.914:
pins2lts-mc-linux64( 0/ 8), 147.914: mean standard work distribution: 3.3% (states) 1.9% (transitions)
pins2lts-mc-linux64( 0/ 8), 147.914:
pins2lts-mc-linux64( 0/ 8), 147.914: Explored 3287595 states 70158184 transitions, fanout: 21.340
pins2lts-mc-linux64( 0/ 8), 147.914: Total exploration time 147.710 sec (147.260 sec minimum, 147.454 sec on average)
pins2lts-mc-linux64( 0/ 8), 147.914: States per second: 22257, Transitions per second: 474972
pins2lts-mc-linux64( 0/ 8), 147.914:
pins2lts-mc-linux64( 0/ 8), 147.914: Progress states detected: 16233163
pins2lts-mc-linux64( 0/ 8), 147.914: Redundant explorations: -79.7478
pins2lts-mc-linux64( 0/ 8), 147.914:
pins2lts-mc-linux64( 0/ 8), 147.914: Queue width: 8B, total height: 20211117, memory: 154.20MB
pins2lts-mc-linux64( 0/ 8), 147.914: Tree memory: 379.8MB, 24.5 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 147.914: Tree fill ratio (roots/leafs): 12.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 147.914: Stored 680 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 147.914: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 147.914: Est. total memory use: 534.0MB (~1178.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3033486325106767974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))||(([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true))))&&(<>(!(LTLAPp0==true)) U X((LTLAPp3==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin3033486325106767974;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '([](([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true)))))||(([](((LTLAPp0==true)||X((LTLAPp1==true))))||(((LTLAPp0==true)||X((LTLAPp1==true)))&&<>((LTLAPp2==true))))&&(<>(!(LTLAPp0==true)) U X((LTLAPp3==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)
Reverse transition relation is NOT exact ! Due to transitions gu19.t53, gu19.t131, gu8.t65, gu8.t69, gi0.gi0.gi0.gi0.gu9.t75, gi0.gi0.gi0.gi0.gu9.t79, gi0....1861
Computing Next relation with stutter on 3.20361e+22 deadlock states
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="HirschbergSinclair-PT-30"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is HirschbergSinclair-PT-30, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r114-tall-174876422000099"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/HirschbergSinclair-PT-30.tgz
mv HirschbergSinclair-PT-30 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;