fond
Model Checking Contest 2026
16th edition, Hamburg, Germany, June 23, 2026
Execution of r146-tall-177961074200515
Last Updated
Jun 17, 2026

About the Execution of ITS-Tools for GPUForwardProgress-PT-36b

Execution Summary
Max Memory
Used (MB)
Time wait (ms) CPU Usage (ms) I/O Wait (ms) Computed Result Execution
Status
1054.111 452940.00 550690.00 2215.70 FFFFFTFFFFTFFFTF normal

Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r146-tall-177961074200515.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-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-5973
Executing tool itstools
Input is GPUForwardProgress-PT-36b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074200515
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 644K
-rw-r--r-- 1 mcc users 7.6K Mar 7 11:38 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 11:38 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.1K Mar 7 11:38 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 7 11:38 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:39 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:39 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:39 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 7 11:38 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 152K Mar 7 11:38 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.9K Mar 7 11:38 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 66K Mar 7 11:38 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.8K Mar 15 10:39 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:39 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 179K Mar 3 18:30 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 GPUForwardProgress-PT-36b-LTLCardinality-00
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-01
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-02
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-03
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-04
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-05
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-06
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-07
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-08
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-09
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-10
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-11
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-12
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-13
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-14
FORMULA_NAME GPUForwardProgress-PT-36b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779733346966

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=GPUForwardProgress-PT-36b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 18:22:28] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 18:22:28] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 18:22:28] [INFO ] Load time of PNML (sax parser for PT used): 102 ms
[2026-05-25 18:22:28] [INFO ] Transformed 720 places.
[2026-05-25 18:22:28] [INFO ] Transformed 757 transitions.
[2026-05-25 18:22:28] [INFO ] Found NUPN structural information;
[2026-05-25 18:22:28] [INFO ] Parsed PT model containing 720 places and 757 transitions and 1877 arcs in 203 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 720 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 720/720 places, 757/757 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 719 transition count 757
Discarding 74 places :
Symmetric choice reduction at 1 with 74 rule applications. Total rules 75 place count 645 transition count 683
Iterating global reduction 1 with 74 rules applied. Total rules applied 149 place count 645 transition count 683
Discarding 35 places :
Symmetric choice reduction at 1 with 35 rule applications. Total rules 184 place count 610 transition count 648
Iterating global reduction 1 with 35 rules applied. Total rules applied 219 place count 610 transition count 648
Ensure Unique test removed 32 transitions
Reduce isomorphic transitions removed 32 transitions.
Iterating post reduction 1 with 32 rules applied. Total rules applied 251 place count 610 transition count 616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 252 place count 609 transition count 615
Iterating global reduction 2 with 1 rules applied. Total rules applied 253 place count 609 transition count 615
Applied a total of 253 rules in 189 ms. Remains 609 /720 variables (removed 111) and now considering 615/757 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4606655303473524412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6155831427959130015.kers'
[2026-05-25 18:22:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4606655303473524412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6155831427959130015.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 615 rows 609 cols 1591 entries
Finished phase 1 with 571 SingleSign rule and 1 generalized
[2026-05-25 18:22:28] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6155831427959130015.kers
Total runtime 3 ms.
[2026-05-25 18:22:29] [INFO ] Implicit Places using invariants in 341 ms returned []
[2026-05-25 18:22:29] [INFO ] Invariant cache hit.
[2026-05-25 18:22:29] [INFO ] Implicit Places using invariants and state equation in 634 ms returned []
Implicit Place search using SMT with State Equation took 1008 ms to find 0 implicit places.
Running 614 sub problems to find dead transitions.
[2026-05-25 18:22:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 615/1223 variables, 608/645 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 1223/1224 variables, and 645 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30035 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 608/609 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 2 (OVERLAPS) 615/1223 variables, 608/645 constraints. Problems are: Problem set: 0 solved, 614 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1223 variables, 614/1259 constraints. Problems are: Problem set: 0 solved, 614 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1223/1224 variables, and 1259 constraints, problems are : Problem set: 0 solved, 614 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 608/609 constraints, PredecessorRefiner: 614/614 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60260ms problems are : Problem set: 0 solved, 614 unsolved
Search for dead transitions found 0 dead transitions in 60274ms
Starting structural reductions in LTL mode, iteration 1 : 609/720 places, 615/757 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61510 ms. Remains : 609/720 places, 615/757 transitions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Applied a total of 0 rules in 11 ms. Remains 609 /609 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2026-05-25 18:23:29] [INFO ] Invariant cache hit.
[2026-05-25 18:23:30] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-25 18:23:30] [INFO ] Invariant cache hit.
[2026-05-25 18:23:30] [INFO ] Implicit Places using invariants and state equation in 658 ms returned []
Implicit Place search using SMT with State Equation took 816 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 828 ms. Remains : 609/609 places, 615/615 transitions.
Support contains 26 out of 609 places after structural reductions.
[2026-05-25 18:23:31] [INFO ] Flatten gal took : 79 ms
[2026-05-25 18:23:31] [INFO ] Flatten gal took : 29 ms
[2026-05-25 18:23:31] [INFO ] Input system was already deterministic with 615 transitions.
RANDOM walk for 40000 steps (129 resets) in 1225 ms. (32 steps per ms) remains 7/15 properties
BEST_FIRST walk for 40004 steps (12 resets) in 142 ms. (279 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 139 ms. (285 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 99 ms. (400 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (13 resets) in 109 ms. (363 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (12 resets) in 72 ms. (548 steps per ms) remains 5/7 properties
[2026-05-25 18:23:31] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 165/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 434/608 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 615/1223 variables, 608/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1223 variables, 0/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1/1224 variables, 1/646 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1224 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 0/1224 variables, 0/646 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1224/1224 variables, and 646 constraints, problems are : Problem set: 0 solved, 5 unsolved in 606 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 165/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 434/608 variables, 29/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/608 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 615/1223 variables, 608/645 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1223 variables, 5/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1223 variables, 0/650 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 1/1224 variables, 1/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1224 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1224 variables, 0/651 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1224/1224 variables, and 651 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1139 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 609/609 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1760ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 4 different solutions.
Finished Parikh walk after 239 steps, including 0 resets, run visited all 5 properties in 3 ms. (steps per millisecond=79 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 6 ms.
Computed a total of 113 stabilizing places and 113 stable transitions
Graph (complete) has 948 edges and 609 vertex of which 569 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.19 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 603 transition count 609
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 603 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 603 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 600 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 600 transition count 605
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 600 transition count 602
Applied a total of 22 rules in 38 ms. Remains 600 /609 variables (removed 9) and now considering 602/615 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14038513270945381128.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11522495612205483147.kers'
[2026-05-25 18:23:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14038513270945381128.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11522495612205483147.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 602 rows 600 cols 1565 entries
Finished phase 1 with 562 SingleSign rule and 1 generalized
[2026-05-25 18:23:33] [INFO ] Computed 37 invariants in 6 ms
Computed 37 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-11522495612205483147.kers
Total runtime 9 ms.
[2026-05-25 18:23:34] [INFO ] Implicit Places using invariants in 155 ms returned []
[2026-05-25 18:23:34] [INFO ] Invariant cache hit.
[2026-05-25 18:23:34] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 587 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-25 18:23:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1201/1202 variables, and 636 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1202 variables, and 1237 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30022 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60161ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60163ms
Starting structural reductions in LTL mode, iteration 1 : 600/609 places, 602/615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60791 ms. Remains : 600/609 places, 602/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(X(p1))))))'
Stuttering acceptance computed with spot in 270 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-01
Product exploration explored 100000 steps with 1122 reset in 319 ms.
Product exploration explored 100000 steps with 1138 reset in 240 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.9 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 3 factoid took 55 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (129 resets) in 271 ms. (147 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 161 ms. (246 steps per ms) remains 1/1 properties
[2026-05-25 18:24:35] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 524/599 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 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
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 524/599 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1201 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1202 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1202 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1202 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 370 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 654ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 173 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=86 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 169 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1132 ms.
Stuttering acceptance computed with spot in 161 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Support contains 3 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Applied a total of 0 rules in 15 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2026-05-25 18:24:36] [INFO ] Invariant cache hit.
[2026-05-25 18:24:36] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-25 18:24:36] [INFO ] Invariant cache hit.
[2026-05-25 18:24:37] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 557 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 573 ms. Remains : 600/600 places, 602/602 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 935 edges and 600 vertex of which 560 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.8 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (128 resets) in 163 ms. (243 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (12 resets) in 97 ms. (408 steps per ms) remains 1/1 properties
[2026-05-25 18:24:37] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 524/599 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/1202 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1202 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1202/1202 variables, and 637 constraints, problems are : Problem set: 0 solved, 1 unsolved in 262 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 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
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 73/75 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/75 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 524/599 variables, 35/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1201 variables, 1/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1201 variables, 0/637 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 1/1202 variables, 1/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1202 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1202 variables, 0/638 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1202/1202 variables, and 638 constraints, problems are : Problem set: 0 solved, 1 unsolved in 375 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 600/600 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 641ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 171 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=85 )
Parikh walk visited 1 properties in 1 ms.
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 5 states, 6 edges and 2 AP (stutter sensitive) to 5 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 191 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Knowledge-based reduction took 1065 ms.
Stuttering acceptance computed with spot in 167 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Stuttering acceptance computed with spot in 179 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Product exploration explored 100000 steps with 1130 reset in 147 ms.
Product exploration explored 100000 steps with 1181 reset in 151 ms.
Spot run failed in 77 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4850070474756885921
[2026-05-25 18:24:39] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4850070474756885921
Running compilation step : cd /tmp/ltsmin4850070474756885921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 993 ms.
Running link step : cd /tmp/ltsmin4850070474756885921;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin4850070474756885921;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased10314413601961689835.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 600 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 600/600 places, 602/602 transitions.
Applied a total of 0 rules in 14 ms. Remains 600 /600 variables (removed 0) and now considering 602/602 (removed 0) transitions.
[2026-05-25 18:24:54] [INFO ] Invariant cache hit.
[2026-05-25 18:24:54] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 18:24:54] [INFO ] Invariant cache hit.
[2026-05-25 18:24:54] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 567 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 582 ms. Remains : 600/600 places, 602/602 transitions.
Built C files in :
/tmp/ltsmin15475105011177999169
[2026-05-25 18:24:54] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15475105011177999169
Running compilation step : cd /tmp/ltsmin15475105011177999169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 853 ms.
Running link step : cd /tmp/ltsmin15475105011177999169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15475105011177999169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased15115295618713382237.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 18:25:09] [INFO ] Flatten gal took : 22 ms
[2026-05-25 18:25:09] [INFO ] Flatten gal took : 21 ms
[2026-05-25 18:25:09] [INFO ] Time to serialize gal into /tmp/LTL16957319296450715662.gal : 6 ms
[2026-05-25 18:25:09] [INFO ] Time to serialize properties into /tmp/LTL63307928547880714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16957319296450715662.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18207412029246149997.hoa' '-atoms' '/tmp/LTL63307928547880714.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL63307928547880714.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18207412029246149997.hoa
Detected timeout of ITS tools.
[2026-05-25 18:25:25] [INFO ] Flatten gal took : 18 ms
[2026-05-25 18:25:25] [INFO ] Flatten gal took : 18 ms
[2026-05-25 18:25:25] [INFO ] Time to serialize gal into /tmp/LTL13194098552087937033.gal : 4 ms
[2026-05-25 18:25:25] [INFO ] Time to serialize properties into /tmp/LTL10933949891016578029.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13194098552087937033.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10933949891016578029.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.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X(G(("(p626!=1)")||(X(X("((p78==0)||(p610==1))")))))))
Formula 0 simplified : XF(!"(p626!=1)" & XX!"((p78==0)||(p610==1))")
Detected timeout of ITS tools.
[2026-05-25 18:25:40] [INFO ] Flatten gal took : 18 ms
[2026-05-25 18:25:40] [INFO ] Applying decomposition
[2026-05-25 18:25:40] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17697764293995859155.txt' '-o' '/tmp/graph17697764293995859155.bin' '-w' '/tmp/graph17697764293995859155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17697764293995859155.bin' '-l' '-1' '-v' '-w' '/tmp/graph17697764293995859155.weights' '-q' '0' '-e' '0.001'
[2026-05-25 18:25:40] [INFO ] Decomposing Gal with order
[2026-05-25 18:25:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 18:25:40] [INFO ] Removed a total of 180 redundant transitions.
[2026-05-25 18:25:40] [INFO ] Flatten gal took : 106 ms
[2026-05-25 18:25:40] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 8 ms.
[2026-05-25 18:25:40] [INFO ] Time to serialize gal into /tmp/LTL2949269064461100386.gal : 12 ms
[2026-05-25 18:25:40] [INFO ] Time to serialize properties into /tmp/LTL4257517746396989206.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.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2949269064461100386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4257517746396989206.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G(("(i34.i2.u226.p626!=1)")||(X(X("((i3.i0.u30.p78==0)||(i33.i1.u219.p610==1))")))))))
Formula 0 simplified : XF(!"(i34.i2.u226.p626!=1)" & XX!"((i3.i0.u30.p78==0)||(i33.i1.u219.p610==1))")
Reverse transition relation is NOT exact ! Due to transitions t541, i1.t536, i1.i2.t529, i2.i1.t516, i2.i1.u29.t523, i3.t509, i3.i1.u35.t502, i4.t495, i4.i...1166
Computing Next relation with stutter on 3.00189e+17 deadlock states
300 unique states visited
300 strongly connected components in search stack
301 transitions explored
300 items max in DFS search stack
872 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,8.77871,254436,1,0,596692,337,5632,619168,159,1051,1072076
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-01 finished in 136664 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Graph (trivial) has 500 edges and 609 vertex of which 6 / 609 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 942 edges and 604 vertex of which 564 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.3 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 295 transitions
Trivial Post-agglo rules discarded 295 transitions
Performed 295 trivial Post agglomeration. Transition count delta: 295
Iterating post reduction 0 with 295 rules applied. Total rules applied 297 place count 563 transition count 310
Reduce places removed 295 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 300 rules applied. Total rules applied 597 place count 268 transition count 305
Reduce places removed 1 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 599 place count 267 transition count 304
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 600 place count 266 transition count 304
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 75 Pre rules applied. Total rules applied 600 place count 266 transition count 229
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 750 place count 191 transition count 229
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 785 place count 156 transition count 194
Iterating global reduction 4 with 35 rules applied. Total rules applied 820 place count 156 transition count 194
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 4 with 218 rules applied. Total rules applied 1038 place count 47 transition count 85
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1039 place count 47 transition count 84
Discarding 34 places :
Symmetric choice reduction at 5 with 34 rule applications. Total rules 1073 place count 13 transition count 17
Iterating global reduction 5 with 34 rules applied. Total rules applied 1107 place count 13 transition count 17
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1109 place count 12 transition count 16
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1110 place count 12 transition count 16
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1111 place count 11 transition count 15
Applied a total of 1111 rules in 61 ms. Remains 11 /609 variables (removed 598) and now considering 15/615 (removed 600) transitions.
[2026-05-25 18:25:50] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3138852555200401827.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-459059236708535739.kers'
[2026-05-25 18:25:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3138852555200401827.kers, --Pflows, --basisKERS=/tmp/petrispot-output-459059236708535739.kers]
Normalized transition count is 13 out of 14 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 11 cols 32 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 18:25:50] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-459059236708535739.kers
Total runtime 0 ms.
[2026-05-25 18:25:50] [INFO ] Implicit Places using invariants in 25 ms returned []
[2026-05-25 18:25:50] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2026-05-25 18:25:50] [INFO ] Invariant cache hit.
[2026-05-25 18:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:25:50] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 48 ms to find 0 implicit places.
[2026-05-25 18:25:50] [INFO ] Redundant transitions in 11 ms returned []
Running 9 sub problems to find dead transitions.
[2026-05-25 18:25:50] [INFO ] Flow matrix only has 14 transitions (discarded 1 similar events)
[2026-05-25 18:25:50] [INFO ] Invariant cache hit.
[2026-05-25 18:25:50] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 3/24 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 12 constraints, problems are : Problem set: 0 solved, 9 unsolved in 93 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 13/21 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/21 variables, 3/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/21 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 3/24 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 6/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/24 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 1/25 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 0/25 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 21 constraints, problems are : Problem set: 0 solved, 9 unsolved in 109 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 207ms problems are : Problem set: 0 solved, 9 unsolved
Search for dead transitions found 0 dead transitions in 207ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/609 places, 15/615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 333 ms. Remains : 11/609 places, 15/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-04
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-04 finished in 388 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&F(!p1)))))'
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 604 transition count 610
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 604 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 604 transition count 609
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 602 transition count 607
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 602 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 602 transition count 605
Applied a total of 17 rules in 55 ms. Remains 602 /609 variables (removed 7) and now considering 605/615 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11342102600985205720.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6843693931737635811.kers'
[2026-05-25 18:25:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11342102600985205720.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6843693931737635811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 605 rows 602 cols 1571 entries
Finished phase 1 with 564 SingleSign rule and 1 generalized
[2026-05-25 18:25:50] [INFO ] Computed 37 invariants in 3 ms
Computed 37 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6843693931737635811.kers
Total runtime 5 ms.
[2026-05-25 18:25:51] [INFO ] Implicit Places using invariants in 142 ms returned []
[2026-05-25 18:25:51] [INFO ] Invariant cache hit.
[2026-05-25 18:25:51] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 571 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2026-05-25 18:25:51] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 1206/1207 variables, and 638 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30024 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1207 variables, and 1242 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30019 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60129ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 602/609 places, 605/615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60767 ms. Remains : 602/609 places, 605/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(F(p0))||(F(p0)&&F(p1)))))'
Stuttering acceptance computed with spot in 173 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-07
Product exploration explored 100000 steps with 2640 reset in 172 ms.
Product exploration explored 100000 steps with 2669 reset in 186 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 938 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.5 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 6 factoid took 52 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 676 steps (0 resets) in 12 ms. (52 steps per ms) remains 0/3 properties
Knowledge based reduction with 6 factoid took 80 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 298 ms.
Stuttering acceptance computed with spot in 136 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 602 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 602/602 places, 605/605 transitions.
Applied a total of 0 rules in 18 ms. Remains 602 /602 variables (removed 0) and now considering 605/605 (removed 0) transitions.
[2026-05-25 18:26:52] [INFO ] Invariant cache hit.
[2026-05-25 18:26:52] [INFO ] Implicit Places using invariants in 134 ms returned []
[2026-05-25 18:26:52] [INFO ] Invariant cache hit.
[2026-05-25 18:26:53] [INFO ] Implicit Places using invariants and state equation in 441 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 608 ms. Remains : 602/602 places, 605/605 transitions.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 938 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.6 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Knowledge based reduction with 4 factoid took 53 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 579 steps (0 resets) in 9 ms. (57 steps per ms) remains 0/3 properties
Knowledge based reduction with 4 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Knowledge-based reduction took 297 ms.
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 2637 reset in 134 ms.
Product exploration explored 100000 steps with 2650 reset in 146 ms.
Spot run failed in 49 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin4260997843606120528
[2026-05-25 18:26:54] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4260997843606120528
Running compilation step : cd /tmp/ltsmin4260997843606120528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 900 ms.
Running link step : cd /tmp/ltsmin4260997843606120528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin4260997843606120528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased6189189754115150107.hoa' '--buchi-type=spotba'
LTSmin run took 447 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-07 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-07 finished in 64739 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 603 transition count 609
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 603 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 13 place count 603 transition count 608
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 16 place count 600 transition count 605
Iterating global reduction 1 with 3 rules applied. Total rules applied 19 place count 600 transition count 605
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 22 place count 600 transition count 602
Applied a total of 22 rules in 37 ms. Remains 600 /609 variables (removed 9) and now considering 602/615 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14653131432179997417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1410680469582232808.kers'
[2026-05-25 18:26:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14653131432179997417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1410680469582232808.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 602 rows 600 cols 1565 entries
Finished phase 1 with 562 SingleSign rule and 1 generalized
[2026-05-25 18:26:55] [INFO ] Computed 37 invariants in 8 ms
Computed 37 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-1410680469582232808.kers
Total runtime 10 ms.
[2026-05-25 18:26:55] [INFO ] Implicit Places using invariants in 156 ms returned []
[2026-05-25 18:26:55] [INFO ] Invariant cache hit.
[2026-05-25 18:26:56] [INFO ] Implicit Places using invariants and state equation in 450 ms returned []
Implicit Place search using SMT with State Equation took 610 ms to find 0 implicit places.
Running 601 sub problems to find dead transitions.
[2026-05-25 18:26:56] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
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 1201/1202 variables, and 636 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30015 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 601 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/599 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/599 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 2 (OVERLAPS) 602/1201 variables, 599/636 constraints. Problems are: Problem set: 0 solved, 601 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1201 variables, 601/1237 constraints. Problems are: Problem set: 0 solved, 601 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1201/1202 variables, and 1237 constraints, problems are : Problem set: 0 solved, 601 unsolved in 30012 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 599/600 constraints, PredecessorRefiner: 601/601 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60123ms problems are : Problem set: 0 solved, 601 unsolved
Search for dead transitions found 0 dead transitions in 60127ms
Starting structural reductions in LTL mode, iteration 1 : 600/609 places, 602/615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60777 ms. Remains : 600/609 places, 602/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 141 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 65382 steps with 214 reset in 103 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-08 finished in 61058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((p0&&X(G(p1)))))))))'
Support contains 4 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 605 transition count 611
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 605 transition count 611
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 603 transition count 609
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 603 transition count 609
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 14 place count 603 transition count 607
Applied a total of 14 rules in 43 ms. Remains 603 /609 variables (removed 6) and now considering 607/615 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14799380957724848762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17654601152431862122.kers'
[2026-05-25 18:27:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14799380957724848762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17654601152431862122.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 607 rows 603 cols 1575 entries
Finished phase 1 with 565 SingleSign rule and 1 generalized
[2026-05-25 18:27:56] [INFO ] Computed 37 invariants in 5 ms
Computed 37 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-17654601152431862122.kers
Total runtime 6 ms.
[2026-05-25 18:27:56] [INFO ] Implicit Places using invariants in 145 ms returned []
[2026-05-25 18:27:56] [INFO ] Invariant cache hit.
[2026-05-25 18:27:57] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 660 ms to find 0 implicit places.
Running 606 sub problems to find dead transitions.
[2026-05-25 18:27:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (OVERLAPS) 607/1209 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1209/1210 variables, and 639 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30018 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/602 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/602 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 2 (OVERLAPS) 607/1209 variables, 602/639 constraints. Problems are: Problem set: 0 solved, 606 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1209 variables, 606/1245 constraints. Problems are: Problem set: 0 solved, 606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1209/1210 variables, and 1245 constraints, problems are : Problem set: 0 solved, 606 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 602/603 constraints, PredecessorRefiner: 606/606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60094ms problems are : Problem set: 0 solved, 606 unsolved
Search for dead transitions found 0 dead transitions in 60096ms
Starting structural reductions in LTL mode, iteration 1 : 603/609 places, 607/615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60804 ms. Remains : 603/609 places, 607/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(X(F((X(G(p0))&&p1)))))))'
Stuttering acceptance computed with spot in 218 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-11
Stuttering criterion allowed to conclude after 297 steps with 0 reset in 2 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-11 finished in 61058 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Graph (trivial) has 502 edges and 609 vertex of which 6 / 609 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 942 edges and 604 vertex of which 564 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 297 transitions
Trivial Post-agglo rules discarded 297 transitions
Performed 297 trivial Post agglomeration. Transition count delta: 297
Iterating post reduction 0 with 297 rules applied. Total rules applied 299 place count 563 transition count 308
Reduce places removed 297 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 302 rules applied. Total rules applied 601 place count 266 transition count 303
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 602 place count 265 transition count 303
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 76 Pre rules applied. Total rules applied 602 place count 265 transition count 227
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 754 place count 189 transition count 227
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 789 place count 154 transition count 192
Iterating global reduction 3 with 35 rules applied. Total rules applied 824 place count 154 transition count 192
Performed 109 Post agglomeration using F-continuation condition.Transition count delta: 109
Deduced a syphon composed of 109 places in 0 ms
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 218 rules applied. Total rules applied 1042 place count 45 transition count 83
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1043 place count 45 transition count 82
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1078 place count 10 transition count 13
Iterating global reduction 4 with 35 rules applied. Total rules applied 1113 place count 10 transition count 13
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1115 place count 9 transition count 12
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 1116 place count 9 transition count 12
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1117 place count 8 transition count 11
Applied a total of 1117 rules in 30 ms. Remains 8 /609 variables (removed 601) and now considering 11/615 (removed 604) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9785629755058117962.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13735790749332795726.kers'
[2026-05-25 18:28:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9785629755058117962.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13735790749332795726.kers]
Normalized transition count is 10 out of 11 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 10 rows 8 cols 24 entries
Finished phase 1 with 8 SingleSign rule and 0 generalized
[2026-05-25 18:28:57] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13735790749332795726.kers
Total runtime 0 ms.
[2026-05-25 18:28:57] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-25 18:28:57] [INFO ] Invariant cache hit.
[2026-05-25 18:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:28:57] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 36 ms to find 0 implicit places.
[2026-05-25 18:28:57] [INFO ] Redundant transitions in 10 ms returned []
Running 6 sub problems to find dead transitions.
[2026-05-25 18:28:57] [INFO ] Invariant cache hit.
[2026-05-25 18:28:57] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 2/18 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/18 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 1/19 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 0/19 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 19/19 variables, and 9 constraints, problems are : Problem set: 0 solved, 6 unsolved in 60 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 10/16 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/16 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/16 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 2/18 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/18 variables, 5/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/18 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 1/19 variables, 1/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (OVERLAPS) 0/19 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 19/19 variables, and 15 constraints, problems are : Problem set: 0 solved, 6 unsolved in 71 ms.
Refiners :[State Equation: 8/8 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 131ms problems are : Problem set: 0 solved, 6 unsolved
Search for dead transitions found 0 dead transitions in 132ms
Starting structural reductions in SI_LTL mode, iteration 1 : 8/609 places, 11/615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 211 ms. Remains : 8/609 places, 11/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-13
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-13 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||F((G(F(p2))||(p3&&F(p2)))))))'
Support contains 7 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 604 transition count 610
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 604 transition count 610
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 604 transition count 609
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 13 place count 602 transition count 607
Iterating global reduction 1 with 2 rules applied. Total rules applied 15 place count 602 transition count 607
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 602 transition count 605
Applied a total of 17 rules in 46 ms. Remains 602 /609 variables (removed 7) and now considering 605/615 (removed 10) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7699000505700352546.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1834513293648389356.kers'
[2026-05-25 18:28:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7699000505700352546.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1834513293648389356.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 605 rows 602 cols 1571 entries
Finished phase 1 with 564 SingleSign rule and 1 generalized
[2026-05-25 18:28:58] [INFO ] Computed 37 invariants in 2 ms
Computed 37 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1834513293648389356.kers
Total runtime 3 ms.
[2026-05-25 18:28:58] [INFO ] Implicit Places using invariants in 138 ms returned []
[2026-05-25 18:28:58] [INFO ] Invariant cache hit.
[2026-05-25 18:28:58] [INFO ] Implicit Places using invariants and state equation in 444 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
Running 604 sub problems to find dead transitions.
[2026-05-25 18:28:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1206/1207 variables, and 638 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30014 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/601 variables, 37/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/601 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 2 (OVERLAPS) 605/1206 variables, 601/638 constraints. Problems are: Problem set: 0 solved, 604 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/1206 variables, 604/1242 constraints. Problems are: Problem set: 0 solved, 604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1206/1207 variables, and 1242 constraints, problems are : Problem set: 0 solved, 604 unsolved in 30020 ms.
Refiners :[Generalized P Invariants (flows): 37/37 constraints, State Equation: 601/602 constraints, PredecessorRefiner: 604/604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 0 solved, 604 unsolved
Search for dead transitions found 0 dead transitions in 60097ms
Starting structural reductions in LTL mode, iteration 1 : 602/609 places, 605/615 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60732 ms. Remains : 602/609 places, 605/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&(G(p1)||F((G(F(p2))||(p3&&F(p2)))))))'
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), true]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-14
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 216 ms.
Computed a total of 111 stabilizing places and 111 stable transitions
Graph (complete) has 938 edges and 602 vertex of which 562 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.4 ms
Computed a total of 111 stabilizing places and 111 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 18 factoid took 14 ms. Proved property starting from automaton with 7 states, 16 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-14 finished in 61453 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 615/615 transitions.
Graph (trivial) has 499 edges and 609 vertex of which 6 / 609 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 942 edges and 604 vertex of which 564 are kept as prefixes of interest. Removing 40 places using SCC suffix rule.2 ms
Discarding 40 places :
Also discarding 3 output transitions
Drop transitions (Output transitions of discarded places.) removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 294 transitions
Trivial Post-agglo rules discarded 294 transitions
Performed 294 trivial Post agglomeration. Transition count delta: 294
Iterating post reduction 0 with 294 rules applied. Total rules applied 296 place count 563 transition count 311
Reduce places removed 294 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 299 rules applied. Total rules applied 595 place count 269 transition count 306
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 596 place count 268 transition count 306
Performed 77 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 77 Pre rules applied. Total rules applied 596 place count 268 transition count 229
Deduced a syphon composed of 77 places in 1 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 154 rules applied. Total rules applied 750 place count 191 transition count 229
Discarding 35 places :
Symmetric choice reduction at 3 with 35 rule applications. Total rules 785 place count 156 transition count 194
Iterating global reduction 3 with 35 rules applied. Total rules applied 820 place count 156 transition count 194
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 3 with 216 rules applied. Total rules applied 1036 place count 48 transition count 86
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 1037 place count 48 transition count 85
Discarding 35 places :
Symmetric choice reduction at 4 with 35 rule applications. Total rules 1072 place count 13 transition count 16
Iterating global reduction 4 with 35 rules applied. Total rules applied 1107 place count 13 transition count 16
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1109 place count 12 transition count 15
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1110 place count 11 transition count 14
Applied a total of 1110 rules in 23 ms. Remains 11 /609 variables (removed 598) and now considering 14/615 (removed 601) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10279541144833027768.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11350203880432183254.kers'
[2026-05-25 18:29:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10279541144833027768.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11350203880432183254.kers]
Normalized transition count is 13 out of 14 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 13 rows 11 cols 30 entries
Finished phase 1 with 11 SingleSign rule and 0 generalized
[2026-05-25 18:29:59] [INFO ] Computed 0 invariants in 0 ms
Computed 0 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11350203880432183254.kers
Total runtime 0 ms.
[2026-05-25 18:29:59] [INFO ] Implicit Places using invariants in 17 ms returned []
[2026-05-25 18:29:59] [INFO ] Invariant cache hit.
[2026-05-25 18:29:59] [INFO ] State equation strengthened by 1 read => feed constraints.
[2026-05-25 18:29:59] [INFO ] Implicit Places using invariants and state equation in 18 ms returned []
Implicit Place search using SMT with State Equation took 42 ms to find 0 implicit places.
[2026-05-25 18:29:59] [INFO ] Redundant transitions in 9 ms returned []
Running 8 sub problems to find dead transitions.
[2026-05-25 18:29:59] [INFO ] Invariant cache hit.
[2026-05-25 18:29:59] [INFO ] State equation strengthened by 1 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 1/25 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 0/25 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 25/25 variables, and 12 constraints, problems are : Problem set: 0 solved, 8 unsolved in 98 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/7 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 13/20 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/20 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 4/24 variables, 4/11 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/24 variables, 8/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/24 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 1/25 variables, 1/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 0/25 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Int declared 25/25 variables, and 20 constraints, problems are : Problem set: 0 solved, 8 unsolved in 94 ms.
Refiners :[State Equation: 11/11 constraints, ReadFeed: 1/1 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 193ms problems are : Problem set: 0 solved, 8 unsolved
Search for dead transitions found 0 dead transitions in 193ms
Starting structural reductions in SI_LTL mode, iteration 1 : 11/609 places, 14/615 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 11/609 places, 14/615 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : GPUForwardProgress-PT-36b-LTLCardinality-15
Stuttering criterion allowed to conclude after 6 steps with 0 reset in 0 ms.
FORMULA GPUForwardProgress-PT-36b-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property GPUForwardProgress-PT-36b-LTLCardinality-15 finished in 382 ms.
All properties solved by simple procedures.
Total runtime 451788 ms.

BK_STOP 1779733799906

--------------------
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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -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.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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="GPUForwardProgress-PT-36b"
export BK_EXAMINATION="LTLCardinality"
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-5973"
echo " Executing tool itstools"
echo " Input is GPUForwardProgress-PT-36b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961074200515"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/GPUForwardProgress-PT-36b.tgz
mv GPUForwardProgress-PT-36b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;