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-177961074000147.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 FunctionPointer-PT-c032, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961074000147
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 7.7K Mar 7 07:28 CTLCardinality.txt
-rw-r--r-- 1 mcc users 82K Mar 7 07:28 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 7 07:28 CTLFireability.txt
-rw-r--r-- 1 mcc users 32K Mar 7 07:28 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:26 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:26 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 10:26 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 10:26 LTLFireability.xml
-rw-r--r-- 1 mcc users 15K Mar 7 07:28 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 155K Mar 7 07:28 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.9K Mar 7 07:28 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 7 07:28 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:26 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:26 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 4.2M 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 FunctionPointer-PT-c032-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c032-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779697873016

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c032
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 08:31:14] [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 08:31:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 08:31:14] [INFO ] Load time of PNML (sax parser for PT used): 351 ms
[2026-05-25 08:31:14] [INFO ] Transformed 2826 places.
[2026-05-25 08:31:14] [INFO ] Transformed 8960 transitions.
[2026-05-25 08:31:14] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 478 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c032-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-07 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c032-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 12 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 300 places :
Symmetric choice reduction at 1 with 300 rule applications. Total rules 317 place count 1311 transition count 3694
Iterating global reduction 1 with 300 rules applied. Total rules applied 617 place count 1311 transition count 3694
Ensure Unique test removed 372 transitions
Reduce isomorphic transitions removed 372 transitions.
Iterating post reduction 1 with 372 rules applied. Total rules applied 989 place count 1311 transition count 3322
Discarding 153 places :
Symmetric choice reduction at 2 with 153 rule applications. Total rules 1142 place count 1158 transition count 3016
Iterating global reduction 2 with 153 rules applied. Total rules applied 1295 place count 1158 transition count 3016
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1367 place count 1158 transition count 2944
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1381 place count 1144 transition count 2916
Iterating global reduction 3 with 14 rules applied. Total rules applied 1395 place count 1144 transition count 2916
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1409 place count 1130 transition count 2888
Iterating global reduction 3 with 14 rules applied. Total rules applied 1423 place count 1130 transition count 2888
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1437 place count 1116 transition count 2860
Iterating global reduction 3 with 14 rules applied. Total rules applied 1451 place count 1116 transition count 2860
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1465 place count 1102 transition count 2832
Iterating global reduction 3 with 14 rules applied. Total rules applied 1479 place count 1102 transition count 2832
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1493 place count 1088 transition count 2804
Iterating global reduction 3 with 14 rules applied. Total rules applied 1507 place count 1088 transition count 2804
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1521 place count 1074 transition count 2776
Iterating global reduction 3 with 14 rules applied. Total rules applied 1535 place count 1074 transition count 2776
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1549 place count 1060 transition count 2748
Iterating global reduction 3 with 14 rules applied. Total rules applied 1563 place count 1060 transition count 2748
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1621 place count 1002 transition count 2530
Iterating global reduction 3 with 58 rules applied. Total rules applied 1679 place count 1002 transition count 2530
Discarding 58 places :
Symmetric choice reduction at 3 with 58 rule applications. Total rules 1737 place count 944 transition count 2298
Iterating global reduction 3 with 58 rules applied. Total rules applied 1795 place count 944 transition count 2298
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1852 place count 887 transition count 2170
Iterating global reduction 3 with 57 rules applied. Total rules applied 1909 place count 887 transition count 2170
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1966 place count 830 transition count 2056
Iterating global reduction 3 with 57 rules applied. Total rules applied 2023 place count 830 transition count 2056
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2079 place count 774 transition count 1944
Iterating global reduction 3 with 56 rules applied. Total rules applied 2135 place count 774 transition count 1944
Discarding 56 places :
Symmetric choice reduction at 3 with 56 rule applications. Total rules 2191 place count 718 transition count 1832
Iterating global reduction 3 with 56 rules applied. Total rules applied 2247 place count 718 transition count 1832
Discarding 53 places :
Symmetric choice reduction at 3 with 53 rule applications. Total rules 2300 place count 665 transition count 1726
Iterating global reduction 3 with 53 rules applied. Total rules applied 2353 place count 665 transition count 1726
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2360 place count 658 transition count 1712
Iterating global reduction 3 with 7 rules applied. Total rules applied 2367 place count 658 transition count 1712
Applied a total of 2367 rules in 1103 ms. Remains 658 /1628 variables (removed 970) and now considering 1712/5962 (removed 4250) transitions.
[2026-05-25 08:31:15] [INFO ] Flow matrix only has 1154 transitions (discarded 558 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12602081662906960385.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18394670579466685761.kers'
[2026-05-25 08:31:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12602081662906960385.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18394670579466685761.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1154 rows 658 cols 3172 entries
Finished phase 1 with 655 SingleSign rule and 1 generalized
[2026-05-25 08:31:15] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-18394670579466685761.kers
Total runtime 6 ms.
[2026-05-25 08:31:16] [INFO ] Implicit Places using invariants in 701 ms returned []
[2026-05-25 08:31:16] [INFO ] Flow matrix only has 1154 transitions (discarded 558 similar events)
[2026-05-25 08:31:16] [INFO ] Invariant cache hit.
[2026-05-25 08:31:16] [INFO ] State equation strengthened by 288 read => feed constraints.
[2026-05-25 08:31:19] [INFO ] Implicit Places using invariants and state equation in 2679 ms returned []
Implicit Place search using SMT with State Equation took 3408 ms to find 0 implicit places.
Running 1710 sub problems to find dead transitions.
[2026-05-25 08:31:19] [INFO ] Flow matrix only has 1154 transitions (discarded 558 similar events)
[2026-05-25 08:31:19] [INFO ] Invariant cache hit.
[2026-05-25 08:31:19] [INFO ] State equation strengthened by 288 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 658/1812 variables, and 2 constraints, problems are : Problem set: 0 solved, 1710 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/658 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 1710/1710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1710 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/658 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/658 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1710 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 658/1812 variables, and 2 constraints, problems are : Problem set: 0 solved, 1710 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/658 constraints, ReadFeed: 0/288 constraints, PredecessorRefiner: 0/1710 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63174ms problems are : Problem set: 0 solved, 1710 unsolved
Search for dead transitions found 0 dead transitions in 63194ms
Starting structural reductions in LTL mode, iteration 1 : 658/1628 places, 1712/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67744 ms. Remains : 658/1628 places, 1712/5962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 1712/1712 transitions.
Applied a total of 0 rules in 16 ms. Remains 658 /658 variables (removed 0) and now considering 1712/1712 (removed 0) transitions.
[2026-05-25 08:32:22] [INFO ] Flow matrix only has 1154 transitions (discarded 558 similar events)
[2026-05-25 08:32:22] [INFO ] Invariant cache hit.
[2026-05-25 08:32:23] [INFO ] Implicit Places using invariants in 425 ms returned []
[2026-05-25 08:32:23] [INFO ] Flow matrix only has 1154 transitions (discarded 558 similar events)
[2026-05-25 08:32:23] [INFO ] Invariant cache hit.
[2026-05-25 08:32:23] [INFO ] State equation strengthened by 288 read => feed constraints.
[2026-05-25 08:32:25] [INFO ] Implicit Places using invariants and state equation in 2752 ms returned []
Implicit Place search using SMT with State Equation took 3180 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3198 ms. Remains : 658/658 places, 1712/1712 transitions.
Support contains 12 out of 658 places after structural reductions.
[2026-05-25 08:32:26] [INFO ] Flatten gal took : 111 ms
[2026-05-25 08:32:26] [INFO ] Flatten gal took : 78 ms
[2026-05-25 08:32:26] [INFO ] Input system was already deterministic with 1712 transitions.
RANDOM walk for 40001 steps (8 resets) in 1631 ms. (24 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (17 resets) in 207 ms. (192 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (16 resets) in 219 ms. (181 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40003 steps (19 resets) in 201 ms. (198 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 172 ms. (231 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 204 ms. (195 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (16 resets) in 194 ms. (205 steps per ms) remains 4/7 properties
[2026-05-25 08:32:27] [INFO ] Flow matrix only has 1154 transitions (discarded 558 similar events)
[2026-05-25 08:32:27] [INFO ] Invariant cache hit.
[2026-05-25 08:32:27] [INFO ] State equation strengthened by 288 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/388 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/388 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 17/405 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/405 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 689/1094 variables, 405/407 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1094 variables, 10/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1094 variables, 0/417 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 8 (OVERLAPS) 264/1358 variables, 22/439 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1358 variables, 213/652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1358 variables, 0/652 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 376/1734 variables, 159/811 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1734 variables, 65/876 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1734 variables, 0/876 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 75/1809 variables, 70/946 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1809 variables, 0/946 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 3/1812 variables, 2/948 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1812 variables, 0/948 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 0/1812 variables, 0/948 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1812/1812 variables, and 948 constraints, problems are : Problem set: 1 solved, 3 unsolved in 860 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 658/658 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 383/387 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/387 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 649/1036 variables, 387/388 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1036 variables, 2/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1036 variables, 0/390 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 267/1303 variables, 11/401 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1303 variables, 213/614 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1303 variables, 3/617 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1303 variables, 0/617 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 15/1318 variables, 1/618 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1318 variables, 1/619 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1318 variables, 0/619 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 393/1711 variables, 172/791 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1711 variables, 73/864 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1711 variables, 1/865 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1711 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 94/1805 variables, 83/948 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1805 variables, 2/950 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1805 variables, 0/950 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 7/1812 variables, 4/954 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1812 variables, 0/954 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 22 (OVERLAPS) 0/1812 variables, 0/954 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1812/1812 variables, and 954 constraints, problems are : Problem set: 1 solved, 3 unsolved in 2055 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 658/658 constraints, ReadFeed: 288/288 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 2938ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 1 properties in 185 ms.
Support contains 3 out of 658 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 658/658 places, 1712/1712 transitions.
Graph (complete) has 2844 edges and 658 vertex of which 466 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.4 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 466 transition count 1328
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 392 place count 459 transition count 1314
Iterating global reduction 1 with 7 rules applied. Total rules applied 399 place count 459 transition count 1314
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 404 place count 454 transition count 1300
Iterating global reduction 1 with 5 rules applied. Total rules applied 409 place count 454 transition count 1300
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 414 place count 449 transition count 1282
Iterating global reduction 1 with 5 rules applied. Total rules applied 419 place count 449 transition count 1282
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 424 place count 444 transition count 1268
Iterating global reduction 1 with 5 rules applied. Total rules applied 429 place count 444 transition count 1268
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 434 place count 439 transition count 1258
Iterating global reduction 1 with 5 rules applied. Total rules applied 439 place count 439 transition count 1258
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 443 place count 435 transition count 1250
Iterating global reduction 1 with 4 rules applied. Total rules applied 447 place count 435 transition count 1250
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 451 place count 431 transition count 1242
Iterating global reduction 1 with 4 rules applied. Total rules applied 455 place count 431 transition count 1242
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 459 place count 427 transition count 1234
Iterating global reduction 1 with 4 rules applied. Total rules applied 463 place count 427 transition count 1234
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 465 place count 425 transition count 1230
Iterating global reduction 1 with 2 rules applied. Total rules applied 467 place count 425 transition count 1230
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 471 place count 425 transition count 1226
Applied a total of 471 rules in 290 ms. Remains 425 /658 variables (removed 233) and now considering 1226/1712 (removed 486) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 291 ms. Remains : 425/658 places, 1226/1712 transitions.
RANDOM walk for 40001 steps (8 resets) in 193 ms. (206 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 52 ms. (754 steps per ms) remains 1/1 properties
[2026-05-25 08:32:30] [INFO ] Flow matrix only has 697 transitions (discarded 529 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9363340271754696418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16584780799450430802.kers'
[2026-05-25 08:32:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9363340271754696418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16584780799450430802.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 697 rows 425 cols 2076 entries
Finished phase 1 with 422 SingleSign rule and 0 generalized
[2026-05-25 08:32:30] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-16584780799450430802.kers
Total runtime 3 ms.
[2026-05-25 08:32:30] [INFO ] State equation strengthened by 79 read => feed constraints.
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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 359/366 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/374 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 613/987 variables, 343/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/987 variables, 79/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/987 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 62/1049 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1049 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 70/1119 variables, 69/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1119 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 3/1122 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1122 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/1122 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1122/1122 variables, and 507 constraints, problems are : Problem set: 0 solved, 1 unsolved in 273 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 79/79 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 359/366 variables, 7/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/366 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/374 variables, 2/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/374 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/374 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 613/987 variables, 343/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/987 variables, 79/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/987 variables, 1/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/987 variables, 0/436 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 62/1049 variables, 1/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1049 variables, 0/437 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 70/1119 variables, 69/506 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1119 variables, 2/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1119 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 3/1122 variables, 2/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1122 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1122 variables, 0/510 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1122/1122 variables, and 510 constraints, problems are : Problem set: 0 solved, 1 unsolved in 561 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 79/79 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 851ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 764 steps, including 46 resets, run visited all 1 properties in 6 ms. (steps per millisecond=127 )
Parikh walk visited 1 properties in 10 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 192 stabilizing places and 512 stable transitions
FORMULA FunctionPointer-PT-c032-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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(F((p0 U (p1||G(p0))))))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 1712/1712 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 649 transition count 1694
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 649 transition count 1694
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 643 transition count 1678
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 643 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 637 transition count 1658
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 637 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 632 transition count 1644
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 632 transition count 1644
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 627 transition count 1634
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 627 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 623 transition count 1626
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 623 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 619 transition count 1618
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 615 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 615 transition count 1610
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 613 transition count 1606
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 613 transition count 1606
Applied a total of 90 rules in 124 ms. Remains 613 /658 variables (removed 45) and now considering 1606/1712 (removed 106) transitions.
[2026-05-25 08:32:31] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7295181510106570362.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6764504666023794257.kers'
[2026-05-25 08:32:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7295181510106570362.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6764504666023794257.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1072 rows 613 cols 2946 entries
Finished phase 1 with 610 SingleSign rule and 1 generalized
[2026-05-25 08:32:31] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6764504666023794257.kers
Total runtime 6 ms.
[2026-05-25 08:32:32] [INFO ] Implicit Places using invariants in 399 ms returned []
[2026-05-25 08:32:32] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2026-05-25 08:32:32] [INFO ] Invariant cache hit.
[2026-05-25 08:32:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 08:32:34] [INFO ] Implicit Places using invariants and state equation in 2614 ms returned []
Implicit Place search using SMT with State Equation took 3015 ms to find 0 implicit places.
Running 1604 sub problems to find dead transitions.
[2026-05-25 08:32:34] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2026-05-25 08:32:34] [INFO ] Invariant cache hit.
[2026-05-25 08:32:34] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1604 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1604/1604 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1604 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
At refinement iteration 3 (OVERLAPS) 1072/1685 variables, 613/615 constraints. Problems are: Problem set: 0 solved, 1604 unsolved
SMT process timed out in 61891ms, After SMT, problems are : Problem set: 0 solved, 1604 unsolved
Search for dead transitions found 0 dead transitions in 61897ms
Starting structural reductions in LTL mode, iteration 1 : 613/658 places, 1606/1712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65045 ms. Remains : 613/658 places, 1606/1712 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(F((p0 U (G(p0)||p1)))))'
Stuttering acceptance computed with spot in 192 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-01
Product exploration explored 100000 steps with 47 reset in 762 ms.
Product exploration explored 100000 steps with 203 reset in 749 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/613 stabilizing places and 512/1606 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter sensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40015 steps (8 resets) in 204 ms. (195 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (18 resets) in 121 ms. (327 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (17 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (20 resets) in 146 ms. (272 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (12 resets) in 87 ms. (454 steps per ms) remains 3/5 properties
BEST_FIRST walk for 40002 steps (15 resets) in 61 ms. (645 steps per ms) remains 3/3 properties
[2026-05-25 08:33:38] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2026-05-25 08:33:38] [INFO ] Invariant cache hit.
[2026-05-25 08:33:38] [INFO ] State equation strengthened by 265 read => feed constraints.
Problem apf3 is UNSAT
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 644/1029 variables, 385/386 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 221/1250 variables, 7/393 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 196/589 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 0/589 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 358/1608 variables, 148/737 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1608 variables, 1/738 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1608 variables, 69/807 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1608 variables, 0/807 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 74/1682 variables, 71/878 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1682 variables, 0/878 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1685 variables, 2/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1685 variables, 0/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1685/1685 variables, and 880 constraints, problems are : Problem set: 1 solved, 2 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 644/1029 variables, 385/386 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1029 variables, 0/386 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 221/1250 variables, 7/393 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1250 variables, 196/589 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1250 variables, 2/591 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1250 variables, 0/591 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 358/1608 variables, 148/739 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1608 variables, 1/740 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1608 variables, 69/809 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1608 variables, 0/809 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 74/1682 variables, 71/880 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1682 variables, 1/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1682 variables, 0/881 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1685 variables, 2/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1685 variables, 0/883 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1685/1685 variables, and 883 constraints, problems are : Problem set: 1 solved, 2 unsolved in 1237 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1761ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 10474 steps, including 46 resets, run visited all 2 properties in 89 ms. (steps per millisecond=117 )
Parikh walk visited 2 properties in 88 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 11 factoid took 117 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), false]
Knowledge-based reduction took 2427 ms.
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), false]
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 269 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2026-05-25 08:33:41] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16426232470997111132.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16915068324669110954.kers'
[2026-05-25 08:33:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16426232470997111132.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16915068324669110954.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1070 rows 613 cols 2942 entries
Finished phase 1 with 610 SingleSign rule and 1 generalized
[2026-05-25 08:33:41] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-16915068324669110954.kers
Total runtime 6 ms.
[2026-05-25 08:33:41] [INFO ] Implicit Places using invariants in 407 ms returned []
[2026-05-25 08:33:41] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2026-05-25 08:33:41] [INFO ] Invariant cache hit.
[2026-05-25 08:33:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 08:33:44] [INFO ] Implicit Places using invariants and state equation in 2710 ms returned []
Implicit Place search using SMT with State Equation took 3119 ms to find 0 implicit places.
[2026-05-25 08:33:44] [INFO ] Redundant transitions in 111 ms returned []
Running 1600 sub problems to find dead transitions.
[2026-05-25 08:33:44] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2026-05-25 08:33:44] [INFO ] Invariant cache hit.
[2026-05-25 08:33:44] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
SMT process timed out in 62113ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 62118ms
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65628 ms. Remains : 613/613 places, 1602/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Detected a total of 192/613 stabilizing places and 512/1602 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 46 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
RANDOM walk for 40048 steps (8 resets) in 168 ms. (236 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (19 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (22 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (19 resets) in 38 ms. (1025 steps per ms) remains 2/4 properties
[2026-05-25 08:34:46] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2026-05-25 08:34:46] [INFO ] Invariant cache hit.
[2026-05-25 08:34:46] [INFO ] State equation strengthened by 265 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/1248 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1248 variables, 196/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1248 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 358/1606 variables, 149/737 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1606 variables, 1/738 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1606 variables, 69/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1606 variables, 0/807 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 74/1680 variables, 71/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1680 variables, 0/878 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 3/1683 variables, 2/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1683 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1683/1683 variables, and 880 constraints, problems are : Problem set: 0 solved, 2 unsolved in 547 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 220/1248 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1248 variables, 196/588 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1248 variables, 2/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1248 variables, 0/590 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 358/1606 variables, 149/739 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1606 variables, 1/740 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1606 variables, 69/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1606 variables, 0/809 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 74/1680 variables, 71/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1680 variables, 0/880 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 3/1683 variables, 2/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/1683 variables, 0/882 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1683/1683 variables, and 882 constraints, problems are : Problem set: 0 solved, 2 unsolved in 950 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 613/613 constraints, ReadFeed: 265/265 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1512ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 160 ms.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Graph (complete) has 2677 edges and 613 vertex of which 421 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.0 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 421 transition count 1218
Applied a total of 385 rules in 75 ms. Remains 421 /613 variables (removed 192) and now considering 1218/1602 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 76 ms. Remains : 421/613 places, 1218/1602 transitions.
RANDOM walk for 40003 steps (8 resets) in 191 ms. (208 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 47 ms. (833 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 37 ms. (1052 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 365643 steps, run timeout after 3001 ms. (steps per millisecond=121 ) properties seen :0 out of 2
Probabilistic random walk after 365643 steps, saw 224216 distinct states, run finished after 3005 ms. (steps per millisecond=121 ) properties seen :0
[2026-05-25 08:34:51] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10522922302483847957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15982173026245652377.kers'
[2026-05-25 08:34:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10522922302483847957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15982173026245652377.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 688 rows 421 cols 2050 entries
Finished phase 1 with 418 SingleSign rule and 0 generalized
[2026-05-25 08:34:51] [INFO ] Computed 3 invariants in 3 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15982173026245652377.kers
Total runtime 4 ms.
[2026-05-25 08:34:51] [INFO ] State equation strengthened by 75 read => feed constraints.
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, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/1058 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1058 variables, 70/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1058 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/1066 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1066 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 30/1096 variables, 19/485 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1096 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1096 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 10/1106 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1106 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 3/1109 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (OVERLAPS) 0/1109 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1109/1109 variables, and 499 constraints, problems are : Problem set: 0 solved, 2 unsolved in 388 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 30/1058 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1058 variables, 70/462 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1058 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1058 variables, 0/464 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 8/1066 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1066 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1066 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 30/1096 variables, 19/487 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1096 variables, 5/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1096 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 10/1106 variables, 7/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1106 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 3/1109 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1109 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 19 (OVERLAPS) 0/1109 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 501 constraints, problems are : Problem set: 0 solved, 2 unsolved in 757 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1161ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 182 ms.
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 71 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 71 ms. Remains : 421/421 places, 1218/1218 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 1218/1218 transitions.
Applied a total of 0 rules in 75 ms. Remains 421 /421 variables (removed 0) and now considering 1218/1218 (removed 0) transitions.
[2026-05-25 08:34:53] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2026-05-25 08:34:53] [INFO ] Invariant cache hit.
[2026-05-25 08:34:53] [INFO ] Implicit Places using invariants in 288 ms returned []
[2026-05-25 08:34:53] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2026-05-25 08:34:53] [INFO ] Invariant cache hit.
[2026-05-25 08:34:53] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 08:34:55] [INFO ] Implicit Places using invariants and state equation in 2176 ms returned []
Implicit Place search using SMT with State Equation took 2466 ms to find 0 implicit places.
[2026-05-25 08:34:55] [INFO ] Redundant transitions in 25 ms returned []
Running 1216 sub problems to find dead transitions.
[2026-05-25 08:34:55] [INFO ] Flow matrix only has 688 transitions (discarded 530 similar events)
[2026-05-25 08:34:55] [INFO ] Invariant cache hit.
[2026-05-25 08:34:55] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 421/1109 variables, and 4 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/421 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1216 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/421 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/421 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/421 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 3 (OVERLAPS) 688/1109 variables, 421/425 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1109 variables, 75/500 constraints. Problems are: Problem set: 0 solved, 1216 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1109/1109 variables, and 1716 constraints, problems are : Problem set: 0 solved, 1216 unsolved in 30802 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 421/421 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1216/1216 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62019ms problems are : Problem set: 0 solved, 1216 unsolved
Search for dead transitions found 0 dead transitions in 62021ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64597 ms. Remains : 421/421 places, 1218/1218 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 530 transitions
Reduce isomorphic transitions removed 530 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 540 rules applied. Total rules applied 540 place count 421 transition count 678
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 550 place count 411 transition count 678
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 550 place count 411 transition count 605
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 696 place count 338 transition count 605
Performed 126 Post agglomeration using F-continuation condition.Transition count delta: 126
Deduced a syphon composed of 126 places in 0 ms
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 252 rules applied. Total rules applied 948 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1012 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1076 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1077 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1140 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1203 place count 85 transition count 224
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1265 place count 23 transition count 100
Iterating global reduction 3 with 62 rules applied. Total rules applied 1327 place count 23 transition count 100
Ensure Unique test removed 61 transitions
Reduce isomorphic transitions removed 61 transitions.
Iterating post reduction 3 with 61 rules applied. Total rules applied 1388 place count 23 transition count 39
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 1390 place count 22 transition count 38
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 1392 place count 21 transition count 39
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 1396 place count 21 transition count 35
Free-agglomeration rule applied 1 times.
Iterating global reduction 4 with 1 rules applied. Total rules applied 1397 place count 21 transition count 34
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 1398 place count 20 transition count 34
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1399 place count 20 transition count 33
Applied a total of 1399 rules in 60 ms. Remains 20 /421 variables (removed 401) and now considering 33/1218 (removed 1185) transitions.
Running SMT prover for 2 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7872281844399677899.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2208863135633488752.kers'
[2026-05-25 08:35:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7872281844399677899.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2208863135633488752.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 33 rows 20 cols 106 entries
Finished phase 1 with 17 SingleSign rule and 0 generalized
[2026-05-25 08:35:57] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2208863135633488752.kers
Total runtime 2 ms.
[2026-05-25 08:35:57] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2026-05-25 08:35:57] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 08:35:57] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2026-05-25 08:35:57] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 08:35:57] [INFO ] After 4ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2026-05-25 08:35:57] [INFO ] After 10ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2026-05-25 08:35:57] [INFO ] After 51ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 163 ms.
Knowledge based reduction with 10 factoid took 62 ms. Reduced automaton from 3 states, 6 edges and 2 AP (stutter insensitive) to 3 states, 6 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0), false]
Knowledge-based reduction took 71338 ms.
Stuttering acceptance computed with spot in 104 ms :[(NOT p0), (NOT p0), false]
Stuttering acceptance computed with spot in 91 ms :[(NOT p0), (NOT p0), false]
Product exploration explored 100000 steps with 179 reset in 643 ms.
Product exploration explored 100000 steps with 130 reset in 684 ms.
Built C files in :
/tmp/ltsmin12849508597445024214
[2026-05-25 08:35:59] [INFO ] Too many transitions (1602) to apply POR reductions. Disabling POR matrices.
[2026-05-25 08:35:59] [INFO ] Built C files in 47ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12849508597445024214
Running compilation step : cd /tmp/ltsmin12849508597445024214;'/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 2924 ms.
Running link step : cd /tmp/ltsmin12849508597445024214;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 52 ms.
Running LTSmin : cd /tmp/ltsmin12849508597445024214;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12261346920299300178.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 104 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2026-05-25 08:36:14] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16443704398965117417.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15179178468749187460.kers'
[2026-05-25 08:36:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16443704398965117417.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15179178468749187460.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1070 rows 613 cols 2942 entries
Finished phase 1 with 610 SingleSign rule and 1 generalized
[2026-05-25 08:36:14] [INFO ] Computed 2 invariants in 6 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-15179178468749187460.kers
Total runtime 7 ms.
[2026-05-25 08:36:15] [INFO ] Implicit Places using invariants in 405 ms returned []
[2026-05-25 08:36:15] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2026-05-25 08:36:15] [INFO ] Invariant cache hit.
[2026-05-25 08:36:15] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 08:36:17] [INFO ] Implicit Places using invariants and state equation in 2775 ms returned []
Implicit Place search using SMT with State Equation took 3183 ms to find 0 implicit places.
[2026-05-25 08:36:17] [INFO ] Redundant transitions in 116 ms returned []
Running 1600 sub problems to find dead transitions.
[2026-05-25 08:36:17] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2026-05-25 08:36:17] [INFO ] Invariant cache hit.
[2026-05-25 08:36:17] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 613/1683 variables, and 2 constraints, problems are : Problem set: 0 solved, 1600 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/613 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1600/1600 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1600 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/613 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/613 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/613 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1600 unsolved
SMT process timed out in 62288ms, After SMT, problems are : Problem set: 0 solved, 1600 unsolved
Search for dead transitions found 0 dead transitions in 62292ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 65704 ms. Remains : 613/613 places, 1602/1602 transitions.
Built C files in :
/tmp/ltsmin16609807107740932891
[2026-05-25 08:37:20] [INFO ] Too many transitions (1602) to apply POR reductions. Disabling POR matrices.
[2026-05-25 08:37:20] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16609807107740932891
Running compilation step : cd /tmp/ltsmin16609807107740932891;'/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 2769 ms.
Running link step : cd /tmp/ltsmin16609807107740932891;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin16609807107740932891;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased7489058445922451249.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 08:37:35] [INFO ] Flatten gal took : 52 ms
[2026-05-25 08:37:35] [INFO ] Flatten gal took : 52 ms
[2026-05-25 08:37:35] [INFO ] Time to serialize gal into /tmp/LTL4997077474049545743.gal : 15 ms
[2026-05-25 08:37:35] [INFO ] Time to serialize properties into /tmp/LTL2352253151751775270.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/LTL4997077474049545743.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12183646689869183924.hoa' '-atoms' '/tmp/LTL2352253151751775270.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...318
Loading property file /tmp/LTL2352253151751775270.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12183646689869183924.hoa
Detected timeout of ITS tools.
[2026-05-25 08:37:50] [INFO ] Flatten gal took : 42 ms
[2026-05-25 08:37:50] [INFO ] Flatten gal took : 39 ms
[2026-05-25 08:37:50] [INFO ] Time to serialize gal into /tmp/LTL15295483258707759567.gal : 8 ms
[2026-05-25 08:37:50] [INFO ] Time to serialize properties into /tmp/LTL15368609726240050846.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15295483258707759567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15368609726240050846.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(F(("(l498<2)")U((G("(l498<2)"))||("((l1562>0)&&(l498<2))"))))))
Formula 0 simplified : XG(!"(l498<2)" M !"((l1562>0)&&(l498<2))")
Detected timeout of ITS tools.
[2026-05-25 08:38:05] [INFO ] Flatten gal took : 34 ms
[2026-05-25 08:38:05] [INFO ] Applying decomposition
[2026-05-25 08:38:05] [INFO ] Flatten gal took : 32 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/graph17362803423337277399.txt' '-o' '/tmp/graph17362803423337277399.bin' '-w' '/tmp/graph17362803423337277399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17362803423337277399.bin' '-l' '-1' '-v' '-w' '/tmp/graph17362803423337277399.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:38:05] [INFO ] Decomposing Gal with order
[2026-05-25 08:38:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:38:06] [INFO ] Removed a total of 2658 redundant transitions.
[2026-05-25 08:38:06] [INFO ] Flatten gal took : 169 ms
[2026-05-25 08:38:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 1155 labels/synchronizations in 84 ms.
[2026-05-25 08:38:06] [INFO ] Time to serialize gal into /tmp/LTL14350585107605579520.gal : 14 ms
[2026-05-25 08:38:06] [INFO ] Time to serialize properties into /tmp/LTL10611015319450734402.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/LTL14350585107605579520.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10611015319450734402.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...256
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i1.u30.l498<2)")U((G("(i1.u30.l498<2)"))||("((i28.i0.u144.l1562>0)&&(i1.u30.l498<2))"))))))
Formula 0 simplified : XG(!"(i1.u30.l498<2)" M !"((i28.i0.u144.l1562>0)&&(i1.u30.l498<2))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c032-LTLCardinality-01 finished in 349733 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(F(p0)))'
Support contains 1 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 1712/1712 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 649 transition count 1694
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 649 transition count 1694
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 643 transition count 1676
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 643 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 637 transition count 1654
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 637 transition count 1654
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 48 place count 631 transition count 1638
Iterating global reduction 0 with 6 rules applied. Total rules applied 54 place count 631 transition count 1638
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 60 place count 625 transition count 1626
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 625 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 71 place count 620 transition count 1616
Iterating global reduction 0 with 5 rules applied. Total rules applied 76 place count 620 transition count 1616
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 81 place count 615 transition count 1606
Iterating global reduction 0 with 5 rules applied. Total rules applied 86 place count 615 transition count 1606
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 91 place count 610 transition count 1596
Iterating global reduction 0 with 5 rules applied. Total rules applied 96 place count 610 transition count 1596
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 98 place count 608 transition count 1592
Iterating global reduction 0 with 2 rules applied. Total rules applied 100 place count 608 transition count 1592
Applied a total of 100 rules in 134 ms. Remains 608 /658 variables (removed 50) and now considering 1592/1712 (removed 120) transitions.
[2026-05-25 08:38:21] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4800057595512577014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12685010502124934487.kers'
[2026-05-25 08:38:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4800057595512577014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12685010502124934487.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1064 rows 608 cols 2926 entries
Finished phase 1 with 605 SingleSign rule and 1 generalized
[2026-05-25 08:38:21] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-12685010502124934487.kers
Total runtime 11 ms.
[2026-05-25 08:38:21] [INFO ] Implicit Places using invariants in 412 ms returned []
[2026-05-25 08:38:21] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2026-05-25 08:38:21] [INFO ] Invariant cache hit.
[2026-05-25 08:38:22] [INFO ] State equation strengthened by 264 read => feed constraints.
[2026-05-25 08:38:24] [INFO ] Implicit Places using invariants and state equation in 2461 ms returned []
Implicit Place search using SMT with State Equation took 2875 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2026-05-25 08:38:24] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2026-05-25 08:38:24] [INFO ] Invariant cache hit.
[2026-05-25 08:38:24] [INFO ] State equation strengthened by 264 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 608/1672 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/608 constraints, ReadFeed: 0/264 constraints, PredecessorRefiner: 1590/1590 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1590 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/608 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/608 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/608 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
At refinement iteration 3 (OVERLAPS) 1064/1672 variables, 608/610 constraints. Problems are: Problem set: 0 solved, 1590 unsolved
SMT process timed out in 62159ms, After SMT, problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 62162ms
Starting structural reductions in LTL mode, iteration 1 : 608/658 places, 1592/1712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65182 ms. Remains : 608/658 places, 1592/1712 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(F(p0)))'
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-03
Stuttering criterion allowed to conclude after 139 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-03 finished in 65295 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(F(p0))))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 1712/1712 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 650 transition count 1696
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 650 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 644 transition count 1678
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 644 transition count 1678
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 638 transition count 1658
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 638 transition count 1658
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 633 transition count 1646
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 633 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 628 transition count 1636
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 628 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 624 transition count 1628
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 624 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 620 transition count 1620
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 620 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 616 transition count 1612
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 615 transition count 1610
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 615 transition count 1610
Applied a total of 86 rules in 124 ms. Remains 615 /658 variables (removed 43) and now considering 1610/1712 (removed 102) transitions.
[2026-05-25 08:39:26] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11786643174202154506.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9267059568042717461.kers'
[2026-05-25 08:39:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11786643174202154506.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9267059568042717461.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1076 rows 615 cols 2956 entries
Finished phase 1 with 612 SingleSign rule and 1 generalized
[2026-05-25 08:39:26] [INFO ] Computed 2 invariants in 10 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-9267059568042717461.kers
Total runtime 13 ms.
[2026-05-25 08:39:27] [INFO ] Implicit Places using invariants in 397 ms returned []
[2026-05-25 08:39:27] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
[2026-05-25 08:39:27] [INFO ] Invariant cache hit.
[2026-05-25 08:39:27] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 08:39:29] [INFO ] Implicit Places using invariants and state equation in 2580 ms returned []
Implicit Place search using SMT with State Equation took 2979 ms to find 0 implicit places.
Running 1608 sub problems to find dead transitions.
[2026-05-25 08:39:29] [INFO ] Flow matrix only has 1076 transitions (discarded 534 similar events)
[2026-05-25 08:39:29] [INFO ] Invariant cache hit.
[2026-05-25 08:39:29] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 615/1691 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/615 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/615 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/615 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/615 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
SMT process timed out in 62315ms, After SMT, problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 62321ms
Starting structural reductions in LTL mode, iteration 1 : 615/658 places, 1610/1712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65432 ms. Remains : 615/658 places, 1610/1712 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(F(p0))))'
Stuttering acceptance computed with spot in 126 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-06
Stuttering criterion allowed to conclude after 74 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-06 finished in 65588 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(p0)||X(p1)))'
Support contains 2 out of 658 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 658/658 places, 1712/1712 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 650 transition count 1696
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 650 transition count 1696
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 644 transition count 1680
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 644 transition count 1680
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 34 place count 638 transition count 1660
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 638 transition count 1660
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 45 place count 633 transition count 1646
Iterating global reduction 0 with 5 rules applied. Total rules applied 50 place count 633 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 55 place count 628 transition count 1636
Iterating global reduction 0 with 5 rules applied. Total rules applied 60 place count 628 transition count 1636
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 64 place count 624 transition count 1628
Iterating global reduction 0 with 4 rules applied. Total rules applied 68 place count 624 transition count 1628
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 72 place count 620 transition count 1620
Iterating global reduction 0 with 4 rules applied. Total rules applied 76 place count 620 transition count 1620
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 80 place count 616 transition count 1612
Iterating global reduction 0 with 4 rules applied. Total rules applied 84 place count 616 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 614 transition count 1608
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 614 transition count 1608
Applied a total of 88 rules in 123 ms. Remains 614 /658 variables (removed 44) and now considering 1608/1712 (removed 104) transitions.
[2026-05-25 08:40:32] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5613858893341173505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10459499092297696214.kers'
[2026-05-25 08:40:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5613858893341173505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10459499092297696214.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1075 rows 614 cols 2954 entries
Finished phase 1 with 611 SingleSign rule and 1 generalized
[2026-05-25 08:40:32] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10459499092297696214.kers
Total runtime 6 ms.
[2026-05-25 08:40:32] [INFO ] Implicit Places using invariants in 397 ms returned []
[2026-05-25 08:40:32] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2026-05-25 08:40:32] [INFO ] Invariant cache hit.
[2026-05-25 08:40:33] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 08:40:34] [INFO ] Implicit Places using invariants and state equation in 2200 ms returned []
Implicit Place search using SMT with State Equation took 2599 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2026-05-25 08:40:34] [INFO ] Flow matrix only has 1075 transitions (discarded 533 similar events)
[2026-05-25 08:40:34] [INFO ] Invariant cache hit.
[2026-05-25 08:40:34] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1689 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1606/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1606 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/614 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
SMT process timed out in 62270ms, After SMT, problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 62273ms
Starting structural reductions in LTL mode, iteration 1 : 614/658 places, 1608/1712 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64999 ms. Remains : 614/658 places, 1608/1712 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(p0)||X(p1)))'
Stuttering acceptance computed with spot in 163 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-11
Product exploration explored 100000 steps with 50000 reset in 679 ms.
Product exploration explored 100000 steps with 50000 reset in 654 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 6 factoid took 18 ms. Proved property starting from automaton with 5 states, 8 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 32 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-c032-LTLCardinality-11 finished in 66571 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 658 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 658/658 places, 1712/1712 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 649 transition count 1694
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 649 transition count 1694
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 643 transition count 1676
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 643 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 637 transition count 1656
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 637 transition count 1656
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 632 transition count 1644
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 632 transition count 1644
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 627 transition count 1634
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 627 transition count 1634
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 66 place count 623 transition count 1626
Iterating global reduction 0 with 4 rules applied. Total rules applied 70 place count 623 transition count 1626
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 74 place count 619 transition count 1618
Iterating global reduction 0 with 4 rules applied. Total rules applied 78 place count 619 transition count 1618
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 82 place count 615 transition count 1610
Iterating global reduction 0 with 4 rules applied. Total rules applied 86 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 614 transition count 1608
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 614 transition count 1608
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 92 place count 614 transition count 1604
Applied a total of 92 rules in 304 ms. Remains 614 /658 variables (removed 44) and now considering 1604/1712 (removed 108) transitions.
[2026-05-25 08:41:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-969355536598009743.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9073377131654985137.kers'
[2026-05-25 08:41:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-969355536598009743.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9073377131654985137.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1071 rows 614 cols 2944 entries
Finished phase 1 with 611 SingleSign rule and 1 generalized
[2026-05-25 08:41:39] [INFO ] Computed 2 invariants in 10 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-9073377131654985137.kers
Total runtime 11 ms.
[2026-05-25 08:41:39] [INFO ] Implicit Places using invariants in 400 ms returned []
[2026-05-25 08:41:39] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2026-05-25 08:41:39] [INFO ] Invariant cache hit.
[2026-05-25 08:41:39] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 08:41:41] [INFO ] Implicit Places using invariants and state equation in 2467 ms returned []
Implicit Place search using SMT with State Equation took 2870 ms to find 0 implicit places.
[2026-05-25 08:41:42] [INFO ] Redundant transitions in 41 ms returned []
Running 1602 sub problems to find dead transitions.
[2026-05-25 08:41:42] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2026-05-25 08:41:42] [INFO ] Invariant cache hit.
[2026-05-25 08:41:42] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1602/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1602 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/614 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1602 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1685 variables, and 2 constraints, problems are : Problem set: 0 solved, 1602 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/614 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 0/1602 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62274ms problems are : Problem set: 0 solved, 1602 unsolved
Search for dead transitions found 0 dead transitions in 62276ms
Starting structural reductions in SI_LTL mode, iteration 1 : 614/658 places, 1604/1712 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65500 ms. Remains : 614/658 places, 1604/1712 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 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c032-LTLCardinality-15
Stuttering criterion allowed to conclude after 91 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c032-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c032-LTLCardinality-15 finished in 65626 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(F((p0 U (p1||G(p0))))))'
Spot run failed in 70 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/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-25 08:42:44] [INFO ] Flatten gal took : 35 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin11946812154314644424
[2026-05-25 08:42:44] [INFO ] Too many transitions (1712) to apply POR reductions. Disabling POR matrices.
[2026-05-25 08:42:44] [INFO ] Applying decomposition
[2026-05-25 08:42:44] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11946812154314644424
Running compilation step : cd /tmp/ltsmin11946812154314644424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' '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'
[2026-05-25 08:42:44] [INFO ] Flatten gal took : 33 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/graph16407148814243698132.txt' '-o' '/tmp/graph16407148814243698132.bin' '-w' '/tmp/graph16407148814243698132.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph16407148814243698132.bin' '-l' '-1' '-v' '-w' '/tmp/graph16407148814243698132.weights' '-q' '0' '-e' '0.001'
[2026-05-25 08:42:44] [INFO ] Decomposing Gal with order
[2026-05-25 08:42:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 08:42:44] [INFO ] Removed a total of 2852 redundant transitions.
[2026-05-25 08:42:44] [INFO ] Flatten gal took : 92 ms
[2026-05-25 08:42:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 1343 labels/synchronizations in 95 ms.
[2026-05-25 08:42:45] [INFO ] Time to serialize gal into /tmp/LTLCardinality11716113472742191665.gal : 17 ms
[2026-05-25 08:42:45] [INFO ] Time to serialize properties into /tmp/LTLCardinality13089531904506489642.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/LTLCardinality11716113472742191665.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13089531904506489642.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...278
Read 1 LTL properties
Checking formula 0 : !((X(F(("(i11.u29.l498<2)")U(("((i28.i1.u151.l1562>0)&&(i11.u29.l498<2))")||(G("(i11.u29.l498<2)")))))))
Formula 0 simplified : XG(!"(i11.u29.l498<2)" M !"((i28.i1.u151.l1562>0)&&(i11.u29.l498<2))")
Compilation finished in 3086 ms.
Running link step : cd /tmp/ltsmin11946812154314644424;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin11946812154314644424;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(<>(((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 09:06:35] [INFO ] Flatten gal took : 33 ms
[2026-05-25 09:06:35] [INFO ] Time to serialize gal into /tmp/LTLCardinality14945144189058736427.gal : 8 ms
[2026-05-25 09:06:35] [INFO ] Time to serialize properties into /tmp/LTLCardinality11047913797166826298.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/LTLCardinality14945144189058736427.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11047913797166826298.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...299
Read 1 LTL properties
Checking formula 0 : !((X(F(("(l498<2)")U(("((l1562>0)&&(l498<2))")||(G("(l498<2)")))))))
Formula 0 simplified : XG(!"(l498<2)" M !"((l1562>0)&&(l498<2))")
Detected timeout of ITS tools.
[2026-05-25 09:30:30] [INFO ] Flatten gal took : 489 ms
[2026-05-25 09:30:33] [INFO ] Input system was already deterministic with 1712 transitions.
[2026-05-25 09:30:33] [INFO ] Transformed 658 places.
[2026-05-25 09:30:33] [INFO ] Transformed 1712 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-25 09:30:33] [INFO ] Time to serialize gal into /tmp/LTLCardinality9528035745323520052.gal : 20 ms
[2026-05-25 09:30:33] [INFO ] Time to serialize properties into /tmp/LTLCardinality6907115295071626137.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality9528035745323520052.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6907115295071626137.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--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...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(F(("(l498<2)")U(("((l1562>0)&&(l498<2))")||(G("(l498<2)")))))))
Formula 0 simplified : XG(!"(l498<2)" M !"((l1562>0)&&(l498<2))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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="FunctionPointer-PT-c032"
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 FunctionPointer-PT-c032, 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-177961074000147"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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