About the Execution of ITS-Tools for CircularTrains-PT-096
| 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 | T??FFFFFF?FFFFF? | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r030-smll-174853813900412.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 CircularTrains-PT-096, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r030-smll-174853813900412
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 632K
-rw-r--r-- 1 mcc users 8.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 55K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.5K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 17K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 182K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 77K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 4 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 73K 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 CircularTrains-PT-096-LTLFireability-00
FORMULA_NAME CircularTrains-PT-096-LTLFireability-01
FORMULA_NAME CircularTrains-PT-096-LTLFireability-02
FORMULA_NAME CircularTrains-PT-096-LTLFireability-03
FORMULA_NAME CircularTrains-PT-096-LTLFireability-04
FORMULA_NAME CircularTrains-PT-096-LTLFireability-05
FORMULA_NAME CircularTrains-PT-096-LTLFireability-06
FORMULA_NAME CircularTrains-PT-096-LTLFireability-07
FORMULA_NAME CircularTrains-PT-096-LTLFireability-08
FORMULA_NAME CircularTrains-PT-096-LTLFireability-09
FORMULA_NAME CircularTrains-PT-096-LTLFireability-10
FORMULA_NAME CircularTrains-PT-096-LTLFireability-11
FORMULA_NAME CircularTrains-PT-096-LTLFireability-12
FORMULA_NAME CircularTrains-PT-096-LTLFireability-13
FORMULA_NAME CircularTrains-PT-096-LTLFireability-14
FORMULA_NAME CircularTrains-PT-096-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1748895538024
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CircularTrains-PT-096
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 20:19:00] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 20:19:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 20:19:00] [INFO ] Load time of PNML (sax parser for PT used): 141 ms
[2025-06-02 20:19:00] [INFO ] Transformed 192 places.
[2025-06-02 20:19:00] [INFO ] Transformed 96 transitions.
[2025-06-02 20:19:00] [INFO ] Parsed PT model containing 192 places and 96 transitions and 384 arcs in 366 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 20 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA CircularTrains-PT-096-LTLFireability-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-096-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 70 out of 192 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 192/192 places, 96/96 transitions.
Applied a total of 0 rules in 27 ms. Remains 192 /192 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 192 cols
[2025-06-02 20:19:01] [INFO ] Computed 97 invariants in 30 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:19:02] [INFO ] Implicit Places using invariants in 759 ms returned [1, 4, 8, 10, 14, 20, 27, 29, 37, 49, 109, 115, 123, 125, 144, 155, 166, 174, 177, 182, 183, 186, 187, 189]
Discarding 24 places :
Implicit Place search using SMT only with invariants took 824 ms to find 24 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 168/192 places, 96/96 transitions.
Applied a total of 0 rules in 14 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 906 ms. Remains : 168/192 places, 96/96 transitions.
Support contains 70 out of 168 places after structural reductions.
[2025-06-02 20:19:02] [INFO ] Flatten gal took : 73 ms
[2025-06-02 20:19:02] [INFO ] Flatten gal took : 32 ms
[2025-06-02 20:19:02] [INFO ] Input system was already deterministic with 96 transitions.
Support contains 68 out of 168 places (down from 70) after GAL structural reductions.
RANDOM walk for 1709 steps (0 resets) in 236 ms. (7 steps per ms) remains 0/33 properties
FORMULA CircularTrains-PT-096-LTLFireability-06 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA CircularTrains-PT-096-LTLFireability-14 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U p1)&&X(X(X(F(p2)))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 28 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2025-06-02 20:19:03] [INFO ] Computed 73 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:19:04] [INFO ] Implicit Places using invariants in 463 ms returned [3, 30, 104, 146, 148, 151, 159, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 466 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 502 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 754 ms :[(OR (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01
Product exploration explored 100000 steps with 2076 reset in 1059 ms.
Product exploration explored 100000 steps with 2117 reset in 817 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 5 factoid took 400 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 448 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 389 steps (0 resets) in 18 ms. (20 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 5 factoid took 687 ms. Reduced automaton from 9 states, 11 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 525 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:19:09] [INFO ] Computed 65 invariants in 7 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:19:09] [INFO ] [Real]Absence check using 63 positive place invariants in 39 ms returned sat
[2025-06-02 20:19:09] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 15 ms returned sat
[2025-06-02 20:19:10] [INFO ] [Real]Absence check using state equation in 927 ms returned sat
[2025-06-02 20:19:10] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 23 ms.
[2025-06-02 20:19:11] [INFO ] Added : 61 causal constraints over 13 iterations in 830 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-02 20:19:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:19:11] [INFO ] [Real]Absence check using 63 positive place invariants in 35 ms returned sat
[2025-06-02 20:19:11] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 8 ms returned sat
[2025-06-02 20:19:12] [INFO ] [Real]Absence check using state equation in 833 ms returned sat
[2025-06-02 20:19:12] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 15 ms.
[2025-06-02 20:19:13] [INFO ] Added : 61 causal constraints over 13 iterations in 814 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 20:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:19:13] [INFO ] Implicit Places using invariants in 299 ms returned []
[2025-06-02 20:19:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:19:14] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:19:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5437 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4664 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10181ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 10191ms
Finished structural reductions in LTL mode , in 1 iterations and 10866 ms. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 4 factoid took 443 ms. Reduced automaton from 9 states, 11 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 492 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 431 steps (0 resets) in 16 ms. (25 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 669 ms. Reduced automaton from 9 states, 11 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 479 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 467 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
[2025-06-02 20:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:19:27] [INFO ] [Real]Absence check using 63 positive place invariants in 36 ms returned sat
[2025-06-02 20:19:27] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 17 ms returned sat
[2025-06-02 20:19:28] [INFO ] [Real]Absence check using state equation in 800 ms returned sat
[2025-06-02 20:19:28] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 20:19:28] [INFO ] Added : 61 causal constraints over 13 iterations in 522 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-02 20:19:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:19:28] [INFO ] [Real]Absence check using 63 positive place invariants in 37 ms returned sat
[2025-06-02 20:19:28] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 9 ms returned sat
[2025-06-02 20:19:29] [INFO ] [Real]Absence check using state equation in 847 ms returned sat
[2025-06-02 20:19:29] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 14 ms.
[2025-06-02 20:19:30] [INFO ] Added : 61 causal constraints over 13 iterations in 886 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 459 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 2131 reset in 767 ms.
Product exploration explored 100000 steps with 2096 reset in 509 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 469 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 160 transition count 96
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 4 Pre rules applied. Total rules applied 28 place count 160 transition count 96
Deduced a syphon composed of 32 places in 1 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 42 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:19:33] [INFO ] Redundant transitions in 3 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:19:33] [INFO ] Computed 65 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 92 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 47 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 4 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:34] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/84 constraints. Problems are: Problem set: 20 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 3 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:35] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:36] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 3 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:36] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:36] [INFO ] Deduced a trap composed of 2 places in 40 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:36] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:19:36] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 12/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 257 constraints, problems are : Problem set: 32 solved, 32 unsolved in 5131 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 95/159 variables, 63/63 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 32/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 32/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 32 solved, 32 unsolved in 2376 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 32/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7536ms problems are : Problem set: 32 solved, 32 unsolved
Search for dead transitions found 32 dead transitions in 7539ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 64/96 transitions.
Graph (complete) has 256 edges and 160 vertex of which 128 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.3 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 14 ms. Remains 128 /160 variables (removed 32) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 7618 ms. Remains : 128/160 places, 64/96 transitions.
Built C files in :
/tmp/ltsmin1759739633078163475
[2025-06-02 20:19:40] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1759739633078163475
Running compilation step : cd /tmp/ltsmin1759739633078163475;'/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 694 ms.
Running link step : cd /tmp/ltsmin1759739633078163475;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 91 ms.
Running LTSmin : cd /tmp/ltsmin1759739633078163475;'/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/stateBased13765725921084841272.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:19:56] [INFO ] Computed 65 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:19:56] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-02 20:19:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:19:56] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 422 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:19:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3468 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2977 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6461ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6462ms
Finished structural reductions in LTL mode , in 1 iterations and 6890 ms. Remains : 160/160 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin14016905304777146886
[2025-06-02 20:20:02] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14016905304777146886
Running compilation step : cd /tmp/ltsmin14016905304777146886;'/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 297 ms.
Running link step : cd /tmp/ltsmin14016905304777146886;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14016905304777146886;'/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/stateBased12297268960572583681.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 20:20:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:20:18] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:20:18] [INFO ] Time to serialize gal into /tmp/LTL14158786540489171691.gal : 5 ms
[2025-06-02 20:20:18] [INFO ] Time to serialize properties into /tmp/LTL12327293825539895439.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/LTL14158786540489171691.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16380734448099630646.hoa' '-atoms' '/tmp/LTL12327293825539895439.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/LTL12327293825539895439.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16380734448099630646.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:20:33] [INFO ] Flatten gal took : 11 ms
[2025-06-02 20:20:33] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:20:33] [INFO ] Time to serialize gal into /tmp/LTL11590166144891861692.gal : 3 ms
[2025-06-02 20:20:33] [INFO ] Time to serialize properties into /tmp/LTL16705163291810361362.ltl : 3 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/LTL11590166144891861692.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16705163291810361362.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F(((F("((F37>=1)&&(Section_36>=1))"))U("((F9>=1)&&(Section_8>=1))"))&&(X(X(X(F("((Section_26>=1)&&(F27>=1))"))))))))
Formula 0 simplified : G((G!"((F37>=1)&&(Section_36>=1))" R !"((F9>=1)&&(Section_8>=1))") | XXXG!"((Section_26>=1)&&(F27>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:20:48] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:20:48] [INFO ] Applying decomposition
[2025-06-02 20:20:48] [INFO ] Flatten gal took : 11 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph3888008652601732324.txt' '-o' '/tmp/graph3888008652601732324.bin' '-w' '/tmp/graph3888008652601732324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3888008652601732324.bin' '-l' '-1' '-v' '-w' '/tmp/graph3888008652601732324.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:20:48] [INFO ] Decomposing Gal with order
[2025-06-02 20:20:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:20:48] [INFO ] Flatten gal took : 65 ms
[2025-06-02 20:20:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 20:20:48] [INFO ] Time to serialize gal into /tmp/LTL16352216133007941332.gal : 4 ms
[2025-06-02 20:20:48] [INFO ] Time to serialize properties into /tmp/LTL6029187906948673029.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/LTL16352216133007941332.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6029187906948673029.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 : !((F(((F("((i5.u8.F37>=1)&&(i5.u8.Section_36>=1))"))U("((i12.u18.F9>=1)&&(i12.u26.Section_8>=1))"))&&(X(X(X(F("((i1.u3.Section_26>=1)&...182
Formula 0 simplified : G((G!"((i5.u8.F37>=1)&&(i5.u8.Section_36>=1))" R !"((i12.u18.F9>=1)&&(i12.u26.Section_8>=1))") | XXXG!"((i1.u3.Section_26>=1)&&(i10....169
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 119927 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(F(p0))||F((!p1 U (p2||G(!p1)))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2025-06-02 20:21:03] [INFO ] Computed 73 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:21:03] [INFO ] Implicit Places using invariants in 243 ms returned [3, 30, 104, 146, 148, 151, 159, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 245 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 252 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-02
Product exploration explored 100000 steps with 21213 reset in 473 ms.
Product exploration explored 100000 steps with 21592 reset in 609 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 276 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 399 steps (0 resets) in 14 ms. (26 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT p1))), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F p2)]
Knowledge based reduction with 3 factoid took 396 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:21:06] [INFO ] Computed 65 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:21:06] [INFO ] Implicit Places using invariants in 167 ms returned []
[2025-06-02 20:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:21:06] [INFO ] Implicit Places using invariants and state equation in 228 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:21:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3507 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2951 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6471ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6472ms
Finished structural reductions in LTL mode , in 1 iterations and 6886 ms. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 3 factoid took 275 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 650 steps (0 resets) in 11 ms. (54 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F p2)]
Knowledge based reduction with 3 factoid took 399 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 113 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 21923 reset in 467 ms.
Product exploration explored 100000 steps with 22083 reset in 514 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 30 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 17 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:21:15] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:21:15] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 53 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:16] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/84 constraints. Problems are: Problem set: 20 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:21:17] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 12/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 257 constraints, problems are : Problem set: 32 solved, 32 unsolved in 3562 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 95/159 variables, 63/63 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 32/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 32/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 32 solved, 32 unsolved in 1640 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 32/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 5214ms problems are : Problem set: 32 solved, 32 unsolved
Search for dead transitions found 32 dead transitions in 5215ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 64/96 transitions.
Graph (complete) has 256 edges and 160 vertex of which 128 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 8 ms. Remains 128 /160 variables (removed 32) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 5250 ms. Remains : 128/160 places, 64/96 transitions.
Built C files in :
/tmp/ltsmin10802811156508477544
[2025-06-02 20:21:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10802811156508477544
Running compilation step : cd /tmp/ltsmin10802811156508477544;'/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 301 ms.
Running link step : cd /tmp/ltsmin10802811156508477544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin10802811156508477544;'/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/stateBased2234081503946034076.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:21:35] [INFO ] Computed 65 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:21:35] [INFO ] Implicit Places using invariants in 143 ms returned []
[2025-06-02 20:21:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:21:36] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 388 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:21:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3571 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2883 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6464ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6466ms
Finished structural reductions in LTL mode , in 1 iterations and 6856 ms. Remains : 160/160 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin412763203802713365
[2025-06-02 20:21:42] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin412763203802713365
Running compilation step : cd /tmp/ltsmin412763203802713365;'/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 280 ms.
Running link step : cd /tmp/ltsmin412763203802713365;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin412763203802713365;'/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/stateBased15802917787751359415.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 20:21:57] [INFO ] Flatten gal took : 23 ms
[2025-06-02 20:21:57] [INFO ] Flatten gal took : 19 ms
[2025-06-02 20:21:57] [INFO ] Time to serialize gal into /tmp/LTL9559826161956277367.gal : 4 ms
[2025-06-02 20:21:57] [INFO ] Time to serialize properties into /tmp/LTL5159687482837819611.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/LTL9559826161956277367.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9449365226983711362.hoa' '-atoms' '/tmp/LTL5159687482837819611.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/LTL5159687482837819611.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9449365226983711362.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:22:12] [INFO ] Flatten gal took : 8 ms
[2025-06-02 20:22:12] [INFO ] Flatten gal took : 9 ms
[2025-06-02 20:22:12] [INFO ] Time to serialize gal into /tmp/LTL10805947076953573646.gal : 1 ms
[2025-06-02 20:22:12] [INFO ] Time to serialize properties into /tmp/LTL13312683500293404561.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/LTL10805947076953573646.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13312683500293404561.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((X(F("((F94>=1)&&(Section_93>=1))")))||(F((!("((Section_23>=1)&&(F24>=1))"))U(("((!((F91>=1)&&(Section_90>=1)))&&(!((Section_23>=...217
Formula 0 simplified : X(XG!"((F94>=1)&&(Section_93>=1))" & G("((Section_23>=1)&&(F24>=1))" M !"((!((F91>=1)&&(Section_90>=1)))&&(!((Section_23>=1)&&(F24>=...163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:22:28] [INFO ] Flatten gal took : 8 ms
[2025-06-02 20:22:28] [INFO ] Applying decomposition
[2025-06-02 20:22:28] [INFO ] Flatten gal took : 8 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph8816904782478961857.txt' '-o' '/tmp/graph8816904782478961857.bin' '-w' '/tmp/graph8816904782478961857.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8816904782478961857.bin' '-l' '-1' '-v' '-w' '/tmp/graph8816904782478961857.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:22:28] [INFO ] Decomposing Gal with order
[2025-06-02 20:22:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:22:28] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:22:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 20:22:28] [INFO ] Time to serialize gal into /tmp/LTL3415596931888762574.gal : 2 ms
[2025-06-02 20:22:28] [INFO ] Time to serialize properties into /tmp/LTL6230497084484579758.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/LTL3415596931888762574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6230497084484579758.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(F("((i9.u12.F94>=1)&&(i9.u12.Section_93>=1))")))||(F((!("((i4.u29.Section_23>=1)&&(i4.u5.F24>=1))"))U(("((!((i9.u16.F91>=1)&&(...284
Formula 0 simplified : X(XG!"((i9.u12.F94>=1)&&(i9.u12.Section_93>=1))" & G("((i4.u29.Section_23>=1)&&(i4.u5.F24>=1))" M !"((!((i9.u16.F91>=1)&&(i9.u16.Sec...217
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-02 finished in 99533 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 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2025-06-02 20:22:43] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:43] [INFO ] Implicit Places using invariants in 197 ms returned [3, 30, 146, 148, 151, 159, 164]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 200 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 203 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 132 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-03
Product exploration explored 100000 steps with 774 reset in 503 ms.
Product exploration explored 100000 steps with 791 reset in 456 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 70 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 545 steps (0 resets) in 8 ms. (60 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 1 factoid took 87 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 129 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 161 cols
[2025-06-02 20:22:45] [INFO ] Computed 66 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 1 factoid took 105 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-096-LTLFireability-03 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-096-LTLFireability-03 finished in 2096 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(((p1 U p2)||p0))&&F(G((p3 U p4))))))'
Support contains 8 out of 168 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 168 transition count 82
Reduce places removed 14 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 15 rules applied. Total rules applied 29 place count 154 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 30 place count 153 transition count 81
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 30 place count 153 transition count 73
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 56 place count 140 transition count 68
Applied a total of 56 rules in 19 ms. Remains 140 /168 variables (removed 28) and now considering 68/96 (removed 28) transitions.
// Phase 1: matrix 68 rows 140 cols
[2025-06-02 20:22:45] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:45] [INFO ] Implicit Places using invariants in 204 ms returned [90, 123, 125, 127, 133, 137]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 208 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 134/168 places, 68/96 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 134 transition count 67
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 133 transition count 67
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 132 transition count 66
Applied a total of 4 rules in 7 ms. Remains 132 /134 variables (removed 2) and now considering 66/68 (removed 2) transitions.
// Phase 1: matrix 66 rows 132 cols
[2025-06-02 20:22:45] [INFO ] Computed 67 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:45] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-06-02 20:22:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:46] [INFO ] Implicit Places using invariants and state equation in 315 ms returned []
Implicit Place search using SMT with State Equation took 559 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 132/168 places, 66/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 793 ms. Remains : 132/168 places, 66/96 transitions.
Stuttering acceptance computed with spot in 179 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-04
Product exploration explored 100000 steps with 421 reset in 456 ms.
Product exploration explored 100000 steps with 389 reset in 526 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p4) (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p4) (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (AND (NOT p4) p3))), (X p0), (X (NOT p0)), (X (OR p4 p3)), (X (NOT (OR p4 p3))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (AND (NOT p4) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR p4 p3))), (X (X (NOT (OR p4 p3))))]
Knowledge based reduction with 3 factoid took 799 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 147 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 296 steps (0 resets) in 10 ms. (26 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p2 (NOT p4) (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p4) (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (AND (NOT p4) p3))), (X p0), (X (NOT p0)), (X (OR p4 p3)), (X (NOT (OR p4 p3))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (AND (NOT p4) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR p4 p3))), (X (X (NOT (OR p4 p3)))), (F (NOT (OR p0 p2))), (F p4), (F (NOT p0)), (F (NOT (OR p4 (NOT p3)))), (F (NOT p2)), (F p3), (F (NOT (AND (NOT p4) (NOT p3)))), (F (NOT (AND (NOT p4) (NOT p3))))]
Knowledge based reduction with 3 factoid took 1163 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 203 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
Stuttering acceptance computed with spot in 165 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
[2025-06-02 20:22:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:22:49] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2025-06-02 20:22:49] [INFO ] [Real]Absence check using 63 positive and 4 generalized place invariants in 7 ms returned sat
[2025-06-02 20:22:50] [INFO ] [Real]Absence check using state equation in 423 ms returned sat
[2025-06-02 20:22:50] [INFO ] Computed and/alt/rep : 34/66/34 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 20:22:50] [INFO ] Added : 32 causal constraints over 7 iterations in 324 ms. Result :sat
Could not prove EG (NOT p4)
Support contains 8 out of 132 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 66/66 transitions.
Applied a total of 0 rules in 4 ms. Remains 132 /132 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2025-06-02 20:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:50] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 20:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:50] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 330 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:22:50] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-02 20:22: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/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 63/131 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 66/198 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/198 variables, 0/199 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 198/198 variables, and 199 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1710 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/68 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/68 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 63/131 variables, 63/65 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/131 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 1/132 variables, 1/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/132 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 66/198 variables, 132/199 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/198 variables, 34/233 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/198 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/198 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 198/198 variables, and 233 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1568 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 132/132 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3287ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 3288ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3628 ms. Remains : 132/132 places, 66/66 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p2 (NOT p4) (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p4) (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (AND (NOT p4) p3))), (X p0), (X (NOT p0)), (X (OR p4 p3)), (X (NOT (OR p4 p3))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (AND (NOT p4) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR p4 p3))), (X (X (NOT (OR p4 p3))))]
Knowledge based reduction with 3 factoid took 743 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
Reduction of identical properties reduced properties to check from 8 to 7
RANDOM walk for 292 steps (0 resets) in 6 ms. (41 steps per ms) remains 0/7 properties
Knowledge obtained : [(AND p0 p2 (NOT p4) (NOT p3)), (X (NOT p4)), (X (NOT (AND (NOT p0) (NOT p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (AND (NOT p4) (NOT p3))), (X (NOT (AND (NOT p4) (NOT p3)))), (X (AND (NOT p4) p3)), (X (NOT (AND (NOT p4) p3))), (X p0), (X (NOT p0)), (X (OR p4 p3)), (X (NOT (OR p4 p3))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p4) (NOT p3)))), (X (X (NOT (AND (NOT p4) (NOT p3))))), (X (X p4)), (X (X (NOT p4))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND (NOT p4) p3))), (X (X (NOT (AND (NOT p4) p3)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR p4 p3))), (X (X (NOT (OR p4 p3)))), (F (NOT (OR p0 p2))), (F p4), (F (NOT p0)), (F (NOT (OR p4 (NOT p3)))), (F (NOT p2)), (F p3), (F (NOT (AND (NOT p4) (NOT p3)))), (F (NOT (AND (NOT p4) (NOT p3))))]
Knowledge based reduction with 3 factoid took 934 ms. Reduced automaton from 4 states, 10 edges and 4 AP (stutter insensitive) to 4 states, 10 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
Stuttering acceptance computed with spot in 146 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
[2025-06-02 20:22:56] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:22:56] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2025-06-02 20:22:56] [INFO ] [Real]Absence check using 63 positive and 4 generalized place invariants in 7 ms returned sat
[2025-06-02 20:22:56] [INFO ] [Real]Absence check using state equation in 418 ms returned sat
[2025-06-02 20:22:56] [INFO ] Computed and/alt/rep : 34/66/34 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:22:57] [INFO ] Added : 32 causal constraints over 7 iterations in 300 ms. Result :sat
Could not prove EG (NOT p4)
Stuttering acceptance computed with spot in 213 ms :[(OR (NOT p4) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2)), (NOT p4), (NOT p4)]
Product exploration explored 100000 steps with 430 reset in 689 ms.
Product exploration explored 100000 steps with 517 reset in 525 ms.
Built C files in :
/tmp/ltsmin12752814479963437378
[2025-06-02 20:22:58] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2025-06-02 20:22:58] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:22:58] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2025-06-02 20:22:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:22:58] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2025-06-02 20:22:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:22:58] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12752814479963437378
Running compilation step : cd /tmp/ltsmin12752814479963437378;'/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 255 ms.
Running link step : cd /tmp/ltsmin12752814479963437378;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12752814479963437378;'/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/stateBased14719111682502189307.hoa' '--buchi-type=spotba'
LTSmin run took 409 ms.
FORMULA CircularTrains-PT-096-LTLFireability-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-04 finished in 14168 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 34 place count 151 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 18 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2025-06-02 20:22:59] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:59] [INFO ] Implicit Places using invariants in 188 ms returned [2, 24, 90, 122, 124, 126, 132, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 189 ms to find 8 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 129 transition count 65
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 129 transition count 64
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 9 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2025-06-02 20:22:59] [INFO ] Computed 65 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:22:59] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 20:22:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:00] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 374 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 590 ms. Remains : 128/168 places, 64/96 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-05
Product exploration explored 100000 steps with 0 reset in 405 ms.
Product exploration explored 100000 steps with 0 reset in 547 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 136 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
RANDOM walk for 64 steps (0 resets) in 5 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
[2025-06-02 20:23:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:23:01] [INFO ] [Real]Absence check using 63 positive place invariants in 25 ms returned sat
[2025-06-02 20:23:01] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-02 20:23:01] [INFO ] [Real]Absence check using state equation in 211 ms returned sat
[2025-06-02 20:23:01] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 20:23:01] [INFO ] Added : 30 causal constraints over 6 iterations in 146 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 3 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-02 20:23:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:02] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-02 20:23:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:02] [INFO ] Implicit Places using invariants and state equation in 214 ms returned []
Implicit Place search using SMT with State Equation took 366 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:23:02] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-02 20:23:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1955 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1242 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3203ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3204ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3581 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 140 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 118 steps (0 resets) in 4 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0)]
Knowledge based reduction with 2 factoid took 128 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
[2025-06-02 20:23:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:23:06] [INFO ] [Real]Absence check using 63 positive place invariants in 31 ms returned sat
[2025-06-02 20:23:06] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 11 ms returned sat
[2025-06-02 20:23:06] [INFO ] [Real]Absence check using state equation in 305 ms returned sat
[2025-06-02 20:23:06] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:23:06] [INFO ] Added : 30 causal constraints over 6 iterations in 171 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 404 ms.
Product exploration explored 100000 steps with 0 reset in 540 ms.
Built C files in :
/tmp/ltsmin1851756108304358392
[2025-06-02 20:23:07] [INFO ] Computing symmetric may disable matrix : 64 transitions.
[2025-06-02 20:23:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:23:07] [INFO ] Computing symmetric may enable matrix : 64 transitions.
[2025-06-02 20:23:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:23:07] [INFO ] Computing Do-Not-Accords matrix : 64 transitions.
[2025-06-02 20:23:07] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:23:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1851756108304358392
Running compilation step : cd /tmp/ltsmin1851756108304358392;'/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 382 ms.
Running link step : cd /tmp/ltsmin1851756108304358392;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin1851756108304358392;'/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/stateBased7425383902220702111.hoa' '--buchi-type=spotba'
LTSmin run took 208 ms.
FORMULA CircularTrains-PT-096-LTLFireability-05 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-05 finished in 8789 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U p1)||X(G(p1))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2025-06-02 20:23:08] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:08] [INFO ] Implicit Places using invariants in 182 ms returned [3, 30, 104, 146, 148, 151, 159, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 183 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 186 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 211 ms :[(NOT p1), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-096-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-07 finished in 414 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(X((p0&&G(p1)))))&&(X(X(p0)) U ((!p2&&X(X(p0)))||X(X(G(p0))))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 20:23:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:08] [INFO ] Implicit Places using invariants in 191 ms returned [3, 30, 104, 151, 159, 164]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 192 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 162/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 162 /162 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 194 ms. Remains : 162/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 414 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-08
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-096-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-096-LTLFireability-08 finished in 635 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0))||G(p1)) U (X(p0)&&p2))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 3 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 20:23:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:09] [INFO ] Implicit Places using invariants in 210 ms returned [3, 30, 104, 146, 148, 151, 159, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 212 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 217 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 335 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-09
Product exploration explored 100000 steps with 957 reset in 415 ms.
Product exploration explored 100000 steps with 987 reset in 448 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 18 factoid took 441 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 24 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 332 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 15 to 14
RANDOM walk for 40000 steps (8 resets) in 431 ms. (92 steps per ms) remains 2/14 properties
BEST_FIRST walk for 40004 steps (8 resets) in 291 ms. (137 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 2/2 properties
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:23:11] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf6 is UNSAT
Problem apf11 is UNSAT
After SMT solving in domain Real declared 6/256 variables, and 0 constraints, problems are : Problem set: 2 solved, 0 unsolved in 22 ms.
Refiners :[Positive P Invariants (semi-flows): 0/63 constraints, Generalized P Invariants (flows): 0/2 constraints, State Equation: 0/160 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 28ms problems are : Problem set: 2 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (AND (NOT p2) (NOT p1))), (X (NOT (AND (NOT p2) p1))), (X (NOT p2)), (X (NOT (AND p2 (NOT p1)))), (X (NOT (AND p2 p1))), (X (NOT p1)), (X (X (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p1))))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT (AND p2 p1)))), (X (X (NOT (OR (AND p2 (NOT p0)) (AND (NOT p0) p1))))), (X (X (NOT (AND (NOT p2) (NOT p0) p1)))), (X (X (NOT p1))), (G (OR (NOT p1) p2 p0)), (G (OR (NOT p1) p2))]
False Knowledge obtained : [(X (X (AND (NOT p2) (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p0) (NOT p1))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (NOT p0)), (F (NOT (OR p1 p2 p0))), (F (NOT (OR p1 p0))), (F (NOT (OR p1 (NOT p2) p0))), (F p1), (F p2), (F (NOT (OR (NOT p1) (NOT p2)))), (F (NOT (OR p1 (NOT p2)))), (F (NOT (OR p2 p0))), (F (NOT (OR (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (AND (OR (NOT p1) p0) (OR (NOT p2) p0))))]
Knowledge based reduction with 20 factoid took 1210 ms. Reduced automaton from 8 states, 24 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 360 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 326 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2025-06-02 20:23:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:23:13] [INFO ] [Real]Absence check using 63 positive place invariants in 35 ms returned sat
[2025-06-02 20:23:13] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 21 ms returned sat
[2025-06-02 20:23:14] [INFO ] [Real]Absence check using state equation in 984 ms returned sat
[2025-06-02 20:23:14] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 20:23:15] [INFO ] Added : 61 causal constraints over 13 iterations in 803 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 20:23:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:15] [INFO ] Implicit Places using invariants in 200 ms returned []
[2025-06-02 20:23:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:16] [INFO ] Implicit Places using invariants and state equation in 278 ms returned []
Implicit Place search using SMT with State Equation took 480 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:23:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3846 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2837 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6693ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6694ms
Finished structural reductions in LTL mode , in 1 iterations and 7179 ms. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 13 factoid took 475 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 299 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Reduction of identical properties reduced properties to check from 11 to 9
RANDOM walk for 734 steps (0 resets) in 10 ms. (66 steps per ms) remains 0/9 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT (AND p1 p2))), (X (NOT p1)), (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p2)))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND (NOT p2) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (F (NOT (OR (NOT p2) p1))), (F (NOT (OR p0 (NOT p2)))), (F (NOT (OR (NOT p2) (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT (OR p0 p1))), (F p2), (F (NOT (OR p0 (NOT p1)))), (F p1), (F (NOT (OR p0 p2))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT p0))]
Knowledge based reduction with 13 factoid took 1235 ms. Reduced automaton from 8 states, 22 edges and 3 AP (stutter sensitive) to 8 states, 22 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
[2025-06-02 20:23:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:23:25] [INFO ] [Real]Absence check using 63 positive place invariants in 34 ms returned sat
[2025-06-02 20:23:25] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 22 ms returned sat
[2025-06-02 20:23:26] [INFO ] [Real]Absence check using state equation in 1025 ms returned sat
[2025-06-02 20:23:26] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 20:23:27] [INFO ] Added : 61 causal constraints over 13 iterations in 631 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 325 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 979 reset in 695 ms.
Product exploration explored 100000 steps with 962 reset in 489 ms.
Applying partial POR strategy [false, false, true, true, true, false, true, true]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p2) (NOT p0)), (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1))]
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 30 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 1 ms
Applied a total of 32 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:23:29] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:23:29] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 50 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 37 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 45 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 32 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 3 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:30] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 1 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/84 constraints. Problems are: Problem set: 20 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 1 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:23:31] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 12/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 257 constraints, problems are : Problem set: 32 solved, 32 unsolved in 4294 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 95/159 variables, 63/63 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 32/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 32/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 32 solved, 32 unsolved in 2092 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 32/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6399ms problems are : Problem set: 32 solved, 32 unsolved
Search for dead transitions found 32 dead transitions in 6400ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 64/96 transitions.
Graph (complete) has 256 edges and 160 vertex of which 128 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 128 /160 variables (removed 32) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6419 ms. Remains : 128/160 places, 64/96 transitions.
Built C files in :
/tmp/ltsmin8768048255620967514
[2025-06-02 20:23:35] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8768048255620967514
Running compilation step : cd /tmp/ltsmin8768048255620967514;'/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 280 ms.
Running link step : cd /tmp/ltsmin8768048255620967514;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin8768048255620967514;'/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/stateBased695135399011553734.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:23:50] [INFO ] Computed 65 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:51] [INFO ] Implicit Places using invariants in 230 ms returned []
[2025-06-02 20:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:23:51] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 468 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:23:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4778 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3526 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8310ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 8310ms
Finished structural reductions in LTL mode , in 1 iterations and 8781 ms. Remains : 160/160 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin7444094367125516828
[2025-06-02 20:23:59] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7444094367125516828
Running compilation step : cd /tmp/ltsmin7444094367125516828;'/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 292 ms.
Running link step : cd /tmp/ltsmin7444094367125516828;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7444094367125516828;'/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/stateBased12975081535069680444.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 20:24:14] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:24:14] [INFO ] Flatten gal took : 6 ms
[2025-06-02 20:24:14] [INFO ] Time to serialize gal into /tmp/LTL2227334857490788270.gal : 1 ms
[2025-06-02 20:24:14] [INFO ] Time to serialize properties into /tmp/LTL3361280063967390960.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/LTL2227334857490788270.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8578386545936164646.hoa' '-atoms' '/tmp/LTL3361280063967390960.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/LTL3361280063967390960.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8578386545936164646.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:24:29] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:24:29] [INFO ] Flatten gal took : 6 ms
[2025-06-02 20:24:29] [INFO ] Time to serialize gal into /tmp/LTL11051255971179853712.gal : 1 ms
[2025-06-02 20:24:29] [INFO ] Time to serialize properties into /tmp/LTL123096706544705344.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/LTL11051255971179853712.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL123096706544705344.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(((G(F("((Section_48>=1)&&(F49>=1))")))||(G("(((F69>=1)&&(Section_68>=1))&&((F28>=1)&&(Section_27>=1)))")))U(("((F69>=1)&&(Section...205
Formula 0 simplified : X((FG!"((Section_48>=1)&&(F49>=1))" & F!"(((F69>=1)&&(Section_68>=1))&&((F28>=1)&&(Section_27>=1)))") R (!"((F69>=1)&&(Section_68>=1...194
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:24:44] [INFO ] Flatten gal took : 6 ms
[2025-06-02 20:24:44] [INFO ] Applying decomposition
[2025-06-02 20:24:44] [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/graph8981705227946211702.txt' '-o' '/tmp/graph8981705227946211702.bin' '-w' '/tmp/graph8981705227946211702.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8981705227946211702.bin' '-l' '-1' '-v' '-w' '/tmp/graph8981705227946211702.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:24:44] [INFO ] Decomposing Gal with order
[2025-06-02 20:24:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:24:45] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:24:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 20:24:45] [INFO ] Time to serialize gal into /tmp/LTL12847953384140785483.gal : 2 ms
[2025-06-02 20:24:45] [INFO ] Time to serialize properties into /tmp/LTL7301831480953472365.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/LTL12847953384140785483.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7301831480953472365.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(((G(F("((i12.u19.Section_48>=1)&&(i12.u19.F49>=1))")))||(G("(((i9.u20.F69>=1)&&(i1.u15.Section_68>=1))&&((i11.u5.F28>=1)&&(i11.u5...279
Formula 0 simplified : X((FG!"((i12.u19.Section_48>=1)&&(i12.u19.F49>=1))" & F!"(((i9.u20.F69>=1)&&(i1.u15.Section_68>=1))&&((i11.u5.F28>=1)&&(i11.u5.Secti...268
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-09 finished in 110804 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((F(G(p0))&&G((p1||X(X(X(X(F(p2))))))))))'
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 0 with 18 rules applied. Total rules applied 18 place count 168 transition count 78
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 56 place count 140 transition count 68
Applied a total of 56 rules in 9 ms. Remains 140 /168 variables (removed 28) and now considering 68/96 (removed 28) transitions.
// Phase 1: matrix 68 rows 140 cols
[2025-06-02 20:25:00] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:00] [INFO ] Implicit Places using invariants in 173 ms returned [2, 25, 90, 123, 125, 133, 137]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 174 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 133/168 places, 68/96 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 133 transition count 66
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 131 transition count 66
Applied a total of 4 rules in 4 ms. Remains 131 /133 variables (removed 2) and now considering 66/68 (removed 2) transitions.
// Phase 1: matrix 66 rows 131 cols
[2025-06-02 20:25:00] [INFO ] Computed 66 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:00] [INFO ] Implicit Places using invariants in 142 ms returned []
[2025-06-02 20:25:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:00] [INFO ] Implicit Places using invariants and state equation in 237 ms returned []
Implicit Place search using SMT with State Equation took 393 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 131/168 places, 66/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 581 ms. Remains : 131/168 places, 66/96 transitions.
Stuttering acceptance computed with spot in 439 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-11
Product exploration explored 100000 steps with 3 reset in 637 ms.
Product exploration explored 100000 steps with 0 reset in 664 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 131 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 283 steps (0 resets) in 7 ms. (35 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) p2))), (F p0), (F (NOT (OR (NOT p1) p0 p2))), (F p2), (F (NOT (AND (NOT p1) (NOT p2)))), (F (NOT (OR (NOT p0) p2))), (F p1)]
Knowledge based reduction with 3 factoid took 330 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 140 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2025-06-02 20:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:03] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2025-06-02 20:25:03] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 10 ms returned sat
[2025-06-02 20:25:03] [INFO ] [Real]Absence check using state equation in 257 ms returned sat
[2025-06-02 20:25:03] [INFO ] Computed and/alt/rep : 34/66/34 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:25:03] [INFO ] Added : 32 causal constraints over 7 iterations in 183 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-02 20:25:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:04] [INFO ] [Real]Absence check using 62 positive place invariants in 35 ms returned sat
[2025-06-02 20:25:04] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 15 ms returned sat
[2025-06-02 20:25:04] [INFO ] [Real]Absence check using state equation in 378 ms returned sat
[2025-06-02 20:25:04] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:04] [INFO ] [Nat]Absence check using 62 positive place invariants in 24 ms returned sat
[2025-06-02 20:25:04] [INFO ] [Nat]Absence check using 62 positive and 4 generalized place invariants in 9 ms returned sat
[2025-06-02 20:25:05] [INFO ] [Nat]Absence check using state equation in 448 ms returned sat
[2025-06-02 20:25:05] [INFO ] Computed and/alt/rep : 34/66/34 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:25:05] [INFO ] Added : 32 causal constraints over 7 iterations in 290 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 6 out of 131 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 131/131 places, 66/66 transitions.
Applied a total of 0 rules in 3 ms. Remains 131 /131 variables (removed 0) and now considering 66/66 (removed 0) transitions.
[2025-06-02 20:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:05] [INFO ] Implicit Places using invariants in 149 ms returned []
[2025-06-02 20:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:05] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:25:05] [INFO ] Redundant transitions in 1 ms returned []
Running 34 sub problems to find dead transitions.
[2025-06-02 20:25:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 62/129 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 2/131 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 66/197 variables, 131/197 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (OVERLAPS) 0/197 variables, 0/197 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Real declared 197/197 variables, and 197 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1894 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 34 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/67 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/67 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 2 (OVERLAPS) 62/129 variables, 62/63 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 5 (OVERLAPS) 2/131 variables, 2/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 7 (OVERLAPS) 66/197 variables, 131/197 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/197 variables, 34/231 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/197 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 34 unsolved
At refinement iteration 10 (OVERLAPS) 0/197 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 34 unsolved
No progress, stopping.
After SMT solving in domain Int declared 197/197 variables, and 231 constraints, problems are : Problem set: 0 solved, 34 unsolved in 1863 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 4/4 constraints, State Equation: 131/131 constraints, PredecessorRefiner: 34/34 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3763ms problems are : Problem set: 0 solved, 34 unsolved
Search for dead transitions found 0 dead transitions in 3764ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 4124 ms. Remains : 131/131 places, 66/66 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 7 factoid took 705 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
RANDOM walk for 265 steps (0 resets) in 8 ms. (29 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p1 (NOT p2)))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X p1)), (X (X (NOT p1))), (F (NOT (AND (NOT p2) (NOT p0)))), (F (NOT (OR p2 (NOT p0)))), (F p0), (F (NOT (OR p2 p0 (NOT p1)))), (F (NOT (AND (NOT p2) (NOT p1)))), (F (NOT (OR p2 (NOT p1)))), (F p2), (F p1)]
Knowledge based reduction with 7 factoid took 1063 ms. Reduced automaton from 4 states, 10 edges and 3 AP (stutter insensitive) to 4 states, 10 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 217 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 172 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
[2025-06-02 20:25:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:12] [INFO ] [Real]Absence check using 62 positive place invariants in 36 ms returned sat
[2025-06-02 20:25:12] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 17 ms returned sat
[2025-06-02 20:25:12] [INFO ] [Real]Absence check using state equation in 430 ms returned sat
[2025-06-02 20:25:12] [INFO ] Computed and/alt/rep : 34/66/34 causal constraints (skipped 0 transitions) in 8 ms.
[2025-06-02 20:25:12] [INFO ] Added : 32 causal constraints over 7 iterations in 282 ms. Result :sat
Could not prove EG (NOT p0)
[2025-06-02 20:25:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:12] [INFO ] [Real]Absence check using 62 positive place invariants in 24 ms returned sat
[2025-06-02 20:25:12] [INFO ] [Real]Absence check using 62 positive and 4 generalized place invariants in 8 ms returned sat
[2025-06-02 20:25:13] [INFO ] [Real]Absence check using state equation in 238 ms returned sat
[2025-06-02 20:25:13] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:13] [INFO ] [Nat]Absence check using 62 positive place invariants in 33 ms returned sat
[2025-06-02 20:25:13] [INFO ] [Nat]Absence check using 62 positive and 4 generalized place invariants in 21 ms returned sat
[2025-06-02 20:25:14] [INFO ] [Nat]Absence check using state equation in 700 ms returned sat
[2025-06-02 20:25:14] [INFO ] Computed and/alt/rep : 34/66/34 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:25:14] [INFO ] Added : 32 causal constraints over 7 iterations in 293 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 151 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p0) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 0 reset in 365 ms.
Product exploration explored 100000 steps with 0 reset in 531 ms.
Built C files in :
/tmp/ltsmin11145081934552982277
[2025-06-02 20:25:15] [INFO ] Computing symmetric may disable matrix : 66 transitions.
[2025-06-02 20:25:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:25:15] [INFO ] Computing symmetric may enable matrix : 66 transitions.
[2025-06-02 20:25:15] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:25:15] [INFO ] Computing Do-Not-Accords matrix : 66 transitions.
[2025-06-02 20:25:15] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:25:15] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11145081934552982277
Running compilation step : cd /tmp/ltsmin11145081934552982277;'/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 399 ms.
Running link step : cd /tmp/ltsmin11145081934552982277;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin11145081934552982277;'/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/stateBased16192382920133134252.hoa' '--buchi-type=spotba'
LTSmin run took 596 ms.
FORMULA CircularTrains-PT-096-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-11 finished in 16462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&F(G(p1)))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2025-06-02 20:25:16] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:16] [INFO ] Implicit Places using invariants in 232 ms returned [3, 30, 104, 146, 148, 151, 159]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 233 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 161/168 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 236 ms. Remains : 161/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 185 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-12
Product exploration explored 100000 steps with 0 reset in 392 ms.
Product exploration explored 100000 steps with 0 reset in 705 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 155 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 279 steps (0 resets) in 7 ms. (34 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 224 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 161 cols
[2025-06-02 20:25:19] [INFO ] Computed 66 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:19] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-02 20:25:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:19] [INFO ] Implicit Places using invariants and state equation in 353 ms returned []
Implicit Place search using SMT with State Equation took 500 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:25: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/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/257 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 227 constraints, problems are : Problem set: 0 solved, 64 unsolved in 5937 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/227 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 64/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4014 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9960ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 9961ms
Finished structural reductions in LTL mode , in 1 iterations and 10462 ms. Remains : 161/161 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 169 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 262 steps (0 resets) in 7 ms. (32 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 p1), (X (X p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0)), (F (NOT p1))]
Knowledge based reduction with 2 factoid took 256 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 159 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 148 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 144 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 370 ms.
Product exploration explored 100000 steps with 0 reset in 443 ms.
Applying partial POR strategy [false, true, true, true]
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Support contains 4 out of 161 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 161/161 places, 96/96 transitions.
Performed 28 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 161 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 28 place count 161 transition count 96
Deduced a syphon composed of 30 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 30 place count 161 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 31 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 161 transition count 96
Deduced a syphon composed of 31 places in 0 ms
Applied a total of 31 rules in 12 ms. Remains 161 /161 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:25:31] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 161 cols
[2025-06-02 20:25:31] [INFO ] Computed 66 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (OVERLAPS) 63/160 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 57 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 55 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:32] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 23 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 1 ms to minimize.
Problem TDEAD14 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 20/85 constraints. Problems are: Problem set: 20 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 2 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 2 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD44 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:25:33] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 11/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 11 (OVERLAPS) 0/257 variables, 0/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 257/257 variables, and 258 constraints, problems are : Problem set: 31 solved, 33 unsolved in 3800 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 31 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 0/0 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 1 (OVERLAPS) 94/160 variables, 63/63 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 2/65 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/160 variables, 31/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/160 variables, 0/96 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/161 variables, 1/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/161 variables, 0/97 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 96/257 variables, 161/258 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/257 variables, 33/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/257 variables, 0/291 constraints. Problems are: Problem set: 31 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 257/257 variables, and 291 constraints, problems are : Problem set: 31 solved, 33 unsolved in 2315 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 161/161 constraints, PredecessorRefiner: 33/64 constraints, Known Traps: 31/31 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6124ms problems are : Problem set: 31 solved, 33 unsolved
Search for dead transitions found 31 dead transitions in 6125ms
Found 31 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 31 transitions
Dead transitions reduction (with SMT) removed 31 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 161/161 places, 65/96 transitions.
Graph (complete) has 260 edges and 161 vertex of which 130 are kept as prefixes of interest. Removing 31 places using SCC suffix rule.1 ms
Discarding 31 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 130 /161 variables (removed 31) and now considering 65/65 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/161 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6151 ms. Remains : 130/161 places, 65/96 transitions.
Built C files in :
/tmp/ltsmin191260929921391573
[2025-06-02 20:25:37] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin191260929921391573
Running compilation step : cd /tmp/ltsmin191260929921391573;'/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 309 ms.
Running link step : cd /tmp/ltsmin191260929921391573;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 58 ms.
Running LTSmin : cd /tmp/ltsmin191260929921391573;'/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/stateBased1096770834763611488.hoa' '--buchi-type=spotba'
LTSmin run took 1932 ms.
FORMULA CircularTrains-PT-096-LTLFireability-12 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-12 finished in 23674 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 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 18 rules applied. Total rules applied 35 place count 151 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 36 place count 150 transition count 78
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 36 place count 150 transition count 73
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 3 with 10 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 8 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2025-06-02 20:25:40] [INFO ] Computed 73 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:40] [INFO ] Implicit Places using invariants in 167 ms returned [2, 24, 89, 121, 123, 125, 136]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 169 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 65
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 65
Applied a total of 4 rules in 3 ms. Remains 130 /132 variables (removed 2) and now considering 65/67 (removed 2) transitions.
// Phase 1: matrix 65 rows 130 cols
[2025-06-02 20:25:40] [INFO ] Computed 66 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:40] [INFO ] Implicit Places using invariants in 150 ms returned []
[2025-06-02 20:25:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:40] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 357 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/168 places, 65/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 537 ms. Remains : 130/168 places, 65/96 transitions.
Stuttering acceptance computed with spot in 128 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 399 ms.
Product exploration explored 100000 steps with 0 reset in 517 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 236 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 161 steps (0 resets) in 5 ms. (26 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 348 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 105 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-02 20:25:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:42] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2025-06-02 20:25:42] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 9 ms returned sat
[2025-06-02 20:25:43] [INFO ] [Real]Absence check using state equation in 385 ms returned sat
[2025-06-02 20:25:43] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 20:25:43] [INFO ] Added : 30 causal constraints over 6 iterations in 180 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 4 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 65/65 transitions.
Applied a total of 0 rules in 3 ms. Remains 130 /130 variables (removed 0) and now considering 65/65 (removed 0) transitions.
[2025-06-02 20:25:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:43] [INFO ] Implicit Places using invariants in 184 ms returned []
[2025-06-02 20:25:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:43] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:25:43] [INFO ] Redundant transitions in 2 ms returned []
Running 33 sub problems to find dead transitions.
[2025-06-02 20:25:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (OVERLAPS) 0/195 variables, 0/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Real declared 195/195 variables, and 196 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1609 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 33 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/66 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/66 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 2 (OVERLAPS) 63/129 variables, 63/64 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/129 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/129 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 5 (OVERLAPS) 1/130 variables, 1/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/130 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 7 (OVERLAPS) 65/195 variables, 130/196 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/195 variables, 33/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
At refinement iteration 10 (OVERLAPS) 0/195 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 33 unsolved
No progress, stopping.
After SMT solving in domain Int declared 195/195 variables, and 229 constraints, problems are : Problem set: 0 solved, 33 unsolved in 1366 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 130/130 constraints, PredecessorRefiner: 33/33 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2982ms problems are : Problem set: 0 solved, 33 unsolved
Search for dead transitions found 0 dead transitions in 2983ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3421 ms. Remains : 130/130 places, 65/65 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 260 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
RANDOM walk for 82 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND p0 (NOT p1))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X p1), (X (NOT p1)), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 277 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
[2025-06-02 20:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:47] [INFO ] [Real]Absence check using 63 positive place invariants in 24 ms returned sat
[2025-06-02 20:25:47] [INFO ] [Real]Absence check using 63 positive and 3 generalized place invariants in 8 ms returned sat
[2025-06-02 20:25:48] [INFO ] [Real]Absence check using state equation in 390 ms returned sat
[2025-06-02 20:25:48] [INFO ] Computed and/alt/rep : 33/65/33 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 20:25:48] [INFO ] Added : 30 causal constraints over 6 iterations in 165 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 112 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 0 reset in 654 ms.
Product exploration explored 100000 steps with 1 reset in 582 ms.
Built C files in :
/tmp/ltsmin17637537310993256453
[2025-06-02 20:25:49] [INFO ] Computing symmetric may disable matrix : 65 transitions.
[2025-06-02 20:25:49] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:25:49] [INFO ] Computing symmetric may enable matrix : 65 transitions.
[2025-06-02 20:25:49] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:25:49] [INFO ] Computing Do-Not-Accords matrix : 65 transitions.
[2025-06-02 20:25:49] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:25:49] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17637537310993256453
Running compilation step : cd /tmp/ltsmin17637537310993256453;'/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 252 ms.
Running link step : cd /tmp/ltsmin17637537310993256453;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 53 ms.
Running LTSmin : cd /tmp/ltsmin17637537310993256453;'/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/stateBased7386582807274817615.hoa' '--buchi-type=spotba'
LTSmin run took 162 ms.
FORMULA CircularTrains-PT-096-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-096-LTLFireability-13 finished in 10078 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(G(p1))))'
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 168 /168 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 168 cols
[2025-06-02 20:25:50] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:50] [INFO ] Implicit Places using invariants in 205 ms returned [3, 30, 104, 146, 148, 151, 159, 164]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 207 ms to find 8 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/168 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 211 ms. Remains : 160/168 places, 96/96 transitions.
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 1488 reset in 697 ms.
Product exploration explored 100000 steps with 1479 reset in 540 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 104 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 340 steps (0 resets) in 6 ms. (48 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 9 factoid took 128 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 99 ms :[(NOT p0), (NOT p0), (NOT p0)]
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:25:52] [INFO ] Computed 65 invariants in 0 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:25:52] [INFO ] [Real]Absence check using 63 positive place invariants in 27 ms returned sat
[2025-06-02 20:25:52] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 15 ms returned sat
[2025-06-02 20:25:53] [INFO ] [Real]Absence check using state equation in 648 ms returned sat
[2025-06-02 20:25:53] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 9 ms.
[2025-06-02 20:25:53] [INFO ] Added : 61 causal constraints over 13 iterations in 549 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 160 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
[2025-06-02 20:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:53] [INFO ] Implicit Places using invariants in 190 ms returned []
[2025-06-02 20:25:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:25:54] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 427 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:25:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3394 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 2804 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6204ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 6205ms
Finished structural reductions in LTL mode , in 1 iterations and 6634 ms. Remains : 160/160 places, 96/96 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 78 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 323 steps (0 resets) in 6 ms. (46 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0)]
Knowledge based reduction with 2 factoid took 86 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-02 20:26:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:26:01] [INFO ] [Real]Absence check using 63 positive place invariants in 33 ms returned sat
[2025-06-02 20:26:01] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 17 ms returned sat
[2025-06-02 20:26:02] [INFO ] [Real]Absence check using state equation in 940 ms returned sat
[2025-06-02 20:26:02] [INFO ] Computed and/alt/rep : 64/96/64 causal constraints (skipped 0 transitions) in 7 ms.
[2025-06-02 20:26:02] [INFO ] Added : 61 causal constraints over 13 iterations in 737 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 101 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1478 reset in 407 ms.
Product exploration explored 100000 steps with 1482 reset in 453 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Performed 30 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 30 rules applied. Total rules applied 30 place count 160 transition count 96
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 30 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 32 place count 160 transition count 96
Deduced a syphon composed of 32 places in 0 ms
Applied a total of 32 rules in 10 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:26:04] [INFO ] Redundant transitions in 2 ms returned []
Running 64 sub problems to find dead transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:26:04] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:04] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:04] [INFO ] Deduced a trap composed of 2 places in 58 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:04] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:04] [INFO ] Deduced a trap composed of 2 places in 51 ms of which 5 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:04] [INFO ] Deduced a trap composed of 2 places in 48 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:04] [INFO ] Deduced a trap composed of 2 places in 43 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 54 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD2 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 20 ms of which 2 ms to minimize.
Problem TDEAD4 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 3 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD8 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 33 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 31 ms of which 2 ms to minimize.
Problem TDEAD12 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 3 ms to minimize.
Problem TDEAD0 is UNSAT
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD61 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 20/84 constraints. Problems are: Problem set: 20 solved, 44 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 28 ms of which 1 ms to minimize.
Problem TDEAD16 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 3 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 19 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:05] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD40 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:06] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 3 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:06] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD42 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:06] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 3 ms to minimize.
Problem TDEAD43 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 20:26:06] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Problem TDEAD47 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 12/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 257 constraints, problems are : Problem set: 32 solved, 32 unsolved in 4243 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 32 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 95/159 variables, 63/63 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 32/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/96 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/160 variables, 1/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/160 variables, 0/97 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 96/256 variables, 160/257 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 32/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 32 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 32 solved, 32 unsolved in 2310 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 32/64 constraints, Known Traps: 32/32 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6561ms problems are : Problem set: 32 solved, 32 unsolved
Search for dead transitions found 32 dead transitions in 6561ms
Found 32 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 32 transitions
Dead transitions reduction (with SMT) removed 32 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 160/160 places, 64/96 transitions.
Graph (complete) has 256 edges and 160 vertex of which 128 are kept as prefixes of interest. Removing 32 places using SCC suffix rule.1 ms
Discarding 32 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 5 ms. Remains 128 /160 variables (removed 32) and now considering 64/64 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 128/160 places, 64/96 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 6584 ms. Remains : 128/160 places, 64/96 transitions.
Built C files in :
/tmp/ltsmin12605407601008540260
[2025-06-02 20:26:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12605407601008540260
Running compilation step : cd /tmp/ltsmin12605407601008540260;'/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 307 ms.
Running link step : cd /tmp/ltsmin12605407601008540260;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin12605407601008540260;'/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/stateBased8355669572047269069.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 160 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 160/160 places, 96/96 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 96/96 (removed 0) transitions.
// Phase 1: matrix 96 rows 160 cols
[2025-06-02 20:26:25] [INFO ] Computed 65 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:26:25] [INFO ] Implicit Places using invariants in 178 ms returned []
[2025-06-02 20:26:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:26:26] [INFO ] Implicit Places using invariants and state equation in 268 ms returned []
Implicit Place search using SMT with State Equation took 447 ms to find 0 implicit places.
Running 64 sub problems to find dead transitions.
[2025-06-02 20:26:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 225 constraints, problems are : Problem set: 0 solved, 64 unsolved in 4571 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 64 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/96 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 1 (OVERLAPS) 63/159 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/159 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/159 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 4 (OVERLAPS) 1/160 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/160 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 6 (OVERLAPS) 96/256 variables, 160/225 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 64/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
At refinement iteration 9 (OVERLAPS) 0/256 variables, 0/289 constraints. Problems are: Problem set: 0 solved, 64 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 289 constraints, problems are : Problem set: 0 solved, 64 unsolved in 3076 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 160/160 constraints, PredecessorRefiner: 64/64 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7656ms problems are : Problem set: 0 solved, 64 unsolved
Search for dead transitions found 0 dead transitions in 7657ms
Finished structural reductions in LTL mode , in 1 iterations and 8106 ms. Remains : 160/160 places, 96/96 transitions.
Built C files in :
/tmp/ltsmin8610682113046701170
[2025-06-02 20:26:33] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8610682113046701170
Running compilation step : cd /tmp/ltsmin8610682113046701170;'/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 447 ms.
Running link step : cd /tmp/ltsmin8610682113046701170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin8610682113046701170;'/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/stateBased5552893765783188759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 20:26:49] [INFO ] Flatten gal took : 15 ms
[2025-06-02 20:26:49] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:26:49] [INFO ] Time to serialize gal into /tmp/LTL15427302105188085000.gal : 2 ms
[2025-06-02 20:26:49] [INFO ] Time to serialize properties into /tmp/LTL12136843256324030322.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/LTL15427302105188085000.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3461574029537453181.hoa' '-atoms' '/tmp/LTL12136843256324030322.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL12136843256324030322.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3461574029537453181.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:27:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 20:27:04] [INFO ] Flatten gal took : 5 ms
[2025-06-02 20:27:04] [INFO ] Time to serialize gal into /tmp/LTL10419960374609752489.gal : 1 ms
[2025-06-02 20:27:04] [INFO ] Time to serialize properties into /tmp/LTL9722379631245830792.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/LTL10419960374609752489.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9722379631245830792.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((F87>=1)&&(Section_86>=1))"))||(X(G("((Section_11>=1)&&(F12>=1))")))))
Formula 0 simplified : G!"((F87>=1)&&(Section_86>=1))" & XF!"((Section_11>=1)&&(F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:27:19] [INFO ] Flatten gal took : 4 ms
[2025-06-02 20:27:19] [INFO ] Applying decomposition
[2025-06-02 20:27:19] [INFO ] Flatten gal took : 4 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph1415040262038053143.txt' '-o' '/tmp/graph1415040262038053143.bin' '-w' '/tmp/graph1415040262038053143.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph1415040262038053143.bin' '-l' '-1' '-v' '-w' '/tmp/graph1415040262038053143.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:27:19] [INFO ] Decomposing Gal with order
[2025-06-02 20:27:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:27:19] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:27:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 20:27:19] [INFO ] Time to serialize gal into /tmp/LTL11925713850155699205.gal : 2 ms
[2025-06-02 20:27:19] [INFO ] Time to serialize properties into /tmp/LTL16642104398488158289.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/LTL11925713850155699205.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16642104398488158289.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...256
Read 1 LTL properties
Checking formula 0 : !(((F("((i9.u27.F87>=1)&&(i8.u5.Section_86>=1))"))||(X(G("((i1.u22.Section_11>=1)&&(i4.u28.F12>=1))")))))
Formula 0 simplified : G!"((i9.u27.F87>=1)&&(i8.u5.Section_86>=1))" & XF!"((i1.u22.Section_11>=1)&&(i4.u28.F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 104018 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(((F(p0) U p1)&&X(X(X(F(p2)))))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-01
Stuttering acceptance computed with spot in 313 ms :[(OR (NOT p1) (NOT p2)), (AND p1 (NOT p0) (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 168 transition count 80
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 33 place count 152 transition count 79
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 7 Pre rules applied. Total rules applied 34 place count 151 transition count 72
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 14 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 3 with 8 rules applied. Total rules applied 56 place count 140 transition count 68
Applied a total of 56 rules in 8 ms. Remains 140 /168 variables (removed 28) and now considering 68/96 (removed 28) transitions.
// Phase 1: matrix 68 rows 140 cols
[2025-06-02 20:27:34] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:27:34] [INFO ] Implicit Places using invariants in 154 ms returned [2, 24, 90, 123, 125, 127, 133, 137]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 165 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 132/168 places, 68/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 132 transition count 66
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 130 transition count 66
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 4 place count 130 transition count 64
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 128 transition count 64
Applied a total of 8 rules in 5 ms. Remains 128 /132 variables (removed 4) and now considering 64/68 (removed 4) transitions.
// Phase 1: matrix 64 rows 128 cols
[2025-06-02 20:27:34] [INFO ] Computed 65 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:27:35] [INFO ] Implicit Places using invariants in 157 ms returned []
[2025-06-02 20:27:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:27:35] [INFO ] Implicit Places using invariants and state equation in 196 ms returned []
Implicit Place search using SMT with State Equation took 355 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 534 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-01
Product exploration explored 100000 steps with 3735 reset in 456 ms.
Product exploration explored 100000 steps with 3677 reset in 504 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 4 factoid took 345 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 196 steps (0 resets) in 6 ms. (28 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT p1)), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(X (AND (NOT p1) (NOT p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 4 factoid took 490 ms. Reduced automaton from 9 states, 11 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 304 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
[2025-06-02 20:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using 63 positive place invariants in 21 ms returned sat
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using state equation in 268 ms returned sat
[2025-06-02 20:27:38] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:27:38] [INFO ] Added : 30 causal constraints over 6 iterations in 165 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-02 20:27:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-02 20:27:38] [INFO ] [Real]Absence check using state equation in 214 ms returned sat
[2025-06-02 20:27:38] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:27:39] [INFO ] Added : 30 causal constraints over 6 iterations in 171 ms. Result :sat
Could not prove EG (NOT p2)
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-02 20:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:27:39] [INFO ] Implicit Places using invariants in 155 ms returned []
[2025-06-02 20:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:27:39] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 20:27:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1451 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1246 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2703ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2703ms
Finished structural reductions in LTL mode , in 1 iterations and 3074 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 331 ms. Reduced automaton from 9 states, 11 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
RANDOM walk for 242 steps (0 resets) in 5 ms. (40 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (NOT p1)), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p0), (X (NOT p0)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT p0)), (F (NOT (OR p0 p2))), (F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR p0 p1)))]
Knowledge based reduction with 3 factoid took 473 ms. Reduced automaton from 9 states, 11 edges and 3 AP (stutter sensitive) to 9 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 307 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
[2025-06-02 20:27:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:27:44] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2025-06-02 20:27:44] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 9 ms returned sat
[2025-06-02 20:27:44] [INFO ] [Real]Absence check using state equation in 276 ms returned sat
[2025-06-02 20:27:44] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 20:27:44] [INFO ] Added : 30 causal constraints over 6 iterations in 165 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-02 20:27:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:27:44] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2025-06-02 20:27:44] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 4 ms returned sat
[2025-06-02 20:27:44] [INFO ] [Real]Absence check using state equation in 217 ms returned sat
[2025-06-02 20:27:44] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 20:27:44] [INFO ] Added : 30 causal constraints over 6 iterations in 166 ms. Result :sat
Could not prove EG (NOT p2)
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 3673 reset in 451 ms.
Product exploration explored 100000 steps with 3719 reset in 499 ms.
Applying partial POR strategy [false, false, false, false, false, false, false, true, true]
Stuttering acceptance computed with spot in 306 ms :[(OR (NOT p1) (NOT p2)), (AND (NOT p0) p1 (NOT p2)), (NOT p1), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:27:46] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-02 20:27:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1467 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1243 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2722ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2723ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2731 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin3876405314687678398
[2025-06-02 20:27:49] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3876405314687678398
Running compilation step : cd /tmp/ltsmin3876405314687678398;'/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 231 ms.
Running link step : cd /tmp/ltsmin3876405314687678398;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin3876405314687678398;'/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/stateBased3509142534222612665.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-02 20:28:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:28:04] [INFO ] Implicit Places using invariants in 137 ms returned []
[2025-06-02 20:28:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:28:04] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 20:28:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1414 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1202 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2621ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2621ms
Finished structural reductions in LTL mode , in 1 iterations and 2921 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin15611152264994335035
[2025-06-02 20:28:07] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15611152264994335035
Running compilation step : cd /tmp/ltsmin15611152264994335035;'/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 339 ms.
Running link step : cd /tmp/ltsmin15611152264994335035;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15611152264994335035;'/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/stateBased8435379346568315199.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 20:28:22] [INFO ] Flatten gal took : 10 ms
[2025-06-02 20:28:22] [INFO ] Flatten gal took : 8 ms
[2025-06-02 20:28:22] [INFO ] Time to serialize gal into /tmp/LTL16842747220652595204.gal : 1 ms
[2025-06-02 20:28:22] [INFO ] Time to serialize properties into /tmp/LTL13739328611171656348.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/LTL16842747220652595204.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6427586424353414030.hoa' '-atoms' '/tmp/LTL13739328611171656348.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL13739328611171656348.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6427586424353414030.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:28:37] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:28:37] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:28:37] [INFO ] Time to serialize gal into /tmp/LTL2383109597328941880.gal : 0 ms
[2025-06-02 20:28:37] [INFO ] Time to serialize properties into /tmp/LTL17223202428504014538.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/LTL2383109597328941880.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17223202428504014538.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(((F("((F37>=1)&&(Section_36>=1))"))U("((F9>=1)&&(Section_8>=1))"))&&(X(X(X(F("((Section_26>=1)&&(F27>=1))"))))))))
Formula 0 simplified : G((G!"((F37>=1)&&(Section_36>=1))" R !"((F9>=1)&&(Section_8>=1))") | XXXG!"((Section_26>=1)&&(F27>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:28:52] [INFO ] Flatten gal took : 4 ms
[2025-06-02 20:28:52] [INFO ] Applying decomposition
[2025-06-02 20:28:52] [INFO ] Flatten gal took : 3 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/graph8084206777224067324.txt' '-o' '/tmp/graph8084206777224067324.bin' '-w' '/tmp/graph8084206777224067324.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8084206777224067324.bin' '-l' '-1' '-v' '-w' '/tmp/graph8084206777224067324.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:28:52] [INFO ] Decomposing Gal with order
[2025-06-02 20:28:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:28:52] [INFO ] Flatten gal took : 16 ms
[2025-06-02 20:28:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 20:28:52] [INFO ] Time to serialize gal into /tmp/LTL14047030753842526141.gal : 21 ms
[2025-06-02 20:28:52] [INFO ] Time to serialize properties into /tmp/LTL16139559208672783152.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/LTL14047030753842526141.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16139559208672783152.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...256
Read 1 LTL properties
Checking formula 0 : !((F(((F("((i2.i0.u3.F37>=1)&&(i2.i0.u50.Section_36>=1))"))U("((i3.i0.u9.F9>=1)&&(i3.i0.u5.Section_8>=1))"))&&(X(X(X(F("((i9.i1.u40.Se...197
Formula 0 simplified : G((G!"((i2.i0.u3.F37>=1)&&(i2.i0.u50.Section_36>=1))" R !"((i3.i0.u9.F9>=1)&&(i3.i0.u5.Section_8>=1))") | XXXG!"((i9.i1.u40.Section_...184
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-01 finished in 93652 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(F(p0))||F((!p1 U (p2||G(!p1)))))))'
Found a Shortening insensitive property : CircularTrains-PT-096-LTLFireability-02
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0)), (AND (NOT p2) p1 (NOT p0))]
Support contains 6 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 168 transition count 79
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 151 transition count 79
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 34 place count 151 transition count 73
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 46 place count 145 transition count 73
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 58 place count 139 transition count 67
Applied a total of 58 rules in 6 ms. Remains 139 /168 variables (removed 29) and now considering 67/96 (removed 29) transitions.
// Phase 1: matrix 67 rows 139 cols
[2025-06-02 20:29:08] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:29:08] [INFO ] Implicit Places using invariants in 234 ms returned [2, 24, 90, 122, 124, 126, 132, 136]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 235 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 131/168 places, 67/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 131 transition count 65
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 3 rules applied. Total rules applied 5 place count 129 transition count 64
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 128 transition count 64
Applied a total of 6 rules in 3 ms. Remains 128 /131 variables (removed 3) and now considering 64/67 (removed 3) transitions.
// Phase 1: matrix 64 rows 128 cols
[2025-06-02 20:29:08] [INFO ] Computed 65 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:29:08] [INFO ] Implicit Places using invariants in 146 ms returned []
[2025-06-02 20:29:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:29:08] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 350 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 594 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-02
Product exploration explored 100000 steps with 22021 reset in 469 ms.
Product exploration explored 100000 steps with 22357 reset in 512 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 323 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 519 steps (0 resets) in 12 ms. (39 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) (NOT p1) p0), (X (X (NOT (AND (NOT p2) p1 (NOT p0)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p2) (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F p2)]
Knowledge based reduction with 2 factoid took 487 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-02 20:29:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:29:11] [INFO ] Implicit Places using invariants in 144 ms returned []
[2025-06-02 20:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:29:11] [INFO ] Implicit Places using invariants and state equation in 201 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 20:29:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1932 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1229 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3167ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3167ms
Finished structural reductions in LTL mode , in 1 iterations and 3514 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 346 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
RANDOM walk for 325 steps (0 resets) in 8 ms. (36 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p2) p0 (NOT p1)), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : [(X (NOT p2)), (X p2), (X (X p2)), (X (X (NOT p2))), (X (X (AND (NOT p0) (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p1), (F (NOT p0)), (F (NOT (OR p0 (NOT p1) p2))), (F (NOT (OR p0 p1 p2))), (F p2)]
Knowledge based reduction with 2 factoid took 410 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Product exploration explored 100000 steps with 22183 reset in 781 ms.
Product exploration explored 100000 steps with 22578 reset in 505 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1), (AND (NOT p2) (NOT p0) p1)]
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:29:17] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-02 20:29: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/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1368 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1224 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2597ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2597ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 2604 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin17186451978666061486
[2025-06-02 20:29:19] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17186451978666061486
Running compilation step : cd /tmp/ltsmin17186451978666061486;'/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 266 ms.
Running link step : cd /tmp/ltsmin17186451978666061486;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin17186451978666061486;'/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/stateBased4616697453749002660.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-02 20:29:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:29:35] [INFO ] Implicit Places using invariants in 153 ms returned []
[2025-06-02 20:29:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:29:35] [INFO ] Implicit Places using invariants and state equation in 200 ms returned []
Implicit Place search using SMT with State Equation took 354 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 20:29:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2232 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1734 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3970ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3970ms
Finished structural reductions in LTL mode , in 1 iterations and 4325 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin2295333645302444059
[2025-06-02 20:29:39] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2295333645302444059
Running compilation step : cd /tmp/ltsmin2295333645302444059;'/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 337 ms.
Running link step : cd /tmp/ltsmin2295333645302444059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin2295333645302444059;'/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/stateBased7678302943236522615.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 20:29:54] [INFO ] Flatten gal took : 4 ms
[2025-06-02 20:29:54] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:29:54] [INFO ] Time to serialize gal into /tmp/LTL14293385325614055121.gal : 5 ms
[2025-06-02 20:29:54] [INFO ] Time to serialize properties into /tmp/LTL5623486472175789926.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/LTL14293385325614055121.gal' '-t' 'CGAL' '-hoa' '/tmp/aut1336441117930579860.hoa' '-atoms' '/tmp/LTL5623486472175789926.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/LTL5623486472175789926.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut1336441117930579860.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:30:09] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:30:09] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:30:09] [INFO ] Time to serialize gal into /tmp/LTL17924135122163156568.gal : 1 ms
[2025-06-02 20:30:09] [INFO ] Time to serialize properties into /tmp/LTL12549844639902177525.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/LTL17924135122163156568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12549844639902177525.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((X(F("((F94>=1)&&(Section_93>=1))")))||(F((!("((Section_23>=1)&&(F24>=1))"))U(("((!((F91>=1)&&(Section_90>=1)))&&(!((Section_23>=...217
Formula 0 simplified : X(XG!"((F94>=1)&&(Section_93>=1))" & G("((Section_23>=1)&&(F24>=1))" M !"((!((F91>=1)&&(Section_90>=1)))&&(!((Section_23>=1)&&(F24>=...163
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:30:24] [INFO ] Flatten gal took : 5 ms
[2025-06-02 20:30:24] [INFO ] Applying decomposition
[2025-06-02 20:30:24] [INFO ] Flatten gal took : 5 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/graph2490748213114870073.txt' '-o' '/tmp/graph2490748213114870073.bin' '-w' '/tmp/graph2490748213114870073.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2490748213114870073.bin' '-l' '-1' '-v' '-w' '/tmp/graph2490748213114870073.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:30:24] [INFO ] Decomposing Gal with order
[2025-06-02 20:30:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:30:24] [INFO ] Flatten gal took : 12 ms
[2025-06-02 20:30:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 20:30:24] [INFO ] Time to serialize gal into /tmp/LTL15852635558394608546.gal : 4 ms
[2025-06-02 20:30:24] [INFO ] Time to serialize properties into /tmp/LTL14460522130751861281.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/LTL15852635558394608546.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14460522130751861281.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...256
Read 1 LTL properties
Checking formula 0 : !((X((X(F("((i11.i0.u7.F94>=1)&&(i11.i1.u50.Section_93>=1))")))||(F((!("((i8.i1.u53.Section_23>=1)&&(i2.i2.u33.F24>=1))"))U(("((!((i11...319
Formula 0 simplified : X(XG!"((i11.i0.u7.F94>=1)&&(i11.i1.u50.Section_93>=1))" & G("((i8.i1.u53.Section_23>=1)&&(i2.i2.u33.F24>=1))" M !"((!((i11.i1.u56.F9...245
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-02 finished in 91717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(F(p0))||G(p1)) U (X(p0)&&p2))))'
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(G(p1))))'
Found a Lengthening insensitive property : CircularTrains-PT-096-LTLFireability-15
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 4 out of 168 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 168/168 places, 96/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 14 place count 168 transition count 82
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 28 place count 154 transition count 82
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 28 place count 154 transition count 72
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 48 place count 144 transition count 72
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 60 place count 138 transition count 66
Applied a total of 60 rules in 5 ms. Remains 138 /168 variables (removed 30) and now considering 66/96 (removed 30) transitions.
// Phase 1: matrix 66 rows 138 cols
[2025-06-02 20:30:40] [INFO ] Computed 73 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:30:40] [INFO ] Implicit Places using invariants in 171 ms returned [2, 24, 89, 121, 123, 125, 131, 135]
Discarding 8 places :
Implicit Place search using SMT only with invariants took 172 ms to find 8 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 130/168 places, 66/96 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 130 transition count 64
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 128 transition count 64
Applied a total of 4 rules in 3 ms. Remains 128 /130 variables (removed 2) and now considering 64/66 (removed 2) transitions.
// Phase 1: matrix 64 rows 128 cols
[2025-06-02 20:30:40] [INFO ] Computed 65 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:30:40] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-02 20:30:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:30:40] [INFO ] Implicit Places using invariants and state equation in 199 ms returned []
Implicit Place search using SMT with State Equation took 419 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 128/168 places, 64/96 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 599 ms. Remains : 128/168 places, 64/96 transitions.
Running random walk in product with property : CircularTrains-PT-096-LTLFireability-15
Product exploration explored 100000 steps with 2870 reset in 436 ms.
Product exploration explored 100000 steps with 2874 reset in 484 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 5 factoid took 266 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 110 steps (0 resets) in 4 ms. (22 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT p0)), (X (NOT p1))]
False Knowledge obtained : [(X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p0))), (X (X p0)), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 5 factoid took 289 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-02 20:30:42] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:30:42] [INFO ] [Real]Absence check using 63 positive place invariants in 33 ms returned sat
[2025-06-02 20:30:42] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 16 ms returned sat
[2025-06-02 20:30:43] [INFO ] [Real]Absence check using state equation in 575 ms returned sat
[2025-06-02 20:30:43] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:30:43] [INFO ] Added : 30 causal constraints over 6 iterations in 183 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 128 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 0 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-02 20:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:30:43] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-06-02 20:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:30:43] [INFO ] Implicit Places using invariants and state equation in 202 ms returned []
Implicit Place search using SMT with State Equation took 323 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 20:30:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1492 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1289 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2787ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2787ms
Finished structural reductions in LTL mode , in 1 iterations and 3110 ms. Remains : 128/128 places, 64/64 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 98 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 126 steps (0 resets) in 4 ms. (25 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 126 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-06-02 20:30:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 20:30:47] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2025-06-02 20:30:47] [INFO ] [Real]Absence check using 63 positive and 2 generalized place invariants in 11 ms returned sat
[2025-06-02 20:30:47] [INFO ] [Real]Absence check using state equation in 414 ms returned sat
[2025-06-02 20:30:47] [INFO ] Computed and/alt/rep : 32/64/32 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 20:30:47] [INFO ] Added : 30 causal constraints over 6 iterations in 179 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 2879 reset in 431 ms.
Product exploration explored 100000 steps with 2842 reset in 482 ms.
Applying partial POR strategy [true, false, false]
Stuttering acceptance computed with spot in 116 ms :[(NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 20:30:49] [INFO ] Redundant transitions in 0 ms returned []
Running 32 sub problems to find dead transitions.
[2025-06-02 20:30:49] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 2031 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1219 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3256ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3256ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 3262 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin6470920891513567582
[2025-06-02 20:30:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6470920891513567582
Running compilation step : cd /tmp/ltsmin6470920891513567582;'/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 352 ms.
Running link step : cd /tmp/ltsmin6470920891513567582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6470920891513567582;'/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/stateBased12749685192410055037.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 128 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 128/128 places, 64/64 transitions.
Applied a total of 0 rules in 1 ms. Remains 128 /128 variables (removed 0) and now considering 64/64 (removed 0) transitions.
[2025-06-02 20:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:31:07] [INFO ] Implicit Places using invariants in 117 ms returned []
[2025-06-02 20:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 20:31:07] [INFO ] Implicit Places using invariants and state equation in 209 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 20:31:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/192 variables, 0/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 192/192 variables, and 193 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1413 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/64 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 63/127 variables, 63/63 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 1/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/128 variables, 1/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/128 variables, 0/65 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 64/192 variables, 128/193 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/192 variables, 32/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/192 variables, 0/225 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 192/192 variables, and 225 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1704 ms.
Refiners :[Positive P Invariants (semi-flows): 63/63 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 128/128 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3123ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3123ms
Finished structural reductions in LTL mode , in 1 iterations and 3456 ms. Remains : 128/128 places, 64/64 transitions.
Built C files in :
/tmp/ltsmin1962440626166613783
[2025-06-02 20:31:10] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1962440626166613783
Running compilation step : cd /tmp/ltsmin1962440626166613783;'/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 218 ms.
Running link step : cd /tmp/ltsmin1962440626166613783;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin1962440626166613783;'/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/stateBased12721470534054520433.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 20:31:26] [INFO ] Flatten gal took : 4 ms
[2025-06-02 20:31:26] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:31:26] [INFO ] Time to serialize gal into /tmp/LTL4822269278221930139.gal : 1 ms
[2025-06-02 20:31:26] [INFO ] Time to serialize properties into /tmp/LTL18362632453296580679.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/LTL4822269278221930139.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8870942607809497029.hoa' '-atoms' '/tmp/LTL18362632453296580679.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/LTL18362632453296580679.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8870942607809497029.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:31:41] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:31:41] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:31:41] [INFO ] Time to serialize gal into /tmp/LTL18325285088197387204.gal : 1 ms
[2025-06-02 20:31:41] [INFO ] Time to serialize properties into /tmp/LTL5121108767193493820.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/LTL18325285088197387204.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5121108767193493820.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((F("((F87>=1)&&(Section_86>=1))"))||(X(G("((Section_11>=1)&&(F12>=1))")))))
Formula 0 simplified : G!"((F87>=1)&&(Section_86>=1))" & XF!"((Section_11>=1)&&(F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 20:31:56] [INFO ] Flatten gal took : 3 ms
[2025-06-02 20:31:56] [INFO ] Applying decomposition
[2025-06-02 20:31:56] [INFO ] Flatten gal took : 3 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/graph11232015837758857724.txt' '-o' '/tmp/graph11232015837758857724.bin' '-w' '/tmp/graph11232015837758857724.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11232015837758857724.bin' '-l' '-1' '-v' '-w' '/tmp/graph11232015837758857724.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:31:56] [INFO ] Decomposing Gal with order
[2025-06-02 20:31:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:31:56] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:31:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 20:31:56] [INFO ] Time to serialize gal into /tmp/LTL8606081825648427428.gal : 2 ms
[2025-06-02 20:31:56] [INFO ] Time to serialize properties into /tmp/LTL5503918948733221418.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/LTL8606081825648427428.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5503918948733221418.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 : !(((F("((i8.i1.u1.F87>=1)&&(i8.i1.u36.Section_86>=1))"))||(X(G("((i9.i1.u50.Section_11>=1)&&(i9.i1.u34.F12>=1))")))))
Formula 0 simplified : G!"((i8.i1.u1.F87>=1)&&(i8.i1.u36.Section_86>=1))" & XF!"((i9.i1.u50.Section_11>=1)&&(i9.i1.u34.F12>=1))"
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-096-LTLFireability-15 finished in 91379 ms.
[2025-06-02 20:32:11] [INFO ] Flatten gal took : 7 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15810171874094614905
[2025-06-02 20:32:11] [INFO ] Computing symmetric may disable matrix : 96 transitions.
[2025-06-02 20:32:11] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:32:11] [INFO ] Computing symmetric may enable matrix : 96 transitions.
[2025-06-02 20:32:11] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:32:11] [INFO ] Applying decomposition
[2025-06-02 20:32:11] [INFO ] Computing Do-Not-Accords matrix : 96 transitions.
[2025-06-02 20:32:11] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 20:32:11] [INFO ] Flatten gal took : 4 ms
[2025-06-02 20:32:11] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15810171874094614905
Running compilation step : cd /tmp/ltsmin15810171874094614905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph16432875456196534917.txt' '-o' '/tmp/graph16432875456196534917.bin' '-w' '/tmp/graph16432875456196534917.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph16432875456196534917.bin' '-l' '-1' '-v' '-w' '/tmp/graph16432875456196534917.weights' '-q' '0' '-e' '0.001'
[2025-06-02 20:32:11] [INFO ] Decomposing Gal with order
[2025-06-02 20:32:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 20:32:11] [INFO ] Flatten gal took : 7 ms
[2025-06-02 20:32:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 0 ms.
[2025-06-02 20:32:11] [INFO ] Time to serialize gal into /tmp/LTLFireability9581957267664044437.gal : 2 ms
[2025-06-02 20:32:11] [INFO ] Time to serialize properties into /tmp/LTLFireability9544575121415505529.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/LTLFireability9581957267664044437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9544575121415505529.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...276
Read 4 LTL properties
Checking formula 0 : !((F(((F("((i5.u8.F37>=1)&&(i5.u8.Section_36>=1))"))U("((i9.u23.F9>=1)&&(i7.u19.Section_8>=1))"))&&(X(X(X(F("((i8.u22.Section_26>=1)&&...180
Formula 0 simplified : G((G!"((i5.u8.F37>=1)&&(i5.u8.Section_36>=1))" R !"((i9.u23.F9>=1)&&(i7.u19.Section_8>=1))") | XXXG!"((i8.u22.Section_26>=1)&&(i8.u1...167
Compilation finished in 520 ms.
Running link step : cd /tmp/ltsmin15810171874094614905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin15810171874094614905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X(X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
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( 0/ 8), 0.001: 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( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: LTL layer: formula: <>(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X(X(X(<>((LTLAPp2==true)))))))
pins2lts-mc-linux64( 0/ 8), 0.003: "<>(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X(X(X(<>((LTLAPp2==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.003: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.005: completed 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( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.005: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.021: buchi has 18 states
pins2lts-mc-linux64( 0/ 8), 0.045: There are 108 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.045: State length is 169, there are 143 groups
pins2lts-mc-linux64( 0/ 8), 0.045: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.045: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.045: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.045: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.407: [Blue] ~120 levels ~960 states ~18656 transitions
pins2lts-mc-linux64( 7/ 8), 0.493: [Blue] ~156 levels ~1920 states ~21688 transitions
pins2lts-mc-linux64( 7/ 8), 0.605: [Blue] ~243 levels ~3840 states ~28968 transitions
pins2lts-mc-linux64( 7/ 8), 0.723: [Blue] ~417 levels ~7680 states ~37352 transitions
pins2lts-mc-linux64( 6/ 8), 0.898: [Blue] ~677 levels ~15360 states ~49336 transitions
pins2lts-mc-linux64( 6/ 8), 1.109: [Blue] ~677 levels ~30720 states ~75136 transitions
pins2lts-mc-linux64( 4/ 8), 1.523: [Blue] ~802 levels ~61440 states ~150096 transitions
pins2lts-mc-linux64( 7/ 8), 2.188: [Blue] ~677 levels ~122880 states ~236912 transitions
pins2lts-mc-linux64( 4/ 8), 3.368: [Blue] ~802 levels ~245760 states ~547336 transitions
pins2lts-mc-linux64( 6/ 8), 5.148: [Blue] ~677 levels ~491520 states ~1006224 transitions
pins2lts-mc-linux64( 3/ 8), 7.531: [Blue] ~725 levels ~983040 states ~1843392 transitions
pins2lts-mc-linux64( 7/ 8), 11.469: [Blue] ~677 levels ~1966080 states ~4198504 transitions
pins2lts-mc-linux64( 2/ 8), 18.887: [Blue] ~1016 levels ~3932160 states ~7443552 transitions
pins2lts-mc-linux64( 2/ 8), 34.590: [Blue] ~1016 levels ~7864320 states ~16103000 transitions
pins2lts-mc-linux64( 7/ 8), 65.446: [Blue] ~677 levels ~15728640 states ~37205848 transitions
pins2lts-mc-linux64( 2/ 8), 128.791: [Blue] ~1016 levels ~31457280 states ~67878120 transitions
pins2lts-mc-linux64( 5/ 8), 183.503: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 183.590:
pins2lts-mc-linux64( 0/ 8), 183.590: Explored 41118395 states 106924000 transitions, fanout: 2.600
pins2lts-mc-linux64( 0/ 8), 183.590: Total exploration time 183.530 sec (183.440 sec minimum, 183.482 sec on average)
pins2lts-mc-linux64( 0/ 8), 183.590: States per second: 224042, Transitions per second: 582597
pins2lts-mc-linux64( 0/ 8), 183.590:
pins2lts-mc-linux64( 0/ 8), 183.590: State space has 41153910 states, 41112596 are accepting
pins2lts-mc-linux64( 0/ 8), 183.590: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 183.590: blue states: 41118395 (99.91%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 183.590: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 183.590: all-red states: 41112596 (99.90%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 183.590:
pins2lts-mc-linux64( 0/ 8), 183.590: Total memory used for local state coloring: 0.1MB
pins2lts-mc-linux64( 0/ 8), 183.590:
pins2lts-mc-linux64( 0/ 8), 183.590: Queue width: 8B, total height: 6576, memory: 0.05MB
pins2lts-mc-linux64( 0/ 8), 183.590: Tree memory: 570.0MB, 14.5 B/state, compr.: 2.1%
pins2lts-mc-linux64( 0/ 8), 183.590: Tree fill ratio (roots/leafs): 30.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 183.590: Stored 97 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 183.590: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 183.590: Est. total memory use: 570.0MB (~1024.1MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15810171874094614905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X(X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15810171874094614905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(((<>((LTLAPp0==true)) U (LTLAPp1==true))&&X(X(X(<>((LTLAPp2==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-02 20:56:34] [INFO ] Flatten gal took : 4 ms
[2025-06-02 20:56:34] [INFO ] Time to serialize gal into /tmp/LTLFireability16886004248160406085.gal : 1 ms
[2025-06-02 20:56:34] [INFO ] Time to serialize properties into /tmp/LTLFireability12855631837048152107.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/LTLFireability16886004248160406085.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability12855631837048152107.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 4 LTL properties
Checking formula 0 : !((F(((F("((F37>=1)&&(Section_36>=1))"))U("((F9>=1)&&(Section_8>=1))"))&&(X(X(X(F("((Section_26>=1)&&(F27>=1))"))))))))
Formula 0 simplified : G((G!"((F37>=1)&&(Section_36>=1))" R !"((F9>=1)&&(Section_8>=1))") | XXXG!"((Section_26>=1)&&(F27>=1))")
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="CircularTrains-PT-096"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5832"
echo " Executing tool itstools"
echo " Input is CircularTrains-PT-096, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r030-smll-174853813900412"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/CircularTrains-PT-096.tgz
mv CircularTrains-PT-096 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;