Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 6.9K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 78K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.4K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 63K 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.6K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 14K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 126K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K 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 745K 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-8A-LTLFireability-00
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-01
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-02
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-03
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-04
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-05
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-06
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-07
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-08
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-09
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-10
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-11
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-12
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-13
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-14
FORMULA_NAME NoC3x3-PT-8A-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1748852107539

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-8A
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202505121319
[2025-06-02 08:15:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2025-06-02 08:15:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 08:15:09] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2025-06-02 08:15:09] [INFO ] Transformed 317 places.
[2025-06-02 08:15:09] [INFO ] Transformed 4293 transitions.
[2025-06-02 08:15:09] [INFO ] Found NUPN structural information;
[2025-06-02 08:15:09] [INFO ] Parsed PT model containing 317 places and 4293 transitions and 9691 arcs in 248 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Ensure Unique test removed 3607 transitions
Reduce redundant transitions removed 3607 transitions.
FORMULA NoC3x3-PT-8A-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA NoC3x3-PT-8A-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 31 out of 317 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 317/317 places, 686/686 transitions.
Discarding 53 places :
Symmetric choice reduction at 0 with 53 rule applications. Total rules 53 place count 264 transition count 575
Iterating global reduction 0 with 53 rules applied. Total rules applied 106 place count 264 transition count 575
Drop transitions (Redundant composition of simpler transitions.) removed 62 transitions
Redundant transition composition rules discarded 62 transitions
Iterating global reduction 0 with 62 rules applied. Total rules applied 168 place count 264 transition count 513
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 0 with 9 rules applied. Total rules applied 177 place count 255 transition count 513
Applied a total of 177 rules in 66 ms. Remains 255 /317 variables (removed 62) and now considering 513/686 (removed 173) transitions.
// Phase 1: matrix 513 rows 255 cols
[2025-06-02 08:15:09] [INFO ] Computed 57 invariants in 16 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:09] [INFO ] Implicit Places using invariants in 386 ms returned []
[2025-06-02 08:15:09] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:15:10] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 692 ms to find 0 implicit places.
Running 512 sub problems to find dead transitions.
[2025-06-02 08:15: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/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 513/768 variables, 255/312 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 0/312 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 768/768 variables, and 312 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 512 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/254 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 1 (OVERLAPS) 1/255 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/255 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 3 (OVERLAPS) 513/768 variables, 255/312 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/768 variables, 512/824 constraints. Problems are: Problem set: 0 solved, 512 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/768 variables, 0/824 constraints. Problems are: Problem set: 0 solved, 512 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 768/768 variables, and 824 constraints, problems are : Problem set: 0 solved, 512 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 255/255 constraints, PredecessorRefiner: 512/512 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60250ms problems are : Problem set: 0 solved, 512 unsolved
Search for dead transitions found 0 dead transitions in 60263ms
Starting structural reductions in LTL mode, iteration 1 : 255/317 places, 513/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61039 ms. Remains : 255/317 places, 513/686 transitions.
Support contains 31 out of 255 places after structural reductions.
[2025-06-02 08:16:10] [INFO ] Flatten gal took : 65 ms
[2025-06-02 08:16:10] [INFO ] Flatten gal took : 36 ms
[2025-06-02 08:16:10] [INFO ] Input system was already deterministic with 513 transitions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 34775 steps (7 resets) in 1204 ms. (28 steps per ms) remains 0/29 properties
Computed a total of 1 stabilizing places and 1 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Graph (trivial) has 163 edges and 255 vertex of which 75 / 255 are part of one of the 33 SCC in 2 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 203 transition count 348
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 179 transition count 348
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 176 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 176 transition count 345
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 116 place count 154 transition count 323
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 252 place count 154 transition count 187
Applied a total of 252 rules in 43 ms. Remains 154 /255 variables (removed 101) and now considering 187/513 (removed 326) transitions.
// Phase 1: matrix 187 rows 154 cols
[2025-06-02 08:16:11] [INFO ] Computed 48 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:11] [INFO ] Implicit Places using invariants in 86 ms returned []
[2025-06-02 08:16:11] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:11] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 08:16:12] [INFO ] Implicit Places using invariants and state equation in 173 ms returned []
Implicit Place search using SMT with State Equation took 261 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:16:12] [INFO ] Redundant transitions in 7 ms returned []
Running 162 sub problems to find dead transitions.
[2025-06-02 08:16:12] [INFO ] Invariant cache hit.
[2025-06-02 08:16:12] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/340 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 112/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (OVERLAPS) 0/340 variables, 0/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Real declared 340/341 variables, and 314 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5748 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 162 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/154 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/154 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 2 (OVERLAPS) 186/340 variables, 154/202 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/340 variables, 112/314 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 162/476 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 162 unsolved
At refinement iteration 6 (OVERLAPS) 0/340 variables, 0/476 constraints. Problems are: Problem set: 0 solved, 162 unsolved
No progress, stopping.
After SMT solving in domain Int declared 340/341 variables, and 476 constraints, problems are : Problem set: 0 solved, 162 unsolved in 5298 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 154/154 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 162/162 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11067ms problems are : Problem set: 0 solved, 162 unsolved
Search for dead transitions found 0 dead transitions in 11070ms
Starting structural reductions in SI_LTL mode, iteration 1 : 154/255 places, 187/513 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 11388 ms. Remains : 154/255 places, 187/513 transitions.
Stuttering acceptance computed with spot in 131 ms :[(NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-00 finished in 11583 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(!p0)||(!p0&&X(p1)&&F(p2))))) U X(!p2)))'
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 253 transition count 511
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 253 transition count 511
Applied a total of 4 rules in 12 ms. Remains 253 /255 variables (removed 2) and now considering 511/513 (removed 2) transitions.
// Phase 1: matrix 511 rows 253 cols
[2025-06-02 08:16:23] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:23] [INFO ] Implicit Places using invariants in 162 ms returned []
[2025-06-02 08:16:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:16:23] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2025-06-02 08:16:23] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 310 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 510/820 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 764/764 variables, and 820 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60138ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60139ms
Starting structural reductions in LTL mode, iteration 1 : 253/255 places, 511/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60488 ms. Remains : 253/255 places, 511/513 transitions.
Stuttering acceptance computed with spot in 339 ms :[p2, (AND p0 p2 (NOT p1)), p2, (AND p0 p2), p0, (AND p0 (NOT p1)), (AND p0 (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-01
Product exploration explored 100000 steps with 33191 reset in 596 ms.
Stack based approach found an accepted trace after 192 steps with 61 reset with depth 5 and stack size 5 in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-01 finished in 61457 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 U p1) U (p2&&(p0 U p1)))))'
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 253 transition count 511
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 253 transition count 511
Applied a total of 4 rules in 10 ms. Remains 253 /255 variables (removed 2) and now considering 511/513 (removed 2) transitions.
// Phase 1: matrix 511 rows 253 cols
[2025-06-02 08:17:24] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:17:24] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 08:17:24] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:17:25] [INFO ] Implicit Places using invariants and state equation in 194 ms returned []
Implicit Place search using SMT with State Equation took 309 ms to find 0 implicit places.
Running 510 sub problems to find dead transitions.
[2025-06-02 08:17:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 764/764 variables, and 310 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 510 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/252 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 1 (OVERLAPS) 1/253 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/253 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 3 (OVERLAPS) 511/764 variables, 253/310 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/764 variables, 510/820 constraints. Problems are: Problem set: 0 solved, 510 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/764 variables, 0/820 constraints. Problems are: Problem set: 0 solved, 510 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 Int declared 764/764 variables, and 820 constraints, problems are : Problem set: 0 solved, 510 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 253/253 constraints, PredecessorRefiner: 510/510 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 510 unsolved
Search for dead transitions found 0 dead transitions in 60131ms
Starting structural reductions in LTL mode, iteration 1 : 253/255 places, 511/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60455 ms. Remains : 253/255 places, 511/513 transitions.
Stuttering acceptance computed with spot in 147 ms :[(NOT p1), (OR (NOT p2) (NOT p1)), true, (OR (NOT p1) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-02 finished in 60627 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&((p1 U (G(p1)||(p1&&G(p2))))||(X(X(p1)) U ((p2&&X(X(p1)))||X(X(G(p1))))))))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 10 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
// Phase 1: matrix 510 rows 252 cols
[2025-06-02 08:18:25] [INFO ] Computed 57 invariants in 6 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:25] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 08:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:18:25] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:18:25] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60418 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 672 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-03
Product exploration explored 100000 steps with 33333 reset in 442 ms.
Product exploration explored 100000 steps with 33333 reset in 453 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1 p2), (X p2), (X (NOT (AND (NOT p0) p2 p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) p2))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (AND p2 p1)), (X (NOT (AND (NOT p2) (NOT p1)))), (X (NOT (OR (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X p0), (X (NOT (AND (NOT p2) p1))), (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))))), (X p1), (X (X p2)), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND (NOT p0) p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (AND p2 p1))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (NOT (OR (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p1)))), (X (X (NOT (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1)))))), (X (X (NOT (AND p2 (NOT p1))))), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 31 factoid took 25 ms. Reduced automaton from 14 states, 48 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA NoC3x3-PT-8A-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property NoC3x3-PT-8A-LTLFireability-03 finished in 62066 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||(X(p1) U ((!p2&&X(p1))||X(G(p1)))))))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 5 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
[2025-06-02 08:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:27] [INFO ] Implicit Places using invariants in 185 ms returned []
[2025-06-02 08:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:19:27] [INFO ] Implicit Places using invariants and state equation in 232 ms returned []
Implicit Place search using SMT with State Equation took 420 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:19:27] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60102ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60103ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60529 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-04 finished in 60830 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 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Graph (trivial) has 164 edges and 255 vertex of which 75 / 255 are part of one of the 33 SCC in 1 ms
Free SCC test removed 42 places
Ensure Unique test removed 132 transitions
Reduce isomorphic transitions removed 132 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 203 transition count 348
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 179 transition count 348
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 69 place count 176 transition count 345
Iterating global reduction 2 with 3 rules applied. Total rules applied 72 place count 176 transition count 345
Performed 23 Post agglomeration using F-continuation condition.Transition count delta: 23
Deduced a syphon composed of 23 places in 0 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 2 with 46 rules applied. Total rules applied 118 place count 153 transition count 322
Drop transitions (Redundant composition of simpler transitions.) removed 136 transitions
Redundant transition composition rules discarded 136 transitions
Iterating global reduction 2 with 136 rules applied. Total rules applied 254 place count 153 transition count 186
Applied a total of 254 rules in 33 ms. Remains 153 /255 variables (removed 102) and now considering 186/513 (removed 327) transitions.
// Phase 1: matrix 186 rows 153 cols
[2025-06-02 08:20:28] [INFO ] Computed 48 invariants in 0 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:28] [INFO ] Implicit Places using invariants in 67 ms returned []
[2025-06-02 08:20:28] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:28] [INFO ] State equation strengthened by 112 read => feed constraints.
[2025-06-02 08:20:28] [INFO ] Implicit Places using invariants and state equation in 183 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:20:28] [INFO ] Redundant transitions in 8 ms returned []
Running 161 sub problems to find dead transitions.
[2025-06-02 08:20:28] [INFO ] Invariant cache hit.
[2025-06-02 08:20:28] [INFO ] State equation strengthened by 112 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (OVERLAPS) 0/338 variables, 0/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Real declared 338/339 variables, and 313 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5275 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 161 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/153 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/153 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 2 (OVERLAPS) 185/338 variables, 153/201 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/338 variables, 112/313 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/338 variables, 161/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
At refinement iteration 6 (OVERLAPS) 0/338 variables, 0/474 constraints. Problems are: Problem set: 0 solved, 161 unsolved
No progress, stopping.
After SMT solving in domain Int declared 338/339 variables, and 474 constraints, problems are : Problem set: 0 solved, 161 unsolved in 5182 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 153/153 constraints, ReadFeed: 112/112 constraints, PredecessorRefiner: 161/161 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10467ms problems are : Problem set: 0 solved, 161 unsolved
Search for dead transitions found 0 dead transitions in 10468ms
Starting structural reductions in SI_LTL mode, iteration 1 : 153/255 places, 186/513 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 10773 ms. Remains : 153/255 places, 186/513 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-05 finished in 10874 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(G(p0))||(p1&&F((p2||X(!p3)))))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 5 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
// Phase 1: matrix 510 rows 252 cols
[2025-06-02 08:20:39] [INFO ] Computed 57 invariants in 2 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:39] [INFO ] Implicit Places using invariants in 105 ms returned []
[2025-06-02 08:20:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:20:39] [INFO ] Implicit Places using invariants and state equation in 205 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:20: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/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 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 Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30039 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60125ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60446 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 183 ms :[true, (AND (NOT p2) p3), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) (NOT p2) p3) (AND (NOT p0) (NOT p1))), (NOT p0), (AND (NOT p2) p3 (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-06
Entered a terminal (fully accepting) state of product in 66 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-06 finished in 60645 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&G((p1||X(X(F((p2&&F(!p3))))))))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 3 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
[2025-06-02 08:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:39] [INFO ] Implicit Places using invariants in 108 ms returned []
[2025-06-02 08:21:39] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:21:40] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:21: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/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "ParserException while parsing response: ((t0 1.0)
(t1 2.0)
(t2 0.0)
(t3 0.0)
(t4 2.0)
(t5 0.0)
(t6 0.0)
(t7 1.0)
(t8 1.0)
(t9 0.0)
(t10 2.0)
(t11 1.0)
(t12 0.0)
(t13 1.0)
(t14 0.0)
(t15 3.0)
(t16 1.0)
(t17 0.0)
(t18 1.0)
(t19 1.0)
(t20 timeout
1.0 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60093ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60094ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60580 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 347 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2)) (AND (NOT p0) p3) (AND (NOT p1) p3)), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p1) p3)), (OR (AND (NOT p0) p3) (AND (NOT p1) p3)), (AND (NOT p1) p3)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-07
Product exploration explored 100000 steps with 238 reset in 418 ms.
Stack based approach found an accepted trace after 9 steps with 0 reset with depth 10 and stack size 10 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-07 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-07 finished in 61367 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((X(p0)&&(F(G(p1))||G(!p2)))||X(G(p0))))))'
Support contains 4 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 6 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
[2025-06-02 08:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:41] [INFO ] Implicit Places using invariants in 107 ms returned []
[2025-06-02 08:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:22:41] [INFO ] Implicit Places using invariants and state equation in 206 ms returned []
Implicit Place search using SMT with State Equation took 315 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:22:41] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60095ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60421 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 447 ms :[(NOT p0), (NOT p0), (AND p2 (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND p2 (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), true, (NOT p1), (AND (NOT p1) p2 p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-08
Product exploration explored 100000 steps with 25078 reset in 415 ms.
Product exploration explored 100000 steps with 25064 reset in 455 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 172 ms. Reduced automaton from 10 states, 32 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 314 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
RANDOM walk for 40000 steps (8 resets) in 542 ms. (73 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
[2025-06-02 08:23:43] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/252 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 203 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/252 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 442ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 169 steps, including 1 resets, run visited all 1 properties in 2 ms. (steps per millisecond=84 )
Parikh walk visited 1 properties in 7 ms.
Knowledge obtained : [(AND (NOT p2) p1 p0), (X (NOT p2)), (X (X (NOT p2))), (X (X (NOT (AND p1 p2 p0)))), (X (X (NOT (AND p1 p2 (NOT p0))))), (X (X (AND p1 (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) p2 p0)))), (X (X (NOT (AND (NOT p1) p2 (NOT p0))))), (X (X p0)), (X (X p1)), (X (X (NOT (AND p1 (NOT p2) (NOT p0)))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1)))]
Knowledge based reduction with 13 factoid took 827 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 356 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 359 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 4 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
[2025-06-02 08:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:23:45] [INFO ] Implicit Places using invariants in 98 ms returned []
[2025-06-02 08:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:23:45] [INFO ] Implicit Places using invariants and state equation in 187 ms returned []
Implicit Place search using SMT with State Equation took 286 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:23:45] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60108ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Finished structural reductions in LTL mode , in 1 iterations and 60402 ms. Remains : 252/252 places, 510/510 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 150 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 292 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
RANDOM walk for 40000 steps (8 resets) in 650 ms. (61 steps per ms) remains 1/15 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2025-06-02 08:24:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/252 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 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/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 15/19 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/19 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 233/252 variables, 53/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/762 variables, 1/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 0/762 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 762/762 variables, and 310 constraints, problems are : Problem set: 0 solved, 1 unsolved in 261 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 509ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 92 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=92 )
Parikh walk visited 1 properties in 1 ms.
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT p2))), (X (X (NOT (AND (NOT p0) p2 p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT (AND (NOT p0) p2 (NOT p1))))), (X (X (NOT (AND p0 p2 p1)))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND p0 (NOT p2) p1))), (X (X p0)), (X (X p1)), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND p0 (NOT p2) p1))), (F (NOT (OR p0 p2))), (F (NOT (OR p0 p2 p1))), (F (NOT (OR (NOT p0) (NOT p2) (NOT p1)))), (F (NOT (OR p0 p2 (NOT p1)))), (F (NOT (OR p0 (NOT p2) p1))), (F (NOT p1)), (F (NOT (OR (NOT p0) (NOT p2)))), (F (NOT p0)), (F (NOT (OR p0 (NOT p2)))), (F p2), (F (NOT (AND p0 (NOT p2)))), (F (NOT (OR p0 (NOT p2) (NOT p1)))), (F (NOT (OR (NOT p0) (NOT p2) p1))), (F (NOT (OR (NOT p0) p2 p1)))]
Knowledge based reduction with 12 factoid took 698 ms. Reduced automaton from 8 states, 28 edges and 3 AP (stutter sensitive) to 8 states, 28 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 280 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 284 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Stuttering acceptance computed with spot in 266 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Product exploration explored 100000 steps with 19963 reset in 399 ms.
Product exploration explored 100000 steps with 19958 reset in 451 ms.
Applying partial POR strategy [false, false, false, false, true, true, true, true]
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Graph (trivial) has 160 edges and 252 vertex of which 73 / 252 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 0 with 22 rules applied. Total rules applied 23 place count 211 transition count 380
Deduced a syphon composed of 22 places in 0 ms
Drop transitions (Redundant composition of simpler transitions.) removed 107 transitions
Redundant transition composition rules discarded 107 transitions
Iterating global reduction 0 with 107 rules applied. Total rules applied 130 place count 211 transition count 273
Deduced a syphon composed of 22 places in 1 ms
Applied a total of 130 rules in 33 ms. Remains 211 /252 variables (removed 41) and now considering 273/510 (removed 237) transitions.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:24:50] [INFO ] Redundant transitions in 3 ms returned []
Running 272 sub problems to find dead transitions.
[2025-06-02 08:24:50] [INFO ] Flow matrix only has 242 transitions (discarded 31 similar events)
// Phase 1: matrix 242 rows 211 cols
[2025-06-02 08:24:50] [INFO ] Computed 57 invariants in 1 ms
[2025-06-02 08:24:50] [INFO ] State equation strengthened by 155 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 272 unsolved
At refinement iteration 1 (OVERLAPS) 1/211 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 272 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 40 ms of which 6 ms to minimize.
Problem TDEAD1 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD3 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:52] [INFO ] Deduced a trap composed of 3 places in 31 ms of which 2 ms to minimize.
Problem TDEAD5 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD7 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 17 ms of which 1 ms to minimize.
Problem TDEAD9 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD11 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 23 ms of which 3 ms to minimize.
Problem TDEAD13 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 25 ms of which 2 ms to minimize.
Problem TDEAD15 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD17 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 28 ms of which 2 ms to minimize.
Problem TDEAD19 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 22 ms of which 2 ms to minimize.
Problem TDEAD21 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 2 ms to minimize.
Problem TDEAD25 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD27 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 2 ms to minimize.
Problem TDEAD29 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 20 ms of which 1 ms to minimize.
Problem TDEAD31 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 24 ms of which 1 ms to minimize.
Problem TDEAD33 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 25 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-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 18 ms of which 1 ms to minimize.
Problem TDEAD39 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 16 ms of which 1 ms to minimize.
Problem TDEAD41 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 11 ms to minimize.
Problem TDEAD1 is UNSAT
Problem TDEAD3 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD43 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 20/77 constraints. Problems are: Problem set: 20 solved, 252 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 27 ms of which 2 ms to minimize.
Problem TDEAD46 is UNSAT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 08:24:53] [INFO ] Deduced a trap composed of 3 places in 32 ms of which 1 ms to minimize.
Problem TDEAD48 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 2/79 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/211 variables, 0/79 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 5 (OVERLAPS) 241/452 variables, 211/290 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 154/444 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/444 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 1/453 variables, 1/445 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/445 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 0/453 variables, 0/445 constraints. Problems are: Problem set: 22 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Real declared 453/453 variables, and 445 constraints, problems are : Problem set: 22 solved, 250 unsolved in 19673 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 211/211 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 272/272 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 22 solved, 250 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/188 variables, 0/0 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 1 (OVERLAPS) 23/211 variables, 57/57 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/211 variables, 22/79 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/211 variables, 0/79 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 4 (OVERLAPS) 241/452 variables, 211/290 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/452 variables, 154/444 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/452 variables, 250/694 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/452 variables, 0/694 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 8 (OVERLAPS) 1/453 variables, 1/695 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/453 variables, 0/695 constraints. Problems are: Problem set: 22 solved, 250 unsolved
At refinement iteration 10 (OVERLAPS) 0/453 variables, 0/695 constraints. Problems are: Problem set: 22 solved, 250 unsolved
No progress, stopping.
After SMT solving in domain Int declared 453/453 variables, and 695 constraints, problems are : Problem set: 22 solved, 250 unsolved in 21675 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 211/211 constraints, ReadFeed: 155/155 constraints, PredecessorRefiner: 250/272 constraints, Known Traps: 22/22 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 41378ms problems are : Problem set: 22 solved, 250 unsolved
Search for dead transitions found 22 dead transitions in 41379ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 211/252 places, 251/510 transitions.
Graph (complete) has 706 edges and 211 vertex of which 189 are kept as prefixes of interest. Removing 22 places using SCC suffix rule.2 ms
Discarding 22 places :
Also discarding 0 output transitions
Applied a total of 1 rules in 9 ms. Remains 189 /211 variables (removed 22) and now considering 251/251 (removed 0) transitions.
Starting structural reductions in SI_LTL mode, iteration 2 : 189/252 places, 251/510 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 41439 ms. Remains : 189/252 places, 251/510 transitions.
Built C files in :
/tmp/ltsmin2909029689026716007
[2025-06-02 08:25:31] [INFO ] Built C files in 57ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2909029689026716007
Running compilation step : cd /tmp/ltsmin2909029689026716007;'/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 896 ms.
Running link step : cd /tmp/ltsmin2909029689026716007;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin2909029689026716007;'/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/stateBased4547584936632794146.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 252 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 252/252 places, 510/510 transitions.
Applied a total of 0 rules in 6 ms. Remains 252 /252 variables (removed 0) and now considering 510/510 (removed 0) transitions.
// Phase 1: matrix 510 rows 252 cols
[2025-06-02 08:25:46] [INFO ] Computed 57 invariants in 7 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:25:46] [INFO ] Implicit Places using invariants in 124 ms returned []
[2025-06-02 08:25:46] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:25:47] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:25:47] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "ParserException while parsing response: ((s0 0.0)
(s1 0.0)
(s2 1.0)
(s3 0.0)
(s4 0.0)
(s5 0.0)
(s6 1.0)
(s7 0.0)
(s8 0.0)
(s9 0.0)
(s10 1.0)
(s11 0.0)
(s12 0.0)
(s13 0.0)
(s14 1.0)
(s15 0.0)
(s16 0.0)
(s17 0.0)
(s18 1.0)
(s19 0.0)
(s20 0.0)
(s21 0.0)
(s22 1.0)
(s23 0.0)
(s24 0.0)
(s25 0.0)
(s26 0.0)
(s27 0.0)
(s28 1.0)
(s29 0.0)
(s30 0.0)
(s31 0.0)
(s32 0.0)
(s33 0.0)
(s34 1.0)
(s35 0.0)
(s36 0.0)
(s37 1.0)
(s38 0.0)
(s39 0.0)
(s40 0.0)
(s41 1.0)
(s42 0.0)
(s43 0.0)
(s44 0.0)
(s45 1.0)
(s46 0.0)
(s47 0.0)
(s48 0.0)
(s49 1.0)
(s50 0.0)
(s51 0.0)
(s52 0.0)
(s53 1.0)
(s54 0.0)
(s55 0.0)
(s56 0.0)
(s57 1.0)
(s58 0.0)
(s59 0.0)
(s60 0.0)
(s61 0.0)
(s62 1.0)
(s63 0.0)
(s64 0.0)
(s65 0.0)
(s66 1.0)
(s67 0.0)
(s68 0.0)
(s69 0.0)
(s70 1.0)
(s71 0.0)
(s72 0.0)
(s73 0.0)
(s74 1.0)
(s75 0.0)
(s76 0.0)
(s77 0.0)
(s78 1.0)
(s79 0.0)
(s80 0.0)
(s81 0.0)
(s82 0.0)
(s83 0.0)
(s84 0.0)
(s85 0.0)
(s86 1.0)
(s87 0.0)
(s88 0.0)
(s89 1.0)
(s90 0.0)
(s91 0.0)
(s92 0.0)
(s93 1.0)
(s94 0.0)
(s95 0.0)
(s96 0.0)
(s97 1.0)
(s98 0.0)
(s99 0.0)
(s100 0.0)
(s101 1.0)
(s102 0.0)
(s103 0.0)
(s104 0.0)
(s105 1.0)
(s106 0.0)
(s107 0.0)
(s108 0.0)
(s109 0.0)
(s110 1.0)
(s111 0.0)
(s112 0.0)
(s113 0.0)
(s114 0.0)
(s115 0.0)
(s116 0.0)
(s117 0.0)
(s118 0.0)
(s119 0.0)
(s120 1.0)
(s121 0.0)
(s122 1.0)
(s123 0.0)
(s124 0.0)
(s125 0.0)
(s126 0.0)
(s127 0.0)
(s128 1.0)
(s129 0.0)
(s130 0.0)
(s131 0.0)
(s132 1.0)
(s133 0.0)
(s134 0.0)
(s135 0.0)
(s136 1.0)
(s137 0.0)
(s138 0.0)
(s139 0.0)
(s140 1.0)
(s141 0.0)
(s142 0.0)
(s143 0.0)
(s144 1.0)
(s145 0.0)
(s146 0.0)
(s147 0.0)
(s148 1.0)
(s149 0.0)
(s150 0.0)
(s151 0.0)
(s152 1.0)
(s153 0.0)
(s154 0.0)
(s155 0.0)
(s156 0.0)
(s157 0.0)
(s158 0.0)
(s159 0.0)
(s160 1.0)
(s161 0.0)
(s162 0.0)
(s163 0.0)
(s164 0.0)
(s165 0.0)
(s166 1.0)
(s167 1.0)
(s168 0.0)
(s169 0.0)
(s170 0.0)
(s171 1.0)
(s172 0.0)
(s173 0.0)
(s174 0.0)
(s175 1.0)
(s176 0.0)
(s177 0.0)
(s178 0.0)
(s179 1.0)
(s180 0.0)
(s181 0.0)
(s182 0.0)
(s183 1.0)
(s184 0.0)
(s185 0.0)
(s186 0.0)
(s187 0.0)
(s188 0.0)
(s189 0.0)
(s190 0.0)
(s191 1.0)
(s192 1.0)
(s193 0.0)
(s194 0.0)
(s195 0.0)
(s196 1.0)
(s197 0.0)
(s198 0.0)
(s199 timeout
0.0)
(s200 org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 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 Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30037 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60124ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60126ms
Finished structural reductions in LTL mode , in 1 iterations and 60438 ms. Remains : 252/252 places, 510/510 transitions.
Built C files in :
/tmp/ltsmin477399347940753094
[2025-06-02 08:26:47] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin477399347940753094
Running compilation step : cd /tmp/ltsmin477399347940753094;'/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 735 ms.
Running link step : cd /tmp/ltsmin477399347940753094;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin477399347940753094;'/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/stateBased9295504646246079570.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2025-06-02 08:27:02] [INFO ] Flatten gal took : 27 ms
[2025-06-02 08:27:02] [INFO ] Flatten gal took : 24 ms
[2025-06-02 08:27:02] [INFO ] Time to serialize gal into /tmp/LTL8790315314789035357.gal : 7 ms
[2025-06-02 08:27:02] [INFO ] Time to serialize properties into /tmp/LTL8517073566294937604.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8790315314789035357.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18079191023383928242.hoa' '-atoms' '/tmp/LTL8517073566294937604.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL8517073566294937604.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18079191023383928242.hoa
Detected timeout of ITS tools.
[2025-06-02 08:27:17] [INFO ] Flatten gal took : 24 ms
[2025-06-02 08:27:17] [INFO ] Flatten gal took : 22 ms
[2025-06-02 08:27:17] [INFO ] Time to serialize gal into /tmp/LTL11312489328428269239.gal : 4 ms
[2025-06-02 08:27:17] [INFO ] Time to serialize properties into /tmp/LTL8237348060603183906.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11312489328428269239.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8237348060603183906.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X((X("(p176!=1)"))U((X(G("(p176!=1)")))||((X("(p176!=1)"))&&((F(G("(p85!=1)")))||(G(!("((p25==1)&&(p49==1))")))))))))
Formula 0 simplified : X(X!"(p176!=1)" R (XF!"(p176!=1)" & (X!"(p176!=1)" | (GF!"(p85!=1)" & F"((p25==1)&&(p49==1))"))))
Detected timeout of ITS tools.
[2025-06-02 08:27:32] [INFO ] Flatten gal took : 22 ms
[2025-06-02 08:27:32] [INFO ] Applying decomposition
[2025-06-02 08:27:32] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph12785045706857227158.txt' '-o' '/tmp/graph12785045706857227158.bin' '-w' '/tmp/graph12785045706857227158.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph12785045706857227158.bin' '-l' '-1' '-v' '-w' '/tmp/graph12785045706857227158.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:27:32] [INFO ] Decomposing Gal with order
[2025-06-02 08:27:32] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:27:32] [INFO ] Removed a total of 216 redundant transitions.
[2025-06-02 08:27:32] [INFO ] Flatten gal took : 69 ms
[2025-06-02 08:27:32] [INFO ] Fuse similar labels procedure discarded/fused a total of 234 labels/synchronizations in 9 ms.
[2025-06-02 08:27:32] [INFO ] Time to serialize gal into /tmp/LTL741611292811504129.gal : 5 ms
[2025-06-02 08:27:32] [INFO ] Time to serialize properties into /tmp/LTL12611699981607327178.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL741611292811504129.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12611699981607327178.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X((X("(i4.u18.p176!=1)"))U((X(G("(i4.u18.p176!=1)")))||((X("(i4.u18.p176!=1)"))&&((F(G("(i2.u10.p85!=1)")))||(G(!("((i1.u8.p25==1)&...181
Formula 0 simplified : X(X!"(i4.u18.p176!=1)" R (XF!"(i4.u18.p176!=1)" & (X!"(i4.u18.p176!=1)" | (GF!"(i2.u10.p85!=1)" & F"((i1.u8.p25==1)&&(i1.u5.p49==1))...160
Detected timeout of ITS tools.
Treatment of property NoC3x3-PT-8A-LTLFireability-08 finished in 306850 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)||(F((p1&&(F(!p0) U !p2)))&&X(p3))))'
Support contains 5 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 8 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
[2025-06-02 08:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:27:48] [INFO ] Implicit Places using invariants in 141 ms returned []
[2025-06-02 08:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:27:48] [INFO ] Implicit Places using invariants and state equation in 243 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:27:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60114ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60115ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60512 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 330 ms :[(OR (AND p0 (NOT p1)) (AND p0 (NOT p3)) (AND p0 p2)), (OR (NOT p1) p2), (NOT p3), (OR (AND p0 (NOT p1)) (AND p0 p2)), (AND p0 (NOT p3)), (AND p0 p2), (OR (AND p0 (NOT p1)) (AND p0 p2)), p2, true, p0]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-10 finished in 60876 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Graph (trivial) has 160 edges and 255 vertex of which 73 / 255 are part of one of the 32 SCC in 1 ms
Free SCC test removed 41 places
Ensure Unique test removed 130 transitions
Reduce isomorphic transitions removed 130 transitions.
Reduce places removed 1 places and 1 transitions.
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 24 transitions
Trivial Post-agglo rules discarded 24 transitions
Performed 24 trivial Post agglomeration. Transition count delta: 24
Iterating post reduction 0 with 41 rules applied. Total rules applied 42 place count 204 transition count 350
Reduce places removed 24 places and 0 transitions.
Iterating post reduction 1 with 24 rules applied. Total rules applied 66 place count 180 transition count 350
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 68 place count 178 transition count 348
Iterating global reduction 2 with 2 rules applied. Total rules applied 70 place count 178 transition count 348
Performed 22 Post agglomeration using F-continuation condition.Transition count delta: 22
Deduced a syphon composed of 22 places in 0 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 2 with 44 rules applied. Total rules applied 114 place count 156 transition count 326
Drop transitions (Redundant composition of simpler transitions.) removed 130 transitions
Redundant transition composition rules discarded 130 transitions
Iterating global reduction 2 with 130 rules applied. Total rules applied 244 place count 156 transition count 196
Applied a total of 244 rules in 21 ms. Remains 156 /255 variables (removed 99) and now considering 196/513 (removed 317) transitions.
// Phase 1: matrix 196 rows 156 cols
[2025-06-02 08:28:48] [INFO ] Computed 48 invariants in 1 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:28:48] [INFO ] Implicit Places using invariants in 72 ms returned []
[2025-06-02 08:28:48] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:28:49] [INFO ] State equation strengthened by 106 read => feed constraints.
[2025-06-02 08:28:49] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 08:28:49] [INFO ] Redundant transitions in 53 ms returned []
Running 171 sub problems to find dead transitions.
[2025-06-02 08:28:49] [INFO ] Invariant cache hit.
[2025-06-02 08:28:49] [INFO ] State equation strengthened by 106 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 195/351 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (OVERLAPS) 0/351 variables, 0/310 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Real declared 351/352 variables, and 310 constraints, problems are : Problem set: 0 solved, 171 unsolved in 6328 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 156/156 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 171 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/156 variables, 48/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/156 variables, 0/48 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 2 (OVERLAPS) 195/351 variables, 156/204 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/351 variables, 106/310 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/351 variables, 171/481 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/351 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 171 unsolved
At refinement iteration 6 (OVERLAPS) 0/351 variables, 0/481 constraints. Problems are: Problem set: 0 solved, 171 unsolved
No progress, stopping.
After SMT solving in domain Int declared 351/352 variables, and 481 constraints, problems are : Problem set: 0 solved, 171 unsolved in 5994 ms.
Refiners :[Positive P Invariants (semi-flows): 48/48 constraints, State Equation: 156/156 constraints, ReadFeed: 106/106 constraints, PredecessorRefiner: 171/171 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 12338ms problems are : Problem set: 0 solved, 171 unsolved
Search for dead transitions found 0 dead transitions in 12339ms
Starting structural reductions in SI_LTL mode, iteration 1 : 156/255 places, 196/513 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 12698 ms. Remains : 156/255 places, 196/513 transitions.
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-11
Stuttering criterion allowed to conclude after 3628 steps with 0 reset in 21 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-11 finished in 12809 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F((p1||G(p2))))&&p0)))'
Support contains 3 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 4 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
// Phase 1: matrix 510 rows 252 cols
[2025-06-02 08:29:01] [INFO ] Computed 57 invariants in 3 ms
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:29:01] [INFO ] Implicit Places using invariants in 152 ms returned []
[2025-06-02 08:29:01] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:29:02] [INFO ] Implicit Places using invariants and state equation in 195 ms returned []
Implicit Place search using SMT with State Equation took 370 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:29:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60110ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60110ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60486 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 193 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-14
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-14 finished in 60716 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 255 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 255/255 places, 513/513 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 252 transition count 510
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 252 transition count 510
Applied a total of 6 rules in 6 ms. Remains 252 /255 variables (removed 3) and now considering 510/513 (removed 3) transitions.
[2025-06-02 08:30:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:30:02] [INFO ] Implicit Places using invariants in 101 ms returned []
[2025-06-02 08:30:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 08:30:02] [INFO ] Implicit Places using invariants and state equation in 193 ms returned []
Implicit Place search using SMT with State Equation took 296 ms to find 0 implicit places.
Running 509 sub problems to find dead transitions.
[2025-06-02 08:30:02] [INFO ] Invariant cache hit.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 0/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 762/762 variables, and 309 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 509 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/251 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 1 (OVERLAPS) 1/252 variables, 57/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/252 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 3 (OVERLAPS) 510/762 variables, 252/309 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/762 variables, 509/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/762 variables, 0/818 constraints. Problems are: Problem set: 0 solved, 509 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 762/762 variables, and 818 constraints, problems are : Problem set: 0 solved, 509 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 57/57 constraints, State Equation: 252/252 constraints, PredecessorRefiner: 509/509 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60098ms problems are : Problem set: 0 solved, 509 unsolved
Search for dead transitions found 0 dead transitions in 60099ms
Starting structural reductions in LTL mode, iteration 1 : 252/255 places, 510/513 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60404 ms. Remains : 252/255 places, 510/513 transitions.
Stuttering acceptance computed with spot in 121 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : NoC3x3-PT-8A-LTLFireability-15
Product exploration explored 100000 steps with 841 reset in 489 ms.
Stack based approach found an accepted trace after 14 steps with 0 reset with depth 15 and stack size 15 in 0 ms.
FORMULA NoC3x3-PT-8A-LTLFireability-15 FALSE TECHNIQUES STACK_TEST
Treatment of property NoC3x3-PT-8A-LTLFireability-15 finished in 61032 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202505121319/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0) U ((X(p0)&&(F(G(p1))||G(!p2)))||X(G(p0))))))'
[2025-06-02 08:31:03] [INFO ] Flatten gal took : 18 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7405038981732354541
[2025-06-02 08:31:03] [INFO ] Computing symmetric may disable matrix : 513 transitions.
[2025-06-02 08:31:03] [INFO ] Applying decomposition
[2025-06-02 08:31:03] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 08:31:03] [INFO ] Computing symmetric may enable matrix : 513 transitions.
[2025-06-02 08:31:03] [INFO ] Flatten gal took : 17 ms
[2025-06-02 08:31:03] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph11316847488630425959.txt' '-o' '/tmp/graph11316847488630425959.bin' '-w' '/tmp/graph11316847488630425959.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph11316847488630425959.bin' '-l' '-1' '-v' '-w' '/tmp/graph11316847488630425959.weights' '-q' '0' '-e' '0.001'
[2025-06-02 08:31:03] [INFO ] Decomposing Gal with order
[2025-06-02 08:31:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:31:03] [INFO ] Removed a total of 213 redundant transitions.
[2025-06-02 08:31:03] [INFO ] Flatten gal took : 33 ms
[2025-06-02 08:31:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 238 labels/synchronizations in 5 ms.
[2025-06-02 08:31:03] [INFO ] Time to serialize gal into /tmp/LTLFireability13131380628292429429.gal : 4 ms
[2025-06-02 08:31:03] [INFO ] Time to serialize properties into /tmp/LTLFireability13909250473123969411.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability13131380628292429429.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13909250473123969411.ltl' '-c' '-stutter-deadlock'
[2025-06-02 08:31:03] [INFO ] Computing Do-Not-Accords matrix : 513 transitions.

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((X("(i4.u18.p176!=1)"))U(((X("(i4.u18.p176!=1)"))&&((F(G("(i2.u9.p85!=1)")))||(G(!("((i1.u5.p25==1)&&(i1.u3.p49==1))")))))||(X(G(...180
Formula 0 simplified : X(X!"(i4.u18.p176!=1)" R (XF!"(i4.u18.p176!=1)" & (X!"(i4.u18.p176!=1)" | (GF!"(i2.u9.p85!=1)" & F"((i1.u5.p25==1)&&(i1.u3.p49==1))"...159
[2025-06-02 08:31:03] [INFO ] Computation of Completed DNA matrix. took 47 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2025-06-02 08:31:03] [INFO ] Built C files in 191ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7405038981732354541
Running compilation step : cd /tmp/ltsmin7405038981732354541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1193 ms.
Running link step : cd /tmp/ltsmin7405038981732354541;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin7405038981732354541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(<>([]((LTLAPp1==true)))||[](!(LTLAPp2==true))))||X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 7/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.006: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.019: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.031: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.050: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.074: LTL layer: formula: X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(<>([]((LTLAPp1==true)))||[](!(LTLAPp2==true))))||X([]((LTLAPp0==true))))))
pins2lts-mc-linux64( 7/ 8), 0.074: "X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(<>([]((LTLAPp1==true)))||[](!(LTLAPp2==true))))||X([]((LTLAPp0==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 7/ 8), 0.074: Using Spin LTL semantics
pins2lts-mc-linux64( 6/ 8), 0.074: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.135: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.154: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.168: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.313: There are 517 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.313: State length is 256, there are 570 groups
pins2lts-mc-linux64( 0/ 8), 0.313: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.313: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.313: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.313: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 0.502: [Blue] ~62 levels ~960 states ~14936 transitions
pins2lts-mc-linux64( 1/ 8), 0.679: [Blue] ~122 levels ~1920 states ~33560 transitions
pins2lts-mc-linux64( 1/ 8), 1.007: [Blue] ~242 levels ~3840 states ~71832 transitions
pins2lts-mc-linux64( 5/ 8), 1.638: [Blue] ~485 levels ~7680 states ~158344 transitions
pins2lts-mc-linux64( 1/ 8), 2.557: [Blue] ~1641 levels ~15360 states ~332528 transitions
pins2lts-mc-linux64( 1/ 8), 3.138: [Blue] ~3551 levels ~30720 states ~698312 transitions
pins2lts-mc-linux64( 1/ 8), 3.872: [Blue] ~7380 levels ~61440 states ~1527024 transitions
pins2lts-mc-linux64( 1/ 8), 4.707: [Blue] ~14994 levels ~122880 states ~3110800 transitions
pins2lts-mc-linux64( 1/ 8), 6.476: [Blue] ~30204 levels ~245760 states ~6420264 transitions
pins2lts-mc-linux64( 1/ 8), 10.038: [Blue] ~60643 levels ~491520 states ~12936888 transitions
pins2lts-mc-linux64( 1/ 8), 17.046: [Blue] ~121507 levels ~983040 states ~26346328 transitions
pins2lts-mc-linux64( 1/ 8), 31.537: [Blue] ~243357 levels ~1966080 states ~53622760 transitions
pins2lts-mc-linux64( 1/ 8), 61.674: [Blue] ~487100 levels ~3932160 states ~107817672 transitions
pins2lts-mc-linux64( 2/ 8), 122.237: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 122.581:
pins2lts-mc-linux64( 0/ 8), 122.581: Explored 6517630 states 193563193 transitions, fanout: 29.698
pins2lts-mc-linux64( 0/ 8), 122.581: Total exploration time 122.240 sec (121.940 sec minimum, 122.084 sec on average)
pins2lts-mc-linux64( 0/ 8), 122.581: States per second: 53318, Transitions per second: 1583469
pins2lts-mc-linux64( 0/ 8), 122.581:
pins2lts-mc-linux64( 0/ 8), 122.581: State space has 134217461 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 122.581: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 122.581: blue states: 6517630 (4.86%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 122.581: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 122.581: all-red states: 1319004 (0.98%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 122.581:
pins2lts-mc-linux64( 0/ 8), 122.581: Total memory used for local state coloring: 79.3MB
pins2lts-mc-linux64( 0/ 8), 122.581:
pins2lts-mc-linux64( 0/ 8), 122.581: Queue width: 8B, total height: 5198626, memory: 39.66MB
pins2lts-mc-linux64( 0/ 8), 122.581: Tree memory: 1056.7MB, 8.3 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 122.581: Tree fill ratio (roots/leafs): 99.0%/12.0%
pins2lts-mc-linux64( 0/ 8), 122.581: Stored 556 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 122.581: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 122.581: Est. total memory use: 1096.3MB (~1063.7MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7405038981732354541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(<>([]((LTLAPp1==true)))||[](!(LTLAPp2==true))))||X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin7405038981732354541;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202505121319/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((X((LTLAPp0==true)) U ((X((LTLAPp0==true))&&(<>([]((LTLAPp1==true)))||[](!(LTLAPp2==true))))||X([]((LTLAPp0==true))))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:241)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:176)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:114)
at java.base/java.lang.Thread.run(Thread.java:1583)
Detected timeout of ITS tools.
[2025-06-02 08:56:24] [INFO ] Applying decomposition
[2025-06-02 08:56:24] [INFO ] Flatten gal took : 289 ms
[2025-06-02 08:56:25] [INFO ] Decomposing Gal with order
[2025-06-02 08:56:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 08:56:25] [INFO ] Removed a total of 417 redundant transitions.
[2025-06-02 08:56:25] [INFO ] Flatten gal took : 190 ms
[2025-06-02 08:56:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 37 ms.
[2025-06-02 08:56:25] [INFO ] Time to serialize gal into /tmp/LTLFireability11580400594931202453.gal : 24 ms
[2025-06-02 08:56:25] [INFO ] Time to serialize properties into /tmp/LTLFireability10920402307629907388.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11580400594931202453.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10920402307629907388.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((X((X("(u36.p176!=1)"))U(((X("(u36.p176!=1)"))&&((F(G("(u19.p85!=1)")))||(G(!("((u7.p25==1)&&(u11.p49==1))")))))||(X(G("(u36.p176!=1...164
Formula 0 simplified : X(X!"(u36.p176!=1)" R (XF!"(u36.p176!=1)" & (X!"(u36.p176!=1)" | (GF!"(u19.p85!=1)" & F"((u7.p25==1)&&(u11.p49==1))"))))
Reverse transition relation is NOT exact ! Due to transitions u4.t97, u5.t94, u11.t88, u12.t85, u13.t82, u18.t76, u19.t73, u25.t67, u26.t64, u27.t61, u34.t...374
9 unique states visited
6 strongly connected components in search stack
15 transitions explored
9 items max in DFS search stack
64817 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,648.223,6924400,1,0,1.47649e+07,678,2858,2.52219e+07,281,4365,29866251
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA NoC3x3-PT-8A-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Total runtime 3194316 ms.

BK_STOP 1748855303675

--------------------
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-8A"
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-8A, 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-174876812200268"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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