Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 464K
-rw-r--r-- 1 mcc users 7.4K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 74K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:33 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:33 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 56K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:33 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:33 instance
-rw-r--r-- 1 mcc users 6 May 29 14:33 iscolored
-rwxr-xr-x 1 mcc users 24K May 29 14:33 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 TCPcondis-PT-25-LTLFireability-00
FORMULA_NAME TCPcondis-PT-25-LTLFireability-01
FORMULA_NAME TCPcondis-PT-25-LTLFireability-02
FORMULA_NAME TCPcondis-PT-25-LTLFireability-03
FORMULA_NAME TCPcondis-PT-25-LTLFireability-04
FORMULA_NAME TCPcondis-PT-25-LTLFireability-05
FORMULA_NAME TCPcondis-PT-25-LTLFireability-06
FORMULA_NAME TCPcondis-PT-25-LTLFireability-07
FORMULA_NAME TCPcondis-PT-25-LTLFireability-08
FORMULA_NAME TCPcondis-PT-25-LTLFireability-09
FORMULA_NAME TCPcondis-PT-25-LTLFireability-10
FORMULA_NAME TCPcondis-PT-25-LTLFireability-11
FORMULA_NAME TCPcondis-PT-25-LTLFireability-12
FORMULA_NAME TCPcondis-PT-25-LTLFireability-13
FORMULA_NAME TCPcondis-PT-25-LTLFireability-14
FORMULA_NAME TCPcondis-PT-25-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1749194069375

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=TCPcondis-PT-25
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-06 07:14:30] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-06 07:14:30] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-06 07:14:30] [WARNING] Skipping unknown tool specific annotation: Tina
[2025-06-06 07:14:30] [WARNING] Unknown XML tag in source file: size
[2025-06-06 07:14:30] [WARNING] Unknown XML tag in source file: color
[2025-06-06 07:14:30] [INFO ] Load time of PNML (sax parser for PT used): 49 ms
[2025-06-06 07:14:30] [INFO ] Transformed 30 places.
[2025-06-06 07:14:30] [INFO ] Transformed 32 transitions.
[2025-06-06 07:14:31] [INFO ] Parsed PT model containing 30 places and 32 transitions and 108 arcs in 154 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA TCPcondis-PT-25-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA TCPcondis-PT-25-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 8 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:31] [INFO ] Computed 9 invariants in 10 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:31] [INFO ] Implicit Places using invariants in 181 ms returned []
[2025-06-06 07:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:31] [INFO ] Implicit Places using invariants and state equation in 85 ms returned []
Implicit Place search using SMT with State Equation took 321 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:31] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 694 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 625 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1353ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 1365ms
Finished structural reductions in LTL mode , in 1 iterations and 1717 ms. Remains : 30/30 places, 32/32 transitions.
Support contains 26 out of 30 places after structural reductions.
[2025-06-06 07:14:33] [INFO ] Flatten gal took : 18 ms
[2025-06-06 07:14:33] [INFO ] Flatten gal took : 7 ms
[2025-06-06 07:14:33] [INFO ] Input system was already deterministic with 32 transitions.
Reduction of identical properties reduced properties to check from 25 to 21
RANDOM walk for 40056 steps (8 resets) in 259 ms. (154 steps per ms) remains 1/21 properties
BEST_FIRST walk for 1055 steps (0 resets) in 12 ms. (81 steps per ms) remains 0/1 properties
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U p1))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 25 transition count 27
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 21 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2025-06-06 07:14:33] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:33] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-06 07:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:33] [INFO ] Implicit Places using invariants and state equation in 43 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:33] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-06 07:14:33] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 317 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 597ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 597ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 699 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 233 ms :[(NOT p1), p0]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-00
Product exploration explored 100000 steps with 0 reset in 365 ms.
Stack based approach found an accepted trace after 11888 steps with 0 reset with depth 11889 and stack size 11886 in 34 ms.
FORMULA TCPcondis-PT-25-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-00 finished in 1471 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||G(p1)))))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 25 transition count 27
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 25 transition count 27
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 25 transition count 25
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 12 place count 25 transition count 23
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 16 place count 23 transition count 23
Applied a total of 16 rules in 11 ms. Remains 23 /30 variables (removed 7) and now considering 23/32 (removed 9) transitions.
// Phase 1: matrix 23 rows 23 cols
[2025-06-06 07:14:35] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:35] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 07:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:35] [INFO ] Implicit Places using invariants and state equation in 48 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:35] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-06 07:14:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/46 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 46/46 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 270 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (OVERLAPS) 23/46 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/46 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (OVERLAPS) 0/46 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 46/46 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 337 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 614ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 614ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 712 ms. Remains : 23/30 places, 23/32 transitions.
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-01
Product exploration explored 100000 steps with 13945 reset in 260 ms.
Stack based approach found an accepted trace after 5140 steps with 681 reset with depth 11 and stack size 11 in 15 ms.
FORMULA TCPcondis-PT-25-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-01 finished in 1107 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(G(p0))&&(F((F(p2)&&p1))||X(p2)))))'
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:36] [INFO ] Computed 9 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:36] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 07:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:36] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 449 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 937ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 937ms
Finished structural reductions in LTL mode , in 1 iterations and 1013 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 233 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-02
Product exploration explored 100000 steps with 0 reset in 232 ms.
Product exploration explored 100000 steps with 1 reset in 319 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 111 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 196 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 4404 steps (0 resets) in 25 ms. (169 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F p1), (F (NOT (OR (NOT p1) p2))), (F p2)]
Knowledge based reduction with 9 factoid took 270 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 225 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
[2025-06-06 07:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-06 07:14:39] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-06 07:14:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-06 07:14:39] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 4 ms.
[2025-06-06 07:14:39] [INFO ] Added : 18 causal constraints over 4 iterations in 28 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-06 07:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:39] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-06 07:14:39] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:39] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-06 07:14:39] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-06 07:14:39] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-06 07:14:39] [INFO ] Added : 24 causal constraints over 5 iterations in 27 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:39] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 07:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:39] [INFO ] Implicit Places using invariants and state equation in 42 ms returned []
Implicit Place search using SMT with State Equation took 75 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 932ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 934ms
Finished structural reductions in LTL mode , in 1 iterations and 1009 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 132 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
RANDOM walk for 3953 steps (0 resets) in 12 ms. (304 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (AND (NOT p1) (NOT p2))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) (NOT p2)))), (F p0), (F p1), (F (NOT (OR (NOT p1) p2))), (F p2)]
Knowledge based reduction with 9 factoid took 291 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 5 states, 10 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 199 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 192 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
[2025-06-06 07:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Real]Absence check using state equation in 12 ms returned sat
[2025-06-06 07:14:41] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 2 ms.
[2025-06-06 07:14:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 2 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Nat]Absence check using state equation in 12 ms returned sat
[2025-06-06 07:14:41] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-06 07:14:41] [INFO ] Added : 18 causal constraints over 4 iterations in 21 ms. Result :sat
Could not prove EG (NOT p2)
[2025-06-06 07:14:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:41] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Real]Absence check using 3 positive and 6 generalized place invariants in 3 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Real]Absence check using state equation in 11 ms returned sat
[2025-06-06 07:14:41] [INFO ] Solution in real domain found non-integer solution.
Starting Z3 with timeout 15.0 s and query timeout 1500.0 ms
[2025-06-06 07:14:41] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Nat]Absence check using 3 positive and 6 generalized place invariants in 4 ms returned sat
[2025-06-06 07:14:41] [INFO ] [Nat]Absence check using state equation in 14 ms returned sat
[2025-06-06 07:14:41] [INFO ] Computed and/alt/rep : 28/100/28 causal constraints (skipped 0 transitions) in 1 ms.
[2025-06-06 07:14:41] [INFO ] Added : 24 causal constraints over 5 iterations in 24 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 247 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 0 reset in 223 ms.
Product exploration explored 100000 steps with 0 reset in 290 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 216 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (AND (NOT p2) (NOT p1)), (NOT p2), (OR (NOT p1) (NOT p2))]
Support contains 5 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 30 transition count 32
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 29 transition count 31
Deduced a syphon composed of 2 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 29 transition count 29
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 29 transition count 31
Deduced a syphon composed of 4 places in 0 ms
Applied a total of 8 rules in 10 ms. Remains 29 /30 variables (removed 1) and now considering 31/32 (removed 1) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:42] [INFO ] Redundant transitions in 0 ms returned []
Running 29 sub problems to find dead transitions.
// Phase 1: matrix 31 rows 29 cols
[2025-06-06 07:14:42] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/29 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/29 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 29 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD16 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD21 is UNSAT
At refinement iteration 3 (OVERLAPS) 31/60 variables, 29/38 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/60 variables, 0/38 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/60 variables, 0/38 constraints. Problems are: Problem set: 6 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 60/60 variables, and 38 constraints, problems are : Problem set: 6 solved, 23 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 29/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 4/4 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 0/4 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 2 (OVERLAPS) 3/28 variables, 2/6 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/28 variables, 1/7 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/28 variables, 0/7 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 1/29 variables, 2/9 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 7 (OVERLAPS) 31/60 variables, 29/38 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/60 variables, 23/61 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/60 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 23 unsolved
At refinement iteration 10 (OVERLAPS) 0/60 variables, 0/61 constraints. Problems are: Problem set: 6 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 60/60 variables, and 61 constraints, problems are : Problem set: 6 solved, 23 unsolved in 363 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 29/29 constraints, PredecessorRefiner: 23/29 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 649ms problems are : Problem set: 6 solved, 23 unsolved
Search for dead transitions found 6 dead transitions in 649ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 29/30 places, 25/32 transitions.
Graph (complete) has 65 edges and 29 vertex of which 25 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Discarding 4 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 6 ms. Remains 25 /29 variables (removed 4) and now considering 25/25 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 674 ms. Remains : 25/30 places, 25/32 transitions.
Built C files in :
/tmp/ltsmin5864473062428829590
[2025-06-06 07:14:43] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5864473062428829590
Running compilation step : cd /tmp/ltsmin5864473062428829590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 537 ms.
Running link step : cd /tmp/ltsmin5864473062428829590;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin5864473062428829590;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14304361155030213175.hoa' '--buchi-type=spotba'
LTSmin run took 424 ms.
FORMULA TCPcondis-PT-25-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLFireability-02 finished in 8523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X((p0&&X((G(F(!p2))||p1))))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:44] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:44] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:44] [INFO ] Implicit Places using invariants and state equation in 44 ms returned []
Implicit Place search using SMT with State Equation took 81 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:44] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 424 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 933ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 935ms
Finished structural reductions in LTL mode , in 1 iterations and 1017 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 396 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-03
Product exploration explored 100000 steps with 16666 reset in 90 ms.
Product exploration explored 100000 steps with 16666 reset in 93 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))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 115 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 382 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 34241 steps (7 resets) in 55 ms. (611 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT p0)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 185 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 409 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Stuttering acceptance computed with spot in 385 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 2 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
[2025-06-06 07:14:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:47] [INFO ] Implicit Places using invariants in 33 ms returned []
[2025-06-06 07:14:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:47] [INFO ] Implicit Places using invariants and state equation in 39 ms returned []
Implicit Place search using SMT with State Equation took 83 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 894ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 894ms
Finished structural reductions in LTL mode , in 1 iterations and 980 ms. Remains : 30/30 places, 32/32 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 87 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 378 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Reduction of identical properties reduced properties to check from 4 to 3
RANDOM walk for 30867 steps (6 resets) in 44 ms. (685 steps per ms) remains 0/3 properties
Knowledge obtained : [(AND p0 p1 (NOT p2))]
False Knowledge obtained : [(F (NOT p1)), (F p2), (F (NOT p0)), (F (NOT (OR p1 (NOT p2))))]
Knowledge based reduction with 1 factoid took 193 ms. Reduced automaton from 9 states, 12 edges and 3 AP (stutter sensitive) to 9 states, 12 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 366 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Stuttering acceptance computed with spot in 333 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Stuttering acceptance computed with spot in 424 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Product exploration explored 100000 steps with 16666 reset in 92 ms.
Product exploration explored 100000 steps with 16666 reset in 93 ms.
Applying partial POR strategy [false, false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), (OR (NOT p0) (AND (NOT p1) p2)), true, (AND (NOT p1) p2), p2, p2]
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 30 transition count 32
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 5 place count 28 transition count 30
Deduced a syphon composed of 3 places in 1 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 7 place count 28 transition count 30
Deduced a syphon composed of 3 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 9 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 9 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Iterating global reduction 0 with 2 rules applied. Total rules applied 11 place count 28 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 11 rules in 11 ms. Remains 28 /30 variables (removed 2) and now considering 30/32 (removed 2) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:51] [INFO ] Redundant transitions in 0 ms returned []
Running 28 sub problems to find dead transitions.
// Phase 1: matrix 30 rows 28 cols
[2025-06-06 07:14:51] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
Problem TDEAD2 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD18 is UNSAT
At refinement iteration 3 (OVERLAPS) 30/58 variables, 28/37 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/58 variables, 0/37 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 0/58 variables, 0/37 constraints. Problems are: Problem set: 7 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 58/58 variables, and 37 constraints, problems are : Problem set: 7 solved, 21 unsolved in 229 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/23 variables, 2/2 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/23 variables, 0/2 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 3/26 variables, 3/5 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/26 variables, 2/7 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/26 variables, 0/7 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 2/28 variables, 2/9 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/28 variables, 0/9 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 30/58 variables, 28/37 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/58 variables, 21/58 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/58 variables, 0/58 constraints. Problems are: Problem set: 7 solved, 21 unsolved
At refinement iteration 10 (OVERLAPS) 0/58 variables, 0/58 constraints. Problems are: Problem set: 7 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 58/58 variables, and 58 constraints, problems are : Problem set: 7 solved, 21 unsolved in 371 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 28/28 constraints, PredecessorRefiner: 21/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 605ms problems are : Problem set: 7 solved, 21 unsolved
Search for dead transitions found 7 dead transitions in 605ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 28/30 places, 23/32 transitions.
Graph (complete) has 62 edges and 28 vertex of which 23 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.0 ms
Discarding 5 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 2 ms. Remains 23 /28 variables (removed 5) and now considering 23/23 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 23/30 places, 23/32 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 624 ms. Remains : 23/30 places, 23/32 transitions.
Built C files in :
/tmp/ltsmin17577610555578707263
[2025-06-06 07:14:51] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17577610555578707263
Running compilation step : cd /tmp/ltsmin17577610555578707263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 100 ms.
Running link step : cd /tmp/ltsmin17577610555578707263;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin17577610555578707263;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3918577011486942897.hoa' '--buchi-type=spotba'
LTSmin run took 1739 ms.
FORMULA TCPcondis-PT-25-LTLFireability-03 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLFireability-03 finished in 9169 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 4 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 26 transition count 28
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 24 transition count 26
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 24 transition count 26
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 13 place count 24 transition count 25
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 13 place count 24 transition count 24
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 15 place count 23 transition count 24
Applied a total of 15 rules in 5 ms. Remains 23 /30 variables (removed 7) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 23 cols
[2025-06-06 07:14:53] [INFO ] Computed 9 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:53] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:53] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:53] [INFO ] Redundant transitions in 0 ms returned []
Running 21 sub problems to find dead transitions.
[2025-06-06 07:14:53] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 24/47 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 0/47 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 47/47 variables, and 32 constraints, problems are : Problem set: 0 solved, 21 unsolved in 274 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 21 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/22 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/22 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 1/23 variables, 3/8 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/23 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/23 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 5 (OVERLAPS) 24/47 variables, 23/32 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/47 variables, 21/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 0/47 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 47/47 variables, and 53 constraints, problems are : Problem set: 0 solved, 21 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 23/23 constraints, PredecessorRefiner: 21/21 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 583ms problems are : Problem set: 0 solved, 21 unsolved
Search for dead transitions found 0 dead transitions in 583ms
Starting structural reductions in SI_LTL mode, iteration 1 : 23/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 667 ms. Remains : 23/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-04
Product exploration explored 100000 steps with 0 reset in 209 ms.
Stack based approach found an accepted trace after 18877 steps with 0 reset with depth 18878 and stack size 18878 in 39 ms.
FORMULA TCPcondis-PT-25-LTLFireability-04 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-04 finished in 977 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0 U p1)))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 28 transition count 28
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 6 place count 28 transition count 26
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 10 place count 26 transition count 26
Applied a total of 10 rules in 5 ms. Remains 26 /30 variables (removed 4) and now considering 26/32 (removed 6) transitions.
// Phase 1: matrix 26 rows 26 cols
[2025-06-06 07:14:54] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:54] [INFO ] Implicit Places using invariants in 39 ms returned []
[2025-06-06 07:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:54] [INFO ] Implicit Places using invariants and state equation in 36 ms returned []
Implicit Place search using SMT with State Equation took 77 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:54] [INFO ] Redundant transitions in 1 ms returned []
Running 24 sub problems to find dead transitions.
[2025-06-06 07:14:54] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 26/52 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (OVERLAPS) 0/52 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Real declared 52/52 variables, and 35 constraints, problems are : Problem set: 0 solved, 24 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 24 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 3 (OVERLAPS) 26/52 variables, 26/35 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/52 variables, 24/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/52 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
At refinement iteration 6 (OVERLAPS) 0/52 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 24 unsolved
No progress, stopping.
After SMT solving in domain Int declared 52/52 variables, and 59 constraints, problems are : Problem set: 0 solved, 24 unsolved in 307 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 26/26 constraints, PredecessorRefiner: 24/24 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 549ms problems are : Problem set: 0 solved, 24 unsolved
Search for dead transitions found 0 dead transitions in 549ms
Starting structural reductions in SI_LTL mode, iteration 1 : 26/30 places, 26/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 636 ms. Remains : 26/30 places, 26/32 transitions.
Stuttering acceptance computed with spot in 94 ms :[(NOT p1), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-05
Entered a terminal (fully accepting) state of product in 47 steps with 0 reset in 1 ms.
FORMULA TCPcondis-PT-25-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-05 finished in 752 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(p1)&&X(((F(p2) U p3)&&X(F(p4))))&&p0)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 1 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:55] [INFO ] Computed 9 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:55] [INFO ] Implicit Places using invariants in 35 ms returned []
[2025-06-06 07:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:55] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 74 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:55] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 451 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 495 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 953ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 953ms
Finished structural reductions in LTL mode , in 1 iterations and 1029 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 393 ms :[(OR (NOT p3) (NOT p1) (NOT p0) (NOT p4)), (OR (NOT p3) (NOT p1) (NOT p0) (NOT p4)), true, (NOT p1), (OR (NOT p3) (NOT p4)), (NOT p2), (NOT p3), (NOT p4)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-07 finished in 1449 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((!p0 U (F(!p2)&&p1))||G(p3)))'
Support contains 6 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 27 transition count 29
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 26 transition count 28
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 26 transition count 28
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 26 transition count 26
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 10 place count 26 transition count 24
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 24 transition count 24
Applied a total of 14 rules in 7 ms. Remains 24 /30 variables (removed 6) and now considering 24/32 (removed 8) transitions.
// Phase 1: matrix 24 rows 24 cols
[2025-06-06 07:14:57] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:57] [INFO ] Implicit Places using invariants in 31 ms returned []
[2025-06-06 07:14:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:57] [INFO ] Implicit Places using invariants and state equation in 32 ms returned []
Implicit Place search using SMT with State Equation took 64 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:57] [INFO ] Redundant transitions in 0 ms returned []
Running 22 sub problems to find dead transitions.
[2025-06-06 07:14:57] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (OVERLAPS) 0/48 variables, 0/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Real declared 48/48 variables, and 33 constraints, problems are : Problem set: 0 solved, 22 unsolved in 199 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 22 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/24 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/24 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/24 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 3 (OVERLAPS) 24/48 variables, 24/33 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/48 variables, 22/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
At refinement iteration 6 (OVERLAPS) 0/48 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 22 unsolved
No progress, stopping.
After SMT solving in domain Int declared 48/48 variables, and 55 constraints, problems are : Problem set: 0 solved, 22 unsolved in 279 ms.
Refiners :[Positive P Invariants (semi-flows): 2/2 constraints, Generalized P Invariants (flows): 7/7 constraints, State Equation: 24/24 constraints, PredecessorRefiner: 22/22 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 481ms problems are : Problem set: 0 solved, 22 unsolved
Search for dead transitions found 0 dead transitions in 481ms
Starting structural reductions in SI_LTL mode, iteration 1 : 24/30 places, 24/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 557 ms. Remains : 24/30 places, 24/32 transitions.
Stuttering acceptance computed with spot in 221 ms :[true, (OR (NOT p1) p2), (NOT p3), (OR (AND (NOT p1) (NOT p3)) (AND p2 (NOT p3))), p2, (AND p2 (NOT p3))]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-08
Product exploration explored 100000 steps with 4283 reset in 176 ms.
Stack based approach found an accepted trace after 5454 steps with 234 reset with depth 12 and stack size 12 in 28 ms.
FORMULA TCPcondis-PT-25-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-08 finished in 999 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(X(X(X(G(p0)))))))))'
Support contains 1 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 3 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:14:58] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:58] [INFO ] Implicit Places using invariants in 34 ms returned []
[2025-06-06 07:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:58] [INFO ] Implicit Places using invariants and state equation in 35 ms returned []
Implicit Place search using SMT with State Equation took 71 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:14:58] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 394 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 497 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 895ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 895ms
Finished structural reductions in LTL mode , in 1 iterations and 969 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 355 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-09
Entered a terminal (fully accepting) state of product in 7 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-09 finished in 1346 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||G(F((G(!p1)||(!p1&&F(!p2)))))))))'
Support contains 7 out of 30 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 28 transition count 30
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 27 transition count 29
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 27 transition count 29
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 27 transition count 27
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 8 place count 27 transition count 25
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 12 place count 25 transition count 25
Applied a total of 12 rules in 4 ms. Remains 25 /30 variables (removed 5) and now considering 25/32 (removed 7) transitions.
// Phase 1: matrix 25 rows 25 cols
[2025-06-06 07:14:59] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:59] [INFO ] Implicit Places using invariants in 29 ms returned []
[2025-06-06 07:14:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:14:59] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:14:59] [INFO ] Redundant transitions in 1 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 07:14:59] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 231 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 283 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 518ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 518ms
Starting structural reductions in SI_LTL mode, iteration 1 : 25/30 places, 25/32 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 595 ms. Remains : 25/30 places, 25/32 transitions.
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) p1), (AND p1 (NOT p0)), (AND p1 (NOT p0) p2)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-12
Product exploration explored 100000 steps with 1248 reset in 197 ms.
Product exploration explored 100000 steps with 1182 reset in 256 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 213 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
RANDOM walk for 35967 steps (7 resets) in 66 ms. (536 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p1) (NOT p0) (NOT p2)), (X (NOT p2)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p2 (NOT p1) (NOT p0)))), (X (NOT p0)), (X (NOT p1)), (X (NOT (AND p2 p1 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p2 (NOT p1) (NOT p0))))), (X (X (NOT p1))), (X (X (NOT (AND p2 p1 (NOT p0)))))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p2) p0 p1))), (F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 454 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Support contains 7 out of 25 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 25/25 places, 25/25 transitions.
Applied a total of 0 rules in 3 ms. Remains 25 /25 variables (removed 0) and now considering 25/25 (removed 0) transitions.
[2025-06-06 07:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:15:01] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-06 07:15:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:15:01] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 68 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-06 07:15:01] [INFO ] Redundant transitions in 0 ms returned []
Running 23 sub problems to find dead transitions.
[2025-06-06 07:15: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/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (OVERLAPS) 0/50 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Real declared 50/50 variables, and 34 constraints, problems are : Problem set: 0 solved, 23 unsolved in 217 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 23 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/25 variables, 6/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 3 (OVERLAPS) 25/50 variables, 25/34 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/50 variables, 23/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
At refinement iteration 6 (OVERLAPS) 0/50 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 23 unsolved
No progress, stopping.
After SMT solving in domain Int declared 50/50 variables, and 57 constraints, problems are : Problem set: 0 solved, 23 unsolved in 309 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 25/25 constraints, PredecessorRefiner: 23/23 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 530ms problems are : Problem set: 0 solved, 23 unsolved
Search for dead transitions found 0 dead transitions in 530ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 605 ms. Remains : 25/25 places, 25/25 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0)))]
Knowledge based reduction with 12 factoid took 216 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
RANDOM walk for 22773 steps (4 resets) in 38 ms. (583 steps per ms) remains 0/6 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0) p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p2 (NOT p0) (NOT p1)))), (X (NOT p0)), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p2 (NOT p0) (NOT p1))))), (X (X (NOT p1)))]
False Knowledge obtained : [(X (X p0)), (X (X (NOT p0))), (F p0), (F (NOT (OR (NOT p2) p0 p1))), (F p1), (F p2), (F (NOT (OR p0 (NOT p1)))), (F (NOT (OR (NOT p2) p0 (NOT p1))))]
Knowledge based reduction with 12 factoid took 455 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p1), (AND (NOT p0) p1), (AND (NOT p0) p1 p2)]
Product exploration explored 100000 steps with 1233 reset in 209 ms.
Product exploration explored 100000 steps with 1202 reset in 208 ms.
Built C files in :
/tmp/ltsmin2187985406236801170
[2025-06-06 07:15:03] [INFO ] Computing symmetric may disable matrix : 25 transitions.
[2025-06-06 07:15:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:15:03] [INFO ] Computing symmetric may enable matrix : 25 transitions.
[2025-06-06 07:15:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:15:03] [INFO ] Computing Do-Not-Accords matrix : 25 transitions.
[2025-06-06 07:15:03] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-06 07:15:04] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2187985406236801170
Running compilation step : cd /tmp/ltsmin2187985406236801170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 103 ms.
Running link step : cd /tmp/ltsmin2187985406236801170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2187985406236801170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased2123345443365855888.hoa' '--buchi-type=spotba'
LTSmin run took 372 ms.
FORMULA TCPcondis-PT-25-LTLFireability-12 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property TCPcondis-PT-25-LTLFireability-12 finished in 5105 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)) U (p0&&X(X(F(p1))))))'
Support contains 3 out of 30 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 30/30 places, 32/32 transitions.
Applied a total of 0 rules in 0 ms. Remains 30 /30 variables (removed 0) and now considering 32/32 (removed 0) transitions.
// Phase 1: matrix 32 rows 30 cols
[2025-06-06 07:15:04] [INFO ] Computed 9 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:15:04] [INFO ] Implicit Places using invariants in 30 ms returned []
[2025-06-06 07:15:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-06 07:15:04] [INFO ] Implicit Places using invariants and state equation in 37 ms returned []
Implicit Place search using SMT with State Equation took 69 ms to find 0 implicit places.
Running 28 sub problems to find dead transitions.
[2025-06-06 07:15:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (OVERLAPS) 0/62 variables, 0/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Real declared 62/62 variables, and 39 constraints, problems are : Problem set: 0 solved, 28 unsolved in 405 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 28 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/28 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/28 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 2 (OVERLAPS) 1/29 variables, 3/6 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/29 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 5 (OVERLAPS) 1/30 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/30 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 7 (OVERLAPS) 32/62 variables, 30/39 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/62 variables, 28/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
At refinement iteration 10 (OVERLAPS) 0/62 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 28 unsolved
No progress, stopping.
After SMT solving in domain Int declared 62/62 variables, and 67 constraints, problems are : Problem set: 0 solved, 28 unsolved in 454 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, Generalized P Invariants (flows): 6/6 constraints, State Equation: 30/30 constraints, PredecessorRefiner: 28/28 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 865ms problems are : Problem set: 0 solved, 28 unsolved
Search for dead transitions found 0 dead transitions in 865ms
Finished structural reductions in LTL mode , in 1 iterations and 935 ms. Remains : 30/30 places, 32/32 transitions.
Stuttering acceptance computed with spot in 204 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : TCPcondis-PT-25-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA TCPcondis-PT-25-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property TCPcondis-PT-25-LTLFireability-15 finished in 1158 ms.
All properties solved by simple procedures.
Total runtime 34850 ms.

BK_STOP 1749194105759

--------------------
content from stderr:

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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