Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 812K
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 29 14:32 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.1K May 29 14:32 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.5K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 70K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 109K 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.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 362K May 29 14:32 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-00
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-01
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-02
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-03
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-04
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-05
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-06
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-07
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-08
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-09
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-10
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-11
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-12
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-13
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-14
FORMULA_NAME NoC3x3-PT-1B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748814253110

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=NoC3x3-PT-1B
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-01 21:44:14] [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-01 21:44:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-01 21:44:14] [INFO ] Load time of PNML (sax parser for PT used): 114 ms
[2025-06-01 21:44:14] [INFO ] Transformed 1416 places.
[2025-06-01 21:44:14] [INFO ] Transformed 1640 transitions.
[2025-06-01 21:44:14] [INFO ] Found NUPN structural information;
[2025-06-01 21:44:14] [INFO ] Parsed PT model containing 1416 places and 1640 transitions and 3639 arcs in 221 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA NoC3x3-PT-1B-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-1B-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 37 out of 1416 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1416/1416 places, 1640/1640 transitions.
Discarding 345 places :
Symmetric choice reduction at 0 with 345 rule applications. Total rules 345 place count 1071 transition count 1295
Iterating global reduction 0 with 345 rules applied. Total rules applied 690 place count 1071 transition count 1295
Discarding 191 places :
Symmetric choice reduction at 0 with 191 rule applications. Total rules 881 place count 880 transition count 1104
Iterating global reduction 0 with 191 rules applied. Total rules applied 1072 place count 880 transition count 1104
Ensure Unique test removed 76 transitions
Reduce isomorphic transitions removed 76 transitions.
Iterating post reduction 0 with 76 rules applied. Total rules applied 1148 place count 880 transition count 1028
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 1184 place count 844 transition count 992
Iterating global reduction 1 with 36 rules applied. Total rules applied 1220 place count 844 transition count 992
Ensure Unique test removed 17 transitions
Reduce isomorphic transitions removed 17 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 1237 place count 844 transition count 975
Applied a total of 1237 rules in 294 ms. Remains 844 /1416 variables (removed 572) and now considering 975/1640 (removed 665) transitions.
// Phase 1: matrix 975 rows 844 cols
[2025-06-01 21:44:15] [INFO ] Computed 40 invariants in 38 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:15] [INFO ] Implicit Places using invariants in 458 ms returned []
[2025-06-01 21:44:15] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:16] [INFO ] Implicit Places using invariants and state equation in 537 ms returned []
Implicit Place search using SMT with State Equation took 1028 ms to find 0 implicit places.
Running 974 sub problems to find dead transitions.
[2025-06-01 21:44:16] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
At refinement iteration 0 (INCLUDED_ONLY) 0/843 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 974 unsolved
SMT process timed out in 30230ms, After SMT, problems are : Problem set: 0 solved, 974 unsolved
Search for dead transitions found 0 dead transitions in 30244ms
Starting structural reductions in LTL mode, iteration 1 : 844/1416 places, 975/1640 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31591 ms. Remains : 844/1416 places, 975/1640 transitions.
Support contains 37 out of 844 places after structural reductions.
[2025-06-01 21:44:46] [INFO ] Flatten gal took : 77 ms
[2025-06-01 21:44:46] [INFO ] Flatten gal took : 45 ms
[2025-06-01 21:44:46] [INFO ] Input system was already deterministic with 975 transitions.
RANDOM walk for 40000 steps (37 resets) in 1929 ms. (20 steps per ms) remains 5/33 properties
BEST_FIRST walk for 40004 steps (8 resets) in 81 ms. (487 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 118 ms. (336 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40004 steps (8 resets) in 80 ms. (493 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 95 ms. (416 steps per ms) remains 3/3 properties
[2025-06-01 21:44:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 675/844 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 975/1819 variables, 844/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1819 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 0/1819 variables, 0/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1819/1819 variables, and 884 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1015 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 844/844 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 164/169 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/169 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 675/844 variables, 35/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/844 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 975/1819 variables, 844/884 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1819 variables, 3/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1819 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 0/1819 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1819/1819 variables, and 887 constraints, problems are : Problem set: 0 solved, 3 unsolved in 852 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 844/844 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1880ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2019 steps, including 6 resets, run visited all 3 properties in 27 ms. (steps per millisecond=74 )
Parikh walk visited 3 properties in 34 ms.
Computed a total of 41 stabilizing places and 41 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' '!(G((F(p0)&&F(p1)&&F(G(p2)))))'
Support contains 4 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Graph (trivial) has 787 edges and 844 vertex of which 552 / 844 are part of one of the 20 SCC in 3 ms
Free SCC test removed 532 places
Ensure Unique test removed 606 transitions
Reduce isomorphic transitions removed 606 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 311 transition count 363
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 306 transition count 362
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 305 transition count 362
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 16 Pre rules applied. Total rules applied 13 place count 305 transition count 346
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 3 with 32 rules applied. Total rules applied 45 place count 289 transition count 346
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 58 place count 276 transition count 325
Iterating global reduction 3 with 13 rules applied. Total rules applied 71 place count 276 transition count 325
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 74 place count 273 transition count 319
Iterating global reduction 3 with 3 rules applied. Total rules applied 77 place count 273 transition count 319
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 0 ms
Reduce places removed 59 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 195 place count 214 transition count 260
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 196 place count 213 transition count 259
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 146 edges and 207 vertex of which 28 / 207 are part of one of the 14 SCC in 0 ms
Free SCC test removed 14 places
Iterating post reduction 3 with 7 rules applied. Total rules applied 203 place count 193 transition count 259
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 4 with 28 rules applied. Total rules applied 231 place count 193 transition count 231
Applied a total of 231 rules in 96 ms. Remains 193 /844 variables (removed 651) and now considering 231/975 (removed 744) transitions.
[2025-06-01 21:44:49] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
// Phase 1: matrix 212 rows 193 cols
[2025-06-01 21:44:49] [INFO ] Computed 34 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:50] [INFO ] Implicit Places using invariants in 100 ms returned []
[2025-06-01 21:44:50] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
[2025-06-01 21:44:50] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:44:50] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:44:50] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:44:50] [INFO ] Redundant transitions in 9 ms returned []
Running 112 sub problems to find dead transitions.
[2025-06-01 21:44:50] [INFO ] Flow matrix only has 212 transitions (discarded 19 similar events)
[2025-06-01 21:44:50] [INFO ] Invariant cache hit.
[2025-06-01 21:44:50] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 20/193 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:44:51] [INFO ] Deduced a trap composed of 6 places in 35 ms of which 6 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 211/404 variables, 193/228 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 7/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (OVERLAPS) 0/404 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Real declared 404/405 variables, and 235 constraints, problems are : Problem set: 0 solved, 112 unsolved in 5593 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 193/193 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 112 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/173 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 2 (OVERLAPS) 20/193 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/193 variables, 1/35 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/193 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 5 (OVERLAPS) 211/404 variables, 193/228 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/404 variables, 7/235 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/404 variables, 112/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/404 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
At refinement iteration 9 (OVERLAPS) 0/404 variables, 0/347 constraints. Problems are: Problem set: 0 solved, 112 unsolved
No progress, stopping.
After SMT solving in domain Int declared 404/405 variables, and 347 constraints, problems are : Problem set: 0 solved, 112 unsolved in 4877 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 193/193 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 112/112 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10483ms problems are : Problem set: 0 solved, 112 unsolved
Search for dead transitions found 0 dead transitions in 10484ms
Starting structural reductions in SI_LTL mode, iteration 1 : 193/844 places, 231/975 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10861 ms. Remains : 193/844 places, 231/975 transitions.
Stuttering acceptance computed with spot in 308 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-00 finished in 11248 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(((G(p0)||F(p1)) U X(X(p2))))))'
Support contains 4 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 826 transition count 957
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 826 transition count 957
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 40 place count 826 transition count 953
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 47 place count 819 transition count 946
Iterating global reduction 1 with 7 rules applied. Total rules applied 54 place count 819 transition count 946
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 819 transition count 945
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 817 transition count 943
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 817 transition count 943
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 817 transition count 941
Applied a total of 61 rules in 108 ms. Remains 817 /844 variables (removed 27) and now considering 941/975 (removed 34) transitions.
// Phase 1: matrix 941 rows 817 cols
[2025-06-01 21:45:01] [INFO ] Computed 40 invariants in 12 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:45:01] [INFO ] Implicit Places using invariants in 239 ms returned []
[2025-06-01 21:45:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:45:01] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 759 ms to find 0 implicit places.
Running 940 sub problems to find dead transitions.
[2025-06-01 21:45: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/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 940 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1758 variables, and 40 constraints, problems are : Problem set: 0 solved, 940 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 940/940 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 940 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 940 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 940 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:45:54] [INFO ] Deduced a trap composed of 44 places in 243 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:45:54] [INFO ] Deduced a trap composed of 44 places in 256 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:45:56] [INFO ] Deduced a trap composed of 49 places in 204 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:45:58] [INFO ] Deduced a trap composed of 56 places in 152 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:45:58] [INFO ] Deduced a trap composed of 58 places in 151 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:46:01] [INFO ] Deduced a trap composed of 64 places in 108 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1758 variables, and 46 constraints, problems are : Problem set: 0 solved, 940 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/940 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60192ms problems are : Problem set: 0 solved, 940 unsolved
Search for dead transitions found 0 dead transitions in 60195ms
Starting structural reductions in LTL mode, iteration 1 : 817/844 places, 941/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61065 ms. Remains : 817/844 places, 941/975 transitions.
Stuttering acceptance computed with spot in 480 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-01
Stuttering criterion allowed to conclude after 1297 steps with 0 reset in 9 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-01 finished in 61585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(X(X(!(X(p0) U G((!p0 U p1))))))))'
Support contains 2 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 826 transition count 957
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 826 transition count 957
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 41 place count 826 transition count 952
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 48 place count 819 transition count 945
Iterating global reduction 1 with 7 rules applied. Total rules applied 55 place count 819 transition count 945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 56 place count 819 transition count 944
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 58 place count 817 transition count 942
Iterating global reduction 2 with 2 rules applied. Total rules applied 60 place count 817 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 62 place count 817 transition count 940
Applied a total of 62 rules in 92 ms. Remains 817 /844 variables (removed 27) and now considering 940/975 (removed 35) transitions.
// Phase 1: matrix 940 rows 817 cols
[2025-06-01 21:46:02] [INFO ] Computed 40 invariants in 13 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:46:02] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-01 21:46:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:46:03] [INFO ] Implicit Places using invariants and state equation in 476 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
Running 939 sub problems to find dead transitions.
[2025-06-01 21:46:03] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1757 variables, and 40 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 939/939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:46:56] [INFO ] Deduced a trap composed of 43 places in 228 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:46:56] [INFO ] Deduced a trap composed of 44 places in 213 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:46:58] [INFO ] Deduced a trap composed of 49 places in 189 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:47:00] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:47:00] [INFO ] Deduced a trap composed of 58 places in 144 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:47:03] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 9 ms to minimize.
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1757 variables, and 46 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/939 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60156ms problems are : Problem set: 0 solved, 939 unsolved
Search for dead transitions found 0 dead transitions in 60158ms
Starting structural reductions in LTL mode, iteration 1 : 817/844 places, 940/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60949 ms. Remains : 817/844 places, 940/975 transitions.
Stuttering acceptance computed with spot in 230 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-02
Product exploration explored 100000 steps with 207 reset in 267 ms.
Product exploration explored 100000 steps with 189 reset in 283 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 111 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 206 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (37 resets) in 343 ms. (116 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 111 ms. (357 steps per ms) remains 1/1 properties
[2025-06-01 21:47:04] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 744/817 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 940/1757 variables, 817/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1757 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1757 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1757/1757 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 501 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 817/817 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 744/817 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 940/1757 variables, 817/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1757 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1757 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1757 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1757/1757 variables, and 858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 468 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 817/817 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 980ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 284 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=142 )
Parikh walk visited 1 properties in 2 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 197 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 243 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 256 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
Support contains 2 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 940/940 transitions.
Applied a total of 0 rules in 26 ms. Remains 817 /817 variables (removed 0) and now considering 940/940 (removed 0) transitions.
[2025-06-01 21:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:47:06] [INFO ] Implicit Places using invariants in 186 ms returned []
[2025-06-01 21:47:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:47:07] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
Running 939 sub problems to find dead transitions.
[2025-06-01 21:47:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1757 variables, and 40 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 939/939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:47:59] [INFO ] Deduced a trap composed of 43 places in 227 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:47:59] [INFO ] Deduced a trap composed of 44 places in 208 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:01] [INFO ] Deduced a trap composed of 49 places in 198 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:03] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:03] [INFO ] Deduced a trap composed of 58 places in 155 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:06] [INFO ] Deduced a trap composed of 64 places in 106 ms of which 10 ms to minimize.
Error getting values : (error "ParserException while parsing response: ((s0 0)
(s1 0)
(s2 0)
(s3 0)
(s4 0)
(s5 0)
(s6 0)
(s7 0)
(s8 0)
(s9 0)
(s10 0)
(s11 0)
(s12 0)
(s13 0)
(s14 0)
(s15 0)
(s16 0)
(s17 0)
(s18 0)
(s19 0)
(s20 0)
(s21 0)
(s22 0)
(s23 0)
(s24 0)
(s25 0)
(s26 0)
(s27 0)
(s28 0)
(s29 0)
(s30 0)
(s31 0)
(s32 0)
(s33 0)
(s34 0)
(s35 0)
(s36 0)
(s37 0)
(s38 0)
(s39 0)
(s40 0)
(s41 0)
(s42 0)
(s43 0)
(s44 0)
(s45 0)
(s46 0)
(s47 0)
(s48 1)
(s49 0)
(s50 0)
(s51 0)
(s52 0)
(s53 0)
(s54 0)
(s55 0)
(s56 1)
(s57 0)
(s58 1)
(s59 0)
(s60 0)
(s61 0)
(s62 0)
(s63 0)
(s64 0)
(s65 0)
(s66 0)
(s67 0)
(s68 0)
(s69 0)
(s70 0)
(s71 0)
(s72 0)
(s73 0)
(s74 0)
(s75 0)
(s76 0)
(s77 0)
(s78 0)
(s79 0)
(s80 0)
(s81 0)
(s82 0)
(s83 0)
(s84 0)
(s85 0)
(s86 0)
(s87 0)
(s88 0)
(s89 0)
(s90 0)
(s91 1)
(s92 0)
(s93 0)
(s94 0)
(s95 0)
(s96 0)
(s97 0)
(s98 0)
(s99 0)
(s100 0)
(s101 0)
(s102 0)
(s103 0)
(s104 0)
(s105 0)
(s106 0)
(s107 0)
(s108 0)
(s109 0)
(s110 0)
(s111 1)
(s112 0)
(s113 0)
(s114 0)
(s115 0)
(s116 0)
(s117 0)
(s118 0)
(s119 0)
(s120 0)
(s121 0)
(s122 0)
(s123 0)
(s124 0)
(s125 0)
(s126 0)
(s127 0)
(s128 0)
(s129 0)
(s130 0)
(s131 0)
(s132 0)
(s133 0)
(s134 1)
(s135 0)
(s136 0)
(s137 0)
(s138 0)
(s139 0)
(s140 0)
(s141 0)
(s142 0)
(s143 0)
(s144 0)
(s145 0)
(s146 0)
(s147 0)
(s148 0)
(s149 0)
(s150 0)
(s151 0)
(s152 0)
(s153 0)
(s154 0)
(s155 0)
(s156 0)
(s157 0)
(s158 1)
(s159 0)
(s160 0)
(s161 0)
(s162 0)
(s163 0)
(s164 0)
(s165 0)
(s166 0)
(s167 0)
(s168 0)
(s169 1)
(s170 0)
(s171 0)
(s172 1)
(s173 0)
(s174 0)
(s175 0)
(s176 0)
(s177 0)
(s178 0)
(s179 0)
(s180 0)
(s181 0)
(s182 0)
(s183 0)
(s184 0)
(s185 0)
(s186 0)
(s187 0)
(s188 0)
(s189 0)
(s190 0)
(s191 0)
(s192 0)
(s193 0)
(s194 0)
(s195 1)
(s196 0)
(s197 0)
(s198 0)
(s199 0)
(s200 0)
(s201 0)
(s202 0)
(s203 0)
(s204 0)
(s205 0)
(s206 0)
(s207 0)
(s208 1)
(s209 0)
(s210 0)
(s211 0)
(s212 0)
(s213 0)
(s214 0)
(s215 0)
(s216 0)
(s217 0)
(s218 0)
(s219 0)
(s220 0)
(s221 0)
(s222 0)
(s223 0)
(s224 0)
(s225 0)
(s226 0)
(s227 0)
(s228 0)
(s229 0)
(s230 0)
(s231 0)
(s232 0)
(s233 0)
(s234 0)
(s235 0)
(s236 0)
(s237 0)
(s238 0)
(s239 0)
(s240 0)
(s241 1)
(s242 0)
(s243 0)
(s244 0)
(s245 0)
(s246 0)
(s247 0)
(s248 0)
(s249 0)
(s250 0)
(s251 0)
(s252 0)
(s253 0)
(s254 0)
(s255 0)
(s256 0)
(s257 0)
(s258 0)
(s259 0)
(s260 0)
(s261 0)
(s262 0)
(s263 0)
(s264 0)
(s265 0)
(s266 0)
(s267 0)
(s268 0)
(s269 0)
(s270 0)
(s271 0)
(s272 1)
(s273 0)
(s274 0)
(s275 0)
(s276 0)
(s277 0)
(s278 0)
(s279 0)
(s280 0)
(s281 0)
(s282 0)
(s283 1)
(s284 0)
(s285 0)
(s286 0)
(s287 0)
(s288 0)
(s289 0)
(s290 0)
(s291 0)
(s292 0)
(s293 0)
(s294 0)
(s295 1)
(s296 0)
(s297 0)
(s298 0)
(s299 0)
(s300 0)
(s301 1)
(s302 0)
(s303 1)
(s304 0)
(s305 0)
(s306 0)
(s307 0)
(s308 0)
(s309 0)
(s310 0)
(s311 0)
(s312 0)
(s313 0)
(s314 0)
(s315 0)
(s316 0)
(s317 0)
(s318 0)
(s319 0)
(s320 0)
(s321 0)
(s322 0)
(s323 0)
(s324 0)
(s325 0)
(s326 0)
(s327 0)
(s328 0)
(s329 0)
(s330 0)
(s331 0)
(s332 0)
(s333 0)
(s334 0)
(s335 0)
(s336 1)
(s337 0)
(s338 0)
(s339 0)
(s340 0)
(s341 0)
(s342 0)
(s343 0)
(s344 0)
(s345 0)
(s346 0)
(s347 0)
(s348 0)
(s349 0)
(s350 0)
(s351 0)
(s352 0)
(s353 0)
(s354 0)
(s355 0)
(s356 0)
(s357 0)
(s358 0)
(s359 0)
(s360 0)
(s361 0)
(s362 0)
(s363 0)
(s364 0)
(s365 0)
(s366 0)
(s367 0)
(s368 0)
(s369 1)
(s370 0)
(s371 0)
(s372 0)
(s373 0)
(s374 0)
(s375 0)
(s376 0)
(s377 0)
(s378 0)
(s379 0)
(s380 0)
(s381 0)
(s382 0)
(s383 0)
(s384 0)
(s385 0)
(s386 0)
(s387 0)
(s388 0)
(s389 0)
(s390 0)
(s391 0)
(s392 0)
(s393 0)
(s394 0)
(s395 0)
(s396 0)
(s397 0)
(s398 0)
(s399 0)
(s400 0)
(s401 0)
(s402 1)
(s403 0)
(s404 0)
(s405 0)
(s406 0)
(s407 0)
(s408 0)
(s409 0)
(s410 0)
(s411 0)
(s412 0)
(s413 0)
(s414 0)
(s415 0)
(s416 0)
(s417 0)
(s418 0)
(s419 0)
(s420 0)
(s421 0)
(s422 0)
(s423 0)
(s424 0)
(s425 0)
(s426 0)
(s427 0)
(s428 0)
(s429 0)
(s430 0)
(s431 0)
(s432 0)
(s433 0)
(s434 0)
(s435 1)
(s436 0)
(s437 0)
(s438 0)
(s439 0)
(s440 0)
(s441 1)
(s442 0)
(s443 0)
(s444 0)
(s445 0)
(s446 0)
(s447 0)
(s448 1)
(s449 0)
(s450 0)
(s451 0)
(s452 0)
(s453 0)
(s454 1)
(s455 0)
(s456 1)
(s457 0)
(s458 0)
(s459 0)
(s460 0)
(s461 0)
(s462 0)
(s463 0)
(s464 0)
(s465 0)
(s466 0)
(s467 0)
(s468 0)
(s469 0)
(s470 0)
(s471 0)
(s472 0)
(s473 0)
(s474 0)
(s475 0)
(s476 0)
(s477 0)
(s478 0)
(s479 0)
(s480 0)
(s481 0)
(s482 0)
(s483 0)
(s484 0)
(s485 0)
(s486 0)
(s487 0)
(s488 0)
(s489 1)
(s490 0)
(s491 0)
(s492 0)
(s493 0)
(s494 0)
(s495 0)
(s496 0)
(s497 0)
(s498 0)
(s499 0)
(s500 0)
(s501 0)
(s502 0)
(s503 0)
(s504 0)
(s505 0)
(s506 0)
(s507 0)
(s508 0)
(s509 0)
(s510 0)
(s511 0)
(s512 0)
(s513 0)
(s514 0)
(s515 0)
(s516 0)
(s517 0)
(s518 0)
(s519 0)
(s520 0)
(s521 0)
(s522 0)
(s523 0)
(s524 1)
(s525 0)
(s526 0)
(s527 0)
(s528 0)
(s529 0)
(s530 0)
(s531 0)
(s532 0)
(s533 0)
(s534 0)
(s535 0)
(s536 0)
(s537 0)
(s538 0)
(s539 0)
(s540 0)
(s541 0)
(s542 0)
(s543 0)
(s544 0)
(s545 0)
(s546 0)
(s547 0)
(s548 0)
(s549 0)
(s550 0)
(s551 0)
(s552 0)
(s553 0)
(s554 0)
(s555 0)
(s556 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1757 variables, and 46 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/939 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60143ms problems are : Problem set: 0 solved, 939 unsolved
Search for dead transitions found 0 dead transitions in 60145ms
Finished structural reductions in LTL mode , in 1 iterations and 60842 ms. Remains : 817/817 places, 940/940 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : []
Knowledge based reduction with 1 factoid took 81 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 236 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
RANDOM walk for 40000 steps (39 resets) in 310 ms. (128 steps per ms) remains 1/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 64 ms. (615 steps per ms) remains 1/1 properties
[2025-06-01 21:48:07] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 744/817 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 940/1757 variables, 817/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1757 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/1757 variables, 0/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1757/1757 variables, and 857 constraints, problems are : Problem set: 0 solved, 1 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 817/817 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 71/73 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/73 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 744/817 variables, 38/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/817 variables, 0/40 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 940/1757 variables, 817/857 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1757 variables, 1/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1757 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/1757 variables, 0/858 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1757/1757 variables, and 858 constraints, problems are : Problem set: 0 solved, 1 unsolved in 434 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 817/817 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 924ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 281 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=140 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT (AND (NOT p0) (NOT p1)))), (F (NOT (OR (NOT p0) p1))), (F (NOT (OR (NOT p0) (NOT p1))))]
Knowledge based reduction with 1 factoid took 198 ms. Reduced automaton from 6 states, 9 edges and 2 AP (stutter sensitive) to 6 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 271 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 259 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
Stuttering acceptance computed with spot in 254 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
Product exploration explored 100000 steps with 233 reset in 188 ms.
Product exploration explored 100000 steps with 162 reset in 213 ms.
Applying partial POR strategy [false, false, false, false, true, true]
Stuttering acceptance computed with spot in 273 ms :[p1, p1, p1, p1, p1, (AND p0 p1)]
Support contains 2 out of 817 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 817/817 places, 940/940 transitions.
Graph (trivial) has 755 edges and 817 vertex of which 540 / 817 are part of one of the 20 SCC in 3 ms
Free SCC test removed 520 places
Ensure Unique test removed 586 transitions
Reduce isomorphic transitions removed 586 transitions.
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 17 Pre rules applied. Total rules applied 1 place count 297 transition count 374
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 17 rules applied. Total rules applied 18 place count 297 transition count 374
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 28 place count 287 transition count 352
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 38 place count 287 transition count 352
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 48 place count 277 transition count 330
Deduced a syphon composed of 7 places in 0 ms
Iterating global reduction 0 with 10 rules applied. Total rules applied 58 place count 277 transition count 330
Performed 58 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 65 places in 0 ms
Iterating global reduction 0 with 58 rules applied. Total rules applied 116 place count 277 transition count 330
Deduced a syphon composed of 65 places in 0 ms
Applied a total of 116 rules in 59 ms. Remains 277 /817 variables (removed 540) and now considering 330/940 (removed 610) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:48:10] [INFO ] Redundant transitions in 16 ms returned []
Running 329 sub problems to find dead transitions.
[2025-06-01 21:48:10] [INFO ] Flow matrix only has 310 transitions (discarded 20 similar events)
// Phase 1: matrix 310 rows 277 cols
[2025-06-01 21:48:10] [INFO ] Computed 40 invariants in 3 ms
[2025-06-01 21:48:10] [INFO ] State equation strengthened by 22 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/276 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 329 unsolved
At refinement iteration 1 (OVERLAPS) 1/277 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 329 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 2 places in 26 ms of which 1 ms to minimize.
Problem TDEAD18 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 21 ms of which 1 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 1 ms to minimize.
Problem TDEAD20 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 2 places in 24 ms of which 1 ms to minimize.
Problem TDEAD37 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 28 ms of which 1 ms to minimize.
Problem TDEAD38 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 1 ms to minimize.
Problem TDEAD66 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 26 ms of which 1 ms to minimize.
Problem TDEAD67 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 7 places in 27 ms of which 2 ms to minimize.
Problem TDEAD68 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 29 ms of which 2 ms to minimize.
Problem TDEAD69 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD94 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 27 ms of which 2 ms to minimize.
Problem TDEAD95 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 8 places in 33 ms of which 1 ms to minimize.
Problem TDEAD97 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 6 places in 23 ms of which 2 ms to minimize.
Problem TDEAD98 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:15] [INFO ] Deduced a trap composed of 2 places in 36 ms of which 2 ms to minimize.
Problem TDEAD115 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:16] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 2 ms to minimize.
Problem TDEAD116 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:16] [INFO ] Deduced a trap composed of 6 places in 31 ms of which 2 ms to minimize.
Problem TDEAD117 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:16] [INFO ] Deduced a trap composed of 2 places in 30 ms of which 2 ms to minimize.
Problem TDEAD132 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:16] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 2 ms to minimize.
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:48:16] [INFO ] Deduced a trap composed of 6 places in 30 ms of which 2 ms to minimize.
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD321 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/60 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/60 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 309/586 variables, 277/337 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 21/358 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 0/358 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 7 (OVERLAPS) 1/587 variables, 1/359 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/587 variables, 0/359 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 9 (OVERLAPS) 0/587 variables, 0/359 constraints. Problems are: Problem set: 73 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 587/587 variables, and 359 constraints, problems are : Problem set: 73 solved, 256 unsolved in 26147 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 277/277 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 329/329 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 73 solved, 256 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/211 variables, 0/0 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 1 (OVERLAPS) 66/277 variables, 40/40 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/277 variables, 20/60 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/277 variables, 0/60 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 4 (OVERLAPS) 309/586 variables, 277/337 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/586 variables, 21/358 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/586 variables, 256/614 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/586 variables, 0/614 constraints. Problems are: Problem set: 73 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 1/587 variables, 1/615 constraints. Problems are: Problem set: 73 solved, 256 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 587/587 variables, and 615 constraints, problems are : Problem set: 73 solved, 256 unsolved in 30011 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 277/277 constraints, ReadFeed: 22/22 constraints, PredecessorRefiner: 256/329 constraints, Known Traps: 20/20 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 56266ms problems are : Problem set: 73 solved, 256 unsolved
Search for dead transitions found 73 dead transitions in 56267ms
Found 73 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 73 transitions
Dead transitions reduction (with SMT) removed 73 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 277/817 places, 257/940 transitions.
Graph (complete) has 641 edges and 277 vertex of which 212 are kept as prefixes of interest. Removing 65 places using SCC suffix rule.2 ms
Discarding 65 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 13 ms. Remains 212 /277 variables (removed 65) and now considering 257/257 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 212/817 places, 257/940 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 56362 ms. Remains : 212/817 places, 257/940 transitions.
Built C files in :
/tmp/ltsmin11901260479402554285
[2025-06-01 21:49:07] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11901260479402554285
Running compilation step : cd /tmp/ltsmin11901260479402554285;'/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 1533 ms.
Running link step : cd /tmp/ltsmin11901260479402554285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin11901260479402554285;'/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/stateBased947299787994808659.hoa' '--buchi-type=spotba'
LTSmin run took 4642 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-02 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-1B-LTLFireability-02 finished in 190769 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Graph (trivial) has 787 edges and 844 vertex of which 548 / 844 are part of one of the 20 SCC in 2 ms
Free SCC test removed 528 places
Ensure Unique test removed 600 transitions
Reduce isomorphic transitions removed 600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 315 transition count 369
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 310 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 309 transition count 368
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 13 place count 309 transition count 350
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 49 place count 291 transition count 350
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 63 place count 277 transition count 326
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 277 transition count 326
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 274 transition count 320
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 274 transition count 320
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 207 place count 212 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 212 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 211 transition count 260
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 211 transition count 259
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 210 transition count 258
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 143 edges and 204 vertex of which 28 / 204 are part of one of the 14 SCC in 1 ms
Free SCC test removed 14 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 219 place count 190 transition count 258
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 247 place count 190 transition count 230
Applied a total of 247 rules in 57 ms. Remains 190 /844 variables (removed 654) and now considering 230/975 (removed 745) transitions.
[2025-06-01 21:49:13] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
// Phase 1: matrix 211 rows 190 cols
[2025-06-01 21:49:13] [INFO ] Computed 34 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:13] [INFO ] Implicit Places using invariants in 95 ms returned []
[2025-06-01 21:49:13] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2025-06-01 21:49:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:13] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:49:13] [INFO ] Implicit Places using invariants and state equation in 136 ms returned []
Implicit Place search using SMT with State Equation took 235 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:49:13] [INFO ] Redundant transitions in 6 ms returned []
Running 115 sub problems to find dead transitions.
[2025-06-01 21:49:13] [INFO ] Flow matrix only has 211 transitions (discarded 19 similar events)
[2025-06-01 21:49:13] [INFO ] Invariant cache hit.
[2025-06-01 21:49:13] [INFO ] State equation strengthened by 7 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 20/190 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 210/400 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (OVERLAPS) 0/400 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Real declared 400/401 variables, and 231 constraints, problems are : Problem set: 0 solved, 115 unsolved in 4994 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 115 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 2 (OVERLAPS) 20/190 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 4 (OVERLAPS) 210/400 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 115/346 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 115 unsolved
At refinement iteration 8 (OVERLAPS) 0/400 variables, 0/346 constraints. Problems are: Problem set: 0 solved, 115 unsolved
No progress, stopping.
After SMT solving in domain Int declared 400/401 variables, and 346 constraints, problems are : Problem set: 0 solved, 115 unsolved in 5171 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 115/115 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10173ms problems are : Problem set: 0 solved, 115 unsolved
Search for dead transitions found 0 dead transitions in 10173ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/844 places, 230/975 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10475 ms. Remains : 190/844 places, 230/975 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-03
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-03 finished in 10573 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 1 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Graph (trivial) has 787 edges and 844 vertex of which 548 / 844 are part of one of the 20 SCC in 4 ms
Free SCC test removed 528 places
Ensure Unique test removed 600 transitions
Reduce isomorphic transitions removed 600 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 315 transition count 369
Reduce places removed 5 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 6 rules applied. Total rules applied 12 place count 310 transition count 368
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 13 place count 309 transition count 368
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 13 place count 309 transition count 350
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 49 place count 291 transition count 350
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 63 place count 277 transition count 326
Iterating global reduction 3 with 14 rules applied. Total rules applied 77 place count 277 transition count 326
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 80 place count 274 transition count 320
Iterating global reduction 3 with 3 rules applied. Total rules applied 83 place count 274 transition count 320
Performed 62 Post agglomeration using F-continuation condition.Transition count delta: 62
Deduced a syphon composed of 62 places in 0 ms
Reduce places removed 62 places and 0 transitions.
Iterating global reduction 3 with 124 rules applied. Total rules applied 207 place count 212 transition count 258
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 208 place count 212 transition count 257
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 210 place count 211 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 211 place count 211 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 210 transition count 263
Reduce places removed 6 places and 0 transitions.
Graph (trivial) has 142 edges and 204 vertex of which 26 / 204 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Iterating post reduction 5 with 7 rules applied. Total rules applied 219 place count 191 transition count 263
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 245 place count 191 transition count 237
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 247 place count 190 transition count 236
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 7 with 4 rules applied. Total rules applied 251 place count 190 transition count 232
Applied a total of 251 rules in 58 ms. Remains 190 /844 variables (removed 654) and now considering 232/975 (removed 743) transitions.
[2025-06-01 21:49:24] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
// Phase 1: matrix 213 rows 190 cols
[2025-06-01 21:49:24] [INFO ] Computed 34 invariants in 5 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:24] [INFO ] Implicit Places using invariants in 91 ms returned []
[2025-06-01 21:49:24] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
[2025-06-01 21:49:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:24] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-01 21:49:24] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 239 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-01 21:49:24] [INFO ] Redundant transitions in 0 ms returned []
Running 117 sub problems to find dead transitions.
[2025-06-01 21:49:24] [INFO ] Flow matrix only has 213 transitions (discarded 19 similar events)
[2025-06-01 21:49:24] [INFO ] Invariant cache hit.
[2025-06-01 21:49:24] [INFO ] State equation strengthened by 9 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 20/190 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 212/402 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 9/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (OVERLAPS) 0/402 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Real declared 402/403 variables, and 233 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5307 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 117 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/170 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/170 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 2 (OVERLAPS) 20/190 variables, 20/34 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/190 variables, 0/34 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 4 (OVERLAPS) 212/402 variables, 190/224 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 9/233 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 117/350 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 117 unsolved
At refinement iteration 8 (OVERLAPS) 0/402 variables, 0/350 constraints. Problems are: Problem set: 0 solved, 117 unsolved
No progress, stopping.
After SMT solving in domain Int declared 402/403 variables, and 350 constraints, problems are : Problem set: 0 solved, 117 unsolved in 5336 ms.
Refiners :[Positive P Invariants (semi-flows): 34/34 constraints, State Equation: 190/190 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 117/117 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10653ms problems are : Problem set: 0 solved, 117 unsolved
Search for dead transitions found 0 dead transitions in 10653ms
Starting structural reductions in SI_LTL mode, iteration 1 : 190/844 places, 232/975 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10956 ms. Remains : 190/844 places, 232/975 transitions.
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-04 finished in 11015 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(p0) U X(p1))&&F((p2 U (p3||G(p2))))))'
Support contains 4 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 827 transition count 958
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 827 transition count 958
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 39 place count 827 transition count 953
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 45 place count 821 transition count 947
Iterating global reduction 1 with 6 rules applied. Total rules applied 51 place count 821 transition count 947
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 52 place count 821 transition count 946
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 53 place count 820 transition count 945
Iterating global reduction 2 with 1 rules applied. Total rules applied 54 place count 820 transition count 945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 55 place count 820 transition count 944
Applied a total of 55 rules in 88 ms. Remains 820 /844 variables (removed 24) and now considering 944/975 (removed 31) transitions.
// Phase 1: matrix 944 rows 820 cols
[2025-06-01 21:49:35] [INFO ] Computed 40 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:35] [INFO ] Implicit Places using invariants in 210 ms returned []
[2025-06-01 21:49:35] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:49:35] [INFO ] Implicit Places using invariants and state equation in 484 ms returned []
Implicit Place search using SMT with State Equation took 696 ms to find 0 implicit places.
Running 943 sub problems to find dead transitions.
[2025-06-01 21:49: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/819 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 1 (OVERLAPS) 1/820 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 943 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 1.0)
(s49 0.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 1.0)
(s57 0.0)
(s58 1.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 timeout
0.0)
( org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 820/1764 variables, and 40 constraints, problems are : Problem set: 0 solved, 943 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/820 constraints, PredecessorRefiner: 943/943 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 943 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/819 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 943 unsolved
At refinement iteration 1 (OVERLAPS) 1/820 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 943 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:27] [INFO ] Deduced a trap composed of 43 places in 219 ms of which 22 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:27] [INFO ] Deduced a trap composed of 44 places in 234 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:29] [INFO ] Deduced a trap composed of 49 places in 200 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:31] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:32] [INFO ] Deduced a trap composed of 58 places in 143 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:50:34] [INFO ] Deduced a trap composed of 65 places in 109 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 820/1764 variables, and 46 constraints, problems are : Problem set: 0 solved, 943 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/820 constraints, PredecessorRefiner: 0/943 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 943 unsolved
Search for dead transitions found 0 dead transitions in 60140ms
Starting structural reductions in LTL mode, iteration 1 : 820/844 places, 944/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60927 ms. Remains : 820/844 places, 944/975 transitions.
Stuttering acceptance computed with spot in 243 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p3) (NOT p2)), (NOT p1), true, (NOT p0)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-05
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-05 finished in 61194 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 (p1||G(p0))) U X(X(p2))))'
Support contains 4 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 827 transition count 958
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 827 transition count 958
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 38 place count 827 transition count 954
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 44 place count 821 transition count 948
Iterating global reduction 1 with 6 rules applied. Total rules applied 50 place count 821 transition count 948
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 51 place count 821 transition count 947
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 53 place count 819 transition count 945
Iterating global reduction 2 with 2 rules applied. Total rules applied 55 place count 819 transition count 945
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 819 transition count 943
Applied a total of 57 rules in 99 ms. Remains 819 /844 variables (removed 25) and now considering 943/975 (removed 32) transitions.
// Phase 1: matrix 943 rows 819 cols
[2025-06-01 21:50:36] [INFO ] Computed 40 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:36] [INFO ] Implicit Places using invariants in 235 ms returned []
[2025-06-01 21:50:36] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:50:36] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 736 ms to find 0 implicit places.
Running 942 sub problems to find dead transitions.
[2025-06-01 21:50:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 1 (OVERLAPS) 1/819 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 942 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 819/1762 variables, and 40 constraints, problems are : Problem set: 0 solved, 942 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 942/942 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 942 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/818 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 942 unsolved
At refinement iteration 1 (OVERLAPS) 1/819 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 942 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:28] [INFO ] Deduced a trap composed of 43 places in 236 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:29] [INFO ] Deduced a trap composed of 44 places in 227 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:30] [INFO ] Deduced a trap composed of 50 places in 179 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:33] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:33] [INFO ] Deduced a trap composed of 59 places in 134 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:51:35] [INFO ] Deduced a trap composed of 64 places in 100 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 819/1762 variables, and 46 constraints, problems are : Problem set: 0 solved, 942 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/819 constraints, PredecessorRefiner: 0/942 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60150ms problems are : Problem set: 0 solved, 942 unsolved
Search for dead transitions found 0 dead transitions in 60153ms
Starting structural reductions in LTL mode, iteration 1 : 819/844 places, 943/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60991 ms. Remains : 819/844 places, 943/975 transitions.
Stuttering acceptance computed with spot in 476 ms :[(NOT p2), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (NOT p2), true, (AND (NOT p1) (NOT p0) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p2), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-07
Entered a terminal (fully accepting) state of product in 568 steps with 0 reset in 4 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-07 finished in 61499 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 X(X((p1&&F(p2)))))&&F(!p2)))'
Support contains 3 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 826 transition count 957
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 826 transition count 957
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 826 transition count 951
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 819 transition count 944
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 819 transition count 944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 819 transition count 943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 817 transition count 941
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 817 transition count 941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 817 transition count 939
Applied a total of 63 rules in 93 ms. Remains 817 /844 variables (removed 27) and now considering 939/975 (removed 36) transitions.
// Phase 1: matrix 939 rows 817 cols
[2025-06-01 21:51:37] [INFO ] Computed 40 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:37] [INFO ] Implicit Places using invariants in 218 ms returned []
[2025-06-01 21:51:37] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:51:38] [INFO ] Implicit Places using invariants and state equation in 471 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
Running 938 sub problems to find dead transitions.
[2025-06-01 21:51:38] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 0.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 0.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 0.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 0.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 0.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 0.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 0.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 0.0)
(s35 0.0)
(s36 0.0)
(s37 0.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 0.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 0.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 0.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 1.0)
(s60 0.0)
(s61 0.0)
(s62 0.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 0.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 0.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 0.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 0.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 0.0)
(s87 0.0)
(s88 0.0)
(s89 0.0)
(s90 0.0)
(s91 0.0)
(s92 1.0)
(s93 0.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 0.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 0.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 0.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 0.0)
(s111 0.0)
(s112 1.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 0.0)
(s121 0.0)
(s122 0.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 0.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 0.0)
(s133 0.0)
(s134 0.0)
(s135 1.0)
(s136 0.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 0.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 0.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 0.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 0.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 1.0)
(s160 0.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 0.0)
(s167 0.0)
(s168 0.0)
(s169 0.0)
(s170 1.0)
(s171 0.0)
(s172 0.0)
(s173 1.0)
(s174 0.0)
(s175 0.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 0.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 0.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 0.0)
(s192 0.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 0.0)
(s197 0.0)
(s198 0.0)
(s199 0.0)
(s200 0.0)
(s201 0.0)
(s202 0.0)
(s203 0.0)
(s204 0.0)
(s205 0.0)
(s206 0.0)
(s207 1.0)
(s208 0.0)
(s209 0.0)
(s210 0.0)
(s211 0.0)
(s212 0.0)
(s213 0.0)
(s214 0.0)
(s215 0.0)
(s216 0.0)
(s217 0.0)
(s218 0.0)
(s219 0.0)
(s220 0.0)
(s221 0.0)
(s222 0.0)
(s223 0.0)
(s224 0.0)
(s225 0.0)
(s226 0.0)
(s227 0.0)
(s228 0.0)
(s229 1.0)
(s230 0.0)
(s231 0.0)
(s232 0.0)
(s233 0.0)
(s234 0.0)
(s235 0.0)
(s236 0.0)
(s237 0.0)
(s238 timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1756 variables, and 40 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:52:30] [INFO ] Deduced a trap composed of 43 places in 231 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:52:30] [INFO ] Deduced a trap composed of 44 places in 214 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:52:32] [INFO ] Deduced a trap composed of 49 places in 180 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:52:34] [INFO ] Deduced a trap composed of 57 places in 136 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:52:34] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:52:36] [INFO ] Deduced a trap composed of 64 places in 102 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1756 variables, and 46 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60135ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 60137ms
Starting structural reductions in LTL mode, iteration 1 : 817/844 places, 939/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60930 ms. Remains : 817/844 places, 939/975 transitions.
Stuttering acceptance computed with spot in 336 ms :[true, (OR (NOT p1) (NOT p2)), p2, (OR (NOT p2) (NOT p1)), (OR (NOT p1) (NOT p2)), true, (NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-09
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-09 finished in 61296 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||F((p1&&X(F(p1))))))'
Support contains 2 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 825 transition count 956
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 825 transition count 956
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 825 transition count 950
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 51 place count 818 transition count 943
Iterating global reduction 1 with 7 rules applied. Total rules applied 58 place count 818 transition count 943
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 59 place count 818 transition count 942
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 61 place count 816 transition count 940
Iterating global reduction 2 with 2 rules applied. Total rules applied 63 place count 816 transition count 940
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 65 place count 816 transition count 938
Applied a total of 65 rules in 97 ms. Remains 816 /844 variables (removed 28) and now considering 938/975 (removed 37) transitions.
// Phase 1: matrix 938 rows 816 cols
[2025-06-01 21:52:39] [INFO ] Computed 40 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:52:39] [INFO ] Implicit Places using invariants in 195 ms returned []
[2025-06-01 21:52:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:52:39] [INFO ] Implicit Places using invariants and state equation in 492 ms returned []
Implicit Place search using SMT with State Equation took 688 ms to find 0 implicit places.
Running 937 sub problems to find dead transitions.
[2025-06-01 21:52: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/815 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 937 unsolved
SMT process timed out in 30098ms, After SMT, problems are : Problem set: 0 solved, 937 unsolved
Search for dead transitions found 0 dead transitions in 30100ms
Starting structural reductions in LTL mode, iteration 1 : 816/844 places, 938/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 30887 ms. Remains : 816/844 places, 938/975 transitions.
Stuttering acceptance computed with spot in 201 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-10
Stuttering criterion allowed to conclude after 1222 steps with 0 reset in 8 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-10 finished in 31120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G((p1||X(X(p2))))))))'
Support contains 2 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 19 places :
Symmetric choice reduction at 0 with 19 rule applications. Total rules 19 place count 825 transition count 956
Iterating global reduction 0 with 19 rules applied. Total rules applied 38 place count 825 transition count 956
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 44 place count 825 transition count 950
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 50 place count 819 transition count 944
Iterating global reduction 1 with 6 rules applied. Total rules applied 56 place count 819 transition count 944
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 57 place count 819 transition count 943
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 59 place count 817 transition count 941
Iterating global reduction 2 with 2 rules applied. Total rules applied 61 place count 817 transition count 941
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 817 transition count 939
Applied a total of 63 rules in 88 ms. Remains 817 /844 variables (removed 27) and now considering 939/975 (removed 36) transitions.
// Phase 1: matrix 939 rows 817 cols
[2025-06-01 21:53:10] [INFO ] Computed 40 invariants in 9 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:53:10] [INFO ] Implicit Places using invariants in 206 ms returned []
[2025-06-01 21:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:53:10] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 706 ms to find 0 implicit places.
Running 938 sub problems to find dead transitions.
[2025-06-01 21:53:10] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1756 variables, and 40 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:03] [INFO ] Deduced a trap composed of 43 places in 202 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:03] [INFO ] Deduced a trap composed of 44 places in 216 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:05] [INFO ] Deduced a trap composed of 49 places in 178 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:07] [INFO ] Deduced a trap composed of 56 places in 146 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:07] [INFO ] Deduced a trap composed of 58 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:54:10] [INFO ] Deduced a trap composed of 64 places in 110 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1756 variables, and 46 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60122ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 60123ms
Starting structural reductions in LTL mode, iteration 1 : 817/844 places, 939/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60920 ms. Remains : 817/844 places, 939/975 transitions.
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-11
Product exploration explored 100000 steps with 20056 reset in 169 ms.
Product exploration explored 100000 steps with 19971 reset in 184 ms.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 91 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 6079 steps (4 resets) in 33 ms. (178 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p1) (NOT p0))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 251 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 171 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 175 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 2 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 939/939 transitions.
Applied a total of 0 rules in 24 ms. Remains 817 /817 variables (removed 0) and now considering 939/939 (removed 0) transitions.
[2025-06-01 21:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:54:12] [INFO ] Implicit Places using invariants in 192 ms returned []
[2025-06-01 21:54:12] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:54:13] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 681 ms to find 0 implicit places.
Running 938 sub problems to find dead transitions.
[2025-06-01 21:54:13] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1756 variables, and 40 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:55:04] [INFO ] Deduced a trap composed of 43 places in 213 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:55:05] [INFO ] Deduced a trap composed of 44 places in 200 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:55:06] [INFO ] Deduced a trap composed of 49 places in 184 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:55:09] [INFO ] Deduced a trap composed of 56 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:55:09] [INFO ] Deduced a trap composed of 58 places in 148 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:55:11] [INFO ] Deduced a trap composed of 64 places in 107 ms of which 9 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1756 variables, and 46 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60134ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 60135ms
Finished structural reductions in LTL mode , in 1 iterations and 60844 ms. Remains : 817/817 places, 939/939 transitions.
Computed a total of 39 stabilizing places and 39 stable transitions
Computed a total of 39 stabilizing places and 39 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 7 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
RANDOM walk for 24271 steps (24 resets) in 85 ms. (282 steps per ms) remains 0/5 properties
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (NOT p1)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT p1)))]
False Knowledge obtained : [(F p1), (F p0), (F (NOT p2)), (F (NOT (OR p0 p2))), (F (NOT (AND (NOT p0) (NOT p1))))]
Knowledge based reduction with 7 factoid took 216 ms. Reduced automaton from 4 states, 5 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 126 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 149 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 20043 reset in 147 ms.
Product exploration explored 100000 steps with 20049 reset in 156 ms.
Built C files in :
/tmp/ltsmin4115932213980430111
[2025-06-01 21:55:14] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4115932213980430111
Running compilation step : cd /tmp/ltsmin4115932213980430111;'/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 1381 ms.
Running link step : cd /tmp/ltsmin4115932213980430111;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin4115932213980430111;'/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/stateBased17012543844296716100.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 817 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 817/817 places, 939/939 transitions.
Applied a total of 0 rules in 18 ms. Remains 817 /817 variables (removed 0) and now considering 939/939 (removed 0) transitions.
[2025-06-01 21:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:55:29] [INFO ] Implicit Places using invariants in 201 ms returned []
[2025-06-01 21:55:29] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:55:30] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 733 ms to find 0 implicit places.
Running 938 sub problems to find dead transitions.
[2025-06-01 21:55:30] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 817/1756 variables, and 40 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 938/938 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/816 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 938 unsolved
At refinement iteration 1 (OVERLAPS) 1/817 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 938 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:56:21] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 21 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:56:21] [INFO ] Deduced a trap composed of 44 places in 211 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:56:23] [INFO ] Deduced a trap composed of 49 places in 190 ms of which 18 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:56:25] [INFO ] Deduced a trap composed of 56 places in 142 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:56:26] [INFO ] Deduced a trap composed of 58 places in 150 ms of which 14 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:56:28] [INFO ] Deduced a trap composed of 64 places in 99 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:56:29] [INFO ] Deduced a trap composed of 69 places in 68 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 817/1756 variables, and 47 constraints, problems are : Problem set: 0 solved, 938 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/817 constraints, PredecessorRefiner: 0/938 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60137ms problems are : Problem set: 0 solved, 938 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Finished structural reductions in LTL mode , in 1 iterations and 60893 ms. Remains : 817/817 places, 939/939 transitions.
Built C files in :
/tmp/ltsmin7581630697444944777
[2025-06-01 21:56:30] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7581630697444944777
Running compilation step : cd /tmp/ltsmin7581630697444944777;'/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 1390 ms.
Running link step : cd /tmp/ltsmin7581630697444944777;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin7581630697444944777;'/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/stateBased10569826823521111244.hoa' '--buchi-type=spotba'
LTSmin run took 7072 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-11 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property NoC3x3-PT-1B-LTLFireability-11 finished in 209122 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Graph (trivial) has 786 edges and 844 vertex of which 537 / 844 are part of one of the 20 SCC in 1 ms
Free SCC test removed 517 places
Ensure Unique test removed 587 transitions
Reduce isomorphic transitions removed 587 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 326 transition count 377
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 316 transition count 377
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 18 Pre rules applied. Total rules applied 21 place count 316 transition count 359
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 2 with 36 rules applied. Total rules applied 57 place count 298 transition count 359
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 71 place count 284 transition count 335
Iterating global reduction 2 with 14 rules applied. Total rules applied 85 place count 284 transition count 335
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 88 place count 281 transition count 329
Iterating global reduction 2 with 3 rules applied. Total rules applied 91 place count 281 transition count 329
Performed 65 Post agglomeration using F-continuation condition.Transition count delta: 65
Deduced a syphon composed of 65 places in 0 ms
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 2 with 130 rules applied. Total rules applied 221 place count 216 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 223 place count 216 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 225 place count 215 transition count 263
Applied a total of 225 rules in 37 ms. Remains 215 /844 variables (removed 629) and now considering 263/975 (removed 712) transitions.
[2025-06-01 21:56:39] [INFO ] Flow matrix only has 244 transitions (discarded 19 similar events)
// Phase 1: matrix 244 rows 215 cols
[2025-06-01 21:56:39] [INFO ] Computed 40 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:56:39] [INFO ] Implicit Places using invariants in 93 ms returned [10, 38, 73, 122, 165, 195]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 96 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 209/844 places, 263/975 transitions.
Graph (trivial) has 147 edges and 209 vertex of which 26 / 209 are part of one of the 13 SCC in 0 ms
Free SCC test removed 13 places
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 196 transition count 236
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 195 transition count 235
Applied a total of 4 rules in 9 ms. Remains 195 /209 variables (removed 14) and now considering 235/263 (removed 28) transitions.
[2025-06-01 21:56:39] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
// Phase 1: matrix 216 rows 195 cols
[2025-06-01 21:56:39] [INFO ] Computed 34 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:56:39] [INFO ] Implicit Places using invariants in 82 ms returned []
[2025-06-01 21:56:39] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
[2025-06-01 21:56:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:56:39] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:56:39] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 224 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 195/844 places, 235/975 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 366 ms. Remains : 195/844 places, 235/975 transitions.
Stuttering acceptance computed with spot in 108 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-13 finished in 496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(((X(p0) U p1)&&F(p0)&&F(G(p2))))))'
Support contains 3 out of 844 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 826 transition count 957
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 826 transition count 957
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 42 place count 826 transition count 951
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 48 place count 820 transition count 945
Iterating global reduction 1 with 6 rules applied. Total rules applied 54 place count 820 transition count 945
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 55 place count 820 transition count 944
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 57 place count 818 transition count 942
Iterating global reduction 2 with 2 rules applied. Total rules applied 59 place count 818 transition count 942
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 61 place count 818 transition count 940
Applied a total of 61 rules in 85 ms. Remains 818 /844 variables (removed 26) and now considering 940/975 (removed 35) transitions.
// Phase 1: matrix 940 rows 818 cols
[2025-06-01 21:56:39] [INFO ] Computed 40 invariants in 8 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:56:39] [INFO ] Implicit Places using invariants in 194 ms returned []
[2025-06-01 21:56:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:56:40] [INFO ] Implicit Places using invariants and state equation in 465 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
Running 939 sub problems to find dead transitions.
[2025-06-01 21:56:40] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/818 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 818/1758 variables, and 40 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 939/939 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 939 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/817 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 939 unsolved
At refinement iteration 1 (OVERLAPS) 1/818 variables, 40/40 constraints. Problems are: Problem set: 0 solved, 939 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:57:31] [INFO ] Deduced a trap composed of 43 places in 212 ms of which 20 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:57:32] [INFO ] Deduced a trap composed of 46 places in 210 ms of which 19 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:57:33] [INFO ] Deduced a trap composed of 49 places in 174 ms of which 17 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:57:36] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:57:36] [INFO ] Deduced a trap composed of 58 places in 134 ms of which 13 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:57:38] [INFO ] Deduced a trap composed of 64 places in 101 ms of which 9 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-01 21:57:40] [INFO ] Deduced a trap composed of 69 places in 77 ms of which 6 ms to minimize.
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 818/1758 variables, and 47 constraints, problems are : Problem set: 0 solved, 939 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, State Equation: 0/818 constraints, PredecessorRefiner: 0/939 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 939 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 818/844 places, 940/975 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60875 ms. Remains : 818/844 places, 940/975 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (OR (NOT p0) (NOT p1)), true]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-14
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-14 finished in 61205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U G((p1&&F(!p2)))))'
Support contains 4 out of 844 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 844/844 places, 975/975 transitions.
Graph (trivial) has 782 edges and 844 vertex of which 542 / 844 are part of one of the 20 SCC in 1 ms
Free SCC test removed 522 places
Ensure Unique test removed 592 transitions
Reduce isomorphic transitions removed 592 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 7 transitions
Trivial Post-agglo rules discarded 7 transitions
Performed 7 trivial Post agglomeration. Transition count delta: 7
Iterating post reduction 0 with 7 rules applied. Total rules applied 8 place count 321 transition count 375
Reduce places removed 7 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 9 rules applied. Total rules applied 17 place count 314 transition count 373
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 19 place count 312 transition count 373
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 18 Pre rules applied. Total rules applied 19 place count 312 transition count 355
Deduced a syphon composed of 18 places in 0 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 55 place count 294 transition count 355
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 69 place count 280 transition count 331
Iterating global reduction 3 with 14 rules applied. Total rules applied 83 place count 280 transition count 331
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 86 place count 277 transition count 325
Iterating global reduction 3 with 3 rules applied. Total rules applied 89 place count 277 transition count 325
Performed 61 Post agglomeration using F-continuation condition.Transition count delta: 61
Deduced a syphon composed of 61 places in 0 ms
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 3 with 122 rules applied. Total rules applied 211 place count 216 transition count 264
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 213 place count 216 transition count 262
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 215 transition count 265
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 216 place count 215 transition count 264
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 217 place count 214 transition count 263
Reduce places removed 3 places and 0 transitions.
Graph (trivial) has 134 edges and 211 vertex of which 14 / 211 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Iterating post reduction 5 with 4 rules applied. Total rules applied 221 place count 204 transition count 263
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 235 place count 204 transition count 249
Applied a total of 235 rules in 43 ms. Remains 204 /844 variables (removed 640) and now considering 249/975 (removed 726) transitions.
[2025-06-01 21:57:40] [INFO ] Flow matrix only has 230 transitions (discarded 19 similar events)
// Phase 1: matrix 230 rows 204 cols
[2025-06-01 21:57:40] [INFO ] Computed 37 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:57:41] [INFO ] Implicit Places using invariants in 100 ms returned [10, 40, 77]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 101 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 201/844 places, 249/975 transitions.
Graph (trivial) has 127 edges and 201 vertex of which 14 / 201 are part of one of the 7 SCC in 0 ms
Free SCC test removed 7 places
Ensure Unique test removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Applied a total of 1 rules in 5 ms. Remains 194 /201 variables (removed 7) and now considering 235/249 (removed 14) transitions.
[2025-06-01 21:57:41] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
// Phase 1: matrix 216 rows 194 cols
[2025-06-01 21:57:41] [INFO ] Computed 34 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:57:41] [INFO ] Implicit Places using invariants in 90 ms returned []
[2025-06-01 21:57:41] [INFO ] Flow matrix only has 216 transitions (discarded 19 similar events)
[2025-06-01 21:57:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-01 21:57:41] [INFO ] State equation strengthened by 7 read => feed constraints.
[2025-06-01 21:57:41] [INFO ] Implicit Places using invariants and state equation in 130 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 194/844 places, 235/975 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 370 ms. Remains : 194/844 places, 235/975 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p1) p2), (NOT p0), p2]
Running random walk in product with property : NoC3x3-PT-1B-LTLFireability-15
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-1B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-1B-LTLFireability-15 finished in 504 ms.
All properties solved by simple procedures.
Total runtime 807125 ms.

BK_STOP 1748815061451

--------------------
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="NoC3x3-PT-1B"
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 NoC3x3-PT-1B, 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 r142-tall-174876812100164"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/NoC3x3-PT-1B.tgz
mv NoC3x3-PT-1B 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 ;