Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2025-input.r002-tall-174853730100852.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 BART-PT-020, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-tall-174853730100852
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 50M
-rw-r--r-- 1 mcc users 902K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 3.2M May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 1.8M May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 5.9M 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 386K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 1.1M May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 514K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 1.4M May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 1.8M May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 6.4M May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.0M May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 17M May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 221K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 447K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 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 4.8M 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 BART-PT-020-LTLFireability-00
FORMULA_NAME BART-PT-020-LTLFireability-01
FORMULA_NAME BART-PT-020-LTLFireability-02
FORMULA_NAME BART-PT-020-LTLFireability-03
FORMULA_NAME BART-PT-020-LTLFireability-04
FORMULA_NAME BART-PT-020-LTLFireability-05
FORMULA_NAME BART-PT-020-LTLFireability-06
FORMULA_NAME BART-PT-020-LTLFireability-07
FORMULA_NAME BART-PT-020-LTLFireability-08
FORMULA_NAME BART-PT-020-LTLFireability-09
FORMULA_NAME BART-PT-020-LTLFireability-10
FORMULA_NAME BART-PT-020-LTLFireability-11
FORMULA_NAME BART-PT-020-LTLFireability-12
FORMULA_NAME BART-PT-020-LTLFireability-13
FORMULA_NAME BART-PT-020-LTLFireability-14
FORMULA_NAME BART-PT-020-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748674653251

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BART-PT-020
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-05-31 06:57:34] [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-05-31 06:57:34] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-05-31 06:57:34] [INFO ] Load time of PNML (sax parser for PT used): 371 ms
[2025-05-31 06:57:34] [INFO ] Transformed 2850 places.
[2025-05-31 06:57:34] [INFO ] Transformed 4040 transitions.
[2025-05-31 06:57:34] [INFO ] Found NUPN structural information;
[2025-05-31 06:57:34] [INFO ] Parsed PT model containing 2850 places and 4040 transitions and 32400 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 73 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 210 places and 0 transitions.
Support contains 2640 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 34 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2025-05-31 06:57:35] [INFO ] Computed 20 invariants in 58 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:57:36] [INFO ] Implicit Places using invariants in 883 ms returned []
[2025-05-31 06:57:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:57:38] [INFO ] Implicit Places using invariants and state equation in 1686 ms returned []
Implicit Place search using SMT with State Equation took 2602 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2025-05-31 06:57:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30114 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30047 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61526ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61551ms
Finished structural reductions in LTL mode , in 1 iterations and 64219 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Support contains 2640 out of 2640 places after structural reductions.
[2025-05-31 06:58:40] [INFO ] Flatten gal took : 245 ms
[2025-05-31 06:58:41] [INFO ] Flatten gal took : 225 ms
[2025-05-31 06:58:41] [INFO ] Input system was already deterministic with 4040 transitions.
Reduction of identical properties reduced properties to check from 31 to 26
RANDOM walk for 40000 steps (8 resets) in 1592 ms. (25 steps per ms) remains 2/26 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1926 ms. (20 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 86 ms. (459 steps per ms) remains 1/2 properties
[2025-05-31 06:58:43] [INFO ] Invariant cache hit.
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1380 variables, 1380/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1380 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1260/2640 variables, 20/1400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2640 variables, 1260/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2640 variables, 0/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4040/6680 variables, 2640/5300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6680/6680 variables, and 5300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1803 ms.
Refiners :[Domain max(s): 2640/2640 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2640/2640 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1380 variables, 1380/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1380 variables, 0/1380 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 1260/2640 variables, 20/1400 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2640 variables, 1260/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2640 variables, 0/2660 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 4040/6680 variables, 2640/5300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6680/6680 variables, and 5300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2452 ms.
Refiners :[Domain max(s): 2640/2640 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2640/2640 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4283ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 76 steps, including 0 resets, run visited all 1 properties in 3 ms. (steps per millisecond=25 )
Parikh walk visited 1 properties in 7 ms.
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(X((G(p0) U (X(F((p2&&F(p3))))||p1)))))'
Support contains 1560 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 161 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2025-05-31 06:58:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:58:48] [INFO ] Implicit Places using invariants in 442 ms returned []
[2025-05-31 06:58:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 06:58:50] [INFO ] Implicit Places using invariants and state equation in 1553 ms returned []
Implicit Place search using SMT with State Equation took 1999 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2025-05-31 06:58:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30056 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30057 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61434ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61443ms
Finished structural reductions in LTL mode , in 1 iterations and 63618 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Stuttering acceptance computed with spot in 536 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BART-PT-020-LTLFireability-00
Product exploration explored 100000 steps with 2246 reset in 4258 ms.
Product exploration explored 100000 steps with 2268 reset in 4112 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 3 factoid took 161 ms. Reduced automaton from 9 states, 22 edges and 4 AP (stutter sensitive) to 9 states, 21 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 358 ms :[(OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p2)) (AND (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p1) (NOT p3))), (AND (NOT p3) (NOT p0)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 17 to 13
RANDOM walk for 40000 steps (8 resets) in 2108 ms. (18 steps per ms) remains 6/13 properties
BEST_FIRST walk for 40004 steps (8 resets) in 2519 ms. (15 steps per ms) remains 4/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1608 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1767 ms. (22 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 421 ms. (94 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1916 ms. (20 steps per ms) remains 4/4 properties
[2025-05-31 07:00:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1560 variables, 1560/1560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1560 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (OVERLAPS) 1080/2640 variables, 20/1580 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2640 variables, 1080/2660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2640 variables, 0/2660 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 4040/6680 variables, 2640/5300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6680/6680 variables, and 5300 constraints, problems are : Problem set: 0 solved, 4 unsolved in 5012 ms.
Refiners :[Domain max(s): 2640/2640 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2640/2640 constraints, PredecessorRefiner: 4/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
Problem apf11 is UNSAT
Problem apf13 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/1560 variables, 1560/1560 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1560 variables, 0/1560 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1080/2640 variables, 20/1580 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2640 variables, 1080/2660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2640 variables, 0/2660 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4040/6680 variables, 2640/5300 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 2 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 2 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6680/6680 variables, and 5300 constraints, problems are : Problem set: 2 solved, 2 unsolved in 4488 ms.
Refiners :[Domain max(s): 2640/2640 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2640/2640 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9537ms problems are : Problem set: 2 solved, 2 unsolved
Finished Parikh walk after 83 steps, including 0 resets, run visited all 2 properties in 2 ms. (steps per millisecond=41 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 2 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 5 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 (NOT p3) (NOT p2)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (G (OR p1 (NOT p2) (NOT p0) p3)), (G (OR (NOT p1) p2 (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) p0)))), (X (X p1)), (X (X (NOT p1))), (F (NOT (OR (NOT p2) p0 p3))), (F p3), (F (NOT (OR p2 p0))), (F (NOT p0)), (F (NOT (AND p0 (NOT p3)))), (F (NOT (OR (NOT p2) (NOT p0) p3))), (F (NOT (OR (NOT p2) p3))), (F (NOT (OR p0 p3))), (F p1), (F (NOT (OR (NOT p1) (NOT p0) p3))), (F p2), (F (NOT (AND (NOT p2) p0))), (F (NOT (AND (NOT p1) (NOT p2) p0))), (F (NOT (OR (NOT p1) (NOT p2) (NOT p0) p3))), (F (NOT (AND (NOT p1) p0 (NOT p3))))]
Knowledge based reduction with 5 factoid took 710 ms. Reduced automaton from 9 states, 21 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 322 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 320 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
[2025-05-31 07:00:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:00:21] [INFO ] [Real]Absence check using 20 positive place invariants in 599 ms returned sat
[2025-05-31 07:00:33] [INFO ] [Real]Absence check using state equation in 11313 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 1560 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 38 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2025-05-31 07:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:33] [INFO ] Implicit Places using invariants in 513 ms returned []
[2025-05-31 07:00:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:00:35] [INFO ] Implicit Places using invariants and state equation in 1634 ms returned []
Implicit Place search using SMT with State Equation took 2148 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2025-05-31 07:00:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)
(s967 1.0)
(s968 1.0)
(s969 1.0)
(s970 1.0)
(s971 1.0)
(s972 1.0)
(s973 1.0)
(s974 1.0)
(s975 1.0)
(s976 1.0)
(s977 1.0)
(s978 1.0)
(s979 1.0)
(s980 1.0)
(s981 1.0)
(s982 1.0)
(s983 1.0)
(s984 1.0)
(s985 1.0)
(s986 1.0)
(s987 1.0)
(s988 1.0)
(s989 1.0)
(s990 1.0)
(s991 1.0)
(s992 1.0)
(s993 1.0)
(s994 1.0)
(s995 1.0)
(s996 1.0)
(s997 1.0)
(s998 1.0)
(s999 1.0)
(s1000 1.0)
(s1001 1.0)
(s1002 1.0)
(s1003 1.0)
(s1004 1.0)
(s1005 1.0)
(s1006 1.0)
(s1007 1.0)
(s1008 1.0)
(s1009 1.0)
(s1010 1.0)
(s1011 1.0)
(s1012 1.0)
(s1013 1.0)
(s1014 1.0)
(s1015 1.0)
(s1016 1.0)
(s1017 1.0)
(s1018 1.0)
(s1019 1.0)
(s1020 1.0)
(s1021 1.0)
(s1022 1.0)
(s1023 1.0)
(s1024 1.0)
(s1025 1.0)
(s1026 1.0)
(s1027 1.0)
(s1028 1.0)
(s1029 1.0)
(s1030 1.0)
(s1031 1.0)
(s1032 1.0)
(s1033 1.0)
(s1034 1.0)
(s1035 1.0)
(s1036 1.0)
(s1037 1.0)
(s1038 1.0)
(s1039 1.0)
(s1040 1.0)
(s1041 1.0)
(s1042 1.0)
(s1043 1.0)
(s1044 1.0)
(s1045 1.0)
(s1046 1.0)
(s1047 1.0)
(s1048 1.0)
(s1049 1.0)
(s1050 1.0)
(s1051 1.0)
(s1052 1.0)
(s1053 1.0)
(s1054 1.0)
(s1055 1.0)
(s1056 1.0)
(s1057 1.0)
(s1058 1.0)
(s1059 1.0)
(s1060 1.0)
(s1061 1.0)
(s1062 1.0)
(s1063 1.0)
(s1064 1.0)
(s1065 1.0)
(s1066 1.0)
(s1067 1.0)
(s1068 1.0)
(s1069 1.0)
(s1070 1.0)
(s1071 1.0)
(s1072 1.0)
(s1073 1.0)
(s1074 1.0)
(s1075 1.0)
(s1076 1.0)
(s1077 1.0)
(s1078 1.0)
(s1079 1.0)
(s1080 1.0)
(s1081 1.0)
(s1082 1.0)
(s1083 1.0)
(s1084 1.0)
(s1085 1.0)
(s1086 1.0)
(s1087 1.0)
(s1088 1.0)
(s1089 1.0)
(s1090 1.0)
(s1091 1.0)
(s1092 1.0)
(s1093 1.0)
(s1094 1.0)
(s1095 1.0)
(s1096 1.0)
(s1097 1.0)
(s1098 1.0)
(s1099 1.0)
(s1100 1.0)
(s1101 1.0)
(s1102 1.0)
(s1103 1.0)
(s1104 1.0)
(s1105 1.0)
(s1106 1.0)
(s1107 1.0)
(s1108 1.0)
(s1109 1.0)
(s1110 1.0)
(s1111 1.0)
(s1112 1.0)
(s1113 1.0)
(s1114 1.0)
(s1115 1.0)
(s1116 1.0)
(s1117 1.0)
(s1118 1.0)
(s1119 1.0)
(s1120 1.0)
(s1121 1.0)
(s1122 1.0)
(s1123 1.0)
(s1124 1.0)
(s1125 1.0)
(s1126 1.0)
(s1127 1.0)
(s1128 1.0)
(s1129 1.0)
(s1130 1.0)
(s1131 1.0)
(s1132 1.0)
(s1133 1.0)
(s1134 1.0)
(s1135 1.0)
(s1136 1.0)
(s1137 1.0)
(s1138 1.0)
(s1139 1.0)
(s1140 1.0)
(s1141 1.0)
(s1142 1.0)
(s1143 1.0)
(s1144 1.0)
(s1145 1.0)
(s1146 1.0)
(s1147 1.0)
(s1148 1.0)
(s1149 1.0)
(s1150 1.0)
(s1151 1.0)
(s1152 1.0)
(s1153 1.0)
(s1154 1.0)
(s1155 1.0)
(s1156 1.0)
(s1157 1.0)
(s1158 1.0)
(s1159 1.0)
(s1160 1.0)
(s1161 1.0)
(s1162 1.0)
(s1163 1.0)
(s1164 1.0)
(s1165 1.0)
(s1166 1.0)
(s1167 1.0)
(s1168 1.0)
(s1169 1.0)
(s1170 1.0)
(s1171 1.0)
(s1172 1.0)
(s1173 1.0)
(s1174 1.0)
(s1175 1.0)
(s1176 1.0)
(s1177 1.0)
(s1178 1.0)
(s1179 1.0)
(s1180 1.0)
(s1181 1.0)
(s1182 1.0)
(s1183 1.0)
(s1184 1.0)
(s1185 1.0)
(s1186 1.0)
(s1187 1.0)
(s1188 1.0)
(s1189 1.0)
(s1190 1.0)
(s1191 1.0)
(s1192 1.0)
(s1193 1.0)
(s1194 1.0)
(s1195 1.0)
(s1196 1.0)
(s1197 1.0)
(s1198 1.0)
(s1199 1.0)
(s1200 1.0)
(s1201 1.0)
(s1202 1.0)
(s1203 1.0)
(s1204 1.0)
(s1205 1.0)
(s1206 1.0)
(s1207 1.0)
(s1208 1.0)
(s1209 1.0)
(s1210 1.0)
(s1211 1.0)
(s1212 1.0)
(s1213 1.0)
(s1214 1.0)
(s1215 1.0)
(s1216 1.0)
(s1217 1.0)
(s1218 1.0)
(s1219 1.0)
(s1220 1.0)
(s1221 1.0)
(s1222 1.0)
(s1223 1.0)
(s1224 1.0)
(s1225 1.0)
(s1226 1.0)
(s1227 1.0)
(s1228 1.0)
(s1229 1.0)
(s1230 1.0)
(s1231 1.0)
(s1232 1.0)
(s1233 1.0)
(s1234 1.0)
(s1235 1.0)
(s1236 1.0)
(s1237 1.0)
(s1238 1.0)
(s1239 1.0)
(s1240 1.0)
(s1241 1.0)
(s1242 1.0)
(s1243 1.0)
(s1244 1.0)
(s1245 1.0)
(s1246 1.0)
(s1247 1.0)
(s1248 1.0)
(s1249 1.0)
(s1250 1.0)
(s1251 1.0)
(s1252 1.0)
(s1253 1.0)
(s1254 1.0)
(s1255 1.0)
(s1256 1.0)
(s1257 1.0)
(s1258 1.0)
(s1259 1.0)
(s1260 1.0)
(s1261 1.0)
(s1262 1.0)
(s1263 1.0)
(s1264 1.0)
(s1265 1.0)
(s1266 1.0)
(s1267 1.0)
(s1268 1.0)
(s1269 1.0)
(s1270 1.0)
(s1271 1.0)
(s1272 1.0)
(s1273 1.0)
(s1274 1.0)
(s1275 1.0)
(s1276 1.0)
(s1277 1.0)
(s1278 1.0)
(s1279 1.0)
(s1280 1.0)
(s1281 1.0)
(s1282 1.0)
(s1283 1.0)
(s1284 1.0)
(s1285 1.0)
(s1286 1.0)
(s1287 1.0)
(s1288 1.0)
(s1289 1.0)
(s1290 1.0)
(s1291 1.0)
(s1292 1.0)
(s1293 1.0)
(s1294 1.0)
(s1295 1.0)
(s1296 1.0)
(s1297 1.0)
(s1298 1.0)
(s1299 1.0)
(s1300 1.0)
(s1301 1.0)
(s1302 1.0)
(s1303 1.0)
(s1304 1.0)
(s1305 1.0)
(s1306 1.0)
(s1307 1.0)
(s1308 1.0)
(s1309 1.0)
(s1310 1.0)
(s1311 1.0)
(s1312 1.0)
(s1313 1.0)
(s1314 1.0)
(s1315 1.0)
(s1316 1.0)
(s1317 1.0)
(s1318 1.0)
(s1319 1.0)
(s1320 1.0)
(s1321 1.0)
(s1322 1.0)
(s1323 1.0)
(s1324 1.0)
(s1325 1.0)
(s1326 1.0)
(s1327 1.0)
(s1328 1.0)
(s1329 1.0)
(s1330 1.0)
(s1331 1.0)
(s1332 1.0)
(s1333 1.0)
(s1334 1.0)
(s1335 1.0)
(s1336 1.0)
(s1337 1.0)
(s1338 1.0)
(s1339 1.0)
(s1340 1.0)
(s1341 1.0)
(s1342 1.0)
(s1343 1.0)
(s1344 1.0)
(s1345 1.0)
(s1346 1.0)
(s1347 1.0)
(s1348 1.0)
(s1349 1.0)
(s1350 1.0)
(s1351 1.0)
(s1352 1.0)
(s1353 1.0)
(s1354 1.0)
(s1355 1.0)
(s1356 1.0)
(s1357 1.0)
(s1358 1.0)
(s1359 1.0)
(s1360 1.0)
(s1361 1.0)
(s1362 1.0)
(s1363 1.0)
(s1364 1.0)
(s1365 1.0)
(s1366 1.0)
(s1367 1.0)
(s1368 1.0)
(s1369 1.0)
(s1370 1.0)
(s1371 1.0)
(s1372 1.0)
(s1373 1.0)
(s1374 1.0)
(s1375 1.0)
(s1376 1.0)
(s1377 1.0)
(s1378 1.0)
(s1379 1.0)
(s1380 1.0)
(s1381 1.0)
(s1382 1.0)
(s1383 1.0)
(s1384 1.0)
(s1385 1.0)
(s1386 1.0)
(s1387 1.0)
(s1388 1.0)
(s1389 1.0)
(s1390 1.0)
(s1391 1.0)
(s1392 1.0)
(s1393 1.0)
(s1394 1.0)
(s1395 1.0)
(s1396 1.0)
(s1397 1.0)
(s1398 1.0)
(s1399 1.0)
(s1400 1.0)
(s1401 1.0)
(s1402 1.0)
(s1403 1.0)
(s1404 1.0)
(s1405 1.0)
(s1406 1.0)
(s1407 1.0)
(s1408 1.0)
(s1409 1.0)
(s1410 1.0)
(s1411 1.0)
(s1412 1.0)
(s1413 1.0)
(s1414 1.0)
(s1415 1.0)
(s1416 1.0)
(s1417 1.0)
(s1418 1.0)
(s1419 1.0)
(s1420 1.0)
(s1421 1.0)
(s1422 1.0)
(s1423 1.0)
(s1424 1.0)
(s1425 1.0)
(s1426 1.0)
(s1427 1.0)
(s1428 1.0)
(s1429 1.0)
(s1430 1.0)
(s1431 1.0)
(s1432 1.0)
(s1433 1.0)
(s1434 1.0)
(s1435 1.0)
(s1436 1.0)
(s1437 1.0)
(s1438 1.0)
(s1439 1.0)
(s1440 1.0)
(s1441 1.0)
(s1442 1.0)
(s1443 1.0)
(s1444 1.0)
(s1445 1.0)
(s1446 1.0)
(s1447 1.0)
(s1448 1.0)
(s1449 1.0)
(s1450 1.0)
(s1451 1.0)
(s1452 1.0)
(s1453 1.0)
(s1454 1.0)
(s1455 1.0)
(s1456 1.0)
(s1457 1.0)
(s1458 1.0)
(s1459 1.0)
(s1460 1.0)
(s1461 1.0)
(s1462 1.0)
(s1463 1.0)
(s1464 1.0)
(s1465 1.0)
(s1466 1.0)
(s1467 1.0)
(s1468 1.0)
(s1469 1.0)
(s1470 1.0)
(s1471 1.0)
(s1472 1.0)
(s1473 1.0)
(s1474 1.0)
(s1475 1.0)
(s1476 1.0)
(s1477 1.0)
(s1478 1.0)
(s1479 1.0)
(s1480 1.0)
(s1481 1.0)
(s1482 1.0)
(s1483 1.0)
(s1484 1.0)
(s1485 1.0)
(s1486 1.0)
(s1487 1.0)
(s1488 1.0)
(s1489 1.0)
(s1490 1.0)
(s1491 1.0)
(s1492 1.0)
(s1493 1.0)
(s1494 1.0)
(s1495 1.0)
(s1496 1.0)
(s1497 1.0)
(s1498 1.0)
(s1499 1.0)
(s1500 1.0)
(s1501 1.0)
(s1502 1.0)
(s1503 1.0)
(s1504 1.0)
(s1505 1.0)
(s1506 1.0)
(s1507 1.0)
(s1508 1.0)
(s1509 1.0)
(s1510 1.0)
(s1511 1.0)
(s1512 1.0)
(s1513 1.0)
(s1514 1.0)
(s1515 1.0)
(s1516 1.0)
(s1517 1.0)
(s1518 1.0)
(s1519 1.0)
(s1520 1.0)
(s1521 1.0)
(s1522 1.0)
(s1523 1.0)
(s1524 1.0)
(s1525 1.0)
(s1526 1.0)
(s1527 1.0)
(s1528 1.0)
(s1529 1.0)
(s1530 1.0)
(s1531 1.0)
(s1532 1.0)
(s1533 1.0)
(s1534 1.0)
(s1535 1.0)
(s1536 1.0)
(s1537 1.0)
(s1538 1.0)
(s1539 1.0)
(s1540 1.0)
(s1541 1.0)
(s1542 1.0)
(s1543 1.0)
(s1544 1.0)
(s1545 1.0)
(s1546 1.0)
(s1547 1.0)
(s1548 1.0)
(s1549 1.0)
(s1550 1.0)
(s1551 1.0)
(s1552 1.0)
(s1553 1.0)
(s1554 1.0)
(s1555 1.0)
(s1556 1.0)
(s1557 1.0)
(s1558 1.0)
(s1559 1.0)
(s1560 1.0)
(s1561 1.0)
(s1562 1.0)
(s1563 1.0)
(s1564 1.0)
(s1565 1.0)
(s1566 1.0)
(s1567 1.0)
(s1568 1.0)
(s1569 1.0)
(s1570 1.0)
(s1571 1.0)
(s1572 1.0)
(s1573 1.0)
(s1574 1.0)
(s1575 1.0)
(s1576 1.0)
(s1577 1.0)
(s1578 1.0)
(s1579 1.0)
(s1580 1.0)
(s1581 1.0)
(s1582 1.0)
(s1583 1.0)
(s1584 1.0)
(s1585 1.0)
(s1586 1.0)
(s1587 1.0)
(s1588 1.0)
(s1589 1.0)
(s1590 1.0)
(s1591 1.0)
(s1592 1.0)
(s1593 1.0)
(s1594 1.0)
(s1595 1.0)
(s1596 1.0)
(s1597 1.0)
(s1598 1.0)
(s1599 1.0)
(s1600 1.0)
(s1601 1.0)
(s1602 1.0)
(s1603 1.0)
(s1604 1.0)
(s1605 1.0)
(s1606 1.0)
(s1607 1.0)
(s1608 1.0)
(s1609 1.0)
(s1610 1.0)
(s1611 1.0)
(s1612 1.0)
(s1613 1.0)
(s1614 1.0)
(s1615 1.0)
(s1616 1.0)
(s1617 1.0)
(s1618 1.0)
(s1619 1.0)
(s1620 1.0)
(s1621 1.0)
(s1622 1.0)
(s1623 1.0)
(s1624 1.0)
(s1625 1.0)
(s1626 1.0)
(s1627 1.0)
(s1628 1.0)
(s1629 1.0)
(s1630 1.0)
(s1631 1.0)
(s1632 1.0)
(s1633 1.0)
(s1634 1.0)
(s1635 1.0)
(s1636 1.0)
(s1637 1.0)
(s1638 1.0)
(s1639 1.0)
(s1640 1.0)
(s1641 1.0)
(s1642 1.0)
(s1643 1.0)
(s1644 1.0)
(s1645 1.0)
(s1646 1.0)
(s1647 1.0)
(s1648 1.0)
(s1649 1.0)
(s1650 1.0)
(s1651 1.0)
(s1652 1.0)
(s1653 1.0)
(s1654 1.0)
(s1655 1.0)
(s1656 1.0)
(s1657 1.0)
(s1658 1.0)
(s1659 1.0)
(s1660 1.0)
(s1661 1.0)
(s1662 1.0)
(s1663 1.0)
(s1664 1.0)
(s1665 1.0)
(s1666 1.0)
(s1667 1.0)
(s1668 1.0)
(s1669 1.0)
(s1670 1.0)
(s1671 1.0)
(s1672 1.0)
(s1673 1.0)
(s1674 1.0)
(s1675 1.0)
(s1676 1.0)
(s1677 1.0)
(s1678 1.0)
(s1679 1.0)
(s1680 1.0)
(s1681 1.0)
(s1682 1.0)
(s1683 1.0)
(s1684 1.0)
(s1685 1.0)
(s1686 1.0)
(s1687 1.0)
(s1688 1.0)
(s1689 1.0)
(s1690 1.0)
(s1691 1.0)
(s1692 1.0)
(s1693 1.0)
(s1694 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30064 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30042 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61370ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61375ms
Finished structural reductions in LTL mode , in 1 iterations and 63569 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1))]
Knowledge based reduction with 1 factoid took 138 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 263 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Reduction of identical properties reduced properties to check from 11 to 10
RANDOM walk for 40000 steps (8 resets) in 1538 ms. (25 steps per ms) remains 4/10 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1626 ms. (24 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1750 ms. (22 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1793 ms. (22 steps per ms) remains 2/2 properties
[2025-05-31 07:01:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/1560 variables, 1560/1560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1560 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1080/2640 variables, 20/1580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2640 variables, 1080/2660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2640 variables, 0/2660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4040/6680 variables, 2640/5300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 6680/6680 variables, and 5300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2785 ms.
Refiners :[Domain max(s): 2640/2640 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2640/2640 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/1560 variables, 1560/1560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/1560 variables, 0/1560 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 1080/2640 variables, 20/1580 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/2640 variables, 1080/2660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/2640 variables, 0/2660 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4040/6680 variables, 2640/5300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/6680 variables, 0/5300 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 6680/6680 variables, and 5300 constraints, problems are : Problem set: 0 solved, 2 unsolved in 4329 ms.
Refiners :[Domain max(s): 2640/2640 constraints, Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 2640/2640 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7137ms problems are : Problem set: 0 solved, 2 unsolved
Finished Parikh walk after 68 steps, including 0 resets, run visited all 2 properties in 4 ms. (steps per millisecond=17 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 2 properties in 5 ms.
Knowledge obtained : [(AND p0 (NOT p3) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (F p1), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR (NOT p0) (NOT p2) p3))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p3))), (F p3), (F p2), (F (NOT (OR p0 (NOT p2) p3))), (F (NOT p0)), (F (NOT (OR (NOT p2) p3))), (F (NOT (AND p0 (NOT p3))))]
Knowledge based reduction with 1 factoid took 446 ms. Reduced automaton from 7 states, 12 edges and 4 AP (stutter sensitive) to 7 states, 12 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Stuttering acceptance computed with spot in 299 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
[2025-05-31 07:01:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:01:51] [INFO ] [Real]Absence check using 20 positive place invariants in 607 ms returned sat
[2025-05-31 07:02:02] [INFO ] [Real]Absence check using state equation in 11185 ms returned unknown
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 312 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Product exploration explored 100000 steps with 2261 reset in 2812 ms.
Product exploration explored 100000 steps with 2269 reset in 2818 ms.
Applying partial POR strategy [true, true, true, false, true, false, false]
Stuttering acceptance computed with spot in 325 ms :[(AND (NOT p3) (NOT p0)), (NOT p3), (OR (NOT p2) (NOT p3)), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (NOT p2) (AND (NOT p0) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p1) (NOT p3)) (AND (NOT p1) (NOT p2)))]
Support contains 1560 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Performed 460 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 460 rules applied. Total rules applied 460 place count 2640 transition count 4040
Deduced a syphon composed of 460 places in 0 ms
Applied a total of 460 rules in 231 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:02:09] [INFO ] Redundant transitions in 247 ms returned []
Running 3320 sub problems to find dead transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2025-05-31 07:02:09] [INFO ] Computed 20 invariants in 23 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30053 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30065 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61242ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61247ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2640/2640 places, 4040/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61739 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Built C files in :
/tmp/ltsmin16954817025050924077
[2025-05-31 07:03:10] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16954817025050924077
Running compilation step : cd /tmp/ltsmin16954817025050924077;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16954817025050924077;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin16954817025050924077;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1560 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 62 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
// Phase 1: matrix 4040 rows 2640 cols
[2025-05-31 07:03:13] [INFO ] Computed 20 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:14] [INFO ] Implicit Places using invariants in 533 ms returned []
[2025-05-31 07:03:14] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:03:16] [INFO ] Implicit Places using invariants and state equation in 1662 ms returned []
Implicit Place search using SMT with State Equation took 2197 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2025-05-31 07:03:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30062 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30043 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61202ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61207ms
Finished structural reductions in LTL mode , in 1 iterations and 63474 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Built C files in :
/tmp/ltsmin5759141047440141628
[2025-05-31 07:04:17] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5759141047440141628
Running compilation step : cd /tmp/ltsmin5759141047440141628;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5759141047440141628;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin5759141047440141628;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:04:20] [INFO ] Flatten gal took : 80 ms
[2025-05-31 07:04:20] [INFO ] Flatten gal took : 75 ms
[2025-05-31 07:04:20] [INFO ] Time to serialize gal into /tmp/LTL10937101080851431968.gal : 22 ms
[2025-05-31 07:04:20] [INFO ] Time to serialize properties into /tmp/LTL9701925242261750005.prop : 10 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/LTL10937101080851431968.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3086640279987918557.hoa' '-atoms' '/tmp/LTL9701925242261750005.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL9701925242261750005.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3086640279987918557.hoa
Detected timeout of ITS tools.
[2025-05-31 07:04:36] [INFO ] Flatten gal took : 70 ms
[2025-05-31 07:04:36] [INFO ] Flatten gal took : 72 ms
[2025-05-31 07:04:36] [INFO ] Time to serialize gal into /tmp/LTL3628272124183152134.gal : 16 ms
[2025-05-31 07:04:36] [INFO ] Time to serialize properties into /tmp/LTL11122520936586540356.ltl : 10 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/LTL3628272124183152134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11122520936586540356.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((((TrainState_10_0_0==1)||(TrainState_9_0_0==1))||((TrainState_13_0_0==1)||(TrainState_8_0_0==1)))||(((TrainState_4_0_0=...45802
Formula 0 simplified : XX(F!"((((((TrainState_10_0_0==1)||(TrainState_9_0_0==1))||((TrainState_13_0_0==1)||(TrainState_8_0_0==1)))||(((TrainState_4_0_0==1)...45783
Detected timeout of ITS tools.
[2025-05-31 07:04:51] [INFO ] Flatten gal took : 68 ms
[2025-05-31 07:04:51] [INFO ] Applying decomposition
[2025-05-31 07:04:51] [INFO ] Flatten gal took : 67 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/graph5468328056082140238.txt' '-o' '/tmp/graph5468328056082140238.bin' '-w' '/tmp/graph5468328056082140238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph5468328056082140238.bin' '-l' '-1' '-v' '-w' '/tmp/graph5468328056082140238.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:04:51] [INFO ] Decomposing Gal with order
[2025-05-31 07:04:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:04:52] [INFO ] Removed a total of 240 redundant transitions.
[2025-05-31 07:04:52] [INFO ] Flatten gal took : 311 ms
[2025-05-31 07:04:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 23 ms.
[2025-05-31 07:04:52] [INFO ] Time to serialize gal into /tmp/LTL3916676988732052043.gal : 37 ms
[2025-05-31 07:04:52] [INFO ] Time to serialize properties into /tmp/LTL7977262906213096134.ltl : 6 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/LTL3916676988732052043.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7977262906213096134.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(X((G("((((((i7.i0.u53.TrainState_10_0_0==1)||(i6.i0.u52.TrainState_9_0_0==1))||((i9.i0.u54.TrainState_13_0_0==1)||(i18.i1.u257.Tr...65031
Formula 0 simplified : XX(F!"((((((i7.i0.u53.TrainState_10_0_0==1)||(i6.i0.u52.TrainState_9_0_0==1))||((i9.i0.u54.TrainState_13_0_0==1)||(i18.i1.u257.Train...65012
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
84 unique states visited
6 strongly connected components in search stack
84 transitions explored
80 items max in DFS search stack
539 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,5.72749,198124,1,0,316023,7634,18469,797303,1717,16781,632202
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-00 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-020-LTLFireability-00 finished in 371670 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(p0))||(X(!p1) U ((X(!p1)&&G(!p2))||X(G(!p1))))))'
Support contains 1960 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Applied a total of 0 rules in 34 ms. Remains 2640 /2640 variables (removed 0) and now considering 4040/4040 (removed 0) transitions.
[2025-05-31 07:04:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:00] [INFO ] Implicit Places using invariants in 488 ms returned []
[2025-05-31 07:05:00] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:05:01] [INFO ] Implicit Places using invariants and state equation in 1495 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
Running 3320 sub problems to find dead transitions.
[2025-05-31 07:05:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30048 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 3320/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3320 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2620 variables, 2620/2620 constraints. Problems are: Problem set: 0 solved, 3320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2620/6680 variables, and 2620 constraints, problems are : Problem set: 0 solved, 3320 unsolved in 30043 ms.
Refiners :[Domain max(s): 2620/2640 constraints, Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2640 constraints, PredecessorRefiner: 0/3320 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61143ms problems are : Problem set: 0 solved, 3320 unsolved
Search for dead transitions found 0 dead transitions in 61147ms
Finished structural reductions in LTL mode , in 1 iterations and 63174 ms. Remains : 2640/2640 places, 4040/4040 transitions.
Stuttering acceptance computed with spot in 507 ms :[true, (AND (NOT p0) p1), (AND p2 p1 (NOT p0)), (AND p2 p1), p2, (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), p1, p1, (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-01
Entered a terminal (fully accepting) state of product in 83243 steps with 27747 reset in 3467 ms.
FORMULA BART-PT-020-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-01 finished in 67194 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 1380 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 60 place count 2640 transition count 3980
Reduce places removed 60 places and 0 transitions.
Performed 520 Post agglomeration using F-continuation condition.Transition count delta: 520
Iterating post reduction 1 with 580 rules applied. Total rules applied 640 place count 2580 transition count 3460
Reduce places removed 520 places and 0 transitions.
Iterating post reduction 2 with 520 rules applied. Total rules applied 1160 place count 2060 transition count 3460
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1180 place count 2040 transition count 3440
Iterating global reduction 3 with 20 rules applied. Total rules applied 1200 place count 2040 transition count 3440
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 80
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 1360 place count 1960 transition count 3360
Applied a total of 1360 rules in 278 ms. Remains 1960 /2640 variables (removed 680) and now considering 3360/4040 (removed 680) transitions.
// Phase 1: matrix 3360 rows 1960 cols
[2025-05-31 07:06:07] [INFO ] Computed 20 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:06:07] [INFO ] Implicit Places using invariants in 264 ms returned []
[2025-05-31 07:06:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:06:08] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1278 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:06:08] [INFO ] Redundant transitions in 88 ms returned []
Running 2640 sub problems to find dead transitions.
[2025-05-31 07:06:08] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 2640/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2640 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 0/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60940ms problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 60955ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1960/2640 places, 3360/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62612 ms. Remains : 1960/2640 places, 3360/4040 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 883 ms.
Product exploration explored 100000 steps with 0 reset in 991 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 69 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 466 ms. (85 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 1648 ms. (24 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 8266 steps, run visited all 1 properties in 162 ms. (steps per millisecond=51 )
Probabilistic random walk after 8266 steps, saw 8224 distinct states, run finished after 180 ms. (steps per millisecond=45 ) properties seen :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 114 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 85 ms :[(NOT p0), (NOT p0)]
Support contains 1380 out of 1960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1960/1960 places, 3360/3360 transitions.
Applied a total of 0 rules in 40 ms. Remains 1960 /1960 variables (removed 0) and now considering 3360/3360 (removed 0) transitions.
[2025-05-31 07:07:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:07:21] [INFO ] Implicit Places using invariants in 242 ms returned []
[2025-05-31 07:07:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:07:22] [INFO ] Implicit Places using invariants and state equation in 977 ms returned []
Implicit Place search using SMT with State Equation took 1224 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:07:22] [INFO ] Redundant transitions in 226 ms returned []
Running 2640 sub problems to find dead transitions.
[2025-05-31 07:07:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 2640/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2640 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 0/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60788ms problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62293 ms. Remains : 1960/1960 places, 3360/3360 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), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 71 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 54 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 40000 steps (8 resets) in 644 ms. (62 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36866 steps (7 resets) in 1589 ms. (23 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 92 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 999 ms.
Product exploration explored 100000 steps with 0 reset in 1056 ms.
Built C files in :
/tmp/ltsmin15887958724391587896
[2025-05-31 07:08:34] [INFO ] Too many transitions (3360) to apply POR reductions. Disabling POR matrices.
[2025-05-31 07:08:34] [INFO ] Built C files in 40ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15887958724391587896
Running compilation step : cd /tmp/ltsmin15887958724391587896;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15887958724391587896;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin15887958724391587896;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1380 out of 1960 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1960/1960 places, 3360/3360 transitions.
Applied a total of 0 rules in 45 ms. Remains 1960 /1960 variables (removed 0) and now considering 3360/3360 (removed 0) transitions.
[2025-05-31 07:08:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:08:37] [INFO ] Implicit Places using invariants in 216 ms returned []
[2025-05-31 07:08:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:08:38] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:08:38] [INFO ] Redundant transitions in 91 ms returned []
Running 2640 sub problems to find dead transitions.
[2025-05-31 07:08:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 2640/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2640 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1940/5320 variables, and 0 constraints, problems are : Problem set: 0 solved, 2640 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1960 constraints, PredecessorRefiner: 0/2640 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60804ms problems are : Problem set: 0 solved, 2640 unsolved
Search for dead transitions found 0 dead transitions in 60807ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62146 ms. Remains : 1960/1960 places, 3360/3360 transitions.
Built C files in :
/tmp/ltsmin10694753417188051211
[2025-05-31 07:09:39] [INFO ] Too many transitions (3360) to apply POR reductions. Disabling POR matrices.
[2025-05-31 07:09:39] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10694753417188051211
Running compilation step : cd /tmp/ltsmin10694753417188051211;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10694753417188051211;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10694753417188051211;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:09:42] [INFO ] Flatten gal took : 47 ms
[2025-05-31 07:09:42] [INFO ] Flatten gal took : 43 ms
[2025-05-31 07:09:43] [INFO ] Time to serialize gal into /tmp/LTL17727336587943674217.gal : 10 ms
[2025-05-31 07:09:43] [INFO ] Time to serialize properties into /tmp/LTL11388129991995935097.prop : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17727336587943674217.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4497132100700964919.hoa' '-atoms' '/tmp/LTL11388129991995935097.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/LTL11388129991995935097.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4497132100700964919.hoa
Detected timeout of ITS tools.
[2025-05-31 07:09:58] [INFO ] Flatten gal took : 42 ms
[2025-05-31 07:09:58] [INFO ] Flatten gal took : 57 ms
[2025-05-31 07:09:58] [INFO ] Time to serialize gal into /tmp/LTL6970175746339214277.gal : 11 ms
[2025-05-31 07:09:58] [INFO ] Time to serialize properties into /tmp/LTL2002758644134566193.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6970175746339214277.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2002758644134566193.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13_...36409
Formula 0 simplified : FG!"((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13_4_...36403
Detected timeout of ITS tools.
[2025-05-31 07:10:13] [INFO ] Flatten gal took : 41 ms
[2025-05-31 07:10:13] [INFO ] Applying decomposition
[2025-05-31 07:10:13] [INFO ] Flatten gal took : 42 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/graph2083276443920165388.txt' '-o' '/tmp/graph2083276443920165388.bin' '-w' '/tmp/graph2083276443920165388.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2083276443920165388.bin' '-l' '-1' '-v' '-w' '/tmp/graph2083276443920165388.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:10:13] [INFO ] Decomposing Gal with order
[2025-05-31 07:10:13] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:10:13] [INFO ] Removed a total of 158 redundant transitions.
[2025-05-31 07:10:14] [INFO ] Flatten gal took : 101 ms
[2025-05-31 07:10:14] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 9 ms.
[2025-05-31 07:10:14] [INFO ] Time to serialize gal into /tmp/LTL4320858692939368207.gal : 19 ms
[2025-05-31 07:10:14] [INFO ] Time to serialize properties into /tmp/LTL10902533855774081072.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4320858692939368207.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10902533855774081072.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("((((((((((((i2.u36.TrainState_6_1_7==1)||(i15.u164.TrainState_9_1_27==1))||((i10.u49.TrainState_2_1_9==1)||(i10.u49.TrainState...47412
Formula 0 simplified : FG!"((((((((((((i2.u36.TrainState_6_1_7==1)||(i15.u164.TrainState_9_1_27==1))||((i10.u49.TrainState_2_1_9==1)||(i10.u49.TrainState_2...47406
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
2 unique states visited
0 strongly connected components in search stack
2 transitions explored
2 items max in DFS search stack
115 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,1.41098,44328,1,0,34331,9854,17564,40311,1903,21280,114698
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-020-LTLFireability-02 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BART-PT-020-LTLFireability-02 finished in 248760 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 1760 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 880 edges and 2640 vertex of which 120 / 2640 are part of one of the 20 SCC in 8 ms
Free SCC test removed 100 places
Ensure Unique test removed 100 transitions
Reduce isomorphic transitions removed 100 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 20 transitions
Trivial Post-agglo rules discarded 20 transitions
Performed 20 trivial Post agglomeration. Transition count delta: 20
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 2540 transition count 3920
Reduce places removed 20 places and 0 transitions.
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Iterating post reduction 1 with 200 rules applied. Total rules applied 221 place count 2520 transition count 3740
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 401 place count 2340 transition count 3740
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 401 place count 2340 transition count 3700
Deduced a syphon composed of 40 places in 1 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 481 place count 2300 transition count 3700
Discarding 100 places :
Symmetric choice reduction at 3 with 100 rule applications. Total rules 581 place count 2200 transition count 3600
Iterating global reduction 3 with 100 rules applied. Total rules applied 681 place count 2200 transition count 3600
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 741 place count 2140 transition count 3540
Iterating global reduction 3 with 60 rules applied. Total rules applied 801 place count 2140 transition count 3540
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 861 place count 2080 transition count 3480
Iterating global reduction 3 with 60 rules applied. Total rules applied 921 place count 2080 transition count 3480
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 981 place count 2020 transition count 3420
Iterating global reduction 3 with 60 rules applied. Total rules applied 1041 place count 2020 transition count 3420
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1081 place count 1980 transition count 3380
Iterating global reduction 3 with 40 rules applied. Total rules applied 1121 place count 1980 transition count 3380
Discarding 40 places :
Symmetric choice reduction at 3 with 40 rule applications. Total rules 1161 place count 1940 transition count 3340
Iterating global reduction 3 with 40 rules applied. Total rules applied 1201 place count 1940 transition count 3340
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 1221 place count 1920 transition count 3320
Iterating global reduction 3 with 20 rules applied. Total rules applied 1241 place count 1920 transition count 3320
Performed 140 Post agglomeration using F-continuation condition.Transition count delta: 140
Deduced a syphon composed of 140 places in 0 ms
Reduce places removed 140 places and 0 transitions.
Iterating global reduction 3 with 280 rules applied. Total rules applied 1521 place count 1780 transition count 3180
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 1541 place count 1780 transition count 3160
Applied a total of 1541 rules in 251 ms. Remains 1780 /2640 variables (removed 860) and now considering 3160/4040 (removed 880) transitions.
[2025-05-31 07:10:15] [INFO ] Flow matrix only has 3141 transitions (discarded 19 similar events)
// Phase 1: matrix 3141 rows 1780 cols
[2025-05-31 07:10:15] [INFO ] Computed 20 invariants in 19 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:10:16] [INFO ] Implicit Places using invariants in 217 ms returned []
[2025-05-31 07:10:16] [INFO ] Flow matrix only has 3141 transitions (discarded 19 similar events)
[2025-05-31 07:10:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:10:16] [INFO ] Implicit Places using invariants and state equation in 917 ms returned []
Implicit Place search using SMT with State Equation took 1138 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:10:17] [INFO ] Redundant transitions in 78 ms returned []
Running 2440 sub problems to find dead transitions.
[2025-05-31 07:10:17] [INFO ] Flow matrix only has 3141 transitions (discarded 19 similar events)
[2025-05-31 07:10:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1760/4921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2440 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1780 constraints, PredecessorRefiner: 2440/2440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2440 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1760/4921 variables, and 0 constraints, problems are : Problem set: 0 solved, 2440 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1780 constraints, PredecessorRefiner: 0/2440 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60856ms problems are : Problem set: 0 solved, 2440 unsolved
Search for dead transitions found 0 dead transitions in 60859ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1780/2640 places, 3160/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62339 ms. Remains : 1780/2640 places, 3160/4040 transitions.
Stuttering acceptance computed with spot in 53 ms :[(NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BART-PT-020-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-03 finished in 62418 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))))'
Support contains 180 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 460 places :
Symmetric choice reduction at 0 with 460 rule applications. Total rules 460 place count 2180 transition count 3580
Iterating global reduction 0 with 460 rules applied. Total rules applied 920 place count 2180 transition count 3580
Discarding 380 places :
Symmetric choice reduction at 0 with 380 rule applications. Total rules 1300 place count 1800 transition count 3200
Iterating global reduction 0 with 380 rules applied. Total rules applied 1680 place count 1800 transition count 3200
Applied a total of 1680 rules in 244 ms. Remains 1800 /2640 variables (removed 840) and now considering 3200/4040 (removed 840) transitions.
// Phase 1: matrix 3200 rows 1800 cols
[2025-05-31 07:11:18] [INFO ] Computed 20 invariants in 17 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:11:18] [INFO ] Implicit Places using invariants in 243 ms returned []
[2025-05-31 07:11:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:11:19] [INFO ] Implicit Places using invariants and state equation in 1019 ms returned []
Implicit Place search using SMT with State Equation took 1264 ms to find 0 implicit places.
Running 2480 sub problems to find dead transitions.
[2025-05-31 07:11:19] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1780/5000 variables, and 0 constraints, problems are : Problem set: 0 solved, 2480 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 2480/2480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2480 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 timeout
1) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1780/5000 variables, and 0 constraints, problems are : Problem set: 0 solved, 2480 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1800 constraints, PredecessorRefiner: 0/2480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60789ms problems are : Problem set: 0 solved, 2480 unsolved
Search for dead transitions found 0 dead transitions in 60792ms
Starting structural reductions in LTL mode, iteration 1 : 1800/2640 places, 3200/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62309 ms. Remains : 1800/2640 places, 3200/4040 transitions.
Stuttering acceptance computed with spot in 182 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BART-PT-020-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-04 finished in 62515 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F((!p0&&F(!p1))) U p2))'
Support contains 1800 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 2640 transition count 4000
Reduce places removed 40 places and 0 transitions.
Performed 180 Post agglomeration using F-continuation condition.Transition count delta: 180
Iterating post reduction 1 with 220 rules applied. Total rules applied 260 place count 2600 transition count 3820
Reduce places removed 180 places and 0 transitions.
Iterating post reduction 2 with 180 rules applied. Total rules applied 440 place count 2420 transition count 3820
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 80 Pre rules applied. Total rules applied 440 place count 2420 transition count 3740
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 3 with 160 rules applied. Total rules applied 600 place count 2340 transition count 3740
Discarding 120 places :
Symmetric choice reduction at 3 with 120 rule applications. Total rules 720 place count 2220 transition count 3620
Iterating global reduction 3 with 120 rules applied. Total rules applied 840 place count 2220 transition count 3620
Ensure Unique test removed 20 transitions
Reduce isomorphic transitions removed 20 transitions.
Iterating post reduction 3 with 20 rules applied. Total rules applied 860 place count 2220 transition count 3600
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 920 place count 2160 transition count 3540
Iterating global reduction 4 with 60 rules applied. Total rules applied 980 place count 2160 transition count 3540
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1040 place count 2100 transition count 3480
Iterating global reduction 4 with 60 rules applied. Total rules applied 1100 place count 2100 transition count 3480
Discarding 60 places :
Symmetric choice reduction at 4 with 60 rule applications. Total rules 1160 place count 2040 transition count 3420
Iterating global reduction 4 with 60 rules applied. Total rules applied 1220 place count 2040 transition count 3420
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1260 place count 2000 transition count 3380
Iterating global reduction 4 with 40 rules applied. Total rules applied 1300 place count 2000 transition count 3380
Discarding 40 places :
Symmetric choice reduction at 4 with 40 rule applications. Total rules 1340 place count 1960 transition count 3340
Iterating global reduction 4 with 40 rules applied. Total rules applied 1380 place count 1960 transition count 3340
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 1400 place count 1940 transition count 3320
Iterating global reduction 4 with 20 rules applied. Total rules applied 1420 place count 1940 transition count 3320
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 1 ms
Reduce places removed 120 places and 0 transitions.
Iterating global reduction 4 with 240 rules applied. Total rules applied 1660 place count 1820 transition count 3200
Applied a total of 1660 rules in 205 ms. Remains 1820 /2640 variables (removed 820) and now considering 3200/4040 (removed 840) transitions.
// Phase 1: matrix 3200 rows 1820 cols
[2025-05-31 07:12:20] [INFO ] Computed 20 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:12:20] [INFO ] Implicit Places using invariants in 221 ms returned []
[2025-05-31 07:12:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:12:21] [INFO ] Implicit Places using invariants and state equation in 925 ms returned []
Implicit Place search using SMT with State Equation took 1147 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:12:21] [INFO ] Redundant transitions in 84 ms returned []
Running 2480 sub problems to find dead transitions.
[2025-05-31 07:12:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1800/5020 variables, and 0 constraints, problems are : Problem set: 0 solved, 2480 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1820 constraints, PredecessorRefiner: 2480/2480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2480 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1800/5020 variables, and 0 constraints, problems are : Problem set: 0 solved, 2480 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/1820 constraints, PredecessorRefiner: 0/2480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60767ms problems are : Problem set: 0 solved, 2480 unsolved
Search for dead transitions found 0 dead transitions in 60771ms
Starting structural reductions in SI_LTL mode, iteration 1 : 1820/2640 places, 3200/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62219 ms. Remains : 1820/2640 places, 3200/4040 transitions.
Stuttering acceptance computed with spot in 106 ms :[(NOT p2), (OR p0 p1), p1]
Running random walk in product with property : BART-PT-020-LTLFireability-05
Product exploration explored 100000 steps with 4054 reset in 2084 ms.
Stack based approach found an accepted trace after 1376 steps with 4 reset with depth 1299 and stack size 1242 in 18 ms.
FORMULA BART-PT-020-LTLFireability-05 FALSE TECHNIQUES STACK_TEST
Treatment of property BART-PT-020-LTLFireability-05 finished in 64462 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(X(X(X(p1))))))))'
Support contains 1380 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 60 place count 2580 transition count 3980
Iterating global reduction 0 with 60 rules applied. Total rules applied 120 place count 2580 transition count 3980
Applied a total of 120 rules in 118 ms. Remains 2580 /2640 variables (removed 60) and now considering 3980/4040 (removed 60) transitions.
// Phase 1: matrix 3980 rows 2580 cols
[2025-05-31 07:13:25] [INFO ] Computed 20 invariants in 23 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:13:25] [INFO ] Implicit Places using invariants in 308 ms returned []
[2025-05-31 07:13:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:13:26] [INFO ] Implicit Places using invariants and state equation in 1334 ms returned []
Implicit Place search using SMT with State Equation took 1644 ms to find 0 implicit places.
Running 3260 sub problems to find dead transitions.
[2025-05-31 07:13:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 3260/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)
(s330 1)
(s331 1)
(s332 1)
(s333 1)
(s334 1)
(s335 1)
(s336 1)
(s337 1)
(s338 1)
(s339 1)
(s340 1)
(s341 1)
(s342 1)
(s343 1)
(s344 1)
(s345 1)
(s346 1)
(s347 1)
(s348 1)
(s349 1)
(s350 1)
(s351 1)
(s352 1)
(s353 1)
(s354 1)
(s355 1)
(s356 1)
(s357 1)
(s358 1)
(s359 1)
(s360 1)
(s361 1)
(s362 1)
(s363 1)
(s364 1)
(s365 1)
(s366 1)
(s367 1)
(s368 1)
(s369 1)
(s370 1)
(s371 1)
(s372 1)
(s373 1)
(s374 1)
(s375 1)
(s376 1)
(s377 1)
(s378 1)
(s379 1)
(s380 1)
(s381 1)
(s382 1)
(s383 1)
(s384 1)
(s385 1)
(s386 1)
(s387 1)
(s388 1)
(s389 1)
(s390 1)
(s391 1)
(s392 1)
(s393 1)
(s394 1)
(s395 1)
(s396 1)
(s397 1)
(s398 1)
(s399 1)
(s400 1)
(s401 1)
(s402 1)
(s403 1)
(s404 1)
(s405 1)
(s406 1)
(s407 1)
(s408 1)
(s409 1)
(s410 1)
(s411 1)
(s412 1)
(s413 1)
(s414 1)
(s415 1)
(s416 1)
(s417 1)
(s418 1)
(s419 1)
(s420 1)
(s421 1)
(s422 1)
(s423 1)
(s424 1)
(s425 1)
(s426 1)
(s427 1)
(s428 1)
(s429 1)
(s430 1)
(s431 1)
(s432 1)
(s433 1)
(s434 1)
(s435 1)
(s436 1)
(s437 1)
(s438 1)
(s439 1)
(s440 1)
(s441 1)
(s442 1)
(s443 1)
(s444 1)
(s445 1)
(s446 1)
(s447 1)
(s448 1)
(s449 1)
(s450 1)
(s451 1)
(s452 1)
(s453 1)
(s454 1)
(s455 1)
(s456 1)
(s457 1)
(s458 1)
(s459 1)
(s460 1)
(s461 1)
(s462 1)
(s463 1)
(s464 1)
(s465 1)
(s466 1)
(s467 1)
(s468 1)
(s469 1)
(s470 1)
(s471 1)
(s472 1)
(s473 1)
(s474 1)
(s475 1)
(s476 1)
(s477 1)
(s478 1)
(s479 1)
(s480 1)
(s481 1)
(s482 1)
(s483 1)
(s484 1)
(s485 1)
(s486 1)
(s487 1)
(s488 1)
(s489 1)
(s490 1)
(s491 1)
(s492 1)
(s493 1)
(s494 1)
(s495 1)
(s496 1)
(s497 1)
(s498 1)
(s499 1)
(s500 1)
(s501 1)
(s502 1)
(s503 1)
(s504 1)
(s505 1)
(s506 1)
(s507 1)
(s508 1)
(s509 1)
(s510 1)
(s511 1)
(s512 1)
(s513 1)
(s514 1)
(s515 1)
(s516 1)
(s517 1)
(s518 1)
(s519 1)
(s520 1)
(s521 1)
(s522 1)
(s523 1)
(s524 1)
(s525 1)
(s526 1)
(s527 1)
(s528 1)
(s529 1)
(s530 1)
(s531 1)
(s532 1)
(s533 1)
(s534 1)
(s535 1)
(s536 1)
(s537 1)
(s538 1)
(s539 1)
(s540 1)
(s541 1)
(s542 1)
(s543 1)
(s544 1)
(s545 1)
(s546 1)
(s547 1)
(s548 1)
(s549 1)
(s550 1)
(s551 1)
(s552 1)
(s553 1)
(s554 1)
(s555 1)
(s556 1)
(s557 1)
(s558 1)
(s559 1)
(s560 1)
(s561 1)
(s562 1)
(s563 1)
(s564 1)
(s565 1)
(s566 1)
(s567 1)
(s568 1)
(s569 1)
(s570 1)
(s571 1)
(s572 1)
(s573 1)
(s574 1)
(s575 1)
(s576 1)
(s577 1)
(s578 1)
(s579 1)
(s580 1)
(s581 1)
(s582 1)
(s583 1)
(s584 1)
(s585 1)
(s586 1)
(s587 1)
(s588 1)
(s589 1)
(s590 1)
(s591 1)
(s592 1)
(s593 1)
(s594 1)
(s595 1)
(s596 1)
(s597 1)
(s598 1)
(s599 1)
(s600 1)
(s601 1)
(s602 1)
(s603 1)
(s604 1)
(s605 1)
(s606 1)
(s607 1)
(s608 1)
(s609 1)
(s610 1)
(s611 1)
(s612 1)
(s613 1)
(s614 1)
(s615 1)
(s616 1)
(s617 1)
(s618 1)
(s619 1)
(s620 1)
(s621 1)
(s622 1)
(s623 1)
(s624 1)
(s625 1)
(s626 1)
(s627 1)
(s628 1)
(s629 1)
(s630 1)
(s631 1)
(s632 1)
(s633 1)
(s634 1)
(s635 1)
(s636 1)
(s637 1)
(s638 1)
(s639 1)
(s640 1)
(s641 1)
(s642 1)
(s643 1)
(s644 1)
(s645 1)
(s646 1)
(s647 1)
(s648 1)
(s649 1)
(s650 1)
(s651 1)
(s652 1)
(s653 1)
(s654 1)
(s655 1)
(s656 1)
(s657 1)
(s658 1)
(s659 1)
(s660 1)
(s661 1)
(s662 1)
(s663 1)
(s664 1)
(s665 1)
(s666 1)
(s667 1)
(s668 1)
(s669 1)
(s670 1)
(s671 1)
(s672 1)
(s673 1)
(s674 1)
(s675 1)
(s676 1)
(s677 1)
(s678 1)
(s679 1)
(s680 1)
(s681 1)
(s682 1)
(s683 1)
(s684 1)
(s685 1)
(s686 1)
(s687 1)
(s688 1)
(s689 1)
(s690 1)
(s691 1)
(s692 1)
(s693 1)
(s694 1)
(s695 1)
(s696 1)
(s697 1)
(s698 1)
(s699 1)
(s700 1)
(s701 1)
(s702 1)
(s703 1)
(s704 1)
(s705 1)
(s706 1)
(s707 1)
(s708 1)
(s709 1)
(s710 1)
(s711 1)
(s712 1)
(s713 1)
(s714 1)
(s715 1)
(s716 1)
(s717 1)
(s718 1)
(s719 1)
(s720 1)
(s721 1)
(s722 1)
(s723 1)
(s724 1)
(s725 1)
(s726 1)
(s727 1)
(s728 1)
(s729 1)
(s730 1)
(s731 1)
(s732 1)
(s733 1)
(s734 1)
(s735 1)
(s736 1)
(s737 1)
(s738 1)
(s739 1)
(s740 1)
(s741 1)
(s742 1)
(s743 1)
(s744 1)
(s745 1)
(s746 1)
(s747 1)
(s748 1)
(s749 1)
(s750 1)
(s751 1)
(s752 1)
(s753 1)
(s754 1)
(s755 1)
(s756 1)
(s757 1)
(s758 1)
(s759 1)
(s760 1)
(s761 1)
(s762 1)
(s763 1)
(s764 1)
(s765 1)
(s766 1)
(s767 1)
(s768 1)
(s769 1)
(s770 1)
(s771 1)
(s772 1)
(s773 1)
(s774 1)
(s775 1)
(s776 1)
(s777 1)
(s778 1)
(s779 1)
(s780 1)
(s781 1)
(s782 1)
(s783 1)
(s784 1)
(s785 1)
(s786 1)
(s787 1)
(s788 1)
(s789 1)
(s790 1)
(s791 1)
(s792 1)
(s793 1)
(s794 1)
(s795 1)
(s796 1)
(s797 1)
(s798 1)
(s799 1)
(s800 1)
(s801 1)
(s802 1)
(s803 1)
(s804 1)
(s805 1)
(s806 1)
(s807 1)
(s808 1)
(s809 1)
(s810 1)
(s811 1)
(s812 1)
(s813 1)
(s814 1)
(s815 1)
(s816 1)
(s817 1)
(s818 1)
(s819 1)
(s820 1)
(s821 1)
(s822 1)
(s823 1)
(s824 1)
(s825 1)
(s826 1)
(s827 1)
(s828 1)
(s829 1)
(s830 1)
(s831 1)
(s832 1)
(s833 1)
(s834 1)
(s835 1)
(s836 1)
(s837 1)
(s838 1)
(s839 1)
(s840 1)
(s841 1)
(s842 1)
(s843 1)
(s844 1)
(s845 1)
(s846 1)
(s847 1)
(s848 1)
(s849 1)
(s850 1)
(s851 1)
(s852 1)
(s853 1)
(s854 1)
(s855 1)
(s856 1)
(s857 1)
(s858 1)
(s859 1)
(s860 1)
(s861 1)
(s862 1)
(s863 1)
(s864 1)
(s865 1)
(s866 1)
(s867 1)
(s868 1)
(s869 1)
(s870 1)
(s871 1)
(s872 1)
(s873 1)
(s874 1)
(s875 1)
(s876 1)
(s877 1)
(s878 1)
(s879 1)
(s880 1)
(s881 1)
(s882 1)
(s883 1)
(s884 1)
(s885 1)
(s886 1)
(s887 1)
(s888 1)
(s889 1)
(s890 1)
(s891 1)
(s892 1)
(s893 1)
(s894 1)
(s895 1)
(s896 1)
(s897 1)
(s898 1)
(s899 1)
(s900 1)
(s901 1)
(s902 1)
(s903 1)
(s904 1)
(s905 1)
(s906 1)
(s907 1)
(s908 1)
(s909 1)
(s910 1)
(s911 1)
(s912 1)
(s913 1)
(s914 1)
(s915 1)
(s916 1)
(s917 1)
(s918 1)
(s919 1)
(s920 1)
(s921 1)
(s922 1)
(s923 1)
(s924 1)
(s925 1)
(s926 1)
(s927 1)
(s928 1)
(s929 1)
(s930 1)
(s931 1)
(s932 1)
(s933 1)
(s934 1)
(s935 1)
(s936 1)
(s937 1)
(s938 1)
(s939 1)
(s940 1)
(s941 1)
(s942 1)
(s943 1)
(s944 1)
(s945 1)
(s946 1)
(s947 1)
(s948 1)
(s949 1)
(s950 1)
(s951 1)
(s952 1)
(s953 1)
(s954 1)
(s955 1)
(s956 1)
(s957 1)
(s958 1)
(s959 1)
(s960 1)
(s961 1)
(s962 1)
(s963 1)
(s964 1)
(s965 1)
(s966 1)
(s967 1)
(s968 1)
(s969 1)
(s970 1)
(s971 1)
(s972 1)
(s973 1)
(s974 1)
(s975 1)
(s976 1)
(s977 1)
(s978 1)
(s979 1)
(s980 1)
(s981 1)
(s982 1)
(s983 1)
(s984 1)
(s985 1)
(s986 1)
(s987 1)
(s988 1)
(s989 1)
(s990 1)
(s991 1)
(s992 1)
(s993 1)
(s994 1)
(s995 1)
(s996 1)
(s997 1)
(s998 1)
(s999 1)
(s1000 1)
(s1001 1)
(s1002 1)
(s1003 1)
(s1004 1)
(s1005 1)
(s1006 1)
(s1007 1)
(s1008 1)
(s1009 1)
(s1010 1)
(s1011 1)
(s1012 1)
(s1013 1)
(s1014 1)
(s1015 1)
(s1016 1)
(s1017 1)
(s1018 1)
(s1019 1)
(s1020 1)
(s1021 1)
(s1022 1)
(s1023 1)
(s1024 1)
(s1025 1)
(s1026 1)
(s1027 1)
(s1028 1)
(s1029 1)
(s1030 1)
(s1031 1)
(s1032 1)
(s1033 1)
(s1034 1)
(s1035 1)
(s1036 1)
(s1037 1)
(s1038 1)
(s1039 1)
(s1040 1)
(s1041 1)
(s1042 1)
(s1043 1)
(s1044 1)
(s1045 1)
(s1046 1)
(s1047 1)
(s1048 1)
(s1049 1)
(s1050 1)
(s1051 1)
(s1052 1)
(s1053 1)
(s1054 1)
(s1055 1)
(s1056 1)
(s1057 1)
(s1058 1)
(s1059 1)
(s1060 1)
(s1061 1)
(s1062 1)
(s1063 1)
(s1064 1)
(s1065 1)
(s1066 1)
(s1067 1)
(s1068 1)
(s1069 1)
(s1070 1)
(s1071 1)
(s1072 1)
(s1073 1)
(s1074 1)
(s1075 1)
(s1076 1)
(s1077 1)
(s1078 1)
(s1079 1)
(s1080 1)
(s1081 1)
(s1082 1)
(s1083 1)
(s1084 1)
(s1085 1)
(s1086 1)
(s1087 1)
(s1088 1)
(s1089 1)
(s1090 1)
(s1091 1)
(s1092 1)
(s1093 1)
(s1094 1)
(s1095 1)
(s1096 1)
(s1097 1)
(s1098 1)
(s1099 1)
(s1100 1)
(s1101 1)
(s1102 1)
(s1103 1)
(s1104 1)
(s1105 1)
(s1106 1)
(s1107 1)
(s1108 1)
(s1109 1)
(s1110 1)
(s1111 1)
(s1112 1)
(s1113 1)
(s1114 1)
(s1115 1)
(s1116 1)
(s1117 1)
(s1118 1)
(s1119 1)
(s1120 1)
(s1121 1)
(s1122 1)
(s1123 1)
(s1124 1)
(s1125 1)
(s1126 1)
(s1127 1)
(s1128 1)
(s1129 1)
(s1130 1)
(s1131 1)
(s1132 1)
(s1133 1)
(s1134 1)
(s1135 1)
(s1136 1)
(s1137 1)
(s1138 1)
(s1139 1)
(s1140 1)
(s1141 1)
(s1142 1)
(s1143 1)
(s1144 1)
(s1145 1)
(s1146 1)
(s1147 1)
(s1148 1)
(s1149 1)
(s1150 1)
(s1151 1)
(s1152 1)
(s1153 1)
(s1154 1)
(s1155 1)
(s1156 1)
(s1157 1)
(s1158 1)
(s1159 1)
(s1160 1)
(s1161 1)
(s1162 1)
(s1163 1)
(s1164 1)
(s1165 1)
(s1166 1)
(s1167 1)
(s1168 1)
(s1169 1)
(s1170 1)
(s1171 1)
(s1172 1)
(s1173 1)
(s1174 1)
(s1175 1)
(s1176 1)
(s1177 1)
(s1178 1)
(s1179 1)
(s1180 1)
(s1181 1)
(s1182 1)
(s1183 1)
(s1184 1)
(s1185 1)
(s1186 1)
(s1187 1)
(s1188 1)
(s1189 1)
(s1190 1)
(s1191 1)
(s1192 1)
(s1193 1)
(s1194 1)
(s1195 1)
(s1196 1)
(s1197 1)
(s1198 1)
(s1199 1)
(s1200 1)
(s1201 1)
(s1202 1)
(s1203 1)
(s1204 1)
(s1205 1)
(s1206 1)
(s1207 1)
(s1208 1)
(s1209 1)
(s1210 1)
(s1211 1)
(s1212 1)
(s1213 1)
(s1214 1)
(s1215 1)
(s1216 1)
(s1217 1)
(s1218 1)
(s1219 1)
(s1220 1)
(s1221 1)
(s1222 1)
(s1223 1)
(s1224 1)
(s1225 1)
(s1226 1)
(s1227 1)
(s1228 1)
(s1229 1)
(s1230 1)
(s1231 1)
(s1232 1)
(s1233 1)
(s1234 1)
(s1235 1)
(s1236 1)
(s1237 1)
(s1238 1)
(s1239 1)
(s1240 1)
(s1241 1)
(s1242 1)
(s1243 1)
(s1244 1)
(s1245 1)
(s1246 1)
(s1247 1)
(s1248 1)
(s1249 1)
(s1250 1)
(s1251 1)
(s1252 1)
(s1253 1)
(s1254 1)
(s1255 1)
(s1256 1)
(s1257 1)
(s1258 1)
(s1259 1)
(s1260 1)
(s1261 1)
(s1262 1)
(s1263 1)
(s1264 1)
(s1265 1)
(s1266 1)
(s1267 1)
(s1268 1)
(s1269 1)
(s1270 1)
(s1271 1)
(s1272 1)
(s1273 1)
(s1274 1)
(s1275 1)
(s1276 1)
(s1277 1)
(s1278 1)
(s1279 1)
(s1280 1)
(s1281 1)
(s1282 1)
(s1283 1)
(s1284 1)
(s1285 1)
(s1286 1)
(s1287 1)
(s1288 1)
(s1289 1)
(s1290 1)
(s1291 1)
(s1292 1)
(s1293 1)
(s1294 1)
(s1295 1)
(s1296 1)
(s1297 1)
(s1298 1)
(s1299 1)
(s1300 1)
(s1301 1)
(s1302 1)
(s1303 1)
(s1304 1)
(s1305 1)
(s1306 1)
(s1307 1)
(s1308 1)
(s1309 1)
(s1310 1)
(s1311 1)
(s1312 1)
(s1313 1)
(s1314 1)
(s1315 1)
(s1316 1)
(s1317 1)
(s1318 1)
(s1319 1)
(s1320 1)
(s1321 1)
(s1322 1)
(s1323 1)
(s1324 1)
(s1325 1)
(s1326 1)
(s1327 1)
(s1328 1)
(s1329 1)
(s1330 1)
(s1331 1)
(s1332 1)
(s1333 1)
(s1334 1)
(s1335 1)
(s1336 1)
(s1337 1)
(s1338 1)
(s1339 1)
(s1340 1)
(s1341 1)
(s1342 1)
(s1343 1)
(s1344 1)
(s1345 1)
(s1346 1)
(s1347 1)
(s1348 1)
(s1349 1)
(s1350 1)
(s1351 1)
(s1352 1)
(s1353 1)
(s1354 1)
(s1355 1)
(s1356 1)
(s1357 1)
(s1358 1)
(s1359 1)
(s1360 1)
(s1361 1)
(s1362 1)
(s1363 1)
(s1364 1)
(s1365 1)
(s1366 1)
(s1367 1)
(s1368 1)
(s1369 1)
(s1370 1)
(s1371 1)
(s1372 1)
(s1373 1)
(s1374 1)
(s1375 1)
(s1376 1)
(s1377 1)
(s1378 1)
(s1379 1)
(s1380 1)
(s1381 1)
(s1382 1)
(s1383 1)
(s1384 1)
(s1385 1)
(s1386 1)
(s1387 1)
(s1388 1)
(s1389 1)
(s1390 1)
(s1391 1)
(s1392 1)
(s1393 1)
(s1394 1)
(s1395 1)
(s1396 1)
(s1397 1)
(s1398 1)
(s1399 1)
(s1400 1)
(s1401 1)
(s1402 1)
(s1403 1)
(s1404 1)
(s1405 1)
(s1406 1)
(s1407 1)
(s1408 1)
(s1409 1)
(s1410 1)
(s1411 1)
(s1412 1)
(s1413 1)
(s1414 1)
(s1415 1)
(s1416 1)
(s1417 1)
(s1418 1)
(s1419 1)
(s1420 1)
(s1421 1)
(s1422 1)
(s1423 1)
(s1424 1)
(s1425 1)
(s1426 1)
(s1427 1)
(s1428 1)
(s1429 1)
(s1430 1)
(s1431 1)
(s1432 1)
(s1433 1)
(s1434 1)
(s1435 1)
(s1436 1)
(s1437 1)
(s1438 1)
(s1439 1)
(s1440 1)
(s1441 1)
(s1442 1)
(s1443 1)
(s1444 1)
(s1445 1)
(s1446 1)
(s1447 1)
(s1448 1)
(s1449 1)
(s1450 1)
(s1451 1)
(s1452 1)
(s1453 1)
(s1454 1)
(s1455 1)
(s1456 1)
(s1457 1)
(s1458 1)
(s1459 1)
(s1460 1)
(s1461 1)
(s1462 1)
(s1463 1)
(s1464 1)
(s1465 1)
(s1466 1)
(s1467 1)
(s1468 1)
(s1469 1)
(s1470 1)
(s1471 1)
(s1472 1)
(s1473 1)
(s1474 1)
(s1475 1)
(s1476 1)
(s1477 1)
(s1478 1)
(s1479 1)
(s1480 1)
(s1481 1)
(s1482 1)
(s1483 1)
(s1484 1)
(s1485 1)
(s1486 1)
(s1487 1)
(s1488 1)
(s1489 1)
(s1490 1)
(s1491 1)
(s1492 1)
(s1493 1)
(s1494 1)
(s1495 1)
(s1496 1)
(s1497 1)
(s1498 1)
(s1499 1)
(s1500 1)
(s1501 1)
(s1502 1)
(s1503 1)
(s1504 1)
(s1505 1)
(s1506 1)
(s1507 1)
(s1508 1)
(s1509 1)
(s1510 1)
(s1511 1)
(s1512 1)
(s1513 1)
(s1514 1)
(s1515 1)
(s1516 1)
(s1517 1)
(s1518 1)
(s1519 1)
(s1520 1)
(s1521 1)
(s1522 1)
(s1523 1)
(s1524 1)
(s1525 1)
(s1526 1)
(s1527 1)
(s1528 1)
(s1529 1)
(s1530 1)
(s1531 1)
(s1532 1)
(s1533 1)
(s1534 1)
(s1535 1)
(s1536 1)
(s1537 1)
(s1538 1)
(s1539 1)
(s1540 1)
(s1541 1)
(s1542 1)
(s1543 1)
(s1544 1)
(s1545 1)
(s1546 1)
(s1547 1)
(s1548 1)
(s1549 1)
(s1550 1)
(s1551 1)
(s1552 1)
(s1553 1)
(s1554 1)
(s1555 1)
(s1556 1)
(s1557 1)
(s1558 1)
(s1559 1)
(s1560 1)
(s1561 1)
(s1562 1)
(s1563 1)
(s1564 1)
(s1565 1)
(s1566 1)
(s1567 1)
(s1568 1)
(s1569 1)
(s1570 1)
(s1571 1)
(s1572 1)
(s1573 1)
(s1574 1)
(s1575 1)
(s1576 1)
(s1577 1)
(s1578 1)
(s1579 1)
(s1580 1)
(s1581 1)
(s1582 1)
(s1583 1)
(s1584 1)
(s1585 1)
(s1586 1)
(s1587 1)
(s1588 1)
(s1589 1)
(s1590 1)
(s1591 1)
(s1592 1)
(s1593 1)
(s1594 1)
(s1595 1)
(s1596 1)
(s1597 1)
(s1598 1)
(s1599 1)
(s1600 1)
(s1601 1)
(s1602 1)
(s1603 1)
(s1604 1)
(s1605 1)
(s1606 1)
(s1607 1)
(s1608 1)
(s1609 1)
(s1610 1)
(s1611 1)
(s1612 1)
(s1613 1)
(s1614 1)
(s1615 1)
(s1616 1)
(s1617 1)
(s1618 1)
(s1619 1)
(s1620 1)
(s1621 1)
(s1622 1)
(s1623 1)
(s1624 1)
(s1625 1)
(s1626 1)
(s1627 1)
(s1628 1)
(s1629 1)
(s1630 1)
(s1631 1)
(s1632 1)
(s1633 1)
(s1634 1)
(s1635 1)
(s1636 1)
(s1637 1)
(s1638 1)
(s1639 1)
(s1640 1)
(s1641 1)
(s1642 1)
(s1643 1)
(s1644 1)
(s1645 1)
(s1646 1)
(s1647 1)
(s1648 1)
(s1649 1)
(s1650 1)
(s1651 1)
(s1652 1)
(s1653 1)
(s1654 1)
(s1655 1)
(s1656 1)
(s1657 1)
(s1658 1)
(s1659 1)
(s1660 1)
(s1661 1)
(s1662 1)
(s1663 1)
(s1664 1)
(s1665 1)
(s1666 1)
(s1667 1)
(s1668 1)
(s1669 1)
(s1670 1)
(s1671 1)
(s1672 1)
(s1673 1)
(s1674 1)
(s1675 1)
(s1676 1)
(s1677 1)
(s1678 1)
(s1679 1)
(s1680 1)
(s1681 1)
(s1682 1)
(s1683 1)
(s1684 1)
(s1685 1)
(s1686 1)
(s1687 1)
(s1688 1)
(s1689 1)
(s1690 1)
(s1691 1)
(s1692 1)
(s1693 1)
(s1694 1)
(s1695 1)
(s1696 1)
(s1697 1)
(s1698 1)
(s1699 1)
(s1700 1)
(s1701 1)
(s1702 1)
(s1703 1)
(s1704 1)
(s1705 1)
(s1706 1)
(s1707 1)
(s1708 1)
(s1709 1)
(s1710 1)
(s1711 1)
(s1712 1)
(s1713 1)
(s1714 1)
(s1715 1)
(s1716 1)
(s1717 1)
(s1718 1)
(s1719 1)
(s1720 1)
(s1721 1)
(s1722 1)
(s1723 1)
(s1724 1)
(s1725 1)
(s1726 1)
(s1727 1)
(s1728 1)
(s1729 1)
(s1730 1)
(s1731 1)
(s1732 1)
(s1733 1)
(s1734 1)
(s1735 1)
(s1736 1)
(s1737 1)
(s1738 1)
(s1739 1)
(s1740 1)
(s1741 1)
(s1742 1)
(s1743 1)
(s1744 1)
(s1745 1)
(s1746 1)
(s1747 1)
(s1748 1)
(s1749 1)
(s1750 1)
(s1751 1)
(s1752 1)
(s1753 1)
(s1754 1)
(s1755 1)
(s1756 1)
(s1757 1)
(s1758 1)
(s1759 1)
(s1760 1)
(s1761 1)
(s1762 1)
(s1763 1)
(s1764 1)
(s1765 1)
(s1766 1)
(s1767 1)
(s1768 1)
(s1769 1)
(s1770 1)
(s1771 1)
(s1772 1)
(s1773 1)
(s1774 1)
(s1775 1)
(s1776 1)
(s1777 1)
(s1778 1)
(s1779 1)
(s1780 1)
(s1781 1)
(s1782 1)
(s1783 1)
(s1784 1)
(s1785 1)
(s1786 1)
(s1787 1)
(s1788 1)
(s1789 1)
(s1790 1)
(s1791 1)
(s1792 1)
(s1793 1)
(s1794 1)
(s1795 1)
(s1796 1)
(s1797 1)
(s1798 1)
(s1799 1)
(s1800 1)
(s1801 1)
(s1802 1)
(s1803 1)
(s1804 1)
(s1805 1)
(s1806 1)
(s1807 1)
(s1808 1)
(s1809 1)
(s1810 1)
(s1811 1)
(s1812 1)
(s1813 1)
(s1814 1)
(s1815 1)
(s1816 1)
(s1817 1)
(s1818 1)
(s1819 1)
(s1820 1)
(s1821 1)
(s1822 1)
(s1823 1)
(s1824 1)
(s1825 1)
(s1826 1)
(s1827 1)
(s1828 1)
(s1829 1)
(s1830 1)
(s1831 1)
(s1832 1)
(s1833 1)
(s1834 1)
(s1835 1)
(s1836 1)
(s1837 1)
(s1838 1)
(s1839 1)
(s1840 1)
(s1841 1)
(s1842 1)
(s1843 1)
(s1844 1)
(s1845 1)
(s1846 1)
(s1847 1)
(s1848 1)
(s1849 1)
(s1850 1)
(s1851 1)
(s1852 1)
(s1853 1)
(s1854 1)
(s1855 1)
(s1856 1)
(s1857 1)
(s1858 1)
(s1859 1)
(s1860 1)
(s1861 1)
(s1862 1)
(s1863 1)
(s1864 1)
(s1865 1)
(s1866 1)
(s1867 1)
(s1868 1)
(s1869 1)
(s1870 1)
(s1871 1)
(s1872 1)
(s1873 1)
(s1874 1)
(s1875 1)
(s1876 1)
(s1877 1)
(s1878 1)
(s1879 1)
(s1880 1)
(s1881 1)
(s1882 1)
(s1883 1)
(s1884 1)
(s1885 1)
(s1886 1)
(s1887 1)
(s1888 1)
(s1889 1)
(s1890 1)
(s1891 1)
(s1892 1)
(s1893 1)
(s1894 1)
(s1895 1)
(s1896 1)
(s1897 1)
(s1898 1)
(s1899 1)
(s1900 1)
(s1901 1)
(s1902 1)
(s1903 1)
(s1904 1)
(s1905 1)
(s1906 1)
(s1907 1)
(s1908 1)
(s1909 1)
(s1910 1)
(s1911 1)
(s1912 1)
(s1913 1)
(s1914 1)
(s1915 1)
(s1916 1)
(s1917 1)
(s1918 1)
(s1919 1)
(s1920 1)
(s1921 1)
(s1922 1)
(s1923 1)
(s1924 1)
(s1925 1)
(s1926 1)
(s1927 1)
(s1928 1)
(s1929 1)
(s1930 1)
(s1931 1)
(s1932 1)
(s1933 1)
(s1934 1)
(s1935 1)
(s1936 1)
(s1937 1)
(s1938 1)
(s1939 1)
(s1940 1)
(s1941 1)
(s1942 1)
(s1943 1)
(s1944 1)
(s1945 1)
(s1946 1)
(s1947 1)
(s1948 1)
(s1949 1)
(s1950 1)
(s1951 1)
(s1952 1)
(s1953 1)
(s1954 1)
(s1955 1)
(s1956 1)
(s1957 1)
(s1958 1)
(s1959 1)
(s1960 1)
(s1961 1)
(s1962 1)
(s1963 1)
(s1964 1)
(s1965 1)
(s1966 1)
(s1967 1)
(s1968 1)
(s1969 1)
(s1970 1)
(s1971 1)
(s1972 1)
(s1973 1)
(s1974 1)
(s1975 1)
(s1976 1)
(s1977 1)
(s1978 1)
(s1979 1)
(s1980 1)
(s1981 1)
(s1982 1)
(s1983 1)
(s1984 1)
(s1985 1)
(s1986 1)
(s1987 1)
(s1988 1)
(s1989 1)
(s1990 1)
(s1991 1)
(s1992 1)
(s1993 1)
(s1994 1)
(s1995 1)
(s1996 1)
(s1997 1)
(s1998 1)
(s1999 1)
(s2000 1)
(s2001 1)
(s2002 1)
(s2003 1)
(s2004 1)
(s2005 1)
(s2006 1)
(s2007 1)
(s2008 1)
(s2009 1)
(s2010 1)
(s2011 1)
(s2012 1)
(s2013 1)
(s2014 1)
(s2015 1)
(s2016 1)
(s2017 1)
(s2018 1)
(s2019 1)
(s2020 1)
(s2021 1)
(s2022 1)
(s2023 1)
(s2024 1)
(s2025 1)
(s2026 1)
(s2027 1)
(s2028 1)
(s2029 1)
(s2030 1)
(s2031 1)
(s2032 1)
(s2033 1)
(s2034 1)
(s2035 1)
(s2036 1)
(s2037 1)
(s2038 1)
(s2039 1)
(s2040 1)
(s2041 1)
(s2042 1)
(s2043 1)
(s2044 1)
(s2045 1)
(s2046 1)
(s2047 1)
(s2048 1)
(s2049 1)
(s2050 1)
(s2051 1)
(s2052 1)
(s2053 1)
(s2054 1)
(s2055 1)
(s2056 1)
(s2057 1)
(s2058 1)
(s2059 1)
(s2060 1)
(s2061 1)
(s2062 1)
(s2063 1)
(s2064 1)
(s2065 1)
(s2066 1)
(s2067 1)
(s2068 1)
(s2069 1)
(s2070 1)
(s2071 1)
(s2072 1)
(s2073 1)
(s2074 1)
(s2075 1)
(s2076 1)
(s2077 1)
(s2078 1)
(s2079 1)
(s2080 1)
(s2081 1)
(s2082 1)
(s2083 1)
(s2084 1)
(s2085 1)
(s2086 1)
(s2087 1)
(s2088 1)
(s2089 1)
(s2090 1)
(s2091 1)
(s2092 1)
(s2093 1)
(s2094 1)
(s2095 1)
(s2096 1)
(s2097 1)
(s2098 1)
(s2099 1)
(s2100 1)
(s2101 1)
(s2102 1)
(s2103 1)
(s2104 1)
(s2105 1)
(s2106 1)
(s2107 1)
(s2108 1)
(s2109 1)
(s2110 1)
(s2111 1)
(s2112 1)
(s2113 1)
(s2114 1)
(s2115 1)
(s2116 1)
(s2117 1)
(s2118 1)
(s2119 1)
(s2120 1)
(s2121 1)
(s2122 1)
(s2123 1)
(s2124 1)
(s2125 1)
(s2126 1)
(s2127 1)
(s2128 1)
(s2129 1)
(s2130 1)
(s2131 1)
(s2132 1)
(s2133 1)
(s2134 1)
(s2135 1)
(s2136 1)
(s2137 1)
(s2138 1)
(s2139 1)
(s2140 1)
(s2141 1)
(s2142 1)
(s2143 1)
(s2144 1)
(s2145 1)
(s2146 1)
(s2147 1)
(s2148 1)
(s2149 1)
(s2150 1)
(s2151 1)
(s2152 1)
(s2153 1)
(s2154 1)
(s2155 1)
(s2156 1)
(s2157 1)
(s2158 1)
(s2159 1)
(s2160 1)
(s2161 1)
(s2162 1)
(s2163 1)
(s2164 1)
(s2165 1)
(s2166 1)
(s2167 1)
(s2168 1)
(s2169 1)
(s2170 1)
(s2171 1)
(s2172 1)
(s2173 1)
(s2174 1)
(s2175 1)
(s2176 1)
(s2177 1)
(s2178 1)
(s2179 1)
(s2180 1)
(s2181 1)
(s2182 1)
(s2183 1)
(s2184 1)
(s2185 1)
(s2186 1)
(s2187 1)
(s2188 1)
(s2189 1)
(s2190 1)
(s2191 1)
(s2192 1)
(s2193 1)
(s2194 1)
(s2195 1)
(s2196 1)
(s2197 1)
(s2198 1)
(s2199 1)
(s2200 1)
(s2201 1)
(s2202 1)
(s2203 1)
(s2204 1)
(s2205 1)
(s2206 1)
(s2207 1)
(s2208 1)
(s2209 1)
(s2210 1)
(s2211 1)
(s2212 1)
(s2213 1)
(s2214 1)
(s2215 1)
(s2216 1)
(s2217 1)
(s2218 1)
(s2219 1)
(s2220 1)
(s2221 1)
(s2222 1)
(s2223 1)
(s2224 1)
(s2225 1)
(s2226 1)
(s2227 1)
(s2228 1)
(s2229 1)
(s2230 1)
(s2231 1)
(s2232 1)
(s2233 1)
(s2234 1)
(s2235 1)
(s2236 1)
(s2237 1)
(s2238 1)
(s2239 1)
(s2240 1)
(s2241 1)
(s2242 1)
(s2243 1)
(s2244 1)
(s2245 1)
(s2246 1)
(s2247 1)
(s2248 1)
(s2249 1)
(s2250 1)
(s2251 1)
(s2252 1)
(s2253 1)
(s2254 1)
(s2255 1)
(s2256 1)
(s2257 1)
(s2258 1)
(s2259 1)
(s2260 1)
(s2261 1)
(s2262 1)
(s2263 1)
(s2264 1)
(s2265 1)
(s2266 1)
(s2267 1)
(s2268 1)
(s2269 1)
(s2270 1)
(s2271 1)
(s2272 1)
(s2273 1)
(s2274 1)
(s2275 1)
(s2276 1)
(s2277 1)
(s2278 1)
(s2279 1)
(s2280 1)
(s2281 1)
(s2282 1)
(s2283 1)
(s2284 1)
(s2285 1)
(s2286 1)
(s2287 1)
(s2288 1)
(s2289 1)
(s2290 1)
(s2291 1)
(s2292 1)
(s2293 1)
(s2294 1)
(s2295 1)
(s2296 1)
(s2297 1)
(s2298 1)
(s2299 1)
(s2300 1)
(s2301 1)
(s2302 1)
(s2303 1)
(s2304 1)
(s2305 1)
(s2306 1)
(s2307 1)
(s2308 1)
(s2309 1)
(s2310 1)
(s2311 1)
(s2312 1)
(s2313 1)
(s2314 1)
(s2315 1)
(s2316 1)
(s2317 1)
(s2318 1)
(s2319 1)
(s2320 1)
(s2321 1)
(s2322 1)
(s2323 1)
(s2324 1)
(s2325 1)
(s2326 1)
(s2327 1)
(s2328 1)
(s2329 1)
(s2330 1)
(s2331 1)
(s2332 1)
(s2333 1)
(s2334 1)
timeout
(s2335 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30052 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 0/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61183ms problems are : Problem set: 0 solved, 3260 unsolved
Search for dead transitions found 0 dead transitions in 61187ms
Starting structural reductions in LTL mode, iteration 1 : 2580/2640 places, 3980/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62961 ms. Remains : 2580/2640 places, 3980/4040 transitions.
Stuttering acceptance computed with spot in 449 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-020-LTLFireability-06
Product exploration explored 100000 steps with 2222 reset in 1616 ms.
Product exploration explored 100000 steps with 2297 reset in 1591 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 p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 12 states, 17 edges and 2 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 401 steps (0 resets) in 12 ms. (30 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X p0)]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 2 factoid took 189 ms. Reduced automaton from 10 states, 13 edges and 2 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 375 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 350 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 07:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Support contains 1380 out of 2580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Applied a total of 0 rules in 56 ms. Remains 2580 /2580 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
[2025-05-31 07:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:50] [INFO ] Implicit Places using invariants in 305 ms returned []
[2025-05-31 07:14:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:14:51] [INFO ] Implicit Places using invariants and state equation in 1383 ms returned []
Implicit Place search using SMT with State Equation took 1692 ms to find 0 implicit places.
Running 3260 sub problems to find dead transitions.
[2025-05-31 07:14:51] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 3260/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 0/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61207ms problems are : Problem set: 0 solved, 3260 unsolved
Search for dead transitions found 0 dead transitions in 61212ms
Finished structural reductions in LTL mode , in 1 iterations and 62971 ms. Remains : 2580/2580 places, 3980/3980 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 163 ms. Reduced automaton from 10 states, 13 edges and 2 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 403 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 393 steps (0 resets) in 10 ms. (35 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(X (X (NOT p0))), (X (X p0)), (F p0), (F p1), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 194 ms. Reduced automaton from 10 states, 13 edges and 2 AP (stutter sensitive) to 10 states, 13 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 424 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 423 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
[2025-05-31 07:15:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Could not prove EG (AND (NOT p0) (NOT p1))
Stuttering acceptance computed with spot in 439 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 1137 reset in 1711 ms.
Product exploration explored 100000 steps with 1136 reset in 1676 ms.
Applying partial POR strategy [false, true, false, false, false, false, true, false, false, false]
Stuttering acceptance computed with spot in 418 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 1380 out of 2580 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Performed 540 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 2580 transition count 3980
Discarding 60 places :
Symmetric choice reduction at 1 with 60 rule applications. Total rules 600 place count 2520 transition count 3920
Deduced a syphon composed of 480 places in 1 ms
Iterating global reduction 1 with 60 rules applied. Total rules applied 660 place count 2520 transition count 3920
Performed 80 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 560 places in 0 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 740 place count 2520 transition count 3920
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 820 place count 2440 transition count 3840
Deduced a syphon composed of 480 places in 0 ms
Iterating global reduction 1 with 80 rules applied. Total rules applied 900 place count 2440 transition count 3840
Deduced a syphon composed of 480 places in 0 ms
Applied a total of 900 rules in 278 ms. Remains 2440 /2580 variables (removed 140) and now considering 3840/3980 (removed 140) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:16:16] [INFO ] Redundant transitions in 117 ms returned []
Running 3120 sub problems to find dead transitions.
// Phase 1: matrix 3840 rows 2440 cols
[2025-05-31 07:16:16] [INFO ] Computed 20 invariants in 19 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2420/6280 variables, and 0 constraints, problems are : Problem set: 0 solved, 3120 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2440 constraints, PredecessorRefiner: 3120/3120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3120 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2420/6280 variables, and 0 constraints, problems are : Problem set: 0 solved, 3120 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2440 constraints, PredecessorRefiner: 0/3120 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61128ms problems are : Problem set: 0 solved, 3120 unsolved
Search for dead transitions found 0 dead transitions in 61132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 2440/2580 places, 3840/3980 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 61544 ms. Remains : 2440/2580 places, 3840/3980 transitions.
Built C files in :
/tmp/ltsmin10973075711024579194
[2025-05-31 07:17:18] [INFO ] Built C files in 70ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10973075711024579194
Running compilation step : cd /tmp/ltsmin10973075711024579194;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10973075711024579194;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin10973075711024579194;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 1380 out of 2580 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2580/2580 places, 3980/3980 transitions.
Applied a total of 0 rules in 156 ms. Remains 2580 /2580 variables (removed 0) and now considering 3980/3980 (removed 0) transitions.
// Phase 1: matrix 3980 rows 2580 cols
[2025-05-31 07:17:21] [INFO ] Computed 20 invariants in 97 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:17:21] [INFO ] Implicit Places using invariants in 425 ms returned []
[2025-05-31 07:17:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:17:23] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1757 ms to find 0 implicit places.
Running 3260 sub problems to find dead transitions.
[2025-05-31 07:17:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30053 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 3260/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3260 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2560/6560 variables, and 0 constraints, problems are : Problem set: 0 solved, 3260 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/2580 constraints, PredecessorRefiner: 0/3260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61635ms problems are : Problem set: 0 solved, 3260 unsolved
Search for dead transitions found 0 dead transitions in 61646ms
Finished structural reductions in LTL mode , in 1 iterations and 63577 ms. Remains : 2580/2580 places, 3980/3980 transitions.
Built C files in :
/tmp/ltsmin9107072808584440837
[2025-05-31 07:18:24] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9107072808584440837
Running compilation step : cd /tmp/ltsmin9107072808584440837;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9107072808584440837;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9107072808584440837;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:18:28] [INFO ] Flatten gal took : 190 ms
[2025-05-31 07:18:28] [INFO ] Flatten gal took : 138 ms
[2025-05-31 07:18:28] [INFO ] Time to serialize gal into /tmp/LTL5856225782527765682.gal : 24 ms
[2025-05-31 07:18:28] [INFO ] Time to serialize properties into /tmp/LTL7335049229612625646.prop : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5856225782527765682.gal' '-t' 'CGAL' '-hoa' '/tmp/aut278583392957850347.hoa' '-atoms' '/tmp/LTL7335049229612625646.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/LTL7335049229612625646.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut278583392957850347.hoa
Detected timeout of ITS tools.
[2025-05-31 07:18:43] [INFO ] Flatten gal took : 77 ms
[2025-05-31 07:18:43] [INFO ] Flatten gal took : 95 ms
[2025-05-31 07:18:43] [INFO ] Time to serialize gal into /tmp/LTL16989557704248404461.gal : 10 ms
[2025-05-31 07:18:44] [INFO ] Time to serialize properties into /tmp/LTL8302845498420733949.ltl : 5 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/LTL16989557704248404461.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8302845498420733949.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_...72303
Formula 0 simplified : G(FG!"((((((((((((TrainState_6_1_7==1)||(TrainState_9_1_27==1))||((TrainState_2_1_9==1)||(TrainState_2_1_17==1)))||(((TrainState_13_...72285
Detected timeout of ITS tools.
[2025-05-31 07:18:59] [INFO ] Flatten gal took : 66 ms
[2025-05-31 07:18:59] [INFO ] Applying decomposition
[2025-05-31 07:18:59] [INFO ] Flatten gal took : 68 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/graph15317390623872857290.txt' '-o' '/tmp/graph15317390623872857290.bin' '-w' '/tmp/graph15317390623872857290.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph15317390623872857290.bin' '-l' '-1' '-v' '-w' '/tmp/graph15317390623872857290.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:18:59] [INFO ] Decomposing Gal with order
[2025-05-31 07:18:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:19:00] [INFO ] Removed a total of 328 redundant transitions.
[2025-05-31 07:19:00] [INFO ] Flatten gal took : 194 ms
[2025-05-31 07:19:01] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 29 ms.
[2025-05-31 07:19:01] [INFO ] Time to serialize gal into /tmp/LTL17447106091627085805.gal : 33 ms
[2025-05-31 07:19:01] [INFO ] Time to serialize properties into /tmp/LTL3909047297687975687.ltl : 6 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/LTL17447106091627085805.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3909047297687975687.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((((((((((((i14.i1.u52.TrainState_6_1_7==1)||(i4.i0.u55.TrainState_9_1_27==1))||((i13.i1.u51.TrainState_2_1_9==1)||(i13.i1....102588
Formula 0 simplified : G(FG!"((((((((((((i14.i1.u52.TrainState_6_1_7==1)||(i4.i0.u55.TrainState_9_1_27==1))||((i13.i1.u51.TrainState_2_1_9==1)||(i13.i1.u51...102570
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Detected timeout of ITS tools.
Treatment of property BART-PT-020-LTLFireability-06 finished in 351557 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(p0)||G(!p1))))))'
Support contains 40 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 841 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2025-05-31 07:19:17] [INFO ] Computed 20 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:17] [INFO ] Implicit Places using invariants in 384 ms returned []
[2025-05-31 07:19:17] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:19:18] [INFO ] Implicit Places using invariants and state equation in 734 ms returned []
Implicit Place search using SMT with State Equation took 1123 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:19:18] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60485ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60488ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62475 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-07
Product exploration explored 100000 steps with 25000 reset in 2236 ms.
Product exploration explored 100000 steps with 25000 reset in 2087 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 58 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 184 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 621 steps (0 resets) in 33 ms. (18 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 189 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 174 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 40 out of 980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 980/980 places, 2380/2380 transitions.
Applied a total of 0 rules in 29 ms. Remains 980 /980 variables (removed 0) and now considering 2380/2380 (removed 0) transitions.
[2025-05-31 07:20:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:24] [INFO ] Implicit Places using invariants in 119 ms returned []
[2025-05-31 07:20:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:20:25] [INFO ] Implicit Places using invariants and state equation in 544 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:20:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60424ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60427ms
Finished structural reductions in LTL mode , in 1 iterations and 61137 ms. Remains : 980/980 places, 2380/2380 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 72 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 180 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
RANDOM walk for 426 steps (0 resets) in 19 ms. (21 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND p0 p1)]
False Knowledge obtained : [(F (NOT p1)), (F (NOT p0)), (F (NOT (OR p0 p1))), (F (NOT (OR p0 (NOT p1))))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 192 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Stuttering acceptance computed with spot in 196 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Product exploration explored 100000 steps with 25000 reset in 2075 ms.
Product exploration explored 100000 steps with 25000 reset in 2084 ms.
Applying partial POR strategy [true, true, false, false, false]
Stuttering acceptance computed with spot in 206 ms :[(NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1)]
Support contains 40 out of 980 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 980/980 places, 2380/2380 transitions.
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 20 place count 980 transition count 2380
Performed 20 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 20 Pre rules applied. Total rules applied 20 place count 980 transition count 2380
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 40 place count 980 transition count 2380
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 60 place count 960 transition count 2360
Deduced a syphon composed of 20 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 80 place count 960 transition count 2360
Performed 200 Post agglomeration using F-continuation condition.Transition count delta: -20
Deduced a syphon composed of 220 places in 0 ms
Iterating global reduction 1 with 200 rules applied. Total rules applied 280 place count 960 transition count 2380
Ensure Unique test removed 60 transitions
Reduce isomorphic transitions removed 60 transitions.
Iterating post reduction 1 with 60 rules applied. Total rules applied 340 place count 960 transition count 2320
Discarding 160 places :
Symmetric choice reduction at 2 with 160 rule applications. Total rules 500 place count 800 transition count 2160
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 2 with 160 rules applied. Total rules applied 660 place count 800 transition count 2160
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 2 with 20 rules applied. Total rules applied 680 place count 800 transition count 2160
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 2 with 40 rules applied. Total rules applied 720 place count 800 transition count 2120
Discarding 20 places :
Symmetric choice reduction at 3 with 20 rule applications. Total rules 740 place count 780 transition count 2100
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 760 place count 780 transition count 2100
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 3 with 20 rules applied. Total rules applied 780 place count 780 transition count 2100
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 3 with 40 rules applied. Total rules applied 820 place count 780 transition count 2060
Discarding 20 places :
Symmetric choice reduction at 4 with 20 rule applications. Total rules 840 place count 760 transition count 2040
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 4 with 20 rules applied. Total rules applied 860 place count 760 transition count 2040
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 4 with 20 rules applied. Total rules applied 880 place count 760 transition count 2040
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 920 place count 760 transition count 2000
Discarding 20 places :
Symmetric choice reduction at 5 with 20 rule applications. Total rules 940 place count 740 transition count 1980
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 5 with 20 rules applied. Total rules applied 960 place count 740 transition count 1980
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 5 with 20 rules applied. Total rules applied 980 place count 740 transition count 1980
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 1020 place count 740 transition count 1940
Discarding 20 places :
Symmetric choice reduction at 6 with 20 rule applications. Total rules 1040 place count 720 transition count 1920
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 6 with 20 rules applied. Total rules applied 1060 place count 720 transition count 1920
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 6 with 20 rules applied. Total rules applied 1080 place count 720 transition count 1920
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 6 with 40 rules applied. Total rules applied 1120 place count 720 transition count 1880
Discarding 20 places :
Symmetric choice reduction at 7 with 20 rule applications. Total rules 1140 place count 700 transition count 1860
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 7 with 20 rules applied. Total rules applied 1160 place count 700 transition count 1860
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 7 with 20 rules applied. Total rules applied 1180 place count 700 transition count 1860
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 7 with 40 rules applied. Total rules applied 1220 place count 700 transition count 1820
Discarding 20 places :
Symmetric choice reduction at 8 with 20 rule applications. Total rules 1240 place count 680 transition count 1800
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1260 place count 680 transition count 1800
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 8 with 20 rules applied. Total rules applied 1280 place count 680 transition count 1800
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 8 with 40 rules applied. Total rules applied 1320 place count 680 transition count 1760
Discarding 20 places :
Symmetric choice reduction at 9 with 20 rule applications. Total rules 1340 place count 660 transition count 1740
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 9 with 20 rules applied. Total rules applied 1360 place count 660 transition count 1740
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 9 with 20 rules applied. Total rules applied 1380 place count 660 transition count 1740
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 9 with 40 rules applied. Total rules applied 1420 place count 660 transition count 1700
Discarding 20 places :
Symmetric choice reduction at 10 with 20 rule applications. Total rules 1440 place count 640 transition count 1680
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 10 with 20 rules applied. Total rules applied 1460 place count 640 transition count 1680
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 10 with 20 rules applied. Total rules applied 1480 place count 640 transition count 1680
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 10 with 40 rules applied. Total rules applied 1520 place count 640 transition count 1640
Discarding 20 places :
Symmetric choice reduction at 11 with 20 rule applications. Total rules 1540 place count 620 transition count 1620
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 11 with 20 rules applied. Total rules applied 1560 place count 620 transition count 1620
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 11 with 20 rules applied. Total rules applied 1580 place count 620 transition count 1620
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 11 with 40 rules applied. Total rules applied 1620 place count 620 transition count 1580
Discarding 20 places :
Symmetric choice reduction at 12 with 20 rule applications. Total rules 1640 place count 600 transition count 1560
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 12 with 20 rules applied. Total rules applied 1660 place count 600 transition count 1560
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 12 with 20 rules applied. Total rules applied 1680 place count 600 transition count 1560
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 12 with 40 rules applied. Total rules applied 1720 place count 600 transition count 1520
Discarding 20 places :
Symmetric choice reduction at 13 with 20 rule applications. Total rules 1740 place count 580 transition count 1500
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 13 with 20 rules applied. Total rules applied 1760 place count 580 transition count 1500
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 13 with 20 rules applied. Total rules applied 1780 place count 580 transition count 1500
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 13 with 40 rules applied. Total rules applied 1820 place count 580 transition count 1460
Discarding 20 places :
Symmetric choice reduction at 14 with 20 rule applications. Total rules 1840 place count 560 transition count 1440
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 14 with 20 rules applied. Total rules applied 1860 place count 560 transition count 1440
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 14 with 20 rules applied. Total rules applied 1880 place count 560 transition count 1440
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 14 with 40 rules applied. Total rules applied 1920 place count 560 transition count 1400
Discarding 20 places :
Symmetric choice reduction at 15 with 20 rule applications. Total rules 1940 place count 540 transition count 1380
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 15 with 20 rules applied. Total rules applied 1960 place count 540 transition count 1380
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 15 with 20 rules applied. Total rules applied 1980 place count 540 transition count 1380
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 15 with 40 rules applied. Total rules applied 2020 place count 540 transition count 1340
Discarding 20 places :
Symmetric choice reduction at 16 with 20 rule applications. Total rules 2040 place count 520 transition count 1320
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 16 with 20 rules applied. Total rules applied 2060 place count 520 transition count 1320
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 16 with 20 rules applied. Total rules applied 2080 place count 520 transition count 1320
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 16 with 40 rules applied. Total rules applied 2120 place count 520 transition count 1280
Discarding 20 places :
Symmetric choice reduction at 17 with 20 rule applications. Total rules 2140 place count 500 transition count 1260
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 17 with 20 rules applied. Total rules applied 2160 place count 500 transition count 1260
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 17 with 20 rules applied. Total rules applied 2180 place count 500 transition count 1260
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 17 with 40 rules applied. Total rules applied 2220 place count 500 transition count 1220
Discarding 20 places :
Symmetric choice reduction at 18 with 20 rule applications. Total rules 2240 place count 480 transition count 1200
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 18 with 20 rules applied. Total rules applied 2260 place count 480 transition count 1200
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 18 with 20 rules applied. Total rules applied 2280 place count 480 transition count 1200
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 18 with 40 rules applied. Total rules applied 2320 place count 480 transition count 1160
Discarding 20 places :
Symmetric choice reduction at 19 with 20 rule applications. Total rules 2340 place count 460 transition count 1140
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 19 with 20 rules applied. Total rules applied 2360 place count 460 transition count 1140
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 19 with 20 rules applied. Total rules applied 2380 place count 460 transition count 1140
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 19 with 40 rules applied. Total rules applied 2420 place count 460 transition count 1100
Discarding 20 places :
Symmetric choice reduction at 20 with 20 rule applications. Total rules 2440 place count 440 transition count 1080
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 20 with 20 rules applied. Total rules applied 2460 place count 440 transition count 1080
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 20 with 20 rules applied. Total rules applied 2480 place count 440 transition count 1080
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 20 with 40 rules applied. Total rules applied 2520 place count 440 transition count 1040
Discarding 20 places :
Symmetric choice reduction at 21 with 20 rule applications. Total rules 2540 place count 420 transition count 1020
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 21 with 20 rules applied. Total rules applied 2560 place count 420 transition count 1020
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 21 with 20 rules applied. Total rules applied 2580 place count 420 transition count 1020
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 21 with 40 rules applied. Total rules applied 2620 place count 420 transition count 980
Discarding 20 places :
Symmetric choice reduction at 22 with 20 rule applications. Total rules 2640 place count 400 transition count 960
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 22 with 20 rules applied. Total rules applied 2660 place count 400 transition count 960
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 22 with 20 rules applied. Total rules applied 2680 place count 400 transition count 960
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 22 with 40 rules applied. Total rules applied 2720 place count 400 transition count 920
Discarding 20 places :
Symmetric choice reduction at 23 with 20 rule applications. Total rules 2740 place count 380 transition count 900
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 23 with 20 rules applied. Total rules applied 2760 place count 380 transition count 900
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 23 with 20 rules applied. Total rules applied 2780 place count 380 transition count 900
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 23 with 40 rules applied. Total rules applied 2820 place count 380 transition count 860
Discarding 20 places :
Symmetric choice reduction at 24 with 20 rule applications. Total rules 2840 place count 360 transition count 840
Deduced a syphon composed of 60 places in 1 ms
Iterating global reduction 24 with 20 rules applied. Total rules applied 2860 place count 360 transition count 840
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 24 with 20 rules applied. Total rules applied 2880 place count 360 transition count 840
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 24 with 40 rules applied. Total rules applied 2920 place count 360 transition count 800
Discarding 20 places :
Symmetric choice reduction at 25 with 20 rule applications. Total rules 2940 place count 340 transition count 780
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 25 with 20 rules applied. Total rules applied 2960 place count 340 transition count 780
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 25 with 20 rules applied. Total rules applied 2980 place count 340 transition count 780
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 25 with 40 rules applied. Total rules applied 3020 place count 340 transition count 740
Discarding 20 places :
Symmetric choice reduction at 26 with 20 rule applications. Total rules 3040 place count 320 transition count 720
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 26 with 20 rules applied. Total rules applied 3060 place count 320 transition count 720
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 26 with 20 rules applied. Total rules applied 3080 place count 320 transition count 720
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 26 with 40 rules applied. Total rules applied 3120 place count 320 transition count 680
Discarding 20 places :
Symmetric choice reduction at 27 with 20 rule applications. Total rules 3140 place count 300 transition count 660
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 27 with 20 rules applied. Total rules applied 3160 place count 300 transition count 660
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 1 ms
Iterating global reduction 27 with 20 rules applied. Total rules applied 3180 place count 300 transition count 660
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 27 with 40 rules applied. Total rules applied 3220 place count 300 transition count 620
Discarding 20 places :
Symmetric choice reduction at 28 with 20 rule applications. Total rules 3240 place count 280 transition count 600
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 28 with 20 rules applied. Total rules applied 3260 place count 280 transition count 600
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 28 with 20 rules applied. Total rules applied 3280 place count 280 transition count 600
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 28 with 40 rules applied. Total rules applied 3320 place count 280 transition count 560
Discarding 20 places :
Symmetric choice reduction at 29 with 20 rule applications. Total rules 3340 place count 260 transition count 540
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 29 with 20 rules applied. Total rules applied 3360 place count 260 transition count 540
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 29 with 20 rules applied. Total rules applied 3380 place count 260 transition count 540
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 29 with 40 rules applied. Total rules applied 3420 place count 260 transition count 500
Discarding 20 places :
Symmetric choice reduction at 30 with 20 rule applications. Total rules 3440 place count 240 transition count 480
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 30 with 20 rules applied. Total rules applied 3460 place count 240 transition count 480
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 30 with 20 rules applied. Total rules applied 3480 place count 240 transition count 480
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 30 with 40 rules applied. Total rules applied 3520 place count 240 transition count 440
Discarding 20 places :
Symmetric choice reduction at 31 with 20 rule applications. Total rules 3540 place count 220 transition count 420
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 31 with 20 rules applied. Total rules applied 3560 place count 220 transition count 420
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 31 with 20 rules applied. Total rules applied 3580 place count 220 transition count 420
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 31 with 40 rules applied. Total rules applied 3620 place count 220 transition count 380
Discarding 20 places :
Symmetric choice reduction at 32 with 20 rule applications. Total rules 3640 place count 200 transition count 360
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 32 with 20 rules applied. Total rules applied 3660 place count 200 transition count 360
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 32 with 20 rules applied. Total rules applied 3680 place count 200 transition count 360
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 32 with 40 rules applied. Total rules applied 3720 place count 200 transition count 320
Discarding 20 places :
Symmetric choice reduction at 33 with 20 rule applications. Total rules 3740 place count 180 transition count 300
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 33 with 20 rules applied. Total rules applied 3760 place count 180 transition count 300
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 33 with 20 rules applied. Total rules applied 3780 place count 180 transition count 300
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 33 with 40 rules applied. Total rules applied 3820 place count 180 transition count 260
Discarding 20 places :
Symmetric choice reduction at 34 with 20 rule applications. Total rules 3840 place count 160 transition count 240
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 34 with 20 rules applied. Total rules applied 3860 place count 160 transition count 240
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 34 with 20 rules applied. Total rules applied 3880 place count 160 transition count 240
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 34 with 40 rules applied. Total rules applied 3920 place count 160 transition count 200
Discarding 20 places :
Symmetric choice reduction at 35 with 20 rule applications. Total rules 3940 place count 140 transition count 180
Deduced a syphon composed of 60 places in 0 ms
Iterating global reduction 35 with 20 rules applied. Total rules applied 3960 place count 140 transition count 180
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 80 places in 0 ms
Iterating global reduction 35 with 20 rules applied. Total rules applied 3980 place count 140 transition count 180
Ensure Unique test removed 40 transitions
Reduce isomorphic transitions removed 40 transitions.
Iterating post reduction 35 with 40 rules applied. Total rules applied 4020 place count 140 transition count 140
Discarding 40 places :
Symmetric choice reduction at 36 with 40 rule applications. Total rules 4060 place count 100 transition count 100
Deduced a syphon composed of 40 places in 0 ms
Iterating global reduction 36 with 40 rules applied. Total rules applied 4100 place count 100 transition count 100
Deduced a syphon composed of 40 places in 0 ms
Applied a total of 4100 rules in 983 ms. Remains 100 /980 variables (removed 880) and now considering 100/2380 (removed 2280) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:21:32] [INFO ] Redundant transitions in 2 ms returned []
Running 80 sub problems to find dead transitions.
// Phase 1: matrix 100 rows 100 cols
[2025-05-31 07:21:32] [INFO ] Computed 20 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/80 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (OVERLAPS) 20/100 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 80 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 38 ms of which 12 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD22 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 1 ms to minimize.
Problem TDEAD23 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 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-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD26 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 21 ms of which 1 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 2 ms to minimize.
Problem TDEAD28 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD30 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 2 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 19 ms of which 1 ms to minimize.
Problem TDEAD32 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD34 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD35 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 2 ms to minimize.
Problem TDEAD36 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 2 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:21:32] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/40 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 0/140 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 6 (OVERLAPS) 0/200 variables, 0/140 constraints. Problems are: Problem set: 40 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Real declared 200/200 variables, and 140 constraints, problems are : Problem set: 40 solved, 40 unsolved in 1800 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 40 solved, 40 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 0/0 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 1 (OVERLAPS) 60/100 variables, 20/20 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 20/40 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/100 variables, 0/40 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 4 (OVERLAPS) 100/200 variables, 100/140 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/200 variables, 40/180 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/200 variables, 0/180 constraints. Problems are: Problem set: 40 solved, 40 unsolved
At refinement iteration 7 (OVERLAPS) 0/200 variables, 0/180 constraints. Problems are: Problem set: 40 solved, 40 unsolved
No progress, stopping.
After SMT solving in domain Int declared 200/200 variables, and 180 constraints, problems are : Problem set: 40 solved, 40 unsolved in 721 ms.
Refiners :[Positive P Invariants (semi-flows): 20/20 constraints, State Equation: 100/100 constraints, PredecessorRefiner: 40/80 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2526ms problems are : Problem set: 40 solved, 40 unsolved
Search for dead transitions found 40 dead transitions in 2526ms
Found 40 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 40 transitions
Dead transitions reduction (with SMT) removed 40 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 100/980 places, 60/2380 transitions.
Graph (complete) has 60 edges and 100 vertex of which 60 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.1 ms
Discarding 40 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 60 /100 variables (removed 40) and now considering 60/60 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 60/980 places, 60/2380 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 3522 ms. Remains : 60/980 places, 60/2380 transitions.
Built C files in :
/tmp/ltsmin17985706148976264207
[2025-05-31 07:21:34] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17985706148976264207
Running compilation step : cd /tmp/ltsmin17985706148976264207;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17985706148976264207;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17985706148976264207;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 40 out of 980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 980/980 places, 2380/2380 transitions.
Applied a total of 0 rules in 37 ms. Remains 980 /980 variables (removed 0) and now considering 2380/2380 (removed 0) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2025-05-31 07:21:37] [INFO ] Computed 20 invariants in 15 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:21:37] [INFO ] Implicit Places using invariants in 131 ms returned []
[2025-05-31 07:21:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:21:38] [INFO ] Implicit Places using invariants and state equation in 527 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:21:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60415ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60418ms
Finished structural reductions in LTL mode , in 1 iterations and 61119 ms. Remains : 980/980 places, 2380/2380 transitions.
Built C files in :
/tmp/ltsmin13891652100295192404
[2025-05-31 07:22:38] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13891652100295192404
Running compilation step : cd /tmp/ltsmin13891652100295192404;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13891652100295192404;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin13891652100295192404;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:22:41] [INFO ] Flatten gal took : 31 ms
[2025-05-31 07:22:41] [INFO ] Flatten gal took : 31 ms
[2025-05-31 07:22:41] [INFO ] Time to serialize gal into /tmp/LTL17888344420662917160.gal : 6 ms
[2025-05-31 07:22:41] [INFO ] Time to serialize properties into /tmp/LTL4995408808055479119.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/LTL17888344420662917160.gal' '-t' 'CGAL' '-hoa' '/tmp/aut289061797824086507.hoa' '-atoms' '/tmp/LTL4995408808055479119.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4995408808055479119.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut289061797824086507.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
0 strongly connected components in search stack
3 transitions explored
4 items max in DFS search stack
709 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,7.25382,172180,1,0,8,999480,23,0,24373,42639,16
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA BART-PT-020-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-020-LTLFireability-07 finished in 213138 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((p1||F((p2||G(p3)))))))'
Support contains 4 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 550 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
[2025-05-31 07:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:22:50] [INFO ] Implicit Places using invariants in 115 ms returned []
[2025-05-31 07:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:22:50] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 654 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:22:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60384ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60389ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61601 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2) (NOT p3))), (NOT p0), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BART-PT-020-LTLFireability-08
Product exploration explored 100000 steps with 8475 reset in 654 ms.
Product exploration explored 100000 steps with 8094 reset in 655 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 3 factoid took 379 ms. Reduced automaton from 4 states, 6 edges and 4 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 760 steps (0 resets) in 9 ms. (76 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p0 p1 (NOT p2) p3), (X (NOT p2)), (X (X (NOT p2)))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2)))), (X p1), (X (NOT p1)), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (NOT p0))), (X (X p0)), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT (OR p2 p3))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p3))), (F (NOT p3))]
Knowledge based reduction with 3 factoid took 502 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 104 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 3 out of 980 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 980/980 places, 2380/2380 transitions.
Applied a total of 0 rules in 32 ms. Remains 980 /980 variables (removed 0) and now considering 2380/2380 (removed 0) transitions.
[2025-05-31 07:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:54] [INFO ] Implicit Places using invariants in 116 ms returned []
[2025-05-31 07:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:23:54] [INFO ] Implicit Places using invariants and state equation in 510 ms returned []
Implicit Place search using SMT with State Equation took 626 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:23:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60383ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60386ms
Finished structural reductions in LTL mode , in 1 iterations and 61047 ms. Remains : 980/980 places, 2380/2380 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 p1 (NOT p2) p3), (X (X (NOT p2)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3)))))]
Knowledge based reduction with 2 factoid took 271 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
RANDOM walk for 652 steps (0 resets) in 15 ms. (40 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND p1 (NOT p2) p3), (X (X (NOT p2)))]
False Knowledge obtained : [(X (NOT p1)), (X p1), (X (X p3)), (X (X (NOT p3))), (X (X (AND (NOT p2) p3))), (X (X (NOT (AND (NOT p2) p3)))), (X (X (AND (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p2) (NOT p3))))), (F (NOT (OR p2 p3))), (F (NOT p1)), (F p2), (F (NOT (AND (NOT p2) p3))), (F (NOT p3))]
Knowledge based reduction with 2 factoid took 316 ms. Reduced automaton from 3 states, 4 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Product exploration explored 100000 steps with 8310 reset in 644 ms.
Product exploration explored 100000 steps with 7149 reset in 629 ms.
Applying partial POR strategy [false, false, true]
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p1) (NOT p2) (NOT p3)), (AND (NOT p2) (NOT p3))]
Support contains 3 out of 980 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 980/980 places, 2380/2380 transitions.
Graph (trivial) has 2305 edges and 980 vertex of which 882 / 980 are part of one of the 18 SCC in 1 ms
Free SCC test removed 864 places
Ensure Unique test removed 2124 transitions
Reduce isomorphic transitions removed 2124 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 20 rules applied. Total rules applied 21 place count 98 transition count 239
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 2 Pre rules applied. Total rules applied 21 place count 98 transition count 239
Deduced a syphon composed of 5 places in 1 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 23 place count 98 transition count 239
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 26 place count 95 transition count 236
Deduced a syphon composed of 2 places in 1 ms
Iterating global reduction 1 with 3 rules applied. Total rules applied 29 place count 95 transition count 236
Performed 20 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 22 places in 1 ms
Iterating global reduction 1 with 20 rules applied. Total rules applied 49 place count 95 transition count 238
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 55 place count 95 transition count 232
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 71 place count 79 transition count 216
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 87 place count 79 transition count 216
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 89 place count 79 transition count 216
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 93 place count 79 transition count 212
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 95 place count 77 transition count 210
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 97 place count 77 transition count 210
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 3 with 2 rules applied. Total rules applied 99 place count 77 transition count 210
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 103 place count 77 transition count 206
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 105 place count 75 transition count 204
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 107 place count 75 transition count 204
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 4 with 2 rules applied. Total rules applied 109 place count 75 transition count 204
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 4 with 4 rules applied. Total rules applied 113 place count 75 transition count 200
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 115 place count 73 transition count 198
Deduced a syphon composed of 6 places in 1 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 117 place count 73 transition count 198
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 5 with 2 rules applied. Total rules applied 119 place count 73 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 5 with 4 rules applied. Total rules applied 123 place count 73 transition count 194
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 125 place count 71 transition count 192
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 127 place count 71 transition count 192
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 6 with 2 rules applied. Total rules applied 129 place count 71 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 6 with 4 rules applied. Total rules applied 133 place count 71 transition count 188
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 135 place count 69 transition count 186
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 137 place count 69 transition count 186
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 7 with 2 rules applied. Total rules applied 139 place count 69 transition count 186
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 143 place count 69 transition count 182
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 145 place count 67 transition count 180
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 147 place count 67 transition count 180
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 8 with 2 rules applied. Total rules applied 149 place count 67 transition count 180
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 8 with 4 rules applied. Total rules applied 153 place count 67 transition count 176
Discarding 2 places :
Symmetric choice reduction at 9 with 2 rule applications. Total rules 155 place count 65 transition count 174
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 157 place count 65 transition count 174
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 9 with 2 rules applied. Total rules applied 159 place count 65 transition count 174
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 9 with 4 rules applied. Total rules applied 163 place count 65 transition count 170
Discarding 2 places :
Symmetric choice reduction at 10 with 2 rule applications. Total rules 165 place count 63 transition count 168
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 167 place count 63 transition count 168
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 10 with 2 rules applied. Total rules applied 169 place count 63 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 10 with 4 rules applied. Total rules applied 173 place count 63 transition count 164
Discarding 2 places :
Symmetric choice reduction at 11 with 2 rule applications. Total rules 175 place count 61 transition count 162
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 177 place count 61 transition count 162
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 11 with 2 rules applied. Total rules applied 179 place count 61 transition count 162
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 11 with 4 rules applied. Total rules applied 183 place count 61 transition count 158
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 185 place count 59 transition count 156
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 187 place count 59 transition count 156
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 12 with 2 rules applied. Total rules applied 189 place count 59 transition count 156
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 193 place count 59 transition count 152
Discarding 2 places :
Symmetric choice reduction at 13 with 2 rule applications. Total rules 195 place count 57 transition count 150
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 197 place count 57 transition count 150
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 13 with 2 rules applied. Total rules applied 199 place count 57 transition count 150
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 13 with 4 rules applied. Total rules applied 203 place count 57 transition count 146
Discarding 2 places :
Symmetric choice reduction at 14 with 2 rule applications. Total rules 205 place count 55 transition count 144
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 207 place count 55 transition count 144
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 14 with 2 rules applied. Total rules applied 209 place count 55 transition count 144
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 14 with 4 rules applied. Total rules applied 213 place count 55 transition count 140
Discarding 2 places :
Symmetric choice reduction at 15 with 2 rule applications. Total rules 215 place count 53 transition count 138
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 217 place count 53 transition count 138
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 15 with 2 rules applied. Total rules applied 219 place count 53 transition count 138
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 15 with 4 rules applied. Total rules applied 223 place count 53 transition count 134
Discarding 2 places :
Symmetric choice reduction at 16 with 2 rule applications. Total rules 225 place count 51 transition count 132
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 227 place count 51 transition count 132
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 16 with 2 rules applied. Total rules applied 229 place count 51 transition count 132
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 16 with 4 rules applied. Total rules applied 233 place count 51 transition count 128
Discarding 2 places :
Symmetric choice reduction at 17 with 2 rule applications. Total rules 235 place count 49 transition count 126
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 237 place count 49 transition count 126
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 17 with 2 rules applied. Total rules applied 239 place count 49 transition count 126
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 17 with 4 rules applied. Total rules applied 243 place count 49 transition count 122
Discarding 2 places :
Symmetric choice reduction at 18 with 2 rule applications. Total rules 245 place count 47 transition count 120
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 247 place count 47 transition count 120
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 18 with 2 rules applied. Total rules applied 249 place count 47 transition count 120
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 18 with 4 rules applied. Total rules applied 253 place count 47 transition count 116
Discarding 2 places :
Symmetric choice reduction at 19 with 2 rule applications. Total rules 255 place count 45 transition count 114
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 257 place count 45 transition count 114
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 19 with 2 rules applied. Total rules applied 259 place count 45 transition count 114
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 19 with 4 rules applied. Total rules applied 263 place count 45 transition count 110
Discarding 2 places :
Symmetric choice reduction at 20 with 2 rule applications. Total rules 265 place count 43 transition count 108
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 267 place count 43 transition count 108
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 20 with 2 rules applied. Total rules applied 269 place count 43 transition count 108
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 20 with 4 rules applied. Total rules applied 273 place count 43 transition count 104
Discarding 2 places :
Symmetric choice reduction at 21 with 2 rule applications. Total rules 275 place count 41 transition count 102
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 277 place count 41 transition count 102
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 1 ms
Iterating global reduction 21 with 2 rules applied. Total rules applied 279 place count 41 transition count 102
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 21 with 4 rules applied. Total rules applied 283 place count 41 transition count 98
Discarding 2 places :
Symmetric choice reduction at 22 with 2 rule applications. Total rules 285 place count 39 transition count 96
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 287 place count 39 transition count 96
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 22 with 2 rules applied. Total rules applied 289 place count 39 transition count 96
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 22 with 4 rules applied. Total rules applied 293 place count 39 transition count 92
Discarding 2 places :
Symmetric choice reduction at 23 with 2 rule applications. Total rules 295 place count 37 transition count 90
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 297 place count 37 transition count 90
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 23 with 2 rules applied. Total rules applied 299 place count 37 transition count 90
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 23 with 4 rules applied. Total rules applied 303 place count 37 transition count 86
Discarding 2 places :
Symmetric choice reduction at 24 with 2 rule applications. Total rules 305 place count 35 transition count 84
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 307 place count 35 transition count 84
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 24 with 2 rules applied. Total rules applied 309 place count 35 transition count 84
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 24 with 4 rules applied. Total rules applied 313 place count 35 transition count 80
Discarding 2 places :
Symmetric choice reduction at 25 with 2 rule applications. Total rules 315 place count 33 transition count 78
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 317 place count 33 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 25 with 2 rules applied. Total rules applied 319 place count 33 transition count 78
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 25 with 4 rules applied. Total rules applied 323 place count 33 transition count 74
Discarding 2 places :
Symmetric choice reduction at 26 with 2 rule applications. Total rules 325 place count 31 transition count 72
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 327 place count 31 transition count 72
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 26 with 2 rules applied. Total rules applied 329 place count 31 transition count 72
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 26 with 4 rules applied. Total rules applied 333 place count 31 transition count 68
Discarding 2 places :
Symmetric choice reduction at 27 with 2 rule applications. Total rules 335 place count 29 transition count 66
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 337 place count 29 transition count 66
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 27 with 2 rules applied. Total rules applied 339 place count 29 transition count 66
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 27 with 4 rules applied. Total rules applied 343 place count 29 transition count 62
Discarding 2 places :
Symmetric choice reduction at 28 with 2 rule applications. Total rules 345 place count 27 transition count 60
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 347 place count 27 transition count 60
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 28 with 2 rules applied. Total rules applied 349 place count 27 transition count 60
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 28 with 4 rules applied. Total rules applied 353 place count 27 transition count 56
Discarding 2 places :
Symmetric choice reduction at 29 with 2 rule applications. Total rules 355 place count 25 transition count 54
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 357 place count 25 transition count 54
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 29 with 2 rules applied. Total rules applied 359 place count 25 transition count 54
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 4 rules applied. Total rules applied 363 place count 25 transition count 50
Discarding 2 places :
Symmetric choice reduction at 30 with 2 rule applications. Total rules 365 place count 23 transition count 48
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 367 place count 23 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 30 with 2 rules applied. Total rules applied 369 place count 23 transition count 48
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 30 with 4 rules applied. Total rules applied 373 place count 23 transition count 44
Discarding 2 places :
Symmetric choice reduction at 31 with 2 rule applications. Total rules 375 place count 21 transition count 42
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 377 place count 21 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 31 with 2 rules applied. Total rules applied 379 place count 21 transition count 42
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 383 place count 21 transition count 38
Discarding 2 places :
Symmetric choice reduction at 32 with 2 rule applications. Total rules 385 place count 19 transition count 36
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 387 place count 19 transition count 36
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 32 with 2 rules applied. Total rules applied 389 place count 19 transition count 36
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 32 with 4 rules applied. Total rules applied 393 place count 19 transition count 32
Discarding 2 places :
Symmetric choice reduction at 33 with 2 rule applications. Total rules 395 place count 17 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 397 place count 17 transition count 30
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 33 with 2 rules applied. Total rules applied 399 place count 17 transition count 30
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 33 with 4 rules applied. Total rules applied 403 place count 17 transition count 26
Discarding 2 places :
Symmetric choice reduction at 34 with 2 rule applications. Total rules 405 place count 15 transition count 24
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 407 place count 15 transition count 24
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 34 with 2 rules applied. Total rules applied 409 place count 15 transition count 24
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 34 with 4 rules applied. Total rules applied 413 place count 15 transition count 20
Discarding 2 places :
Symmetric choice reduction at 35 with 2 rule applications. Total rules 415 place count 13 transition count 18
Deduced a syphon composed of 6 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 417 place count 13 transition count 18
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 8 places in 0 ms
Iterating global reduction 35 with 2 rules applied. Total rules applied 419 place count 13 transition count 18
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 35 with 4 rules applied. Total rules applied 423 place count 13 transition count 14
Discarding 4 places :
Symmetric choice reduction at 36 with 4 rule applications. Total rules 427 place count 9 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 36 with 4 rules applied. Total rules applied 431 place count 9 transition count 10
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 431 rules in 51 ms. Remains 9 /980 variables (removed 971) and now considering 10/2380 (removed 2370) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:24:58] [INFO ] Redundant transitions in 0 ms returned []
Running 7 sub problems to find dead transitions.
// Phase 1: matrix 10 rows 9 cols
[2025-05-31 07:24:58] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 2/9 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:24:58] [INFO ] Deduced a trap composed of 2 places in 17 ms of which 1 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-05-31 07:24:58] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 1 ms to minimize.
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 0/18 variables, 0/13 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 18/19 variables, and 13 constraints, problems are : Problem set: 4 solved, 3 unsolved in 105 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 4 solved, 3 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 6/9 variables, 2/2 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/9 variables, 2/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/9 variables, 0/4 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 9/18 variables, 9/13 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 3/16 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/18 variables, 0/16 constraints. Problems are: Problem set: 4 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 18/19 variables, and 16 constraints, problems are : Problem set: 4 solved, 3 unsolved in 41 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 9/9 constraints, PredecessorRefiner: 3/7 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 151ms problems are : Problem set: 4 solved, 3 unsolved
Search for dead transitions found 4 dead transitions in 151ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 9/980 places, 6/2380 transitions.
Graph (complete) has 5 edges and 9 vertex of which 5 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 0 ms. Remains 5 /9 variables (removed 4) and now considering 6/6 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 5/980 places, 6/2380 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 207 ms. Remains : 5/980 places, 6/2380 transitions.
Built C files in :
/tmp/ltsmin1414738741142587615
[2025-05-31 07:24:58] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1414738741142587615
Running compilation step : cd /tmp/ltsmin1414738741142587615;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1414738741142587615;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin1414738741142587615;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 3 out of 980 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 980/980 places, 2380/2380 transitions.
Applied a total of 0 rules in 33 ms. Remains 980 /980 variables (removed 0) and now considering 2380/2380 (removed 0) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2025-05-31 07:25:01] [INFO ] Computed 20 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:01] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-31 07:25:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:25:02] [INFO ] Implicit Places using invariants and state equation in 575 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:25:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 1.0)
(s432 1.0)
(s433 1.0)
(s434 1.0)
(s435 1.0)
(s436 1.0)
(s437 1.0)
(s438 1.0)
(s439 1.0)
(s440 1.0)
(s441 1.0)
(s442 1.0)
(s443 1.0)
(s444 1.0)
(s445 1.0)
(s446 1.0)
(s447 1.0)
(s448 1.0)
(s449 1.0)
(s450 1.0)
(s451 1.0)
(s452 1.0)
(s453 1.0)
(s454 1.0)
(s455 1.0)
(s456 1.0)
(s457 1.0)
(s458 1.0)
(s459 1.0)
(s460 1.0)
(s461 1.0)
(s462 1.0)
(s463 1.0)
(s464 1.0)
(s465 1.0)
(s466 1.0)
(s467 1.0)
(s468 1.0)
(s469 1.0)
(s470 1.0)
(s471 1.0)
(s472 1.0)
(s473 1.0)
(s474 1.0)
(s475 1.0)
(s476 1.0)
(s477 1.0)
(s478 1.0)
(s479 1.0)
(s480 1.0)
(s481 1.0)
(s482 1.0)
(s483 1.0)
(s484 1.0)
(s485 1.0)
(s486 1.0)
(s487 1.0)
(s488 1.0)
(s489 1.0)
(s490 1.0)
(s491 1.0)
(s492 1.0)
(s493 1.0)
(s494 1.0)
(s495 1.0)
(s496 1.0)
(s497 1.0)
(s498 1.0)
(s499 1.0)
(s500 1.0)
(s501 1.0)
(s502 1.0)
(s503 1.0)
(s504 1.0)
(s505 1.0)
(s506 1.0)
(s507 1.0)
(s508 1.0)
(s509 1.0)
(s510 1.0)
(s511 1.0)
(s512 1.0)
(s513 1.0)
(s514 1.0)
(s515 1.0)
(s516 1.0)
(s517 1.0)
(s518 1.0)
(s519 1.0)
(s520 1.0)
(s521 1.0)
(s522 1.0)
(s523 1.0)
(s524 1.0)
(s525 1.0)
(s526 1.0)
(s527 1.0)
(s528 1.0)
(s529 1.0)
(s530 1.0)
(s531 1.0)
(s532 1.0)
(s533 1.0)
(s534 1.0)
(s535 1.0)
(s536 1.0)
(s537 1.0)
(s538 1.0)
(s539 1.0)
(s540 1.0)
(s541 1.0)
(s542 1.0)
(s543 1.0)
(s544 1.0)
(s545 1.0)
(s546 1.0)
(s547 1.0)
(s548 1.0)
(s549 1.0)
(s550 1.0)
(s551 1.0)
(s552 1.0)
(s553 1.0)
(s554 1.0)
(s555 1.0)
(s556 1.0)
(s557 1.0)
(s558 1.0)
(s559 1.0)
(s560 1.0)
(s561 1.0)
(s562 1.0)
(s563 1.0)
(s564 1.0)
(s565 1.0)
(s566 1.0)
(s567 1.0)
(s568 1.0)
(s569 1.0)
(s570 1.0)
(s571 1.0)
(s572 1.0)
(s573 1.0)
(s574 1.0)
(s575 1.0)
(s576 1.0)
(s577 1.0)
(s578 1.0)
(s579 1.0)
(s580 1.0)
(s581 1.0)
(s582 1.0)
(s583 1.0)
(s584 1.0)
(s585 1.0)
(s586 1.0)
(s587 1.0)
(s588 1.0)
(s589 1.0)
(s590 1.0)
(s591 1.0)
(s592 1.0)
(s593 1.0)
(s594 1.0)
(s595 1.0)
(s596 1.0)
(s597 1.0)
(s598 1.0)
(s599 1.0)
(s600 1.0)
(s601 1.0)
(s602 1.0)
(s603 1.0)
(s604 1.0)
(s605 1.0)
(s606 1.0)
(s607 1.0)
(s608 1.0)
(s609 1.0)
(s610 1.0)
(s611 1.0)
(s612 1.0)
(s613 1.0)
(s614 1.0)
(s615 1.0)
(s616 1.0)
(s617 1.0)
(s618 1.0)
(s619 1.0)
(s620 1.0)
(s621 1.0)
(s622 1.0)
(s623 1.0)
(s624 1.0)
(s625 1.0)
(s626 1.0)
(s627 1.0)
(s628 1.0)
(s629 1.0)
(s630 1.0)
(s631 1.0)
(s632 1.0)
(s633 1.0)
(s634 1.0)
(s635 1.0)
(s636 1.0)
(s637 1.0)
(s638 1.0)
(s639 1.0)
(s640 1.0)
(s641 1.0)
(s642 1.0)
(s643 1.0)
(s644 1.0)
(s645 1.0)
(s646 1.0)
(s647 1.0)
(s648 1.0)
(s649 1.0)
(s650 1.0)
(s651 1.0)
(s652 1.0)
(s653 1.0)
(s654 1.0)
(s655 1.0)
(s656 1.0)
(s657 1.0)
(s658 1.0)
(s659 1.0)
(s660 1.0)
(s661 1.0)
(s662 1.0)
(s663 1.0)
(s664 1.0)
(s665 1.0)
(s666 1.0)
(s667 1.0)
(s668 1.0)
(s669 1.0)
(s670 1.0)
(s671 1.0)
(s672 1.0)
(s673 1.0)
(s674 1.0)
(s675 1.0)
(s676 1.0)
(s677 1.0)
(s678 1.0)
(s679 1.0)
(s680 1.0)
(s681 1.0)
(s682 1.0)
(s683 1.0)
(s684 1.0)
(s685 1.0)
(s686 1.0)
(s687 1.0)
(s688 1.0)
(s689 1.0)
(s690 1.0)
(s691 1.0)
(s692 1.0)
(s693 1.0)
(s694 1.0)
(s695 1.0)
(s696 1.0)
(s697 1.0)
(s698 1.0)
(s699 1.0)
(s700 1.0)
(s701 1.0)
(s702 1.0)
(s703 1.0)
(s704 1.0)
(s705 1.0)
(s706 1.0)
(s707 1.0)
(s708 1.0)
(s709 1.0)
(s710 1.0)
(s711 1.0)
(s712 1.0)
(s713 1.0)
(s714 1.0)
(s715 1.0)
(s716 1.0)
(s717 1.0)
(s718 1.0)
(s719 1.0)
(s720 1.0)
(s721 1.0)
(s722 1.0)
(s723 1.0)
(s724 1.0)
(s725 1.0)
(s726 1.0)
(s727 1.0)
(s728 1.0)
(s729 1.0)
(s730 1.0)
(s731 1.0)
(s732 1.0)
(s733 1.0)
(s734 1.0)
(s735 1.0)
(s736 1.0)
(s737 1.0)
(s738 1.0)
(s739 1.0)
(s740 1.0)
(s741 1.0)
(s742 1.0)
(s743 1.0)
(s744 1.0)
(s745 1.0)
(s746 1.0)
(s747 1.0)
(s748 1.0)
(s749 1.0)
(s750 1.0)
(s751 1.0)
(s752 1.0)
(s753 1.0)
(s754 1.0)
(s755 1.0)
(s756 1.0)
(s757 1.0)
(s758 1.0)
(s759 1.0)
(s760 1.0)
(s761 1.0)
(s762 1.0)
(s763 1.0)
(s764 1.0)
(s765 1.0)
(s766 1.0)
(s767 1.0)
(s768 1.0)
(s769 1.0)
(s770 1.0)
(s771 1.0)
(s772 1.0)
(s773 1.0)
(s774 1.0)
(s775 1.0)
(s776 1.0)
(s777 1.0)
(s778 1.0)
(s779 1.0)
(s780 1.0)
(s781 1.0)
(s782 1.0)
(s783 1.0)
(s784 1.0)
(s785 1.0)
(s786 1.0)
(s787 1.0)
(s788 1.0)
(s789 1.0)
(s790 1.0)
(s791 1.0)
(s792 1.0)
(s793 1.0)
(s794 1.0)
(s795 1.0)
(s796 1.0)
(s797 1.0)
(s798 1.0)
(s799 1.0)
(s800 1.0)
(s801 1.0)
(s802 1.0)
(s803 1.0)
(s804 1.0)
(s805 1.0)
(s806 1.0)
(s807 1.0)
(s808 1.0)
(s809 1.0)
(s810 1.0)
(s811 1.0)
(s812 1.0)
(s813 1.0)
(s814 1.0)
(s815 1.0)
(s816 1.0)
(s817 1.0)
(s818 1.0)
(s819 1.0)
(s820 1.0)
(s821 1.0)
(s822 1.0)
(s823 1.0)
(s824 1.0)
(s825 1.0)
(s826 1.0)
(s827 1.0)
(s828 1.0)
(s829 1.0)
(s830 1.0)
(s831 1.0)
(s832 1.0)
(s833 1.0)
(s834 1.0)
(s835 1.0)
(s836 1.0)
(s837 1.0)
(s838 1.0)
(s839 1.0)
(s840 1.0)
(s841 1.0)
(s842 1.0)
(s843 1.0)
(s844 1.0)
(s845 1.0)
(s846 1.0)
(s847 1.0)
(s848 1.0)
(s849 1.0)
(s850 1.0)
(s851 1.0)
(s852 1.0)
(s853 1.0)
(s854 1.0)
(s855 1.0)
(s856 1.0)
(s857 1.0)
(s858 1.0)
(s859 1.0)
(s860 1.0)
(s861 1.0)
(s862 1.0)
(s863 1.0)
(s864 1.0)
(s865 1.0)
(s866 1.0)
(s867 1.0)
(s868 1.0)
(s869 1.0)
(s870 1.0)
(s871 1.0)
(s872 1.0)
(s873 1.0)
(s874 1.0)
(s875 1.0)
(s876 1.0)
(s877 1.0)
(s878 1.0)
(s879 1.0)
(s880 1.0)
(s881 1.0)
(s882 1.0)
(s883 1.0)
(s884 1.0)
(s885 1.0)
(s886 1.0)
(s887 1.0)
(s888 1.0)
(s889 1.0)
(s890 1.0)
(s891 1.0)
(s892 1.0)
(s893 1.0)
(s894 1.0)
(s895 1.0)
(s896 1.0)
(s897 1.0)
(s898 1.0)
(s899 1.0)
(s900 1.0)
(s901 1.0)
(s902 1.0)
(s903 1.0)
(s904 1.0)
(s905 1.0)
(s906 1.0)
(s907 1.0)
(s908 1.0)
(s909 1.0)
(s910 1.0)
(s911 1.0)
(s912 1.0)
(s913 1.0)
(s914 1.0)
(s915 1.0)
(s916 1.0)
(s917 1.0)
(s918 1.0)
(s919 1.0)
(s920 1.0)
(s921 1.0)
(s922 1.0)
(s923 1.0)
(s924 1.0)
(s925 1.0)
(s926 1.0)
(s927 1.0)
(s928 1.0)
(s929 1.0)
(s930 1.0)
(s931 1.0)
(s932 1.0)
(s933 1.0)
(s934 1.0)
(s935 1.0)
(s936 1.0)
(s937 1.0)
(s938 1.0)
(s939 1.0)
(s940 1.0)
(s941 1.0)
(s942 1.0)
(s943 1.0)
(s944 1.0)
(s945 1.0)
(s946 1.0)
(s947 1.0)
(s948 1.0)
(s949 1.0)
(s950 1.0)
(s951 1.0)
(s952 1.0)
(s953 1.0)
(s954 1.0)
(s955 1.0)
(s956 1.0)
(s957 1.0)
(s958 1.0)
(s959 1.0)
(s960 1.0)
(s961 1.0)
(s962 1.0)
(s963 1.0)
(s964 1.0)
(s965 1.0)
(s966 1.0)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60385ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60387ms
Finished structural reductions in LTL mode , in 1 iterations and 61135 ms. Remains : 980/980 places, 2380/2380 transitions.
Built C files in :
/tmp/ltsmin385157739364690422
[2025-05-31 07:26:02] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin385157739364690422
Running compilation step : cd /tmp/ltsmin385157739364690422;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin385157739364690422;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin385157739364690422;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:93)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2025-05-31 07:26:05] [INFO ] Flatten gal took : 28 ms
[2025-05-31 07:26:05] [INFO ] Flatten gal took : 28 ms
[2025-05-31 07:26:05] [INFO ] Time to serialize gal into /tmp/LTL8953219542524788413.gal : 6 ms
[2025-05-31 07:26:05] [INFO ] Time to serialize properties into /tmp/LTL16123130521136792649.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/LTL8953219542524788413.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13591536373477200896.hoa' '-atoms' '/tmp/LTL16123130521136792649.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/LTL16123130521136792649.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13591536373477200896.hoa
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
4 unique states visited
4 strongly connected components in search stack
4 transitions explored
4 items max in DFS search stack
1233 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,12.4786,313348,1,0,211,1.75217e+06,33,105,24257,1.18726e+06,531
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BART-PT-020-LTLFireability-08 FALSE TECHNIQUES KNOWLEDGE HOA DECISION_DIAGRAMS TOPOLOGICAL
Treatment of property BART-PT-020-LTLFireability-08 finished in 210205 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(G(p1)))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 568 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
[2025-05-31 07:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:26:20] [INFO ] Implicit Places using invariants in 120 ms returned []
[2025-05-31 07:26:20] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:26:21] [INFO ] Implicit Places using invariants and state equation in 543 ms returned []
Implicit Place search using SMT with State Equation took 664 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:26:21] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60395ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60398ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61633 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 136 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-09 finished in 61795 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 638 places :
Symmetric choice reduction at 0 with 638 rule applications. Total rules 638 place count 2002 transition count 3402
Iterating global reduction 0 with 638 rules applied. Total rules applied 1276 place count 2002 transition count 3402
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 1814 place count 1464 transition count 2864
Iterating global reduction 0 with 538 rules applied. Total rules applied 2352 place count 1464 transition count 2864
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2432 place count 1384 transition count 2784
Iterating global reduction 0 with 80 rules applied. Total rules applied 2512 place count 1384 transition count 2784
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2571 place count 1325 transition count 2725
Iterating global reduction 0 with 59 rules applied. Total rules applied 2630 place count 1325 transition count 2725
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2689 place count 1266 transition count 2666
Iterating global reduction 0 with 59 rules applied. Total rules applied 2748 place count 1266 transition count 2666
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2807 place count 1207 transition count 2607
Iterating global reduction 0 with 59 rules applied. Total rules applied 2866 place count 1207 transition count 2607
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2925 place count 1148 transition count 2548
Iterating global reduction 0 with 59 rules applied. Total rules applied 2984 place count 1148 transition count 2548
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3043 place count 1089 transition count 2489
Iterating global reduction 0 with 59 rules applied. Total rules applied 3102 place count 1089 transition count 2489
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3141 place count 1050 transition count 2450
Iterating global reduction 0 with 39 rules applied. Total rules applied 3180 place count 1050 transition count 2450
Discarding 38 places :
Symmetric choice reduction at 0 with 38 rule applications. Total rules 3218 place count 1012 transition count 2412
Iterating global reduction 0 with 38 rules applied. Total rules applied 3256 place count 1012 transition count 2412
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3275 place count 993 transition count 2393
Iterating global reduction 0 with 19 rules applied. Total rules applied 3294 place count 993 transition count 2393
Applied a total of 3294 rules in 556 ms. Remains 993 /2640 variables (removed 1647) and now considering 2393/4040 (removed 1647) transitions.
// Phase 1: matrix 2393 rows 993 cols
[2025-05-31 07:27:22] [INFO ] Computed 20 invariants in 11 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:27:22] [INFO ] Implicit Places using invariants in 133 ms returned []
[2025-05-31 07:27:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:27:22] [INFO ] Implicit Places using invariants and state equation in 533 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 1673 sub problems to find dead transitions.
[2025-05-31 07:27:22] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 973/3386 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 1673/1673 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1673 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 973/3386 variables, and 0 constraints, problems are : Problem set: 0 solved, 1673 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/993 constraints, PredecessorRefiner: 0/1673 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60388ms problems are : Problem set: 0 solved, 1673 unsolved
Search for dead transitions found 0 dead transitions in 60390ms
Starting structural reductions in LTL mode, iteration 1 : 993/2640 places, 2393/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61619 ms. Remains : 993/2640 places, 2393/4040 transitions.
Stuttering acceptance computed with spot in 105 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BART-PT-020-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-10 finished in 61740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U X(p1)))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 638 places :
Symmetric choice reduction at 0 with 638 rule applications. Total rules 638 place count 2002 transition count 3402
Iterating global reduction 0 with 638 rules applied. Total rules applied 1276 place count 2002 transition count 3402
Discarding 538 places :
Symmetric choice reduction at 0 with 538 rule applications. Total rules 1814 place count 1464 transition count 2864
Iterating global reduction 0 with 538 rules applied. Total rules applied 2352 place count 1464 transition count 2864
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 2431 place count 1385 transition count 2785
Iterating global reduction 0 with 79 rules applied. Total rules applied 2510 place count 1385 transition count 2785
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2569 place count 1326 transition count 2726
Iterating global reduction 0 with 59 rules applied. Total rules applied 2628 place count 1326 transition count 2726
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2687 place count 1267 transition count 2667
Iterating global reduction 0 with 59 rules applied. Total rules applied 2746 place count 1267 transition count 2667
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2805 place count 1208 transition count 2608
Iterating global reduction 0 with 59 rules applied. Total rules applied 2864 place count 1208 transition count 2608
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2923 place count 1149 transition count 2549
Iterating global reduction 0 with 59 rules applied. Total rules applied 2982 place count 1149 transition count 2549
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3041 place count 1090 transition count 2490
Iterating global reduction 0 with 59 rules applied. Total rules applied 3100 place count 1090 transition count 2490
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3139 place count 1051 transition count 2451
Iterating global reduction 0 with 39 rules applied. Total rules applied 3178 place count 1051 transition count 2451
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3217 place count 1012 transition count 2412
Iterating global reduction 0 with 39 rules applied. Total rules applied 3256 place count 1012 transition count 2412
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3276 place count 992 transition count 2392
Iterating global reduction 0 with 20 rules applied. Total rules applied 3296 place count 992 transition count 2392
Applied a total of 3296 rules in 556 ms. Remains 992 /2640 variables (removed 1648) and now considering 2392/4040 (removed 1648) transitions.
// Phase 1: matrix 2392 rows 992 cols
[2025-05-31 07:28:23] [INFO ] Computed 20 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:28:24] [INFO ] Implicit Places using invariants in 134 ms returned []
[2025-05-31 07:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:28:24] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
Running 1672 sub problems to find dead transitions.
[2025-05-31 07:28:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1.0)
(s21 1.0)
(s22 1.0)
(s23 1.0)
(s24 1.0)
(s25 1.0)
(s26 1.0)
(s27 1.0)
(s28 1.0)
(s29 1.0)
(s30 1.0)
(s31 1.0)
(s32 1.0)
(s33 1.0)
(s34 1.0)
(s35 1.0)
(s36 1.0)
(s37 1.0)
(s38 1.0)
(s39 1.0)
(s40 1.0)
(s41 1.0)
(s42 1.0)
(s43 1.0)
(s44 1.0)
(s45 1.0)
(s46 1.0)
(s47 1.0)
(s48 1.0)
(s49 1.0)
(s50 1.0)
(s51 1.0)
(s52 1.0)
(s53 1.0)
(s54 1.0)
(s55 1.0)
(s56 1.0)
(s57 1.0)
(s58 1.0)
(s59 1.0)
(s60 1.0)
(s61 1.0)
(s62 1.0)
(s63 1.0)
(s64 1.0)
(s65 1.0)
(s66 1.0)
(s67 1.0)
(s68 1.0)
(s69 1.0)
(s70 1.0)
(s71 1.0)
(s72 1.0)
(s73 1.0)
(s74 1.0)
(s75 1.0)
(s76 1.0)
(s77 1.0)
(s78 1.0)
(s79 1.0)
(s80 1.0)
(s81 1.0)
(s82 1.0)
(s83 1.0)
(s84 1.0)
(s85 1.0)
(s86 1.0)
(s87 1.0)
(s88 1.0)
(s89 1.0)
(s90 1.0)
(s91 1.0)
(s92 1.0)
(s93 1.0)
(s94 1.0)
(s95 1.0)
(s96 1.0)
(s97 1.0)
(s98 1.0)
(s99 1.0)
(s100 1.0)
(s101 1.0)
(s102 1.0)
(s103 1.0)
(s104 1.0)
(s105 1.0)
(s106 1.0)
(s107 1.0)
(s108 1.0)
(s109 1.0)
(s110 1.0)
(s111 1.0)
(s112 1.0)
(s113 1.0)
(s114 1.0)
(s115 1.0)
(s116 1.0)
(s117 1.0)
(s118 1.0)
(s119 1.0)
(s120 1.0)
(s121 1.0)
(s122 1.0)
(s123 1.0)
(s124 1.0)
(s125 1.0)
(s126 1.0)
(s127 1.0)
(s128 1.0)
(s129 1.0)
(s130 1.0)
(s131 1.0)
(s132 1.0)
(s133 1.0)
(s134 1.0)
(s135 1.0)
(s136 1.0)
(s137 1.0)
(s138 1.0)
(s139 1.0)
(s140 1.0)
(s141 1.0)
(s142 1.0)
(s143 1.0)
(s144 1.0)
(s145 1.0)
(s146 1.0)
(s147 1.0)
(s148 1.0)
(s149 1.0)
(s150 1.0)
(s151 1.0)
(s152 1.0)
(s153 1.0)
(s154 1.0)
(s155 1.0)
(s156 1.0)
(s157 1.0)
(s158 1.0)
(s159 1.0)
(s160 1.0)
(s161 1.0)
(s162 1.0)
(s163 1.0)
(s164 1.0)
(s165 1.0)
(s166 1.0)
(s167 1.0)
(s168 1.0)
(s169 1.0)
(s170 1.0)
(s171 1.0)
(s172 1.0)
(s173 1.0)
(s174 1.0)
(s175 1.0)
(s176 1.0)
(s177 1.0)
(s178 1.0)
(s179 1.0)
(s180 1.0)
(s181 1.0)
(s182 1.0)
(s183 1.0)
(s184 1.0)
(s185 1.0)
(s186 1.0)
(s187 1.0)
(s188 1.0)
(s189 1.0)
(s190 1.0)
(s191 1.0)
(s192 1.0)
(s193 1.0)
(s194 1.0)
(s195 1.0)
(s196 1.0)
(s197 1.0)
(s198 1.0)
(s199 1.0)
(s200 1.0)
(s201 1.0)
(s202 1.0)
(s203 1.0)
(s204 1.0)
(s205 1.0)
(s206 1.0)
(s207 1.0)
(s208 1.0)
(s209 1.0)
(s210 1.0)
(s211 1.0)
(s212 1.0)
(s213 1.0)
(s214 1.0)
(s215 1.0)
(s216 1.0)
(s217 1.0)
(s218 1.0)
(s219 1.0)
(s220 1.0)
(s221 1.0)
(s222 1.0)
(s223 1.0)
(s224 1.0)
(s225 1.0)
(s226 1.0)
(s227 1.0)
(s228 1.0)
(s229 1.0)
(s230 1.0)
(s231 1.0)
(s232 1.0)
(s233 1.0)
(s234 1.0)
(s235 1.0)
(s236 1.0)
(s237 1.0)
(s238 1.0)
(s239 1.0)
(s240 1.0)
(s241 1.0)
(s242 1.0)
(s243 1.0)
(s244 1.0)
(s245 1.0)
(s246 1.0)
(s247 1.0)
(s248 1.0)
(s249 1.0)
(s250 1.0)
(s251 1.0)
(s252 1.0)
(s253 1.0)
(s254 1.0)
(s255 1.0)
(s256 1.0)
(s257 1.0)
(s258 1.0)
(s259 1.0)
(s260 1.0)
(s261 1.0)
(s262 1.0)
(s263 1.0)
(s264 1.0)
(s265 1.0)
(s266 1.0)
(s267 1.0)
(s268 1.0)
(s269 1.0)
(s270 1.0)
(s271 1.0)
(s272 1.0)
(s273 1.0)
(s274 1.0)
(s275 1.0)
(s276 1.0)
(s277 1.0)
(s278 1.0)
(s279 1.0)
(s280 1.0)
(s281 1.0)
(s282 1.0)
(s283 1.0)
(s284 1.0)
(s285 1.0)
(s286 1.0)
(s287 1.0)
(s288 1.0)
(s289 1.0)
(s290 1.0)
(s291 1.0)
(s292 1.0)
(s293 1.0)
(s294 1.0)
(s295 1.0)
(s296 1.0)
(s297 1.0)
(s298 1.0)
(s299 1.0)
(s300 1.0)
(s301 1.0)
(s302 1.0)
(s303 1.0)
(s304 1.0)
(s305 1.0)
(s306 1.0)
(s307 1.0)
(s308 1.0)
(s309 1.0)
(s310 1.0)
(s311 1.0)
(s312 1.0)
(s313 1.0)
(s314 1.0)
(s315 1.0)
(s316 1.0)
(s317 1.0)
(s318 1.0)
(s319 1.0)
(s320 1.0)
(s321 1.0)
(s322 1.0)
(s323 1.0)
(s324 1.0)
(s325 1.0)
(s326 1.0)
(s327 1.0)
(s328 1.0)
(s329 1.0)
(s330 1.0)
(s331 1.0)
(s332 1.0)
(s333 1.0)
(s334 1.0)
(s335 1.0)
(s336 1.0)
(s337 1.0)
(s338 1.0)
(s339 1.0)
(s340 1.0)
(s341 1.0)
(s342 1.0)
(s343 1.0)
(s344 1.0)
(s345 1.0)
(s346 1.0)
(s347 1.0)
(s348 1.0)
(s349 1.0)
(s350 1.0)
(s351 1.0)
(s352 1.0)
(s353 1.0)
(s354 1.0)
(s355 1.0)
(s356 1.0)
(s357 1.0)
(s358 1.0)
(s359 1.0)
(s360 1.0)
(s361 1.0)
(s362 1.0)
(s363 1.0)
(s364 1.0)
(s365 1.0)
(s366 1.0)
(s367 1.0)
(s368 1.0)
(s369 1.0)
(s370 1.0)
(s371 1.0)
(s372 1.0)
(s373 1.0)
(s374 1.0)
(s375 1.0)
(s376 1.0)
(s377 1.0)
(s378 1.0)
(s379 1.0)
(s380 1.0)
(s381 1.0)
(s382 1.0)
(s383 1.0)
(s384 1.0)
(s385 1.0)
(s386 1.0)
(s387 1.0)
(s388 1.0)
(s389 1.0)
(s390 1.0)
(s391 1.0)
(s392 1.0)
(s393 1.0)
(s394 1.0)
(s395 1.0)
(s396 1.0)
(s397 1.0)
(s398 1.0)
(s399 1.0)
(s400 1.0)
(s401 1.0)
(s402 1.0)
(s403 1.0)
(s404 1.0)
(s405 1.0)
(s406 1.0)
(s407 1.0)
(s408 1.0)
(s409 1.0)
(s410 1.0)
(s411 1.0)
(s412 1.0)
(s413 1.0)
(s414 1.0)
(s415 1.0)
(s416 1.0)
(s417 1.0)
(s418 1.0)
(s419 1.0)
(s420 1.0)
(s421 1.0)
(s422 1.0)
(s423 1.0)
(s424 1.0)
(s425 1.0)
(s426 1.0)
(s427 1.0)
(s428 1.0)
(s429 1.0)
(s430 1.0)
(s431 timeout
1.0) org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 972/3384 variables, and 0 constraints, problems are : Problem set: 0 solved, 1672 unsolved in 30046 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 1672/1672 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1672 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 972/3384 variables, and 0 constraints, problems are : Problem set: 0 solved, 1672 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/992 constraints, PredecessorRefiner: 0/1672 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 1672 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Starting structural reductions in LTL mode, iteration 1 : 992/2640 places, 2392/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61628 ms. Remains : 992/2640 places, 2392/4040 transitions.
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BART-PT-020-LTLFireability-11
Product exploration explored 100000 steps with 24 reset in 344 ms.
Product exploration explored 100000 steps with 30 reset in 353 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 (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 102 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 84 ms :[(NOT p1), (NOT p1), (NOT p1)]
RANDOM walk for 21486 steps (3 resets) in 144 ms. (148 steps per ms) remains 0/4 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p1)]
Knowledge based reduction with 9 factoid took 220 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 3 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(NOT p1), (NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 126 ms :[(NOT p1), (NOT p1), (NOT p1)]
[2025-05-31 07:29:26] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
Proved EG (NOT p1)
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT p1))), (X (X (NOT p0))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F p0), (F p1), (G (NOT p1))]
Property proved to be false thanks to negative knowledge :(G (NOT p1))
Knowledge based reduction with 9 factoid took 265 ms. Reduced automaton from 3 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-11 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-11 finished in 64236 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1))))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Graph (trivial) has 4036 edges and 2640 vertex of which 2636 / 2640 are part of one of the 20 SCC in 2 ms
Free SCC test removed 2616 places
Ensure Unique test removed 4014 transitions
Reduce isomorphic transitions removed 4014 transitions.
Reduce places removed 18 places and 0 transitions.
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 6 transition count 7
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 4 transition count 7
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 4 transition count 5
Applied a total of 24 rules in 11 ms. Remains 4 /2640 variables (removed 2636) and now considering 5/4040 (removed 4035) transitions.
// Phase 1: matrix 5 rows 4 cols
[2025-05-31 07:29:27] [INFO ] Computed 2 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:29:27] [INFO ] Implicit Places using invariants in 18 ms returned []
[2025-05-31 07:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:29:27] [INFO ] Implicit Places using invariants and state equation in 20 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-05-31 07:29:27] [INFO ] Redundant transitions in 0 ms returned []
Running 2 sub problems to find dead transitions.
[2025-05-31 07:29:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 0/8 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 8/9 variables, and 10 constraints, problems are : Problem set: 0 solved, 2 unsolved in 25 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/2 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 2/4 variables, 2/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/4 variables, 2/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/4 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 4/8 variables, 4/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/8 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 0/8 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 8/9 variables, and 12 constraints, problems are : Problem set: 0 solved, 2 unsolved in 26 ms.
Refiners :[Domain max(s): 4/4 constraints, Positive P Invariants (semi-flows): 2/2 constraints, State Equation: 4/4 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 58ms problems are : Problem set: 0 solved, 2 unsolved
Search for dead transitions found 0 dead transitions in 58ms
Starting structural reductions in SI_LTL mode, iteration 1 : 4/2640 places, 5/4040 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 115 ms. Remains : 4/2640 places, 5/4040 transitions.
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1))]
Running random walk in product with property : BART-PT-020-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BART-PT-020-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-12 finished in 164 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||F(G(p1))||G(p2))))'
Support contains 3 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 640 places :
Symmetric choice reduction at 0 with 640 rule applications. Total rules 640 place count 2000 transition count 3400
Iterating global reduction 0 with 640 rules applied. Total rules applied 1280 place count 2000 transition count 3400
Discarding 540 places :
Symmetric choice reduction at 0 with 540 rule applications. Total rules 1820 place count 1460 transition count 2860
Iterating global reduction 0 with 540 rules applied. Total rules applied 2360 place count 1460 transition count 2860
Discarding 80 places :
Symmetric choice reduction at 0 with 80 rule applications. Total rules 2440 place count 1380 transition count 2780
Iterating global reduction 0 with 80 rules applied. Total rules applied 2520 place count 1380 transition count 2780
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2580 place count 1320 transition count 2720
Iterating global reduction 0 with 60 rules applied. Total rules applied 2640 place count 1320 transition count 2720
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2700 place count 1260 transition count 2660
Iterating global reduction 0 with 60 rules applied. Total rules applied 2760 place count 1260 transition count 2660
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2820 place count 1200 transition count 2600
Iterating global reduction 0 with 60 rules applied. Total rules applied 2880 place count 1200 transition count 2600
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 2940 place count 1140 transition count 2540
Iterating global reduction 0 with 60 rules applied. Total rules applied 3000 place count 1140 transition count 2540
Discarding 60 places :
Symmetric choice reduction at 0 with 60 rule applications. Total rules 3060 place count 1080 transition count 2480
Iterating global reduction 0 with 60 rules applied. Total rules applied 3120 place count 1080 transition count 2480
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3160 place count 1040 transition count 2440
Iterating global reduction 0 with 40 rules applied. Total rules applied 3200 place count 1040 transition count 2440
Discarding 40 places :
Symmetric choice reduction at 0 with 40 rule applications. Total rules 3240 place count 1000 transition count 2400
Iterating global reduction 0 with 40 rules applied. Total rules applied 3280 place count 1000 transition count 2400
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3300 place count 980 transition count 2380
Iterating global reduction 0 with 20 rules applied. Total rules applied 3320 place count 980 transition count 2380
Applied a total of 3320 rules in 552 ms. Remains 980 /2640 variables (removed 1660) and now considering 2380/4040 (removed 1660) transitions.
// Phase 1: matrix 2380 rows 980 cols
[2025-05-31 07:29:28] [INFO ] Computed 20 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:29:28] [INFO ] Implicit Places using invariants in 132 ms returned []
[2025-05-31 07:29:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:29:29] [INFO ] Implicit Places using invariants and state equation in 536 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
Running 1660 sub problems to find dead transitions.
[2025-05-31 07:29:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 1660/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1660 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 960/3360 variables, and 0 constraints, problems are : Problem set: 0 solved, 1660 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/980 constraints, PredecessorRefiner: 0/1660 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60389ms problems are : Problem set: 0 solved, 1660 unsolved
Search for dead transitions found 0 dead transitions in 60391ms
Starting structural reductions in LTL mode, iteration 1 : 980/2640 places, 2380/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61623 ms. Remains : 980/2640 places, 2380/4040 transitions.
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : BART-PT-020-LTLFireability-13
Product exploration explored 100000 steps with 0 reset in 332 ms.
Product exploration explored 100000 steps with 0 reset in 386 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 p2) (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 1 factoid took 352 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
RANDOM walk for 703 steps (0 resets) in 19 ms. (35 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2))))]
Knowledge based reduction with 1 factoid took 455 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 4 states, 7 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1))]
[2025-05-31 07:30:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:30:32] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned unsat
Proved EG (AND (NOT p0) (NOT p2) (NOT p1))
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1))]
False Knowledge obtained : [(X p2), (X (NOT p2)), (X (AND (NOT p0) p2)), (X (NOT (AND (NOT p0) p2))), (X (AND (NOT p0) (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X p0), (X (NOT p0)), (X (X (NOT p2))), (X (X p2)), (X (X p1)), (X (X (NOT p1))), (F p1), (F p0), (F p2), (F (NOT (AND (NOT p0) (NOT p2)))), (F (NOT (OR p0 (NOT p2)))), (G (AND (NOT p0) (NOT p2) (NOT p1)))]
Property proved to be false thanks to negative knowledge :(G (AND (NOT p0) (NOT p2) (NOT p1)))
Knowledge based reduction with 1 factoid took 452 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-13 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-13 finished in 64870 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((p0 U X(X(p1))) U (p2&&G(p3)))))'
Support contains 4 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 639 places :
Symmetric choice reduction at 0 with 639 rule applications. Total rules 639 place count 2001 transition count 3401
Iterating global reduction 0 with 639 rules applied. Total rules applied 1278 place count 2001 transition count 3401
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1817 place count 1462 transition count 2862
Iterating global reduction 0 with 539 rules applied. Total rules applied 2356 place count 1462 transition count 2862
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 2435 place count 1383 transition count 2783
Iterating global reduction 0 with 79 rules applied. Total rules applied 2514 place count 1383 transition count 2783
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2573 place count 1324 transition count 2724
Iterating global reduction 0 with 59 rules applied. Total rules applied 2632 place count 1324 transition count 2724
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2691 place count 1265 transition count 2665
Iterating global reduction 0 with 59 rules applied. Total rules applied 2750 place count 1265 transition count 2665
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2809 place count 1206 transition count 2606
Iterating global reduction 0 with 59 rules applied. Total rules applied 2868 place count 1206 transition count 2606
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2927 place count 1147 transition count 2547
Iterating global reduction 0 with 59 rules applied. Total rules applied 2986 place count 1147 transition count 2547
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3045 place count 1088 transition count 2488
Iterating global reduction 0 with 59 rules applied. Total rules applied 3104 place count 1088 transition count 2488
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3143 place count 1049 transition count 2449
Iterating global reduction 0 with 39 rules applied. Total rules applied 3182 place count 1049 transition count 2449
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3221 place count 1010 transition count 2410
Iterating global reduction 0 with 39 rules applied. Total rules applied 3260 place count 1010 transition count 2410
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 3279 place count 991 transition count 2391
Iterating global reduction 0 with 19 rules applied. Total rules applied 3298 place count 991 transition count 2391
Applied a total of 3298 rules in 557 ms. Remains 991 /2640 variables (removed 1649) and now considering 2391/4040 (removed 1649) transitions.
// Phase 1: matrix 2391 rows 991 cols
[2025-05-31 07:30:33] [INFO ] Computed 20 invariants in 14 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:30:33] [INFO ] Implicit Places using invariants in 128 ms returned []
[2025-05-31 07:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:30:33] [INFO ] Implicit Places using invariants and state equation in 562 ms returned []
Implicit Place search using SMT with State Equation took 691 ms to find 0 implicit places.
Running 1671 sub problems to find dead transitions.
[2025-05-31 07:30:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 971/3382 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 1671/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1671 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: ((s20 1)
(s21 1)
(s22 1)
(s23 1)
(s24 1)
(s25 1)
(s26 1)
(s27 1)
(s28 1)
(s29 1)
(s30 1)
(s31 1)
(s32 1)
(s33 1)
(s34 1)
(s35 1)
(s36 1)
(s37 1)
(s38 1)
(s39 1)
(s40 1)
(s41 1)
(s42 1)
(s43 1)
(s44 1)
(s45 1)
(s46 1)
(s47 1)
(s48 1)
(s49 1)
(s50 1)
(s51 1)
(s52 1)
(s53 1)
(s54 1)
(s55 1)
(s56 1)
(s57 1)
(s58 1)
(s59 1)
(s60 1)
(s61 1)
(s62 1)
(s63 1)
(s64 1)
(s65 1)
(s66 1)
(s67 1)
(s68 1)
(s69 1)
(s70 1)
(s71 1)
(s72 1)
(s73 1)
(s74 1)
(s75 1)
(s76 1)
(s77 1)
(s78 1)
(s79 1)
(s80 1)
(s81 1)
(s82 1)
(s83 1)
(s84 1)
(s85 1)
(s86 1)
(s87 1)
(s88 1)
(s89 1)
(s90 1)
(s91 1)
(s92 1)
(s93 1)
(s94 1)
(s95 1)
(s96 1)
(s97 1)
(s98 1)
(s99 1)
(s100 1)
(s101 1)
(s102 1)
(s103 1)
(s104 1)
(s105 1)
(s106 1)
(s107 1)
(s108 1)
(s109 1)
(s110 1)
(s111 1)
(s112 1)
(s113 1)
(s114 1)
(s115 1)
(s116 1)
(s117 1)
(s118 1)
(s119 1)
(s120 1)
(s121 1)
(s122 1)
(s123 1)
(s124 1)
(s125 1)
(s126 1)
(s127 1)
(s128 1)
(s129 1)
(s130 1)
(s131 1)
(s132 1)
(s133 1)
(s134 1)
(s135 1)
(s136 1)
(s137 1)
(s138 1)
(s139 1)
(s140 1)
(s141 1)
(s142 1)
(s143 1)
(s144 1)
(s145 1)
(s146 1)
(s147 1)
(s148 1)
(s149 1)
(s150 1)
(s151 1)
(s152 1)
(s153 1)
(s154 1)
(s155 1)
(s156 1)
(s157 1)
(s158 1)
(s159 1)
(s160 1)
(s161 1)
(s162 1)
(s163 1)
(s164 1)
(s165 1)
(s166 1)
(s167 1)
(s168 1)
(s169 1)
(s170 1)
(s171 1)
(s172 1)
(s173 1)
(s174 1)
(s175 1)
(s176 1)
(s177 1)
(s178 1)
(s179 1)
(s180 1)
(s181 1)
(s182 1)
(s183 1)
(s184 1)
(s185 1)
(s186 1)
(s187 1)
(s188 1)
(s189 1)
(s190 1)
(s191 1)
(s192 1)
(s193 1)
(s194 1)
(s195 1)
(s196 1)
(s197 1)
(s198 1)
(s199 1)
(s200 1)
(s201 1)
(s202 1)
(s203 1)
(s204 1)
(s205 1)
(s206 1)
(s207 1)
(s208 1)
(s209 1)
(s210 1)
(s211 1)
(s212 1)
(s213 1)
(s214 1)
(s215 1)
(s216 1)
(s217 1)
(s218 1)
(s219 1)
(s220 1)
(s221 1)
(s222 1)
(s223 1)
(s224 1)
(s225 1)
(s226 1)
(s227 1)
(s228 1)
(s229 1)
(s230 1)
(s231 1)
(s232 1)
(s233 1)
(s234 1)
(s235 1)
(s236 1)
(s237 1)
(s238 1)
(s239 1)
(s240 1)
(s241 1)
(s242 1)
(s243 1)
(s244 1)
(s245 1)
(s246 1)
(s247 1)
(s248 1)
(s249 1)
(s250 1)
(s251 1)
(s252 1)
(s253 1)
(s254 1)
(s255 1)
(s256 1)
(s257 1)
(s258 1)
(s259 1)
(s260 1)
(s261 1)
(s262 1)
(s263 1)
(s264 1)
(s265 1)
(s266 1)
(s267 1)
(s268 1)
(s269 1)
(s270 1)
(s271 1)
(s272 1)
(s273 1)
(s274 1)
(s275 1)
(s276 1)
(s277 1)
(s278 1)
(s279 1)
(s280 1)
(s281 1)
(s282 1)
(s283 1)
(s284 1)
(s285 1)
(s286 1)
(s287 1)
(s288 1)
(s289 1)
(s290 1)
(s291 1)
(s292 1)
(s293 1)
(s294 1)
(s295 1)
(s296 1)
(s297 1)
(s298 1)
(s299 1)
(s300 1)
(s301 1)
(s302 1)
(s303 1)
(s304 1)
(s305 1)
(s306 1)
(s307 1)
(s308 1)
(s309 1)
(s310 1)
(s311 1)
(s312 1)
(s313 1)
(s314 1)
(s315 1)
(s316 1)
(s317 1)
(s318 1)
(s319 1)
(s320 1)
(s321 1)
(s322 1)
(s323 1)
(s324 1)
(s325 1)
(s326 1)
(s327 1)
(s328 1)
(s329 1)timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 971/3382 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 0/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60394ms problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 60397ms
Starting structural reductions in LTL mode, iteration 1 : 991/2640 places, 2391/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61647 ms. Remains : 991/2640 places, 2391/4040 transitions.
Stuttering acceptance computed with spot in 517 ms :[(OR (NOT p2) (NOT p3)), (NOT p1), (OR (NOT p2) (NOT p3)), (NOT p1), (AND (NOT p1) (NOT p3)), (NOT p3), (AND (NOT p1) (NOT p3)), (NOT p1), true, (NOT p1), (NOT p1), (AND (NOT p3) (NOT p1)), (AND (NOT p1) (NOT p3)), (AND (NOT p1) (NOT p3)), (NOT p3)]
Running random walk in product with property : BART-PT-020-LTLFireability-14
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA BART-PT-020-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BART-PT-020-LTLFireability-14 finished in 62196 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)||G((p1&&X(p2)))))'
Support contains 2 out of 2640 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2640/2640 places, 4040/4040 transitions.
Discarding 638 places :
Symmetric choice reduction at 0 with 638 rule applications. Total rules 638 place count 2002 transition count 3402
Iterating global reduction 0 with 638 rules applied. Total rules applied 1276 place count 2002 transition count 3402
Discarding 539 places :
Symmetric choice reduction at 0 with 539 rule applications. Total rules 1815 place count 1463 transition count 2863
Iterating global reduction 0 with 539 rules applied. Total rules applied 2354 place count 1463 transition count 2863
Discarding 79 places :
Symmetric choice reduction at 0 with 79 rule applications. Total rules 2433 place count 1384 transition count 2784
Iterating global reduction 0 with 79 rules applied. Total rules applied 2512 place count 1384 transition count 2784
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2571 place count 1325 transition count 2725
Iterating global reduction 0 with 59 rules applied. Total rules applied 2630 place count 1325 transition count 2725
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2689 place count 1266 transition count 2666
Iterating global reduction 0 with 59 rules applied. Total rules applied 2748 place count 1266 transition count 2666
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2807 place count 1207 transition count 2607
Iterating global reduction 0 with 59 rules applied. Total rules applied 2866 place count 1207 transition count 2607
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 2925 place count 1148 transition count 2548
Iterating global reduction 0 with 59 rules applied. Total rules applied 2984 place count 1148 transition count 2548
Discarding 59 places :
Symmetric choice reduction at 0 with 59 rule applications. Total rules 3043 place count 1089 transition count 2489
Iterating global reduction 0 with 59 rules applied. Total rules applied 3102 place count 1089 transition count 2489
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3141 place count 1050 transition count 2450
Iterating global reduction 0 with 39 rules applied. Total rules applied 3180 place count 1050 transition count 2450
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 3219 place count 1011 transition count 2411
Iterating global reduction 0 with 39 rules applied. Total rules applied 3258 place count 1011 transition count 2411
Discarding 20 places :
Symmetric choice reduction at 0 with 20 rule applications. Total rules 3278 place count 991 transition count 2391
Iterating global reduction 0 with 20 rules applied. Total rules applied 3298 place count 991 transition count 2391
Applied a total of 3298 rules in 551 ms. Remains 991 /2640 variables (removed 1649) and now considering 2391/4040 (removed 1649) transitions.
// Phase 1: matrix 2391 rows 991 cols
[2025-05-31 07:31:35] [INFO ] Computed 20 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:31:35] [INFO ] Implicit Places using invariants in 125 ms returned []
[2025-05-31 07:31:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-05-31 07:31:36] [INFO ] Implicit Places using invariants and state equation in 540 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 1671 sub problems to find dead transitions.
[2025-05-31 07:31:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 971/3382 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 1671/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1671 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 971/3382 variables, and 0 constraints, problems are : Problem set: 0 solved, 1671 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 0/20 constraints, State Equation: 0/991 constraints, PredecessorRefiner: 0/1671 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60376ms problems are : Problem set: 0 solved, 1671 unsolved
Search for dead transitions found 0 dead transitions in 60377ms
Starting structural reductions in LTL mode, iteration 1 : 991/2640 places, 2391/4040 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61597 ms. Remains : 991/2640 places, 2391/4040 transitions.
Stuttering acceptance computed with spot in 131 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (NOT p0)]
Running random walk in product with property : BART-PT-020-LTLFireability-15
Product exploration explored 100000 steps with 33 reset in 326 ms.
Product exploration explored 100000 steps with 20 reset in 340 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1)))]
Knowledge based reduction with 8 factoid took 300 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0)]
RANDOM walk for 22565 steps (5 resets) in 102 ms. (219 steps per ms) remains 0/1 properties
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0)]
Knowledge based reduction with 8 factoid took 279 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 3 states, 3 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 94 ms :[(NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), (NOT p0)]
[2025-05-31 07:32:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-05-31 07:32:38] [INFO ] [Real]Absence check using 20 positive place invariants in 2 ms returned unsat
Proved EG (NOT p0)
Knowledge obtained : [(AND (NOT p0) p1 (NOT p2)), (X (NOT p2)), (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) p1 p2))), (X (NOT p0)), (X p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p1 p2))))]
False Knowledge obtained : [(X (X (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))))), (X (X p0)), (X (X (NOT p0))), (X (X p1)), (X (X (NOT p1))), (F p0), (G (NOT p0))]
Property proved to be false thanks to negative knowledge :(G (NOT p0))
Knowledge based reduction with 8 factoid took 345 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA BART-PT-020-LTLFireability-15 FALSE TECHNIQUES KNOWLEDGE
Treatment of property BART-PT-020-LTLFireability-15 finished in 64474 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(X(X(X(p1))))))))'
[2025-05-31 07:32:39] [INFO ] Flatten gal took : 56 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin16177565155983176725
[2025-05-31 07:32:39] [INFO ] Too many transitions (4040) to apply POR reductions. Disabling POR matrices.
[2025-05-31 07:32:39] [INFO ] Applying decomposition
[2025-05-31 07:32:39] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16177565155983176725
Running compilation step : cd /tmp/ltsmin16177565155983176725;'/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-05-31 07:32:39] [INFO ] Flatten gal took : 57 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/graph13921486602106388048.txt' '-o' '/tmp/graph13921486602106388048.bin' '-w' '/tmp/graph13921486602106388048.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph13921486602106388048.bin' '-l' '-1' '-v' '-w' '/tmp/graph13921486602106388048.weights' '-q' '0' '-e' '0.001'
[2025-05-31 07:32:39] [INFO ] Decomposing Gal with order
[2025-05-31 07:32:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-05-31 07:32:40] [INFO ] Removed a total of 423 redundant transitions.
[2025-05-31 07:32:40] [INFO ] Flatten gal took : 142 ms
[2025-05-31 07:32:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 12 ms.
[2025-05-31 07:32:41] [INFO ] Time to serialize gal into /tmp/LTLFireability387439477711810913.gal : 21 ms
[2025-05-31 07:32:41] [INFO ] Time to serialize properties into /tmp/LTLFireability9655129574342401117.ltl : 5 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/LTLFireability387439477711810913.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9655129574342401117.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((G(F("((((((((((((i18.i0.u53.TrainState_6_1_7==1)||(i17.i0.u561.TrainState_9_1_27==1))||((i19.i8.u51.TrainState_2_1_9==1)||(i19.i...102769
Formula 0 simplified : G(FG!"((((((((((((i18.i0.u53.TrainState_6_1_7==1)||(i17.i0.u561.TrainState_9_1_27==1))||((i19.i8.u51.TrainState_2_1_9==1)||(i19.i8.u...102751
Reverse transition relation is exact ! Faster fixpoint algorithm enabled.
Compilation finished in 10510 ms.
Running link step : cd /tmp/ltsmin16177565155983176725;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin16177565155983176725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(X(X((LTLAPp1==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( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.049: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.049: LTL layer: formula: <>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(X(X((LTLAPp1==true))))))))
pins2lts-mc-linux64( 4/ 8), 0.052: "<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(X(X((LTLAPp1==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 4/ 8), 0.054: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.055: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.060: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.066: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.069: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.082: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 3.098: DFS-FIFO for weak LTL, using special progress label 4043
pins2lts-mc-linux64( 0/ 8), 3.098: There are 4044 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 3.098: State length is 2641, there are 4057 groups
pins2lts-mc-linux64( 0/ 8), 3.098: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 3.098: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 3.098: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 3.098: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 4.256: ~2 levels ~960 states ~55424 transitions
pins2lts-mc-linux64( 1/ 8), 10.368: ~2 levels ~1920 states ~693016 transitions
pins2lts-mc-linux64( 1/ 8), 20.541: ~2 levels ~3840 states ~1950784 transitions
pins2lts-mc-linux64( 1/ 8), 39.950: ~2 levels ~7680 states ~4460592 transitions
pins2lts-mc-linux64( 1/ 8), 78.469: ~2 levels ~15360 states ~9485424 transitions
pins2lts-mc-linux64( 1/ 8), 155.030: ~2 levels ~30720 states ~19530144 transitions
pins2lts-mc-linux64( 1/ 8), 310.080: ~2 levels ~61440 states ~39607224 transitions
pins2lts-mc-linux64( 4/ 8), 619.991: ~2 levels ~122880 states ~79936384 transitions
pins2lts-mc-linux64( 6/ 8), 1236.564: ~2 levels ~245760 states ~157934752 transitions
pins2lts-mc-linux64( 4/ 8), 1389.096: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1392.117:
pins2lts-mc-linux64( 0/ 8), 1392.117: mean standard work distribution: 0.7% (states) 0.7% (transitions)
pins2lts-mc-linux64( 0/ 8), 1392.117:
pins2lts-mc-linux64( 0/ 8), 1392.117: Explored 274044 states 177663234 transitions, fanout: 648.302
pins2lts-mc-linux64( 0/ 8), 1392.117: Total exploration time 1389.010 sec (1385.990 sec minimum, 1386.834 sec on average)
pins2lts-mc-linux64( 0/ 8), 1392.117: States per second: 197, Transitions per second: 127906
pins2lts-mc-linux64( 0/ 8), 1392.117:
pins2lts-mc-linux64( 0/ 8), 1392.117: Progress states detected: 69017522
pins2lts-mc-linux64( 0/ 8), 1392.117: Redundant explorations: -99.6029
pins2lts-mc-linux64( 0/ 8), 1392.117:
pins2lts-mc-linux64( 0/ 8), 1392.117: Queue width: 8B, total height: 101881726, memory: 777.30MB
pins2lts-mc-linux64( 0/ 8), 1392.117: Tree memory: 782.6MB, 11.9 B/state, compr.: 0.1%
pins2lts-mc-linux64( 0/ 8), 1392.117: Tree fill ratio (roots/leafs): 51.0%/100.0%
pins2lts-mc-linux64( 0/ 8), 1392.118: Stored 4241 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1392.118: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1392.118: Est. total memory use: 1559.9MB (~1801.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16177565155983176725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(X(X((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin16177565155983176725;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X(X(X((LTLAPp1==true))))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)

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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202505121319.jar
++ perl -pe 's/.*\.//g'
+ 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