Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 552K
-rw-r--r-- 1 mcc users 7.1K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 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 3.9K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.6K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 108K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K 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 37K 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-048-LTLFireability-00
FORMULA_NAME CircularTrains-PT-048-LTLFireability-01
FORMULA_NAME CircularTrains-PT-048-LTLFireability-02
FORMULA_NAME CircularTrains-PT-048-LTLFireability-03
FORMULA_NAME CircularTrains-PT-048-LTLFireability-04
FORMULA_NAME CircularTrains-PT-048-LTLFireability-05
FORMULA_NAME CircularTrains-PT-048-LTLFireability-06
FORMULA_NAME CircularTrains-PT-048-LTLFireability-07
FORMULA_NAME CircularTrains-PT-048-LTLFireability-08
FORMULA_NAME CircularTrains-PT-048-LTLFireability-09
FORMULA_NAME CircularTrains-PT-048-LTLFireability-10
FORMULA_NAME CircularTrains-PT-048-LTLFireability-11
FORMULA_NAME CircularTrains-PT-048-LTLFireability-12
FORMULA_NAME CircularTrains-PT-048-LTLFireability-13
FORMULA_NAME CircularTrains-PT-048-LTLFireability-14
FORMULA_NAME CircularTrains-PT-048-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748888314542

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-048
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 18:18:36] [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 18:18:36] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 18:18:37] [INFO ] Load time of PNML (sax parser for PT used): 70 ms
[2025-06-02 18:18:37] [INFO ] Transformed 96 places.
[2025-06-02 18:18:37] [INFO ] Transformed 48 transitions.
[2025-06-02 18:18:37] [INFO ] Parsed PT model containing 96 places and 48 transitions and 192 arcs in 217 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 14 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA CircularTrains-PT-048-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CircularTrains-PT-048-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 56 out of 96 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 96/96 places, 48/48 transitions.
Applied a total of 0 rules in 14 ms. Remains 96 /96 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 96 cols
[2025-06-02 18:18:37] [INFO ] Computed 49 invariants in 31 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:37] [INFO ] Implicit Places using invariants in 333 ms returned [1, 3, 13, 56, 64, 81, 91, 92, 94]
Discarding 9 places :
Implicit Place search using SMT only with invariants took 394 ms to find 9 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 87/96 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 431 ms. Remains : 87/96 places, 48/48 transitions.
Support contains 56 out of 87 places after structural reductions.
[2025-06-02 18:18:38] [INFO ] Flatten gal took : 49 ms
[2025-06-02 18:18:38] [INFO ] Flatten gal took : 23 ms
[2025-06-02 18:18:38] [INFO ] Input system was already deterministic with 48 transitions.
Support contains 54 out of 87 places (down from 56) after GAL structural reductions.
RANDOM walk for 396 steps (0 resets) in 89 ms. (4 steps per ms) remains 0/26 properties
FORMULA CircularTrains-PT-048-LTLFireability-07 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' '!(X((F(p1)||G(p2)||p0)))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 6 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 87 cols
[2025-06-02 18:18:38] [INFO ] Computed 40 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:39] [INFO ] Implicit Places using invariants in 227 ms returned [13, 19, 59, 77, 78, 83, 84]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 230 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/87 places, 48/48 transitions.
Applied a total of 0 rules in 7 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 244 ms. Remains : 80/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 410 ms :[(NOT p1), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-00
Product exploration explored 100000 steps with 50000 reset in 629 ms.
Product exploration explored 100000 steps with 50000 reset in 486 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 p1 p2 (NOT p0)), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (X (NOT (AND (NOT p1) p2)))), (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p2)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p0), (X (NOT p0)), (X (X p2)), (X (X (NOT p2)))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 27 ms. Reduced automaton from 4 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLFireability-00 finished in 2137 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F(p0))))))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-06-02 18:18:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:40] [INFO ] Implicit Places using invariants in 159 ms returned [13, 19, 59, 77, 78, 83, 84]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 161 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/87 places, 48/48 transitions.
Applied a total of 0 rules in 10 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 180 ms. Remains : 80/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 222 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-01
Product exploration explored 100000 steps with 6459 reset in 393 ms.
Product exploration explored 100000 steps with 6554 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 99 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 210 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 79 steps (0 resets) in 7 ms. (9 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 91 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 199 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 5 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2025-06-02 18:18:42] [INFO ] Computed 33 invariants in 4 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:43] [INFO ] Implicit Places using invariants in 183 ms returned []
[2025-06-02 18:18:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:18:43] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 369 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 18:18: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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1998 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1513 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3554ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 3566ms
Finished structural reductions in LTL mode , in 1 iterations and 3943 ms. Remains : 80/80 places, 48/48 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 : [p0]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 73 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 33 steps (0 resets) in 6 ms. (4 steps per ms) remains 0/1 properties
Knowledge obtained : [p0]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 1 factoid took 108 ms. Reduced automaton from 5 states, 5 edges and 1 AP (stutter sensitive) to 5 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 209 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 195 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 6587 reset in 451 ms.
Product exploration explored 100000 steps with 6578 reset in 394 ms.
Applying partial POR strategy [true, false, false, false, false]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 16 rules applied. Total rules applied 16 place count 80 transition count 48
Deduced a syphon composed of 16 places in 0 ms
Applied a total of 16 rules in 23 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:18:49] [INFO ] Redundant transitions in 2 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 80 cols
[2025-06-02 18:18:49] [INFO ] Computed 33 invariants in 3 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:49] [INFO ] Deduced a trap composed of 2 places in 116 ms of which 11 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:49] [INFO ] Deduced a trap composed of 2 places in 41 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:49] [INFO ] Deduced a trap composed of 2 places in 65 ms of which 4 ms to minimize.
Problem TDEAD0 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:49] [INFO ] Deduced a trap composed of 2 places in 67 ms of which 4 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:49] [INFO ] Deduced a trap composed of 2 places in 52 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:50] [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 18:18:50] [INFO ] Deduced a trap composed of 2 places in 37 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 18:18:50] [INFO ] Deduced a trap composed of 2 places in 49 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 18:18:50] [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 18:18:50] [INFO ] Deduced a trap composed of 2 places in 33 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 18:18:50] [INFO ] Deduced a trap composed of 2 places in 34 ms of which 3 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:50] [INFO ] Deduced a trap composed of 2 places in 20 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 18:18:50] [INFO ] Deduced a trap composed of 2 places in 25 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:50] [INFO ] Deduced a trap composed of 2 places in 39 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:50] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:18:50] [INFO ] Deduced a trap composed of 2 places in 38 ms of which 3 ms to minimize.
Problem TDEAD24 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 16/48 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/48 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/129 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/129 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/129 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 129 constraints, problems are : Problem set: 16 solved, 16 unsolved in 1905 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 16 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 47/79 variables, 31/31 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 16/48 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/79 variables, 0/48 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 5 (OVERLAPS) 1/80 variables, 1/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/80 variables, 0/49 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 7 (OVERLAPS) 48/128 variables, 80/129 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 16/145 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 16 solved, 16 unsolved
At refinement iteration 10 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 16 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 16 solved, 16 unsolved in 656 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 16/32 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2582ms problems are : Problem set: 16 solved, 16 unsolved
Search for dead transitions found 16 dead transitions in 2583ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 80/80 places, 32/48 transitions.
Graph (complete) has 128 edges and 80 vertex of which 64 are kept as prefixes of interest. Removing 16 places using SCC suffix rule.1 ms
Discarding 16 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 15 ms. Remains 64 /80 variables (removed 16) and now considering 32/32 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/80 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2638 ms. Remains : 64/80 places, 32/48 transitions.
Built C files in :
/tmp/ltsmin1836654355964885133
[2025-06-02 18:18:51] [INFO ] Built C files in 27ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1836654355964885133
Running compilation step : cd /tmp/ltsmin1836654355964885133;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 440 ms.
Running link step : cd /tmp/ltsmin1836654355964885133;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 78 ms.
Running LTSmin : cd /tmp/ltsmin1836654355964885133;'/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/stateBased3376963415966118706.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 80 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 80/80 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 80 cols
[2025-06-02 18:19:06] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:07] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-02 18:19:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:07] [INFO ] Implicit Places using invariants and state equation in 137 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 18:19: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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 113 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1255 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 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/48 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (OVERLAPS) 31/79 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/79 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/79 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (OVERLAPS) 1/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (OVERLAPS) 48/128 variables, 80/113 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 32/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/128 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 145 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1111 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 80/80 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2376ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2377ms
Finished structural reductions in LTL mode , in 1 iterations and 2613 ms. Remains : 80/80 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin3331981430226878753
[2025-06-02 18:19:09] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3331981430226878753
Running compilation step : cd /tmp/ltsmin3331981430226878753;'/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 187 ms.
Running link step : cd /tmp/ltsmin3331981430226878753;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin3331981430226878753;'/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/stateBased16414750362597802377.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:19:24] [INFO ] Flatten gal took : 12 ms
[2025-06-02 18:19:24] [INFO ] Flatten gal took : 18 ms
[2025-06-02 18:19:24] [INFO ] Time to serialize gal into /tmp/LTL996773464093535164.gal : 4 ms
[2025-06-02 18:19:24] [INFO ] Time to serialize properties into /tmp/LTL7392307264483251608.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/LTL996773464093535164.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9162087460602759364.hoa' '-atoms' '/tmp/LTL7392307264483251608.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL7392307264483251608.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9162087460602759364.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
5 unique states visited
0 strongly connected components in search stack
4 transitions explored
5 items max in DFS search stack
1110 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,11.1521,270284,1,0,1032,1.54388e+06,17,206,1696,1.82751e+06,2066
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA CircularTrains-PT-048-LTLFireability-01 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property CircularTrains-PT-048-LTLFireability-01 finished in 57631 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 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 48/48 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 87 transition count 46
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 85 transition count 46
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 4 place count 85 transition count 39
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 18 place count 78 transition count 39
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 28 place count 73 transition count 34
Applied a total of 28 rules in 29 ms. Remains 73 /87 variables (removed 14) and now considering 34/48 (removed 14) transitions.
// Phase 1: matrix 34 rows 73 cols
[2025-06-02 18:19:38] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:38] [INFO ] Implicit Places using invariants in 155 ms returned [10, 16, 51, 65, 66, 70, 71]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 157 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 66/87 places, 34/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 66 transition count 33
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 65 transition count 33
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 65 transition count 32
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 64 transition count 32
Applied a total of 4 rules in 23 ms. Remains 64 /66 variables (removed 2) and now considering 32/34 (removed 2) transitions.
// Phase 1: matrix 32 rows 64 cols
[2025-06-02 18:19:38] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:38] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-02 18:19:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:38] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 287 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/87 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 497 ms. Remains : 64/87 places, 32/48 transitions.
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-02
Product exploration explored 100000 steps with 3 reset in 235 ms.
Stack based approach found an accepted trace after 12485 steps with 0 reset with depth 12486 and stack size 7565 in 122 ms.
FORMULA CircularTrains-PT-048-LTLFireability-02 FALSE TECHNIQUES STACK_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-02 finished in 1024 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(X(!(X(p0) U (!p1 U G((p2 U p3)))))))'
Support contains 8 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 8 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 87 cols
[2025-06-02 18:19:39] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:39] [INFO ] Implicit Places using invariants in 118 ms returned [13, 19, 77, 78, 83, 84]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 120 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 48/48 transitions.
Applied a total of 0 rules in 21 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 149 ms. Remains : 81/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 286 ms :[p3, p3, p3, p3, (AND p0 p3)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-03
Product exploration explored 100000 steps with 5748 reset in 332 ms.
Product exploration explored 100000 steps with 5722 reset in 480 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) p2 p3 (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND p1 p2 p0) (AND p3 p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p1 p2) p3)), (X (NOT (OR (AND p1 p2) p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3))))]
Knowledge based reduction with 4 factoid took 674 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[p3, p3, p3, p3, (AND p0 p3)]
RANDOM walk for 706 steps (0 resets) in 24 ms. (28 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND p1 p2 p0) (AND p3 p0))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p1 p2) p3)), (X (NOT (OR (AND p1 p2) p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR (NOT p0) (NOT p1) (NOT p2)) (OR (NOT p0) (NOT p3))))), (F (NOT (OR (AND p1 p2) p3))), (F p0), (F (NOT (OR (NOT p2) p3))), (F (NOT p3)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 4 factoid took 775 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 259 ms :[p3, p3, p3, p3, (AND p0 p3)]
Stuttering acceptance computed with spot in 247 ms :[p3, p3, p3, p3, (AND p0 p3)]
// Phase 1: matrix 48 rows 81 cols
[2025-06-02 18:19:43] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:19:43] [INFO ] [Real]Absence check using 31 positive place invariants in 24 ms returned sat
[2025-06-02 18:19:43] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 11 ms returned sat
[2025-06-02 18:19:43] [INFO ] [Real]Absence check using state equation in 110 ms returned sat
[2025-06-02 18:19:43] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 18:19:43] [INFO ] Added : 29 causal constraints over 6 iterations in 169 ms. Result :sat
Could not prove EG p3
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
[2025-06-02 18:19:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:43] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-06-02 18:19:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:19:44] [INFO ] Implicit Places using invariants and state equation in 220 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 18:19:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/80 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/129 variables, 81/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 115 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1435 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 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/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/80 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/129 variables, 81/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 147 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1248 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2721ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2721ms
Finished structural reductions in LTL mode , in 1 iterations and 3071 ms. Remains : 81/81 places, 48/48 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 p3 p2 (NOT p1) (NOT p0)), (X (X (NOT (OR (AND p0 p1 p2) (AND p0 p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3))))]
Knowledge based reduction with 3 factoid took 469 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 224 ms :[p3, p3, p3, p3, (AND p0 p3)]
RANDOM walk for 1244 steps (0 resets) in 21 ms. (56 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (X (NOT (OR (AND p0 p1 p2) (AND p0 p3))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR (NOT p0) (NOT p1) (NOT p2)) (OR (NOT p0) (NOT p3))))), (F (NOT (OR (AND p1 p2) p3))), (F p0), (F (NOT (OR (NOT p2) p3))), (F (NOT p3)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 3 factoid took 671 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 220 ms :[p3, p3, p3, p3, (AND p0 p3)]
Stuttering acceptance computed with spot in 230 ms :[p3, p3, p3, p3, (AND p0 p3)]
[2025-06-02 18:19:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:19:48] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-06-02 18:19:48] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 5 ms returned sat
[2025-06-02 18:19:48] [INFO ] [Real]Absence check using state equation in 38 ms returned sat
[2025-06-02 18:19:48] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 18:19:48] [INFO ] Added : 29 causal constraints over 6 iterations in 121 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 226 ms :[p3, p3, p3, p3, (AND p0 p3)]
Product exploration explored 100000 steps with 5706 reset in 265 ms.
Product exploration explored 100000 steps with 5661 reset in 344 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 294 ms :[p3, p3, p3, p3, (AND p0 p3)]
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 81 transition count 48
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 12 place count 81 transition count 48
Deduced a syphon composed of 14 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 14 place count 81 transition count 48
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 15 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 81 transition count 48
Deduced a syphon composed of 15 places in 0 ms
Applied a total of 15 rules in 10 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:19:50] [INFO ] Redundant transitions in 1 ms returned []
Running 32 sub problems to find dead transitions.
// Phase 1: matrix 48 rows 81 cols
[2025-06-02 18:19:50] [INFO ] Computed 34 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/80 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:50] [INFO ] Deduced a trap composed of 2 places in 59 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 18:19:50] [INFO ] Deduced a trap composed of 2 places in 49 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:50] [INFO ] Deduced a trap composed of 2 places in 46 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:50] [INFO ] Deduced a trap composed of 2 places in 35 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:50] [INFO ] Deduced a trap composed of 2 places in 29 ms of which 2 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:50] [INFO ] Deduced a trap composed of 2 places in 23 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 18:19:51] [INFO ] Deduced a trap composed of 2 places in 36 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 18:19:51] [INFO ] Deduced a trap composed of 2 places in 26 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 18:19:51] [INFO ] Deduced a trap composed of 2 places in 30 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 18:19:51] [INFO ] Deduced a trap composed of 2 places in 21 ms of which 2 ms to minimize.
Problem TDEAD6 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:51] [INFO ] Deduced a trap composed of 2 places in 24 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 18:19:51] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:51] [INFO ] Deduced a trap composed of 2 places in 42 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:51] [INFO ] Deduced a trap composed of 2 places in 22 ms of which 2 ms to minimize.
Problem TDEAD24 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 18:19:51] [INFO ] Deduced a trap composed of 2 places in 27 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 15/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/80 variables, 0/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 6 (OVERLAPS) 1/81 variables, 1/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/81 variables, 0/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 8 (OVERLAPS) 48/129 variables, 81/130 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/130 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/130 constraints. Problems are: Problem set: 15 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 130 constraints, problems are : Problem set: 15 solved, 17 unsolved in 1642 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 0/0 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 46/80 variables, 31/31 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 2/33 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 15/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/48 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/49 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 48/129 variables, 81/130 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 17/147 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 15 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/147 constraints. Problems are: Problem set: 15 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 147 constraints, problems are : Problem set: 15 solved, 17 unsolved in 658 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 17/32 constraints, Known Traps: 15/15 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2335ms problems are : Problem set: 15 solved, 17 unsolved
Search for dead transitions found 15 dead transitions in 2335ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 81/81 places, 33/48 transitions.
Graph (complete) has 132 edges and 81 vertex of which 66 are kept as prefixes of interest. Removing 15 places using SCC suffix rule.0 ms
Discarding 15 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 3 ms. Remains 66 /81 variables (removed 15) and now considering 33/33 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 66/81 places, 33/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 2357 ms. Remains : 66/81 places, 33/48 transitions.
Built C files in :
/tmp/ltsmin16359496116517643691
[2025-06-02 18:19:52] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16359496116517643691
Running compilation step : cd /tmp/ltsmin16359496116517643691;'/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 221 ms.
Running link step : cd /tmp/ltsmin16359496116517643691;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin16359496116517643691;'/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/stateBased15599734238990147338.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 81 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 81/81 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 81 cols
[2025-06-02 18:20:07] [INFO ] Computed 34 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:20:07] [INFO ] Implicit Places using invariants in 196 ms returned []
[2025-06-02 18:20:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:20:08] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 333 ms to find 0 implicit places.
Running 32 sub problems to find dead transitions.
[2025-06-02 18:20:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/80 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/129 variables, 81/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (OVERLAPS) 0/129 variables, 0/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Real declared 129/129 variables, and 115 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1324 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 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/49 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/49 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 2 (OVERLAPS) 31/80 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/80 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/80 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 5 (OVERLAPS) 1/81 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/81 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 7 (OVERLAPS) 48/129 variables, 81/115 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/129 variables, 32/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
At refinement iteration 10 (OVERLAPS) 0/129 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 32 unsolved
No progress, stopping.
After SMT solving in domain Int declared 129/129 variables, and 147 constraints, problems are : Problem set: 0 solved, 32 unsolved in 1025 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 81/81 constraints, PredecessorRefiner: 32/32 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2363ms problems are : Problem set: 0 solved, 32 unsolved
Search for dead transitions found 0 dead transitions in 2364ms
Finished structural reductions in LTL mode , in 1 iterations and 2700 ms. Remains : 81/81 places, 48/48 transitions.
Built C files in :
/tmp/ltsmin2220651704389338338
[2025-06-02 18:20:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2220651704389338338
Running compilation step : cd /tmp/ltsmin2220651704389338338;'/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 189 ms.
Running link step : cd /tmp/ltsmin2220651704389338338;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin2220651704389338338;'/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/stateBased14006984762586831809.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:20:25] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:20:25] [INFO ] Flatten gal took : 14 ms
[2025-06-02 18:20:25] [INFO ] Time to serialize gal into /tmp/LTL10339706751702839905.gal : 2 ms
[2025-06-02 18:20:25] [INFO ] Time to serialize properties into /tmp/LTL7775005146367731359.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/LTL10339706751702839905.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10370372398099936279.hoa' '-atoms' '/tmp/LTL7775005146367731359.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/LTL7775005146367731359.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10370372398099936279.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 18:20:40] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:20:40] [INFO ] Flatten gal took : 7 ms
[2025-06-02 18:20:40] [INFO ] Time to serialize gal into /tmp/LTL16627332928355369046.gal : 11 ms
[2025-06-02 18:20:40] [INFO ] Time to serialize properties into /tmp/LTL13824205299600713998.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/LTL16627332928355369046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13824205299600713998.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(X(!((X("((F47>=1)&&(Section_46>=1))"))U((!("((Section_38>=1)&&(F39>=1))"))U(G(("((F43>=1)&&(Section_42>=1))")U("((F46>=1)&&(Secti...175
Formula 0 simplified : XG(X"((F47>=1)&&(Section_46>=1))" U (!"((Section_38>=1)&&(F39>=1))" U G("((F43>=1)&&(Section_42>=1))" U "((F46>=1)&&(Section_45>=1))...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 18:20:55] [INFO ] Flatten gal took : 5 ms
[2025-06-02 18:20:55] [INFO ] Applying decomposition
[2025-06-02 18:20:55] [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/graph6757349204200226738.txt' '-o' '/tmp/graph6757349204200226738.bin' '-w' '/tmp/graph6757349204200226738.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph6757349204200226738.bin' '-l' '-1' '-v' '-w' '/tmp/graph6757349204200226738.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:20:55] [INFO ] Decomposing Gal with order
[2025-06-02 18:20:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:20:56] [INFO ] Flatten gal took : 69 ms
[2025-06-02 18:20:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 2 ms.
[2025-06-02 18:20:56] [INFO ] Time to serialize gal into /tmp/LTL11312605961987908759.gal : 2 ms
[2025-06-02 18:20:56] [INFO ] Time to serialize properties into /tmp/LTL17561548514266374021.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/LTL11312605961987908759.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17561548514266374021.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(X(!((X("((i7.u15.F47>=1)&&(i7.u15.Section_46>=1))"))U((!("((i3.u6.Section_38>=1)&&(i5.u10.F39>=1))"))U(G(("((i5.u5.F43>=1)&&(i5.u...228
Formula 0 simplified : XG(X"((i7.u15.F47>=1)&&(i7.u15.Section_46>=1))" U (!"((i3.u6.Section_38>=1)&&(i5.u10.F39>=1))" U G("((i5.u5.F43>=1)&&(i5.u5.Section_...212
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-048-LTLFireability-03 finished in 91666 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(X(p0))||G(p1)||(!p2&&X(p2)))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 87 cols
[2025-06-02 18:21:11] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:11] [INFO ] Implicit Places using invariants in 130 ms returned [13, 19, 59, 77, 78, 83]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 146 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 148 ms. Remains : 81/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p2) (NOT p0)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (NOT p0), true, (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-05
Entered a terminal (fully accepting) state of product in 26 steps with 5 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-05 finished in 550 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 87 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 84 transition count 45
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 6 place count 84 transition count 39
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 18 place count 78 transition count 39
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 2 with 8 rules applied. Total rules applied 26 place count 74 transition count 35
Applied a total of 26 rules in 35 ms. Remains 74 /87 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 74 cols
[2025-06-02 18:21:11] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:11] [INFO ] Implicit Places using invariants in 191 ms returned [11, 17, 52, 66, 67, 71, 72]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 194 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/87 places, 35/48 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 67 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 33
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 65 transition count 32
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 64 transition count 32
Applied a total of 6 rules in 5 ms. Remains 64 /67 variables (removed 3) and now considering 32/35 (removed 3) transitions.
// Phase 1: matrix 32 rows 64 cols
[2025-06-02 18:21:11] [INFO ] Computed 33 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:12] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-06-02 18:21:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:12] [INFO ] Implicit Places using invariants and state equation in 179 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/87 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 556 ms. Remains : 64/87 places, 32/48 transitions.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-06
Product exploration explored 100000 steps with 5560 reset in 405 ms.
Product exploration explored 100000 steps with 5499 reset in 424 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 112 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 56 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
[2025-06-02 18:21:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:13] [INFO ] [Real]Absence check using 31 positive place invariants in 17 ms returned sat
[2025-06-02 18:21:13] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 9 ms returned sat
[2025-06-02 18:21:13] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-06-02 18:21:13] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 18:21:13] [INFO ] Added : 14 causal constraints over 3 iterations in 70 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 4 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-02 18:21:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2025-06-02 18:21:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:14] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:14] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-02 18:21: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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 803 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1415ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1416ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1715 ms. Remains : 64/64 places, 32/32 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 80 steps (0 resets) in 4 ms. (16 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 162 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0)]
[2025-06-02 18:21:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:16] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2025-06-02 18:21:16] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 7 ms returned sat
[2025-06-02 18:21:16] [INFO ] [Real]Absence check using state equation in 100 ms returned sat
[2025-06-02 18:21:16] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 18:21:16] [INFO ] Added : 14 causal constraints over 3 iterations in 48 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 5504 reset in 246 ms.
Product exploration explored 100000 steps with 5525 reset in 257 ms.
Built C files in :
/tmp/ltsmin18408450289075784869
[2025-06-02 18:21:17] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2025-06-02 18:21:17] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:17] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2025-06-02 18:21:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:17] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2025-06-02 18:21:17] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:17] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18408450289075784869
Running compilation step : cd /tmp/ltsmin18408450289075784869;'/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 240 ms.
Running link step : cd /tmp/ltsmin18408450289075784869;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin18408450289075784869;'/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/stateBased16206921078878497801.hoa' '--buchi-type=spotba'
LTSmin run took 107 ms.
FORMULA CircularTrains-PT-048-LTLFireability-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-06 finished in 5848 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(p0) U p1)))&&!((X(p0)||p0) U X(p0))))'
Support contains 4 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 87 cols
[2025-06-02 18:21:17] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:17] [INFO ] Implicit Places using invariants in 141 ms returned [13, 59, 77, 78, 83, 84]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 143 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 48/48 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 147 ms. Remains : 81/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (OR (NOT p1) p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) p0), (OR (NOT p1) p0), true, (OR (NOT p1) p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-08
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA CircularTrains-PT-048-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-08 finished in 431 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))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 87 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 83 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 83 transition count 39
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 18 place count 78 transition count 39
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 2 with 8 rules applied. Total rules applied 26 place count 74 transition count 35
Applied a total of 26 rules in 10 ms. Remains 74 /87 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 74 cols
[2025-06-02 18:21:17] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:18] [INFO ] Implicit Places using invariants in 97 ms returned [10, 16, 52, 66, 67, 71, 72]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 98 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/87 places, 35/48 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 67 transition count 33
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 65 transition count 33
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 65 transition count 32
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 64 transition count 32
Applied a total of 6 rules in 4 ms. Remains 64 /67 variables (removed 3) and now considering 32/35 (removed 3) transitions.
// Phase 1: matrix 32 rows 64 cols
[2025-06-02 18:21:18] [INFO ] Computed 33 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:18] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-06-02 18:21:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:18] [INFO ] Implicit Places using invariants and state equation in 120 ms returned []
Implicit Place search using SMT with State Equation took 253 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/87 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 365 ms. Remains : 64/87 places, 32/48 transitions.
Stuttering acceptance computed with spot in 49 ms :[p0]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-09
Product exploration explored 100000 steps with 5664 reset in 273 ms.
Product exploration explored 100000 steps with 5586 reset in 324 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 149 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[p0]
RANDOM walk for 53 steps (0 resets) in 4 ms. (10 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 132 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[p0]
Stuttering acceptance computed with spot in 34 ms :[p0]
[2025-06-02 18:21:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:19] [INFO ] [Real]Absence check using 31 positive place invariants in 10 ms returned sat
[2025-06-02 18:21:19] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 3 ms returned sat
[2025-06-02 18:21:19] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-02 18:21:19] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 3 ms.
[2025-06-02 18:21:19] [INFO ] Added : 14 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG p0
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-02 18:21:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:19] [INFO ] Implicit Places using invariants in 68 ms returned []
[2025-06-02 18:21:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:19] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 192 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:19] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-02 18:21: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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 585 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 535 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1123ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 1124ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1325 ms. Remains : 64/64 places, 32/32 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 : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 2 factoid took 147 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[p0]
RANDOM walk for 64 steps (0 resets) in 4 ms. (12 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0)]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F (NOT p0))]
Knowledge based reduction with 2 factoid took 186 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[p0]
Stuttering acceptance computed with spot in 47 ms :[p0]
[2025-06-02 18:21:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:21] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2025-06-02 18:21:21] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 6 ms returned sat
[2025-06-02 18:21:21] [INFO ] [Real]Absence check using state equation in 92 ms returned sat
[2025-06-02 18:21:21] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 18:21:21] [INFO ] Added : 14 causal constraints over 3 iterations in 50 ms. Result :sat
Could not prove EG p0
Stuttering acceptance computed with spot in 40 ms :[p0]
Product exploration explored 100000 steps with 5619 reset in 228 ms.
Product exploration explored 100000 steps with 5638 reset in 256 ms.
Built C files in :
/tmp/ltsmin3215223822430100063
[2025-06-02 18:21:22] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2025-06-02 18:21:22] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:22] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2025-06-02 18:21:22] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:22] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2025-06-02 18:21:22] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:22] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3215223822430100063
Running compilation step : cd /tmp/ltsmin3215223822430100063;'/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 166 ms.
Running link step : cd /tmp/ltsmin3215223822430100063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin3215223822430100063;'/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/stateBased495804186326512003.hoa' '--buchi-type=spotba'
LTSmin run took 80 ms.
FORMULA CircularTrains-PT-048-LTLFireability-09 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-09 finished in 4554 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(X(X(X(F(p1))))))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 87 cols
[2025-06-02 18:21:22] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:22] [INFO ] Implicit Places using invariants in 87 ms returned [13, 19, 59, 77, 78, 83, 84]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 88 ms to find 7 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 80/87 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 89 ms. Remains : 80/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 245 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-10
Product exploration explored 100000 steps with 2062 reset in 222 ms.
Product exploration explored 100000 steps with 2019 reset in 242 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 313 steps (0 resets) in 6 ms. (44 steps per ms) remains 0/2 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1)]
Knowledge based reduction with 3 factoid took 177 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 7 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 316 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 317 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1)]
// Phase 1: matrix 48 rows 80 cols
[2025-06-02 18:21:24] [INFO ] Computed 33 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:24] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2025-06-02 18:21:24] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 8 ms returned sat
[2025-06-02 18:21:24] [INFO ] [Real]Absence check using state equation in 137 ms returned sat
[2025-06-02 18:21:24] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 18:21:24] [INFO ] Added : 29 causal constraints over 6 iterations in 119 ms. Result :sat
Could not prove EG (NOT p1)
[2025-06-02 18:21:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(F p0), (F p1), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 3 factoid took 206 ms. Reduced automaton from 7 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA CircularTrains-PT-048-LTLFireability-10 FALSE TECHNIQUES KNOWLEDGE
Treatment of property CircularTrains-PT-048-LTLFireability-10 finished in 2618 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(F((p1||G(p2))))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 87 cols
[2025-06-02 18:21:25] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:25] [INFO ] Implicit Places using invariants in 87 ms returned [13, 19, 78, 83, 84]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 88 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 82/87 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 82 /82 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 91 ms. Remains : 82/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-12
Product exploration explored 100000 steps with 7640 reset in 282 ms.
Product exploration explored 100000 steps with 7600 reset in 324 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 : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (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 (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 561 ms. Reduced automaton from 2 states, 3 edges and 3 AP (stutter sensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 363 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 2503 steps (0 resets) in 41 ms. (59 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p0)), (X (X (NOT p0)))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) (NOT p1) p2)), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X p1), (X (NOT p1)), (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 (AND (NOT p0) (NOT p1) p2))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F p2), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 3 factoid took 1058 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 366 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 392 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
// Phase 1: matrix 48 rows 82 cols
[2025-06-02 18:21:28] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:28] [INFO ] [Real]Absence check using 30 positive place invariants in 14 ms returned sat
[2025-06-02 18:21:28] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 12 ms returned sat
[2025-06-02 18:21:28] [INFO ] [Real]Absence check using state equation in 136 ms returned sat
[2025-06-02 18:21:28] [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 18:21:29] [INFO ] [Nat]Absence check using 30 positive place invariants in 15 ms returned sat
[2025-06-02 18:21:29] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 10 ms returned sat
[2025-06-02 18:21:29] [INFO ] [Nat]Absence check using state equation in 144 ms returned sat
[2025-06-02 18:21:29] [INFO ] Computed and/alt/rep : 32/48/32 causal constraints (skipped 0 transitions) in 6 ms.
[2025-06-02 18:21:29] [INFO ] Added : 26 causal constraints over 6 iterations in 85 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Support contains 6 out of 82 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 82/82 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 82 transition count 38
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 20 place count 72 transition count 38
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 20 place count 72 transition count 36
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 24 place count 70 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 28 place count 68 transition count 34
Applied a total of 28 rules in 5 ms. Remains 68 /82 variables (removed 14) and now considering 34/48 (removed 14) transitions.
// Phase 1: matrix 34 rows 68 cols
[2025-06-02 18:21:29] [INFO ] Computed 35 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:29] [INFO ] Implicit Places using invariants in 85 ms returned []
[2025-06-02 18:21:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:29] [INFO ] Implicit Places using invariants and state equation in 113 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:29] [INFO ] Redundant transitions in 1 ms returned []
Running 18 sub problems to find dead transitions.
[2025-06-02 18:21:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (OVERLAPS) 0/102 variables, 0/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Real declared 102/102 variables, and 103 constraints, problems are : Problem set: 0 solved, 18 unsolved in 605 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 18 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/36 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/36 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 2 (OVERLAPS) 30/66 variables, 30/32 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/66 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/66 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 5 (OVERLAPS) 2/68 variables, 2/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/68 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 7 (OVERLAPS) 34/102 variables, 68/103 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/102 variables, 18/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
At refinement iteration 10 (OVERLAPS) 0/102 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 18 unsolved
No progress, stopping.
After SMT solving in domain Int declared 102/102 variables, and 121 constraints, problems are : Problem set: 0 solved, 18 unsolved in 582 ms.
Refiners :[Positive P Invariants (semi-flows): 30/30 constraints, Generalized P Invariants (flows): 5/5 constraints, State Equation: 68/68 constraints, PredecessorRefiner: 18/18 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1194ms problems are : Problem set: 0 solved, 18 unsolved
Search for dead transitions found 0 dead transitions in 1194ms
Starting structural reductions in SI_LTL mode, iteration 1 : 68/82 places, 34/48 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1407 ms. Remains : 68/82 places, 34/48 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 10 factoid took 1311 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 401 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
RANDOM walk for 1069 steps (0 resets) in 8 ms. (118 steps per ms) remains 0/11 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT (AND (NOT p1) p0 p2))), (X (NOT (AND p1 (NOT p0) p2))), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (AND p1 p0 (NOT p2)))), (X (NOT (AND p1 p0 p2))), (X (NOT p0)), (X (X (NOT (AND (NOT p1) p0 p2)))), (X (X (NOT (AND p1 p0 (NOT p2))))), (X (X (NOT (AND p1 p0 p2))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND p1 (NOT p0) (NOT p2))), (X (NOT (AND p1 (NOT p0) (NOT p2)))), (X (AND (NOT p1) (NOT p0) p2)), (X (NOT (AND (NOT p1) (NOT p0) p2))), (X (AND (NOT p1) (NOT p0) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p2)), (X (X (NOT p2))), (X (X (AND p1 (NOT p0) p2))), (X (X (NOT (AND p1 (NOT p0) p2)))), (X (X (AND (NOT p1) p0 (NOT p2)))), (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (AND p1 (NOT p0) (NOT p2)))), (X (X (NOT (AND p1 (NOT p0) (NOT p2))))), (X (X (AND (NOT p1) (NOT p0) p2))), (X (X (NOT (AND (NOT p1) (NOT p0) p2)))), (X (X (AND (NOT p1) (NOT p0) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p0) (NOT p2))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p1) (NOT p0) p2))), (F (NOT (OR p1 (NOT p0) p2))), (F (NOT (OR p1 p0 (NOT p2)))), (F (NOT (OR (NOT p1) p0 p2))), (F p2), (F (NOT (OR (NOT p1) p0 (NOT p2)))), (F (NOT (OR p1 (NOT p0) (NOT p2)))), (F (NOT (OR (NOT p1) (NOT p0) (NOT p2)))), (F p1), (F (NOT (AND (NOT p1) (NOT p0) (NOT p2)))), (F p0)]
Knowledge based reduction with 10 factoid took 1736 ms. Reduced automaton from 8 states, 21 edges and 3 AP (stutter insensitive) to 8 states, 21 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 368 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Stuttering acceptance computed with spot in 383 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
[2025-06-02 18:21:34] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:35] [INFO ] [Real]Absence check using 30 positive place invariants in 17 ms returned sat
[2025-06-02 18:21:35] [INFO ] [Real]Absence check using 30 positive and 5 generalized place invariants in 9 ms returned sat
[2025-06-02 18:21:35] [INFO ] [Real]Absence check using state equation in 158 ms returned sat
[2025-06-02 18:21:35] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:35] [INFO ] [Nat]Absence check using 30 positive place invariants in 17 ms returned sat
[2025-06-02 18:21:35] [INFO ] [Nat]Absence check using 30 positive and 5 generalized place invariants in 7 ms returned sat
[2025-06-02 18:21:35] [INFO ] [Nat]Absence check using state equation in 99 ms returned sat
[2025-06-02 18:21:35] [INFO ] Computed and/alt/rep : 18/34/18 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 18:21:35] [INFO ] Added : 16 causal constraints over 4 iterations in 71 ms. Result :sat
Could not prove EG (AND (NOT p1) (NOT p0) (NOT p2))
Stuttering acceptance computed with spot in 400 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), false, false, false, false, false, false]
Product exploration explored 100000 steps with 10633 reset in 531 ms.
Product exploration explored 100000 steps with 10739 reset in 578 ms.
Built C files in :
/tmp/ltsmin13168239723640708535
[2025-06-02 18:21:37] [INFO ] Computing symmetric may disable matrix : 34 transitions.
[2025-06-02 18:21:37] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:37] [INFO ] Computing symmetric may enable matrix : 34 transitions.
[2025-06-02 18:21:37] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:37] [INFO ] Computing Do-Not-Accords matrix : 34 transitions.
[2025-06-02 18:21:37] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:37] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13168239723640708535
Running compilation step : cd /tmp/ltsmin13168239723640708535;'/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 251 ms.
Running link step : cd /tmp/ltsmin13168239723640708535;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin13168239723640708535;'/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/stateBased4769369637450735443.hoa' '--buchi-type=spotba'
LTSmin run took 174 ms.
FORMULA CircularTrains-PT-048-LTLFireability-12 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-12 finished in 12389 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))'
Support contains 2 out of 87 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 87 transition count 44
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 83 transition count 44
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 8 place count 83 transition count 39
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 18 place count 78 transition count 39
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 2 with 8 rules applied. Total rules applied 26 place count 74 transition count 35
Applied a total of 26 rules in 8 ms. Remains 74 /87 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 74 cols
[2025-06-02 18:21:37] [INFO ] Computed 40 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:37] [INFO ] Implicit Places using invariants in 123 ms returned [11, 17, 52, 66, 67, 71, 72]
Discarding 7 places :
Implicit Place search using SMT only with invariants took 124 ms to find 7 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 67/87 places, 35/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 67 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 66 transition count 34
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 2 place count 66 transition count 32
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 6 place count 64 transition count 32
Applied a total of 6 rules in 5 ms. Remains 64 /67 variables (removed 3) and now considering 32/35 (removed 3) transitions.
// Phase 1: matrix 32 rows 64 cols
[2025-06-02 18:21:37] [INFO ] Computed 33 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:37] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-06-02 18:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:37] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 64/87 places, 32/48 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 445 ms. Remains : 64/87 places, 32/48 transitions.
Stuttering acceptance computed with spot in 63 ms :[(NOT p0)]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-13
Product exploration explored 100000 steps with 5665 reset in 238 ms.
Product exploration explored 100000 steps with 5598 reset in 258 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 139 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[(NOT p0)]
RANDOM walk for 62 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 (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 163 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p0)]
[2025-06-02 18:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:39] [INFO ] [Real]Absence check using 31 positive place invariants in 15 ms returned sat
[2025-06-02 18:21:39] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-02 18:21:39] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-02 18:21:39] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 18:21:39] [INFO ] Added : 14 causal constraints over 3 iterations in 56 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 64 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 64/64 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 64 /64 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-02 18:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:39] [INFO ] Implicit Places using invariants in 123 ms returned []
[2025-06-02 18:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:39] [INFO ] Implicit Places using invariants and state equation in 127 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:39] [INFO ] Redundant transitions in 0 ms returned []
Running 16 sub problems to find dead transitions.
[2025-06-02 18:21: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/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (OVERLAPS) 0/96 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Real declared 96/96 variables, and 97 constraints, problems are : Problem set: 0 solved, 16 unsolved in 516 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 16 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 1 (OVERLAPS) 31/63 variables, 31/31 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/63 variables, 1/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/63 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 4 (OVERLAPS) 1/64 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/64 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 6 (OVERLAPS) 32/96 variables, 64/97 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/96 variables, 16/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
At refinement iteration 9 (OVERLAPS) 0/96 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 16 unsolved
No progress, stopping.
After SMT solving in domain Int declared 96/96 variables, and 113 constraints, problems are : Problem set: 0 solved, 16 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 64/64 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 989ms problems are : Problem set: 0 solved, 16 unsolved
Search for dead transitions found 0 dead transitions in 989ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1250 ms. Remains : 64/64 places, 32/32 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 (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 150 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
RANDOM walk for 55 steps (0 resets) in 4 ms. (11 steps per ms) remains 0/1 properties
Knowledge obtained : [(NOT p0), (X (NOT p0))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 167 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 47 ms :[(NOT p0)]
[2025-06-02 18:21:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:41] [INFO ] [Real]Absence check using 31 positive place invariants in 14 ms returned sat
[2025-06-02 18:21:41] [INFO ] [Real]Absence check using 31 positive and 2 generalized place invariants in 5 ms returned sat
[2025-06-02 18:21:41] [INFO ] [Real]Absence check using state equation in 91 ms returned sat
[2025-06-02 18:21:41] [INFO ] Computed and/alt/rep : 16/32/16 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 18:21:41] [INFO ] Added : 14 causal constraints over 3 iterations in 55 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 5674 reset in 228 ms.
Product exploration explored 100000 steps with 5647 reset in 256 ms.
Built C files in :
/tmp/ltsmin2392051205896177252
[2025-06-02 18:21:41] [INFO ] Computing symmetric may disable matrix : 32 transitions.
[2025-06-02 18:21:41] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:41] [INFO ] Computing symmetric may enable matrix : 32 transitions.
[2025-06-02 18:21:41] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:41] [INFO ] Computing Do-Not-Accords matrix : 32 transitions.
[2025-06-02 18:21:41] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:21:41] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2392051205896177252
Running compilation step : cd /tmp/ltsmin2392051205896177252;'/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 176 ms.
Running link step : cd /tmp/ltsmin2392051205896177252;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin2392051205896177252;'/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/stateBased5362270174383956801.hoa' '--buchi-type=spotba'
LTSmin run took 126 ms.
FORMULA CircularTrains-PT-048-LTLFireability-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CircularTrains-PT-048-LTLFireability-13 finished in 4620 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&X(p1))))'
Support contains 6 out of 87 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Applied a total of 0 rules in 0 ms. Remains 87 /87 variables (removed 0) and now considering 48/48 (removed 0) transitions.
// Phase 1: matrix 48 rows 87 cols
[2025-06-02 18:21:42] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:42] [INFO ] Implicit Places using invariants in 113 ms returned [13, 19, 59, 77, 83, 84]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 114 ms to find 6 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 81/87 places, 48/48 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 116 ms. Remains : 81/87 places, 48/48 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA CircularTrains-PT-048-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CircularTrains-PT-048-LTLFireability-15 finished in 288 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(X(!(X(p0) U (!p1 U G((p2 U p3)))))))'
Found a Shortening insensitive property : CircularTrains-PT-048-LTLFireability-03
Stuttering acceptance computed with spot in 226 ms :[p3, p3, p3, p3, (AND p0 p3)]
Support contains 8 out of 87 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 87/87 places, 48/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 87 transition count 45
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 6 place count 84 transition count 45
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 5 Pre rules applied. Total rules applied 6 place count 84 transition count 40
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 16 place count 79 transition count 40
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 26 place count 74 transition count 35
Applied a total of 26 rules in 7 ms. Remains 74 /87 variables (removed 13) and now considering 35/48 (removed 13) transitions.
// Phase 1: matrix 35 rows 74 cols
[2025-06-02 18:21:42] [INFO ] Computed 40 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:43] [INFO ] Implicit Places using invariants in 119 ms returned [10, 16, 65, 66, 70, 71]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 120 ms to find 6 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 68/87 places, 35/48 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 68 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 67 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 66 transition count 33
Applied a total of 4 rules in 5 ms. Remains 66 /68 variables (removed 2) and now considering 33/35 (removed 2) transitions.
// Phase 1: matrix 33 rows 66 cols
[2025-06-02 18:21:43] [INFO ] Computed 34 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:43] [INFO ] Implicit Places using invariants in 80 ms returned []
[2025-06-02 18:21:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:43] [INFO ] Implicit Places using invariants and state equation in 133 ms returned []
Implicit Place search using SMT with State Equation took 215 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 66/87 places, 33/48 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 347 ms. Remains : 66/87 places, 33/48 transitions.
Running random walk in product with property : CircularTrains-PT-048-LTLFireability-03
Product exploration explored 100000 steps with 6936 reset in 436 ms.
Product exploration explored 100000 steps with 6828 reset in 442 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) p2 p3 (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND p1 p2 p0) (AND p3 p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p1 p2) p3)), (X (NOT (OR (AND p1 p2) p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 632 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[p3, p3, p3, p3, (AND p0 p3)]
RANDOM walk for 542 steps (0 resets) in 5 ms. (90 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND (NOT p1) p2 p3 (NOT p0)), (X (NOT p1)), (X (X (NOT (OR (AND p1 p2 p0) (AND p3 p0)))))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X p3), (X (NOT p3)), (X (OR (AND p1 p2) p3)), (X (NOT (OR (AND p1 p2) p3))), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR (NOT p0) (NOT p1) (NOT p2)) (OR (NOT p0) (NOT p3))))), (F (NOT (OR (AND p1 p2) p3))), (F p0), (F (NOT (OR (NOT p2) p3))), (F (NOT p3)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 3 factoid took 955 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 265 ms :[p3, p3, p3, p3, (AND p0 p3)]
Stuttering acceptance computed with spot in 273 ms :[p3, p3, p3, p3, (AND p0 p3)]
[2025-06-02 18:21:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:46] [INFO ] [Real]Absence check using 31 positive place invariants in 11 ms returned sat
[2025-06-02 18:21:46] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-02 18:21:46] [INFO ] [Real]Absence check using state equation in 60 ms returned sat
[2025-06-02 18:21:46] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-02 18:21:46] [INFO ] Added : 14 causal constraints over 3 iterations in 45 ms. Result :sat
Could not prove EG p3
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-06-02 18:21:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:46] [INFO ] Implicit Places using invariants in 88 ms returned []
[2025-06-02 18:21:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:21:47] [INFO ] Implicit Places using invariants and state equation in 143 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-02 18:21:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 935 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1571ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1573ms
Finished structural reductions in LTL mode , in 1 iterations and 1807 ms. Remains : 66/66 places, 33/33 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 p3 p2 (NOT p1) (NOT p0)), (X (X (NOT (OR (AND p0 p1 p2) (AND p0 p3)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 2 factoid took 597 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 245 ms :[p3, p3, p3, p3, (AND p0 p3)]
RANDOM walk for 822 steps (0 resets) in 10 ms. (74 steps per ms) remains 0/8 properties
Knowledge obtained : [(AND p3 p2 (NOT p1) (NOT p0)), (X (X (NOT (OR (AND p0 p1 p2) (AND p0 p3)))))]
False Knowledge obtained : [(X p3), (X (NOT p3)), (X (X (AND p2 (NOT p3)))), (X (X (NOT (AND p2 (NOT p3))))), (X (X p2)), (X (X (NOT p2))), (X (X p3)), (X (X (NOT p3))), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p0)), (X (X (NOT p0))), (X (X (OR (AND p1 p2) p3))), (X (X (NOT (OR (AND p1 p2) p3)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p0) p1))), (F (NOT (AND (OR (NOT p0) (NOT p1) (NOT p2)) (OR (NOT p0) (NOT p3))))), (F (NOT (OR (AND p1 p2) p3))), (F p0), (F (NOT (OR (NOT p2) p3))), (F (NOT p3)), (F (NOT p2)), (F p1)]
Knowledge based reduction with 2 factoid took 749 ms. Reduced automaton from 5 states, 11 edges and 4 AP (stutter sensitive) to 5 states, 11 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[p3, p3, p3, p3, (AND p0 p3)]
Stuttering acceptance computed with spot in 268 ms :[p3, p3, p3, p3, (AND p0 p3)]
[2025-06-02 18:21:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-02 18:21:50] [INFO ] [Real]Absence check using 31 positive place invariants in 12 ms returned sat
[2025-06-02 18:21:50] [INFO ] [Real]Absence check using 31 positive and 3 generalized place invariants in 4 ms returned sat
[2025-06-02 18:21:50] [INFO ] [Real]Absence check using state equation in 62 ms returned sat
[2025-06-02 18:21:50] [INFO ] Computed and/alt/rep : 17/33/17 causal constraints (skipped 0 transitions) in 5 ms.
[2025-06-02 18:21:50] [INFO ] Added : 14 causal constraints over 3 iterations in 46 ms. Result :sat
Could not prove EG p3
Stuttering acceptance computed with spot in 249 ms :[p3, p3, p3, p3, (AND p0 p3)]
Product exploration explored 100000 steps with 6952 reset in 431 ms.
Product exploration explored 100000 steps with 6928 reset in 477 ms.
Applying partial POR strategy [false, false, true, true, true]
Stuttering acceptance computed with spot in 208 ms :[p3, p3, p3, p3, (AND p0 p3)]
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 1 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 18:21:52] [INFO ] Redundant transitions in 0 ms returned []
Running 17 sub problems to find dead transitions.
[2025-06-02 18:21:52] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 815 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 633 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1456ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1457ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 1464 ms. Remains : 66/66 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin6724358796368463315
[2025-06-02 18:21:53] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6724358796368463315
Running compilation step : cd /tmp/ltsmin6724358796368463315;'/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 157 ms.
Running link step : cd /tmp/ltsmin6724358796368463315;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin6724358796368463315;'/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/stateBased2918914500861964078.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 66 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 66/66 places, 33/33 transitions.
Applied a total of 0 rules in 0 ms. Remains 66 /66 variables (removed 0) and now considering 33/33 (removed 0) transitions.
[2025-06-02 18:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:22:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-02 18:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 18:22:09] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
Running 17 sub problems to find dead transitions.
[2025-06-02 18:22:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (OVERLAPS) 0/99 variables, 0/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Real declared 99/99 variables, and 100 constraints, problems are : Problem set: 0 solved, 17 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 17 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/34 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/34 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (OVERLAPS) 31/65 variables, 31/32 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/65 variables, 1/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/65 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 5 (OVERLAPS) 1/66 variables, 1/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/66 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 7 (OVERLAPS) 33/99 variables, 66/100 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/99 variables, 17/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 10 (OVERLAPS) 0/99 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 17 unsolved
No progress, stopping.
After SMT solving in domain Int declared 99/99 variables, and 117 constraints, problems are : Problem set: 0 solved, 17 unsolved in 620 ms.
Refiners :[Positive P Invariants (semi-flows): 31/31 constraints, Generalized P Invariants (flows): 3/3 constraints, State Equation: 66/66 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1357ms problems are : Problem set: 0 solved, 17 unsolved
Search for dead transitions found 0 dead transitions in 1358ms
Finished structural reductions in LTL mode , in 1 iterations and 1611 ms. Remains : 66/66 places, 33/33 transitions.
Built C files in :
/tmp/ltsmin6799384046731156750
[2025-06-02 18:22:10] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6799384046731156750
Running compilation step : cd /tmp/ltsmin6799384046731156750;'/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 216 ms.
Running link step : cd /tmp/ltsmin6799384046731156750;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin6799384046731156750;'/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/stateBased7404751387551861611.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 18:22:25] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:22:25] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:22:25] [INFO ] Time to serialize gal into /tmp/LTL5741859886640784987.gal : 1 ms
[2025-06-02 18:22:25] [INFO ] Time to serialize properties into /tmp/LTL815555906158025964.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/LTL5741859886640784987.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4790249689693349224.hoa' '-atoms' '/tmp/LTL815555906158025964.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL815555906158025964.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4790249689693349224.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 18:22:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:22:40] [INFO ] Flatten gal took : 6 ms
[2025-06-02 18:22:40] [INFO ] Time to serialize gal into /tmp/LTL17632581056033302647.gal : 2 ms
[2025-06-02 18:22:40] [INFO ] Time to serialize properties into /tmp/LTL1989700427551005716.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/LTL17632581056033302647.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1989700427551005716.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(X(!((X("((F47>=1)&&(Section_46>=1))"))U((!("((Section_38>=1)&&(F39>=1))"))U(G(("((F43>=1)&&(Section_42>=1))")U("((F46>=1)&&(Secti...175
Formula 0 simplified : XG(X"((F47>=1)&&(Section_46>=1))" U (!"((Section_38>=1)&&(F39>=1))" U G("((F43>=1)&&(Section_42>=1))" U "((F46>=1)&&(Section_45>=1))...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 18:22:55] [INFO ] Flatten gal took : 4 ms
[2025-06-02 18:22:55] [INFO ] Applying decomposition
[2025-06-02 18:22:55] [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/graph3831459723036879842.txt' '-o' '/tmp/graph3831459723036879842.bin' '-w' '/tmp/graph3831459723036879842.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph3831459723036879842.bin' '-l' '-1' '-v' '-w' '/tmp/graph3831459723036879842.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:22:56] [INFO ] Decomposing Gal with order
[2025-06-02 18:22:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:22:56] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:22:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 18:22:56] [INFO ] Time to serialize gal into /tmp/LTL12081285311214283443.gal : 2 ms
[2025-06-02 18:22:56] [INFO ] Time to serialize properties into /tmp/LTL14997068980537355983.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/LTL12081285311214283443.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14997068980537355983.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(X(!((X("((i8.u30.F47>=1)&&(i8.u30.Section_46>=1))"))U((!("((i0.u0.Section_38>=1)&&(i0.u11.F39>=1))"))U(G(("((i3.u12.F43>=1)&&(i3....229
Formula 0 simplified : XG(X"((i8.u30.F47>=1)&&(i8.u30.Section_46>=1))" U (!"((i0.u0.Section_38>=1)&&(i0.u11.F39>=1))" U G("((i3.u12.F43>=1)&&(i3.u7.Section...213
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property CircularTrains-PT-048-LTLFireability-03 finished in 88678 ms.
[2025-06-02 18:23:11] [INFO ] Flatten gal took : 8 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin393238042262812627
[2025-06-02 18:23:11] [INFO ] Computing symmetric may disable matrix : 48 transitions.
[2025-06-02 18:23:11] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:23:11] [INFO ] Computing symmetric may enable matrix : 48 transitions.
[2025-06-02 18:23:11] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:23:11] [INFO ] Applying decomposition
[2025-06-02 18:23:11] [INFO ] Computing Do-Not-Accords matrix : 48 transitions.
[2025-06-02 18:23:11] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 18:23:11] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin393238042262812627
Running compilation step : cd /tmp/ltsmin393238042262812627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2025-06-02 18:23:11] [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/graph8819159420281597075.txt' '-o' '/tmp/graph8819159420281597075.bin' '-w' '/tmp/graph8819159420281597075.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph8819159420281597075.bin' '-l' '-1' '-v' '-w' '/tmp/graph8819159420281597075.weights' '-q' '0' '-e' '0.001'
[2025-06-02 18:23:11] [INFO ] Decomposing Gal with order
[2025-06-02 18:23:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 18:23:11] [INFO ] Flatten gal took : 23 ms
[2025-06-02 18:23:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 1 ms.
[2025-06-02 18:23:11] [INFO ] Time to serialize gal into /tmp/LTLFireability9476226596635094461.gal : 2 ms
[2025-06-02 18:23:11] [INFO ] Time to serialize properties into /tmp/LTLFireability775741488694610612.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/LTLFireability9476226596635094461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability775741488694610612.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...275
Read 1 LTL properties
Checking formula 0 : !((F(X(!((X("((i3.i1.u12.F47>=1)&&(i3.i1.u12.Section_46>=1))"))U((!("((u7.Section_38>=1)&&(i7.u17.F39>=1))"))U(G(("((i7.u8.F43>=1)&&(i...237
Formula 0 simplified : XG(X"((i3.i1.u12.F47>=1)&&(i3.i1.u12.Section_46>=1))" U (!"((u7.Section_38>=1)&&(i7.u17.F39>=1))" U G("((i7.u8.F43>=1)&&(i7.u8.Secti...221
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 237 ms.
Running link step : cd /tmp/ltsmin393238042262812627;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 66 ms.
Running LTSmin : cd /tmp/ltsmin393238042262812627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(!(X((LTLAPp0==true)) U (!(LTLAPp1==true) U [](((LTLAPp2==true) U (LTLAPp3==true)))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: LTL layer: formula: <>(X(!(X((LTLAPp0==true)) U (!(LTLAPp1==true) U [](((LTLAPp2==true) U (LTLAPp3==true)))))))
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: "<>(X(!(X((LTLAPp0==true)) U (!(LTLAPp1==true) U [](((LTLAPp2==true) U (LTLAPp3==true)))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.002: Using Spin LTL semantics
pins2lts-mc-linux64( 7/ 8), 0.002: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 2/ 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( 4/ 8), 0.003: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.072: There are 53 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.072: State length is 88, there are 64 groups
pins2lts-mc-linux64( 0/ 8), 0.072: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.072: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.072: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.072: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 5/ 8), 0.616: [Blue] ~108 levels ~960 states ~6680 transitions
pins2lts-mc-linux64( 5/ 8), 0.694: [Blue] ~186 levels ~1920 states ~8832 transitions
pins2lts-mc-linux64( 5/ 8), 0.810: [Blue] ~186 levels ~3840 states ~11320 transitions
pins2lts-mc-linux64( 5/ 8), 1.266: [Blue] ~186 levels ~7680 states ~18384 transitions
pins2lts-mc-linux64( 2/ 8), 1.747: [Blue] ~180 levels ~15360 states ~36432 transitions
pins2lts-mc-linux64( 6/ 8), 2.264: [Blue] ~177 levels ~30720 states ~75200 transitions
pins2lts-mc-linux64( 6/ 8), 2.976: [Blue] ~177 levels ~61440 states ~152528 transitions
pins2lts-mc-linux64( 6/ 8), 4.608: [Blue] ~177 levels ~122880 states ~329280 transitions
pins2lts-mc-linux64( 4/ 8), 5.637: [Blue] ~234 levels ~245760 states ~551736 transitions
pins2lts-mc-linux64( 5/ 8), 7.285: [Blue] ~186 levels ~491520 states ~1291288 transitions
pins2lts-mc-linux64( 2/ 8), 9.291: [Blue] ~180 levels ~983040 states ~2703776 transitions
pins2lts-mc-linux64( 5/ 8), 12.114: [Blue] ~186 levels ~1966080 states ~5707224 transitions
pins2lts-mc-linux64( 5/ 8), 17.752: [Blue] ~186 levels ~3932160 states ~12106592 transitions
pins2lts-mc-linux64( 5/ 8), 29.091: [Blue] ~186 levels ~7864320 states ~24886768 transitions
pins2lts-mc-linux64( 4/ 8), 53.410: [Blue] ~234 levels ~15728640 states ~50630176 transitions
pins2lts-mc-linux64( 5/ 8), 112.249: [Blue] ~186 levels ~31457280 states ~110604888 transitions
pins2lts-mc-linux64( 2/ 8), 122.089: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 122.181:
pins2lts-mc-linux64( 0/ 8), 122.181: Explored 30413529 states 111925023 transitions, fanout: 3.680
pins2lts-mc-linux64( 0/ 8), 122.181: Total exploration time 122.100 sec (121.990 sec minimum, 122.031 sec on average)
pins2lts-mc-linux64( 0/ 8), 122.181: States per second: 249087, Transitions per second: 916667
pins2lts-mc-linux64( 0/ 8), 122.181:
pins2lts-mc-linux64( 0/ 8), 122.181: State space has 30062682 states, 2248864 are accepting
pins2lts-mc-linux64( 0/ 8), 122.181: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 122.181: blue states: 30413529 (101.17%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 122.181: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 122.181: all-red states: 20151809 (67.03%), bogus 81344 (0.27%)
pins2lts-mc-linux64( 0/ 8), 122.181:
pins2lts-mc-linux64( 0/ 8), 122.181: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 122.181:
pins2lts-mc-linux64( 0/ 8), 122.181: Queue width: 8B, total height: 1601, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 122.181: Tree memory: 485.4MB, 16.9 B/state, compr.: 4.8%
pins2lts-mc-linux64( 0/ 8), 122.181: Tree fill ratio (roots/leafs): 22.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 122.181: Stored 48 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 122.181: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 122.181: Est. total memory use: 485.4MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin393238042262812627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(!(X((LTLAPp0==true)) U (!(LTLAPp1==true) U [](((LTLAPp2==true) U (LTLAPp3==true)))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin393238042262812627;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(X(!(X((LTLAPp0==true)) U (!(LTLAPp1==true) U [](((LTLAPp2==true) U (LTLAPp3==true)))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-02 18:44:42] [INFO ] Flatten gal took : 8 ms
[2025-06-02 18:44:42] [INFO ] Time to serialize gal into /tmp/LTLFireability13058529871128488314.gal : 1 ms
[2025-06-02 18:44:42] [INFO ] Time to serialize properties into /tmp/LTLFireability13343167839900934198.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/LTLFireability13058529871128488314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13343167839900934198.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 1 LTL properties
Checking formula 0 : !((F(X(!((X("((F47>=1)&&(Section_46>=1))"))U((!("((Section_38>=1)&&(F39>=1))"))U(G(("((F43>=1)&&(Section_42>=1))")U("((F46>=1)&&(Secti...175
Formula 0 simplified : XG(X"((F47>=1)&&(Section_46>=1))" U (!"((Section_38>=1)&&(F39>=1))" U G("((F43>=1)&&(Section_42>=1))" U "((F46>=1)&&(Section_45>=1))...159
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
[2025-06-02 19:06:13] [INFO ] Flatten gal took : 5 ms
[2025-06-02 19:06:13] [INFO ] Input system was already deterministic with 48 transitions.
[2025-06-02 19:06:13] [INFO ] Transformed 87 places.
[2025-06-02 19:06:13] [INFO ] Transformed 48 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2025-06-02 19:06:13] [INFO ] Time to serialize gal into /tmp/LTLFireability1286386308534770424.gal : 1 ms
[2025-06-02 19:06:13] [INFO ] Time to serialize properties into /tmp/LTLFireability276192750220035585.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/LTLFireability1286386308534770424.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability276192750220035585.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...341
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F(X(!((X("((F47>=1)&&(Section_46>=1))"))U((!("((Section_38>=1)&&(F39>=1))"))U(G(("((F43>=1)&&(Section_42>=1))")U("((F46>=1)&&(Secti...175
Formula 0 simplified : XG(X"((F47>=1)&&(Section_46>=1))" U (!"((Section_38>=1)&&(F39>=1))" U G("((F43>=1)&&(Section_42>=1))" U "((F46>=1)&&(Section_45>=1))...159
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-048"
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-048, 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-174853813900404"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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