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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.7M
-rw-r--r-- 1 mcc users 8.1K Mar 7 07:26 CTLCardinality.txt
-rw-r--r-- 1 mcc users 89K Mar 7 07:26 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.6K Mar 7 07:25 CTLFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 7 07:25 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 10:25 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 10:25 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 16K Mar 7 07:26 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 166K Mar 7 07:26 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.8K Mar 7 07:26 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 83K Mar 7 07:26 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-c016-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c016-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779694259073

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-c016
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 07:31:00] [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 07:31:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 07:31:00] [INFO ] Load time of PNML (sax parser for PT used): 423 ms
[2026-05-25 07:31:00] [INFO ] Transformed 2826 places.
[2026-05-25 07:31:00] [INFO ] Transformed 8960 transitions.
[2026-05-25 07:31:00] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 620 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 13 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 1198 places in 38 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FunctionPointer-PT-c016-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c016-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 20 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 297 places :
Symmetric choice reduction at 1 with 297 rule applications. Total rules 314 place count 1314 transition count 3702
Iterating global reduction 1 with 297 rules applied. Total rules applied 611 place count 1314 transition count 3702
Ensure Unique test removed 368 transitions
Reduce isomorphic transitions removed 368 transitions.
Iterating post reduction 1 with 368 rules applied. Total rules applied 979 place count 1314 transition count 3334
Discarding 154 places :
Symmetric choice reduction at 2 with 154 rule applications. Total rules 1133 place count 1160 transition count 3026
Iterating global reduction 2 with 154 rules applied. Total rules applied 1287 place count 1160 transition count 3026
Ensure Unique test removed 72 transitions
Reduce isomorphic transitions removed 72 transitions.
Iterating post reduction 2 with 72 rules applied. Total rules applied 1359 place count 1160 transition count 2954
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1373 place count 1146 transition count 2926
Iterating global reduction 3 with 14 rules applied. Total rules applied 1387 place count 1146 transition count 2926
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1401 place count 1132 transition count 2898
Iterating global reduction 3 with 14 rules applied. Total rules applied 1415 place count 1132 transition count 2898
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1429 place count 1118 transition count 2870
Iterating global reduction 3 with 14 rules applied. Total rules applied 1443 place count 1118 transition count 2870
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1457 place count 1104 transition count 2842
Iterating global reduction 3 with 14 rules applied. Total rules applied 1471 place count 1104 transition count 2842
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1485 place count 1090 transition count 2814
Iterating global reduction 3 with 14 rules applied. Total rules applied 1499 place count 1090 transition count 2814
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1513 place count 1076 transition count 2786
Iterating global reduction 3 with 14 rules applied. Total rules applied 1527 place count 1076 transition count 2786
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1539 place count 1064 transition count 2762
Iterating global reduction 3 with 12 rules applied. Total rules applied 1551 place count 1064 transition count 2762
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1608 place count 1007 transition count 2544
Iterating global reduction 3 with 57 rules applied. Total rules applied 1665 place count 1007 transition count 2544
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1722 place count 950 transition count 2316
Iterating global reduction 3 with 57 rules applied. Total rules applied 1779 place count 950 transition count 2316
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1836 place count 893 transition count 2192
Iterating global reduction 3 with 57 rules applied. Total rules applied 1893 place count 893 transition count 2192
Discarding 57 places :
Symmetric choice reduction at 3 with 57 rule applications. Total rules 1950 place count 836 transition count 2078
Iterating global reduction 3 with 57 rules applied. Total rules applied 2007 place count 836 transition count 2078
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2062 place count 781 transition count 1968
Iterating global reduction 3 with 55 rules applied. Total rules applied 2117 place count 781 transition count 1968
Discarding 55 places :
Symmetric choice reduction at 3 with 55 rule applications. Total rules 2172 place count 726 transition count 1858
Iterating global reduction 3 with 55 rules applied. Total rules applied 2227 place count 726 transition count 1858
Discarding 52 places :
Symmetric choice reduction at 3 with 52 rule applications. Total rules 2279 place count 674 transition count 1754
Iterating global reduction 3 with 52 rules applied. Total rules applied 2331 place count 674 transition count 1754
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 2336 place count 669 transition count 1744
Iterating global reduction 3 with 5 rules applied. Total rules applied 2341 place count 669 transition count 1744
Applied a total of 2341 rules in 1170 ms. Remains 669 /1628 variables (removed 959) and now considering 1744/5962 (removed 4218) transitions.
[2026-05-25 07:31:02] [INFO ] Flow matrix only has 1173 transitions (discarded 571 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12910412540252662610.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4422672162850424408.kers'
[2026-05-25 07:31:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12910412540252662610.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4422672162850424408.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1173 rows 669 cols 3216 entries
Finished phase 1 with 666 SingleSign rule and 1 generalized
[2026-05-25 07:31:02] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-4422672162850424408.kers
Total runtime 7 ms.
[2026-05-25 07:31:03] [INFO ] Implicit Places using invariants in 770 ms returned []
[2026-05-25 07:31:03] [INFO ] Flow matrix only has 1173 transitions (discarded 571 similar events)
[2026-05-25 07:31:03] [INFO ] Invariant cache hit.
[2026-05-25 07:31:03] [INFO ] State equation strengthened by 290 read => feed constraints.
[2026-05-25 07:31:06] [INFO ] Implicit Places using invariants and state equation in 3273 ms returned []
Implicit Place search using SMT with State Equation took 4085 ms to find 0 implicit places.
Running 1742 sub problems to find dead transitions.
[2026-05-25 07:31:06] [INFO ] Flow matrix only has 1173 transitions (discarded 571 similar events)
[2026-05-25 07:31:06] [INFO ] Invariant cache hit.
[2026-05-25 07:31:06] [INFO ] State equation strengthened by 290 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/669 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/669 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1742 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 669/1842 variables, and 2 constraints, problems are : Problem set: 0 solved, 1742 unsolved in 30050 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/669 constraints, ReadFeed: 0/290 constraints, PredecessorRefiner: 1742/1742 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1742 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/669 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1742 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/669 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1742 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 669/1842 variables, and 2 constraints, problems are : Problem set: 0 solved, 1742 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/669 constraints, ReadFeed: 0/290 constraints, PredecessorRefiner: 0/1742 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63264ms problems are : Problem set: 0 solved, 1742 unsolved
Search for dead transitions found 0 dead transitions in 63288ms
Starting structural reductions in LTL mode, iteration 1 : 669/1628 places, 1744/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 68586 ms. Remains : 669/1628 places, 1744/5962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Applied a total of 0 rules in 16 ms. Remains 669 /669 variables (removed 0) and now considering 1744/1744 (removed 0) transitions.
[2026-05-25 07:32:09] [INFO ] Flow matrix only has 1173 transitions (discarded 571 similar events)
[2026-05-25 07:32:09] [INFO ] Invariant cache hit.
[2026-05-25 07:32:10] [INFO ] Implicit Places using invariants in 458 ms returned []
[2026-05-25 07:32:10] [INFO ] Flow matrix only has 1173 transitions (discarded 571 similar events)
[2026-05-25 07:32:10] [INFO ] Invariant cache hit.
[2026-05-25 07:32:10] [INFO ] State equation strengthened by 290 read => feed constraints.
[2026-05-25 07:32:13] [INFO ] Implicit Places using invariants and state equation in 3026 ms returned []
Implicit Place search using SMT with State Equation took 3485 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3506 ms. Remains : 669/669 places, 1744/1744 transitions.
Support contains 20 out of 669 places after structural reductions.
[2026-05-25 07:32:13] [INFO ] Flatten gal took : 124 ms
[2026-05-25 07:32:13] [INFO ] Flatten gal took : 83 ms
[2026-05-25 07:32:13] [INFO ] Input system was already deterministic with 1744 transitions.
RANDOM walk for 40000 steps (8 resets) in 2775 ms. (14 steps per ms) remains 12/16 properties
BEST_FIRST walk for 40003 steps (10 resets) in 126 ms. (314 steps per ms) remains 8/12 properties
BEST_FIRST walk for 40004 steps (11 resets) in 118 ms. (336 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (13 resets) in 116 ms. (341 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (11 resets) in 146 ms. (272 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (19 resets) in 93 ms. (425 steps per ms) remains 7/8 properties
BEST_FIRST walk for 40004 steps (10 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (14 resets) in 95 ms. (416 steps per ms) remains 7/7 properties
[2026-05-25 07:32:14] [INFO ] Flow matrix only has 1173 transitions (discarded 571 similar events)
[2026-05-25 07:32:14] [INFO ] Invariant cache hit.
[2026-05-25 07:32:14] [INFO ] State equation strengthened by 290 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 660/1052 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 285/1337 variables, 19/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 217/631 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 0/631 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 14/1351 variables, 1/632 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1351 variables, 2/634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1351 variables, 0/634 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (OVERLAPS) 394/1745 variables, 172/806 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1745 variables, 71/877 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1745 variables, 0/877 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 85/1830 variables, 78/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1830 variables, 0/955 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (OVERLAPS) 11/1841 variables, 5/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1841 variables, 0/960 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (OVERLAPS) 1/1842 variables, 1/961 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1842 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 0/1842 variables, 0/961 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1842/1842 variables, and 961 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1728 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 669/669 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 383/392 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/392 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 660/1052 variables, 392/393 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1052 variables, 2/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1052 variables, 0/395 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 285/1337 variables, 19/414 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1337 variables, 217/631 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1337 variables, 7/638 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1337 variables, 1/639 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1337 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 14/1351 variables, 1/640 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1351 variables, 2/642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1351 variables, 0/642 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 394/1745 variables, 172/814 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1745 variables, 71/885 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1745 variables, 2/887 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1745 variables, 0/887 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 18 (OVERLAPS) 85/1830 variables, 78/965 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1830 variables, 3/968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1830 variables, 0/968 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 21 (OVERLAPS) 11/1841 variables, 5/973 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1841 variables, 0/973 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 23 (OVERLAPS) 1/1842 variables, 1/974 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1842/1842 variables, and 974 constraints, problems are : Problem set: 0 solved, 7 unsolved in 5015 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 669/669 constraints, ReadFeed: 290/290 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 6/6 constraints]
After SMT, in 6771ms problems are : Problem set: 0 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 9 out of 669 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Graph (complete) has 2884 edges and 669 vertex of which 480 are kept as prefixes of interest. Removing 189 places using SCC suffix rule.4 ms
Discarding 189 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 379 transitions
Reduce isomorphic transitions removed 379 transitions.
Iterating post reduction 0 with 379 rules applied. Total rules applied 380 place count 480 transition count 1365
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 384 place count 476 transition count 1357
Iterating global reduction 1 with 4 rules applied. Total rules applied 388 place count 476 transition count 1357
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 394 place count 476 transition count 1351
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 397 place count 473 transition count 1345
Iterating global reduction 2 with 3 rules applied. Total rules applied 400 place count 473 transition count 1345
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 402 place count 471 transition count 1341
Iterating global reduction 2 with 2 rules applied. Total rules applied 404 place count 471 transition count 1341
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 406 place count 469 transition count 1333
Iterating global reduction 2 with 2 rules applied. Total rules applied 408 place count 469 transition count 1333
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 410 place count 467 transition count 1325
Iterating global reduction 2 with 2 rules applied. Total rules applied 412 place count 467 transition count 1325
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 414 place count 465 transition count 1321
Iterating global reduction 2 with 2 rules applied. Total rules applied 416 place count 465 transition count 1321
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 418 place count 463 transition count 1317
Iterating global reduction 2 with 2 rules applied. Total rules applied 420 place count 463 transition count 1317
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 422 place count 461 transition count 1313
Iterating global reduction 2 with 2 rules applied. Total rules applied 424 place count 461 transition count 1313
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 426 place count 459 transition count 1309
Iterating global reduction 2 with 2 rules applied. Total rules applied 428 place count 459 transition count 1309
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 430 place count 457 transition count 1305
Iterating global reduction 2 with 2 rules applied. Total rules applied 432 place count 457 transition count 1305
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 442 place count 457 transition count 1295
Applied a total of 442 rules in 346 ms. Remains 457 /669 variables (removed 212) and now considering 1295/1744 (removed 449) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 346 ms. Remains : 457/669 places, 1295/1744 transitions.
RANDOM walk for 40001 steps (8 resets) in 286 ms. (139 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (8 resets) in 89 ms. (444 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (8 resets) in 97 ms. (408 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (8 resets) in 88 ms. (449 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (8 resets) in 93 ms. (425 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 84 ms. (470 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (8 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
[2026-05-25 07:32:22] [INFO ] Flow matrix only has 749 transitions (discarded 546 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1304202380299537994.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3394286435165342475.kers'
[2026-05-25 07:32:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1304202380299537994.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3394286435165342475.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 749 rows 457 cols 2218 entries
Finished phase 1 with 454 SingleSign rule and 0 generalized
[2026-05-25 07:32:22] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3394286435165342475.kers
Total runtime 4 ms.
[2026-05-25 07:32:22] [INFO ] State equation strengthened by 93 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/389 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 652/1041 variables, 389/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1041 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 74/1115 variables, 15/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1115 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1115 variables, 86/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 0/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 11/1126 variables, 1/493 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1126 variables, 1/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1126 variables, 0/494 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 64/1190 variables, 39/533 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1190 variables, 7/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1190 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 13/1203 variables, 11/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1203 variables, 0/551 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 3/1206 variables, 2/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1206 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/1206 variables, 0/553 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1206/1206 variables, and 553 constraints, problems are : Problem set: 0 solved, 4 unsolved in 731 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 457/457 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 383/389 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/389 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 652/1041 variables, 389/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1041 variables, 0/390 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 74/1115 variables, 15/405 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1115 variables, 1/406 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1115 variables, 86/492 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1115 variables, 4/496 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1115 variables, 1/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1115 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 11/1126 variables, 1/498 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1126 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1126 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 64/1190 variables, 39/538 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1190 variables, 7/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1190 variables, 0/545 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 13/1203 variables, 11/556 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1203 variables, 2/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1203 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 20 (OVERLAPS) 3/1206 variables, 2/560 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1206 variables, 1/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1206 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 23 (OVERLAPS) 0/1206 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1206/1206 variables, and 561 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2307 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 457/457 constraints, ReadFeed: 93/93 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 3071ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 2 properties in 206 ms.
Support contains 4 out of 457 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 457/457 places, 1295/1295 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 452 transition count 1285
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 452 transition count 1285
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 448 transition count 1275
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 448 transition count 1275
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 444 transition count 1265
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 444 transition count 1265
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 442 transition count 1261
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 442 transition count 1261
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 440 transition count 1257
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 440 transition count 1257
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 438 transition count 1253
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 438 transition count 1253
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 436 transition count 1249
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 436 transition count 1249
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 434 transition count 1245
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 434 transition count 1245
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 433 transition count 1243
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 433 transition count 1243
Applied a total of 48 rules in 146 ms. Remains 433 /457 variables (removed 24) and now considering 1243/1295 (removed 52) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 146 ms. Remains : 433/457 places, 1243/1295 transitions.
RANDOM walk for 40009 steps (8 resets) in 230 ms. (173 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 80 ms. (493 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 72 ms. (548 steps per ms) remains 1/1 properties
[2026-05-25 07:32:25] [INFO ] Flow matrix only has 707 transitions (discarded 536 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8630930692796496034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2637166836662573318.kers'
[2026-05-25 07:32:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8630930692796496034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2637166836662573318.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 707 rows 433 cols 2100 entries
Finished phase 1 with 430 SingleSign rule and 0 generalized
[2026-05-25 07:32:25] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2637166836662573318.kers
Total runtime 5 ms.
[2026-05-25 07:32:25] [INFO ] State equation strengthened by 81 read => feed constraints.
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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/1065 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 74/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1065 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 10/1075 variables, 2/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1075 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1075 variables, 0/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 41/1116 variables, 25/495 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1116 variables, 6/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1116 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 19/1135 variables, 12/513 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1135 variables, 1/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1135 variables, 0/514 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1139 variables, 2/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1139 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 1/1140 variables, 1/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1140 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 0/1140 variables, 0/517 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1140/1140 variables, and 517 constraints, problems are : Problem set: 0 solved, 1 unsolved in 448 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 81/81 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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/1065 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1065 variables, 74/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1065 variables, 1/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1065 variables, 1/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1065 variables, 0/468 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 10/1075 variables, 2/470 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1075 variables, 2/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1075 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 41/1116 variables, 25/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1116 variables, 6/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1116 variables, 0/503 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 19/1135 variables, 12/515 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1135 variables, 1/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1135 variables, 0/516 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1139 variables, 2/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1139 variables, 0/518 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/1140 variables, 1/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1140 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1140 variables, 0/519 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1140/1140 variables, and 519 constraints, problems are : Problem set: 0 solved, 1 unsolved in 651 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 433/433 constraints, ReadFeed: 81/81 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1117ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 41 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 1243/1243 transitions.
Graph (complete) has 2142 edges and 433 vertex of which 430 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Discarding 3 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 6 place count 430 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 7 place count 429 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 8 place count 429 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 9 place count 428 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 10 place count 428 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 11 place count 427 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 12 place count 427 transition count 1230
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 13 place count 426 transition count 1228
Iterating global reduction 1 with 1 rules applied. Total rules applied 14 place count 426 transition count 1228
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 15 place count 425 transition count 1226
Iterating global reduction 1 with 1 rules applied. Total rules applied 16 place count 425 transition count 1226
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 17 place count 424 transition count 1224
Iterating global reduction 1 with 1 rules applied. Total rules applied 18 place count 424 transition count 1224
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 19 place count 423 transition count 1222
Iterating global reduction 1 with 1 rules applied. Total rules applied 20 place count 423 transition count 1222
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 21 place count 422 transition count 1220
Iterating global reduction 1 with 1 rules applied. Total rules applied 22 place count 422 transition count 1220
Applied a total of 22 rules in 131 ms. Remains 422 /433 variables (removed 11) and now considering 1220/1243 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 131 ms. Remains : 422/433 places, 1220/1243 transitions.
RANDOM walk for 40008 steps (8 resets) in 181 ms. (219 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 57 ms. (689 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 510144 steps, run timeout after 3001 ms. (steps per millisecond=169 ) properties seen :0 out of 1
Probabilistic random walk after 510144 steps, saw 312815 distinct states, run finished after 3007 ms. (steps per millisecond=169 ) properties seen :0
[2026-05-25 07:32:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11540961169171234328.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17505856191738626897.kers'
[2026-05-25 07:32:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11540961169171234328.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17505856191738626897.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 689 rows 422 cols 2052 entries
Finished phase 1 with 419 SingleSign rule and 0 generalized
[2026-05-25 07:32:30] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-17505856191738626897.kers
Total runtime 18 ms.
[2026-05-25 07:32:30] [INFO ] State equation strengthened by 75 read => feed constraints.
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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/1057 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 70/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 0/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 8/1065 variables, 2/464 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1065 variables, 2/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1065 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 30/1095 variables, 19/485 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/1095 variables, 5/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 0/490 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 11/1106 variables, 7/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1106 variables, 0/497 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1110 variables, 2/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1110 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1111 variables, 1/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1111 variables, 0/500 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1111/1111 variables, and 500 constraints, problems are : Problem set: 0 solved, 1 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 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) 383/385 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/385 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 643/1028 variables, 385/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1028 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 29/1057 variables, 6/392 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1057 variables, 70/462 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1057 variables, 1/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1057 variables, 0/463 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 8/1065 variables, 2/465 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1065 variables, 2/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1065 variables, 0/467 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 30/1095 variables, 19/486 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1095 variables, 5/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1095 variables, 0/491 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 11/1106 variables, 7/498 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1106 variables, 1/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1106 variables, 0/499 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1110 variables, 2/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1110 variables, 0/501 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1111 variables, 1/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1111 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 502 constraints, problems are : Problem set: 0 solved, 1 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1235ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 47 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 48 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 46 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2026-05-25 07:32:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2026-05-25 07:32:31] [INFO ] Invariant cache hit.
[2026-05-25 07:32:31] [INFO ] Implicit Places using invariants in 312 ms returned []
[2026-05-25 07:32:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2026-05-25 07:32:31] [INFO ] Invariant cache hit.
[2026-05-25 07:32:32] [INFO ] State equation strengthened by 75 read => feed constraints.
[2026-05-25 07:32:34] [INFO ] Implicit Places using invariants and state equation in 2178 ms returned []
Implicit Place search using SMT with State Equation took 2497 ms to find 0 implicit places.
[2026-05-25 07:32:34] [INFO ] Redundant transitions in 72 ms returned []
Running 1218 sub problems to find dead transitions.
[2026-05-25 07:32:34] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2026-05-25 07:32:34] [INFO ] Invariant cache hit.
[2026-05-25 07:32:34] [INFO ] State equation strengthened by 75 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 422/1111 variables, and 4 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/422 constraints, ReadFeed: 0/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/422 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/422 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/422 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 3 (OVERLAPS) 689/1111 variables, 422/426 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1111 variables, 75/501 constraints. Problems are: Problem set: 0 solved, 1218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1111/1111 variables, and 1719 constraints, problems are : Problem set: 0 solved, 1218 unsolved in 30858 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 422/422 constraints, ReadFeed: 75/75 constraints, PredecessorRefiner: 1218/1218 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61863ms problems are : Problem set: 0 solved, 1218 unsolved
Search for dead transitions found 0 dead transitions in 61865ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64493 ms. Remains : 422/422 places, 1220/1220 transitions.
Attempting over-approximation, by ignoring read arcs.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 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 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
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 697 place count 339 transition count 606
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 949 place count 213 transition count 480
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 1012 place count 150 transition count 354
Iterating global reduction 2 with 63 rules applied. Total rules applied 1075 place count 150 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1076 place count 150 transition count 353
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1138 place count 88 transition count 229
Iterating global reduction 3 with 62 rules applied. Total rules applied 1200 place count 88 transition count 229
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1262 place count 26 transition count 105
Iterating global reduction 3 with 62 rules applied. Total rules applied 1324 place count 26 transition count 105
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 3 with 62 rules applied. Total rules applied 1386 place count 26 transition count 43
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 1388 place count 25 transition count 42
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1392 place count 23 transition count 43
Applied a total of 1392 rules in 72 ms. Remains 23 /422 variables (removed 399) and now considering 43/1220 (removed 1177) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3258514019069418034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6573618685237618167.kers'
[2026-05-25 07:33:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3258514019069418034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6573618685237618167.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 43 rows 23 cols 142 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-25 07:33:36] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6573618685237618167.kers
Total runtime 0 ms.
[2026-05-25 07:33:36] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2026-05-25 07:33:36] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 07:33:36] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 07:33:36] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 07:33:36] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 07:33:36] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 07:33:36] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 07:33:36] [INFO ] After 46ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 1182 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1&&X(p2))))))'
Support contains 5 out of 669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 662 transition count 1730
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 662 transition count 1730
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 18 place count 662 transition count 1726
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 24 place count 656 transition count 1714
Iterating global reduction 1 with 6 rules applied. Total rules applied 30 place count 656 transition count 1714
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 651 transition count 1700
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 651 transition count 1700
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 43 place count 648 transition count 1688
Iterating global reduction 1 with 3 rules applied. Total rules applied 46 place count 648 transition count 1688
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 49 place count 645 transition count 1680
Iterating global reduction 1 with 3 rules applied. Total rules applied 52 place count 645 transition count 1680
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 55 place count 642 transition count 1674
Iterating global reduction 1 with 3 rules applied. Total rules applied 58 place count 642 transition count 1674
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 61 place count 639 transition count 1668
Iterating global reduction 1 with 3 rules applied. Total rules applied 64 place count 639 transition count 1668
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 67 place count 636 transition count 1662
Iterating global reduction 1 with 3 rules applied. Total rules applied 70 place count 636 transition count 1662
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 73 place count 633 transition count 1656
Iterating global reduction 1 with 3 rules applied. Total rules applied 76 place count 633 transition count 1656
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 77 place count 632 transition count 1654
Iterating global reduction 1 with 1 rules applied. Total rules applied 78 place count 632 transition count 1654
Applied a total of 78 rules in 165 ms. Remains 632 /669 variables (removed 37) and now considering 1654/1744 (removed 90) transitions.
[2026-05-25 07:33:37] [INFO ] Flow matrix only has 1106 transitions (discarded 548 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-735564525074559041.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17236421768871066740.kers'
[2026-05-25 07:33:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-735564525074559041.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17236421768871066740.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1106 rows 632 cols 3036 entries
Finished phase 1 with 629 SingleSign rule and 1 generalized
[2026-05-25 07:33:37] [INFO ] Computed 2 invariants in 8 ms
Computed 2 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-17236421768871066740.kers
Total runtime 11 ms.
[2026-05-25 07:33:38] [INFO ] Implicit Places using invariants in 437 ms returned []
[2026-05-25 07:33:38] [INFO ] Flow matrix only has 1106 transitions (discarded 548 similar events)
[2026-05-25 07:33:38] [INFO ] Invariant cache hit.
[2026-05-25 07:33:38] [INFO ] State equation strengthened by 273 read => feed constraints.
[2026-05-25 07:33:40] [INFO ] Implicit Places using invariants and state equation in 2915 ms returned []
Implicit Place search using SMT with State Equation took 3355 ms to find 0 implicit places.
Running 1652 sub problems to find dead transitions.
[2026-05-25 07:33:41] [INFO ] Flow matrix only has 1106 transitions (discarded 548 similar events)
[2026-05-25 07:33:41] [INFO ] Invariant cache hit.
[2026-05-25 07:33:41] [INFO ] State equation strengthened by 273 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1652 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 632/1738 variables, and 2 constraints, problems are : Problem set: 0 solved, 1652 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 1652/1652 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/632 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/632 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1652 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 632/1738 variables, and 2 constraints, problems are : Problem set: 0 solved, 1652 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/632 constraints, ReadFeed: 0/273 constraints, PredecessorRefiner: 0/1652 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61939ms problems are : Problem set: 0 solved, 1652 unsolved
Search for dead transitions found 0 dead transitions in 61945ms
Starting structural reductions in LTL mode, iteration 1 : 632/669 places, 1654/1744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65474 ms. Remains : 632/669 places, 1654/1744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(G((p1&&X(p2))))))'
Stuttering acceptance computed with spot in 323 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p1) (NOT p2)), true, (AND p1 (NOT p2))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 617 steps with 1 reset in 21 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-03 finished in 65904 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Support contains 1 out of 669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 659 transition count 1724
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 659 transition count 1724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 651 transition count 1698
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 651 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 644 transition count 1676
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 644 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 62 place count 638 transition count 1656
Iterating global reduction 1 with 6 rules applied. Total rules applied 68 place count 638 transition count 1656
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 74 place count 632 transition count 1640
Iterating global reduction 1 with 6 rules applied. Total rules applied 80 place count 632 transition count 1640
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 86 place count 626 transition count 1628
Iterating global reduction 1 with 6 rules applied. Total rules applied 92 place count 626 transition count 1628
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 98 place count 620 transition count 1616
Iterating global reduction 1 with 6 rules applied. Total rules applied 104 place count 620 transition count 1616
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 110 place count 614 transition count 1604
Iterating global reduction 1 with 6 rules applied. Total rules applied 116 place count 614 transition count 1604
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 120 place count 610 transition count 1596
Iterating global reduction 1 with 4 rules applied. Total rules applied 124 place count 610 transition count 1596
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 126 place count 608 transition count 1592
Iterating global reduction 1 with 2 rules applied. Total rules applied 128 place count 608 transition count 1592
Applied a total of 128 rules in 176 ms. Remains 608 /669 variables (removed 61) and now considering 1592/1744 (removed 152) transitions.
[2026-05-25 07:34:43] [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-17815976039039470595.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5165757934796707739.kers'
[2026-05-25 07:34:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17815976039039470595.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5165757934796707739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1064 rows 608 cols 2926 entries
Finished phase 1 with 605 SingleSign rule and 1 generalized
[2026-05-25 07:34:43] [INFO ] Computed 2 invariants in 5 ms
Computed 2 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5165757934796707739.kers
Total runtime 8 ms.
[2026-05-25 07:34:43] [INFO ] Implicit Places using invariants in 449 ms returned []
[2026-05-25 07:34:43] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2026-05-25 07:34:43] [INFO ] Invariant cache hit.
[2026-05-25 07:34:44] [INFO ] State equation strengthened by 264 read => feed constraints.
[2026-05-25 07:34:46] [INFO ] Implicit Places using invariants and state equation in 2530 ms returned []
Implicit Place search using SMT with State Equation took 2983 ms to find 0 implicit places.
Running 1590 sub problems to find dead transitions.
[2026-05-25 07:34:46] [INFO ] Flow matrix only has 1064 transitions (discarded 528 similar events)
[2026-05-25 07:34:46] [INFO ] Invariant cache hit.
[2026-05-25 07:34:46] [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
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 30039 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
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 608/1672 variables, and 2 constraints, problems are : Problem set: 0 solved, 1590 unsolved in 30038 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: 0/1590 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61761ms problems are : Problem set: 0 solved, 1590 unsolved
Search for dead transitions found 0 dead transitions in 61765ms
Starting structural reductions in LTL mode, iteration 1 : 608/669 places, 1592/1744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64932 ms. Remains : 608/669 places, 1592/1744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(p0))))'
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-04 finished in 65114 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Support contains 2 out of 669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 659 transition count 1724
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 659 transition count 1724
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 26 place count 659 transition count 1718
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 34 place count 651 transition count 1698
Iterating global reduction 1 with 8 rules applied. Total rules applied 42 place count 651 transition count 1698
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 49 place count 644 transition count 1678
Iterating global reduction 1 with 7 rules applied. Total rules applied 56 place count 644 transition count 1678
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 61 place count 639 transition count 1662
Iterating global reduction 1 with 5 rules applied. Total rules applied 66 place count 639 transition count 1662
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 71 place count 634 transition count 1648
Iterating global reduction 1 with 5 rules applied. Total rules applied 76 place count 634 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 81 place count 629 transition count 1638
Iterating global reduction 1 with 5 rules applied. Total rules applied 86 place count 629 transition count 1638
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 91 place count 624 transition count 1628
Iterating global reduction 1 with 5 rules applied. Total rules applied 96 place count 624 transition count 1628
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 101 place count 619 transition count 1618
Iterating global reduction 1 with 5 rules applied. Total rules applied 106 place count 619 transition count 1618
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 109 place count 616 transition count 1612
Iterating global reduction 1 with 3 rules applied. Total rules applied 112 place count 616 transition count 1612
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 114 place count 614 transition count 1608
Iterating global reduction 1 with 2 rules applied. Total rules applied 116 place count 614 transition count 1608
Applied a total of 116 rules in 281 ms. Remains 614 /669 variables (removed 55) and now considering 1608/1744 (removed 136) transitions.
[2026-05-25 07:35:48] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17232137334406527045.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16241449368365972548.kers'
[2026-05-25 07:35:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17232137334406527045.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16241449368365972548.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1073 rows 614 cols 2948 entries
Finished phase 1 with 611 SingleSign rule and 1 generalized
[2026-05-25 07:35:48] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16241449368365972548.kers
Total runtime 6 ms.
[2026-05-25 07:35:49] [INFO ] Implicit Places using invariants in 515 ms returned []
[2026-05-25 07:35:49] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2026-05-25 07:35:49] [INFO ] Invariant cache hit.
[2026-05-25 07:35:49] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 07:35:51] [INFO ] Implicit Places using invariants and state equation in 2521 ms returned []
Implicit Place search using SMT with State Equation took 3039 ms to find 0 implicit places.
Running 1606 sub problems to find dead transitions.
[2026-05-25 07:35:51] [INFO ] Flow matrix only has 1073 transitions (discarded 535 similar events)
[2026-05-25 07:35:51] [INFO ] Invariant cache hit.
[2026-05-25 07:35:51] [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, 1606 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/614 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1606 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 614/1687 variables, and 2 constraints, problems are : Problem set: 0 solved, 1606 unsolved in 30032 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: 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
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 614/1687 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/265 constraints, PredecessorRefiner: 0/1606 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62548ms problems are : Problem set: 0 solved, 1606 unsolved
Search for dead transitions found 0 dead transitions in 62553ms
Starting structural reductions in LTL mode, iteration 1 : 614/669 places, 1608/1744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65881 ms. Remains : 614/669 places, 1608/1744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)))'
Stuttering acceptance computed with spot in 119 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-06 finished in 66035 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 1 out of 669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 658 transition count 1722
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 658 transition count 1722
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 658 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 649 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 649 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 641 transition count 1670
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 641 transition count 1670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 635 transition count 1650
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 635 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 629 transition count 1634
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 629 transition count 1634
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 623 transition count 1622
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 623 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 617 transition count 1610
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 617 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 611 transition count 1598
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 611 transition count 1598
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 126 place count 607 transition count 1590
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 607 transition count 1590
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 605 transition count 1586
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 605 transition count 1586
Applied a total of 134 rules in 180 ms. Remains 605 /669 variables (removed 64) and now considering 1586/1744 (removed 158) transitions.
[2026-05-25 07:36:54] [INFO ] Flow matrix only has 1058 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-7721668508496045377.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3673861980387889701.kers'
[2026-05-25 07:36:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7721668508496045377.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3673861980387889701.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1058 rows 605 cols 2908 entries
Finished phase 1 with 602 SingleSign rule and 1 generalized
[2026-05-25 07:36:54] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-3673861980387889701.kers
Total runtime 14 ms.
[2026-05-25 07:36:55] [INFO ] Implicit Places using invariants in 532 ms returned []
[2026-05-25 07:36:55] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:36:55] [INFO ] Invariant cache hit.
[2026-05-25 07:36:55] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 07:36:58] [INFO ] Implicit Places using invariants and state equation in 2884 ms returned []
Implicit Place search using SMT with State Equation took 3419 ms to find 0 implicit places.
Running 1584 sub problems to find dead transitions.
[2026-05-25 07:36:58] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:36:58] [INFO ] Invariant cache hit.
[2026-05-25 07:36:58] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1584/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 605/1663 variables, and 2 constraints, problems are : Problem set: 0 solved, 1584 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 0/1584 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61808ms problems are : Problem set: 0 solved, 1584 unsolved
Search for dead transitions found 0 dead transitions in 61811ms
Starting structural reductions in LTL mode, iteration 1 : 605/669 places, 1586/1744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65417 ms. Remains : 605/669 places, 1586/1744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-07 finished in 65529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(X(G(p1)))))))'
Support contains 2 out of 669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 658 transition count 1722
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 658 transition count 1722
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 658 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 649 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 649 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 641 transition count 1670
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 641 transition count 1670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 635 transition count 1650
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 635 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 629 transition count 1634
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 629 transition count 1634
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 623 transition count 1622
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 623 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 617 transition count 1610
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 617 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 611 transition count 1598
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 611 transition count 1598
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 126 place count 607 transition count 1590
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 607 transition count 1590
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 605 transition count 1586
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 605 transition count 1586
Applied a total of 134 rules in 157 ms. Remains 605 /669 variables (removed 64) and now considering 1586/1744 (removed 158) transitions.
[2026-05-25 07:38:00] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:00] [INFO ] Invariant cache hit.
[2026-05-25 07:38:00] [INFO ] Implicit Places using invariants in 428 ms returned []
[2026-05-25 07:38:00] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:00] [INFO ] Invariant cache hit.
[2026-05-25 07:38:00] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 07:38:03] [INFO ] Implicit Places using invariants and state equation in 2819 ms returned []
Implicit Place search using SMT with State Equation took 3281 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 605/669 places, 1586/1744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3440 ms. Remains : 605/669 places, 1586/1744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(X(G(p1)))))))'
Stuttering acceptance computed with spot in 137 ms :[(NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-08
Product exploration explored 100000 steps with 0 reset in 535 ms.
Product exploration explored 100000 steps with 1 reset in 631 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/605 stabilizing places and 512/1586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 112 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40017 steps (8 resets) in 179 ms. (222 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (11 resets) in 65 ms. (606 steps per ms) remains 1/3 properties
[2026-05-25 07:38:05] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:05] [INFO ] Invariant cache hit.
[2026-05-25 07:38:05] [INFO ] State equation strengthened by 262 read => feed constraints.
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) 382/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 344/1577 variables, 141/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1577 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1577 variables, 68/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1577 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/1651 variables, 69/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1651 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1659 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1659 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1663 variables, 3/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1663 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1663 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1663/1663 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 573 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 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) 382/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 344/1577 variables, 141/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1577 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1577 variables, 68/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1577 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/1651 variables, 69/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1651 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1659 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1659 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1663 variables, 3/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1663 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1663 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 711 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1319ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 6516 steps, including 58 resets, run visited all 1 properties in 18 ms. (steps per millisecond=362 )
Parikh walk visited 1 properties in 22 ms.
Knowledge based reduction with 6 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1817 ms.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 16 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2026-05-25 07:38:06] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:06] [INFO ] Invariant cache hit.
[2026-05-25 07:38:07] [INFO ] Implicit Places using invariants in 425 ms returned []
[2026-05-25 07:38:07] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:07] [INFO ] Invariant cache hit.
[2026-05-25 07:38:07] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 07:38:10] [INFO ] Implicit Places using invariants and state equation in 2924 ms returned []
Implicit Place search using SMT with State Equation took 3387 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3405 ms. Remains : 605/605 places, 1586/1586 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/605 stabilizing places and 512/1586 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 6 factoid took 57 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (8 resets) in 247 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (14 resets) in 51 ms. (769 steps per ms) remains 1/3 properties
[2026-05-25 07:38:10] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:10] [INFO ] Invariant cache hit.
[2026-05-25 07:38:10] [INFO ] State equation strengthened by 262 read => feed constraints.
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) 382/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 344/1577 variables, 141/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1577 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1577 variables, 68/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1577 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 74/1651 variables, 69/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1651 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1659 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1659 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1663 variables, 3/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1663 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1663 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1663/1663 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 592 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 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) 382/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 344/1577 variables, 141/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1577 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1577 variables, 68/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1577 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 74/1651 variables, 69/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1651 variables, 0/863 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1659 variables, 4/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1659 variables, 0/867 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 4/1663 variables, 3/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1663 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1663 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1663/1663 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 690 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1305ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 5311 steps, including 46 resets, run visited all 1 properties in 13 ms. (steps per millisecond=408 )
Parikh walk visited 1 properties in 14 ms.
Knowledge based reduction with 6 factoid took 81 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 1702 ms.
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 472 ms.
Product exploration explored 100000 steps with 4 reset in 486 ms.
Spot run failed in 80 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin17514738399046048232
[2026-05-25 07:38:13] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17514738399046048232
Running compilation step : cd /tmp/ltsmin17514738399046048232;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17514738399046048232;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin17514738399046048232;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 605/605 places, 1586/1586 transitions.
Applied a total of 0 rules in 13 ms. Remains 605 /605 variables (removed 0) and now considering 1586/1586 (removed 0) transitions.
[2026-05-25 07:38:16] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:16] [INFO ] Invariant cache hit.
[2026-05-25 07:38:16] [INFO ] Implicit Places using invariants in 418 ms returned []
[2026-05-25 07:38:16] [INFO ] Flow matrix only has 1058 transitions (discarded 528 similar events)
[2026-05-25 07:38:16] [INFO ] Invariant cache hit.
[2026-05-25 07:38:17] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 07:38:19] [INFO ] Implicit Places using invariants and state equation in 2873 ms returned []
Implicit Place search using SMT with State Equation took 3312 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3339 ms. Remains : 605/605 places, 1586/1586 transitions.
Built C files in :
/tmp/ltsmin5419031505316176355
[2026-05-25 07:38:19] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5419031505316176355
Running compilation step : cd /tmp/ltsmin5419031505316176355;'/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 2792 ms.
Running link step : cd /tmp/ltsmin5419031505316176355;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 50 ms.
Running LTSmin : cd /tmp/ltsmin5419031505316176355;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased9841728580969212847.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 07:38:34] [INFO ] Flatten gal took : 94 ms
[2026-05-25 07:38:35] [INFO ] Flatten gal took : 93 ms
[2026-05-25 07:38:35] [INFO ] Time to serialize gal into /tmp/LTL16840481150000865311.gal : 27 ms
[2026-05-25 07:38:35] [INFO ] Time to serialize properties into /tmp/LTL13340367008336889606.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/LTL16840481150000865311.gal' '-t' 'CGAL' '-hoa' '/tmp/aut31223991895366044.hoa' '-atoms' '/tmp/LTL13340367008336889606.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL13340367008336889606.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut31223991895366044.hoa
Detected timeout of ITS tools.
[2026-05-25 07:38:50] [INFO ] Flatten gal took : 60 ms
[2026-05-25 07:38:50] [INFO ] Flatten gal took : 76 ms
[2026-05-25 07:38:50] [INFO ] Time to serialize gal into /tmp/LTL10424595329765860294.gal : 11 ms
[2026-05-25 07:38:50] [INFO ] Time to serialize properties into /tmp/LTL2826276953052206140.ltl : 29 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/LTL10424595329765860294.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2826276953052206140.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F("(l1007<1)")))||((F("(l1007<1)"))&&(X(X(G("(l550<1)"))))))))
Formula 0 simplified : G(FG!"(l1007<1)" & (G!"(l1007<1)" | XXF!"(l550<1)"))
Detected timeout of ITS tools.
[2026-05-25 07:39:05] [INFO ] Flatten gal took : 28 ms
[2026-05-25 07:39:05] [INFO ] Applying decomposition
[2026-05-25 07:39:05] [INFO ] Flatten gal took : 28 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/graph1724212640157120313.txt' '-o' '/tmp/graph1724212640157120313.bin' '-w' '/tmp/graph1724212640157120313.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph1724212640157120313.bin' '-l' '-1' '-v' '-w' '/tmp/graph1724212640157120313.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:39:06] [INFO ] Decomposing Gal with order
[2026-05-25 07:39:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:39:06] [INFO ] Removed a total of 2629 redundant transitions.
[2026-05-25 07:39:06] [INFO ] Flatten gal took : 675 ms
[2026-05-25 07:39:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 1139 labels/synchronizations in 188 ms.
[2026-05-25 07:39:07] [INFO ] Time to serialize gal into /tmp/LTL12447411965502204990.gal : 39 ms
[2026-05-25 07:39:07] [INFO ] Time to serialize properties into /tmp/LTL10495878050824854580.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/LTL12447411965502204990.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10495878050824854580.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 : !((F((G(F("(i15.u136.l1007<1)")))||((F("(i15.u136.l1007<1)"))&&(X(X(G("(i26.u40.l550<1)"))))))))
Formula 0 simplified : G(FG!"(i15.u136.l1007<1)" & (G!"(i15.u136.l1007<1)" | XXF!"(i26.u40.l550<1)"))
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-08 finished in 82352 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(((p1&&X(X(X(p2)))&&G(p3))||G(p2)))))))))'
Support contains 5 out of 669 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 661 transition count 1728
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 661 transition count 1728
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 20 place count 661 transition count 1724
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 27 place count 654 transition count 1706
Iterating global reduction 1 with 7 rules applied. Total rules applied 34 place count 654 transition count 1706
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 41 place count 647 transition count 1686
Iterating global reduction 1 with 7 rules applied. Total rules applied 48 place count 647 transition count 1686
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 53 place count 642 transition count 1670
Iterating global reduction 1 with 5 rules applied. Total rules applied 58 place count 642 transition count 1670
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 63 place count 637 transition count 1656
Iterating global reduction 1 with 5 rules applied. Total rules applied 68 place count 637 transition count 1656
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 73 place count 632 transition count 1646
Iterating global reduction 1 with 5 rules applied. Total rules applied 78 place count 632 transition count 1646
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 83 place count 627 transition count 1636
Iterating global reduction 1 with 5 rules applied. Total rules applied 88 place count 627 transition count 1636
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 93 place count 622 transition count 1626
Iterating global reduction 1 with 5 rules applied. Total rules applied 98 place count 622 transition count 1626
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 101 place count 619 transition count 1620
Iterating global reduction 1 with 3 rules applied. Total rules applied 104 place count 619 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 106 place count 617 transition count 1616
Iterating global reduction 1 with 2 rules applied. Total rules applied 108 place count 617 transition count 1616
Applied a total of 108 rules in 172 ms. Remains 617 /669 variables (removed 52) and now considering 1616/1744 (removed 128) transitions.
[2026-05-25 07:39:22] [INFO ] Flow matrix only has 1081 transitions (discarded 535 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-18362845419408254040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3197081643900350033.kers'
[2026-05-25 07:39:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18362845419408254040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3197081643900350033.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1081 rows 617 cols 2968 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 07:39:22] [INFO ] Computed 2 invariants in 4 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3197081643900350033.kers
Total runtime 7 ms.
[2026-05-25 07:39:23] [INFO ] Implicit Places using invariants in 596 ms returned []
[2026-05-25 07:39:23] [INFO ] Flow matrix only has 1081 transitions (discarded 535 similar events)
[2026-05-25 07:39:23] [INFO ] Invariant cache hit.
[2026-05-25 07:39:23] [INFO ] State equation strengthened by 269 read => feed constraints.
[2026-05-25 07:39:25] [INFO ] Implicit Places using invariants and state equation in 2490 ms returned []
Implicit Place search using SMT with State Equation took 3096 ms to find 0 implicit places.
Running 1614 sub problems to find dead transitions.
[2026-05-25 07:39:25] [INFO ] Flow matrix only has 1081 transitions (discarded 535 similar events)
[2026-05-25 07:39:25] [INFO ] Invariant cache hit.
[2026-05-25 07:39:25] [INFO ] State equation strengthened by 269 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 1614/1614 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1614 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1614 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1698 variables, and 2 constraints, problems are : Problem set: 0 solved, 1614 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/269 constraints, PredecessorRefiner: 0/1614 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61853ms problems are : Problem set: 0 solved, 1614 unsolved
Search for dead transitions found 0 dead transitions in 61857ms
Starting structural reductions in LTL mode, iteration 1 : 617/669 places, 1616/1744 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65141 ms. Remains : 617/669 places, 1616/1744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(F((p0&&F(((p1&&X(X(X(p2)))&&G(p3))||G(p2)))))))))'
Stuttering acceptance computed with spot in 717 ms :[(NOT p0), (NOT p0), (OR (NOT p0) (NOT p2)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3)), (NOT p2), (NOT p2), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-11
Stuttering criterion allowed to conclude after 93 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-c016-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-c016-LTLCardinality-11 finished in 65923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 669 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 669/669 places, 1744/1744 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 658 transition count 1722
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 658 transition count 1722
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 28 place count 658 transition count 1716
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 37 place count 649 transition count 1694
Iterating global reduction 1 with 9 rules applied. Total rules applied 46 place count 649 transition count 1694
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 54 place count 641 transition count 1670
Iterating global reduction 1 with 8 rules applied. Total rules applied 62 place count 641 transition count 1670
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 68 place count 635 transition count 1650
Iterating global reduction 1 with 6 rules applied. Total rules applied 74 place count 635 transition count 1650
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 80 place count 629 transition count 1634
Iterating global reduction 1 with 6 rules applied. Total rules applied 86 place count 629 transition count 1634
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 92 place count 623 transition count 1622
Iterating global reduction 1 with 6 rules applied. Total rules applied 98 place count 623 transition count 1622
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 104 place count 617 transition count 1610
Iterating global reduction 1 with 6 rules applied. Total rules applied 110 place count 617 transition count 1610
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 116 place count 611 transition count 1598
Iterating global reduction 1 with 6 rules applied. Total rules applied 122 place count 611 transition count 1598
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 126 place count 607 transition count 1590
Iterating global reduction 1 with 4 rules applied. Total rules applied 130 place count 607 transition count 1590
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 132 place count 605 transition count 1586
Iterating global reduction 1 with 2 rules applied. Total rules applied 134 place count 605 transition count 1586
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 1 with 2 rules applied. Total rules applied 136 place count 605 transition count 1584
Applied a total of 136 rules in 981 ms. Remains 605 /669 variables (removed 64) and now considering 1584/1744 (removed 160) transitions.
[2026-05-25 07:40:29] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14492824429501237659.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5967333715274732990.kers'
[2026-05-25 07:40:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14492824429501237659.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5967333715274732990.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1057 rows 605 cols 2906 entries
Finished phase 1 with 602 SingleSign rule and 1 generalized
[2026-05-25 07:40:29] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5967333715274732990.kers
Total runtime 4 ms.
[2026-05-25 07:40:29] [INFO ] Implicit Places using invariants in 525 ms returned []
[2026-05-25 07:40:29] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 07:40:29] [INFO ] Invariant cache hit.
[2026-05-25 07:40:30] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 07:40:33] [INFO ] Implicit Places using invariants and state equation in 3575 ms returned []
Implicit Place search using SMT with State Equation took 4121 ms to find 0 implicit places.
[2026-05-25 07:40:33] [INFO ] Redundant transitions in 37 ms returned []
Running 1582 sub problems to find dead transitions.
[2026-05-25 07:40:33] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 07:40:33] [INFO ] Invariant cache hit.
[2026-05-25 07:40:33] [INFO ] State equation strengthened by 262 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/1662 variables, and 2 constraints, problems are : Problem set: 0 solved, 1582 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/605 constraints, ReadFeed: 0/262 constraints, PredecessorRefiner: 1582/1582 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1582 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/605 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/605 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/605 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
At refinement iteration 3 (OVERLAPS) 1057/1662 variables, 605/607 constraints. Problems are: Problem set: 0 solved, 1582 unsolved
SMT process timed out in 62597ms, After SMT, problems are : Problem set: 0 solved, 1582 unsolved
Search for dead transitions found 0 dead transitions in 62600ms
Starting structural reductions in SI_LTL mode, iteration 1 : 605/669 places, 1584/1744 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 67777 ms. Remains : 605/669 places, 1584/1744 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c016-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 480 ms.
Product exploration explored 100000 steps with 2 reset in 606 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 3 factoid took 48 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (9 resets) in 123 ms. (322 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 454547 steps, run timeout after 3001 ms. (steps per millisecond=151 ) properties seen :0 out of 1
Probabilistic random walk after 454547 steps, saw 295032 distinct states, run finished after 3001 ms. (steps per millisecond=151 ) properties seen :0
[2026-05-25 07:41:40] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 07:41:40] [INFO ] Invariant cache hit.
[2026-05-25 07:41:40] [INFO ] State equation strengthened by 262 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) 382/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 343/1576 variables, 141/724 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1576 variables, 1/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 68/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 0/793 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 72/1648 variables, 68/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1648 variables, 0/861 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 8/1656 variables, 4/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1656 variables, 0/865 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 6/1662 variables, 4/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 0/1662 variables, 0/869 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1662/1662 variables, and 869 constraints, problems are : Problem set: 0 solved, 1 unsolved in 486 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 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) 382/384 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/384 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 641/1025 variables, 384/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1025 variables, 0/385 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 208/1233 variables, 4/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1233 variables, 194/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1233 variables, 1/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1233 variables, 0/584 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 343/1576 variables, 141/725 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1576 variables, 1/726 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1576 variables, 68/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1576 variables, 0/794 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 72/1648 variables, 68/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1648 variables, 0/862 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 8/1656 variables, 4/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1656 variables, 0/866 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 6/1662 variables, 4/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1662 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 0/1662 variables, 0/870 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1662/1662 variables, and 870 constraints, problems are : Problem set: 0 solved, 1 unsolved in 718 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 605/605 constraints, ReadFeed: 262/262 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1215ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 4737 steps, including 40 resets, run visited all 1 properties in 16 ms. (steps per millisecond=296 )
Parikh walk visited 1 properties in 16 ms.
Knowledge based reduction with 3 factoid took 54 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 45 ms :[(NOT p0)]
Knowledge-based reduction took 4483 ms.
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 93 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2026-05-25 07:41:41] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 07:41:41] [INFO ] Invariant cache hit.
[2026-05-25 07:41:42] [INFO ] Implicit Places using invariants in 415 ms returned []
[2026-05-25 07:41:42] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 07:41:42] [INFO ] Invariant cache hit.
[2026-05-25 07:41:42] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 07:41:45] [INFO ] Implicit Places using invariants and state equation in 3647 ms returned []
Implicit Place search using SMT with State Equation took 4064 ms to find 0 implicit places.
[2026-05-25 07:41:45] [INFO ] Redundant transitions in 39 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4201 ms. Remains : 605/605 places, 1584/1584 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge based reduction with 3 factoid took 46 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 40039 steps (8 resets) in 180 ms. (221 steps per ms) remains 1/1 properties
BEST_FIRST walk for 36028 steps (9 resets) in 36 ms. (973 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Knowledge-based reduction took 236 ms.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Product exploration explored 100000 steps with 0 reset in 478 ms.
Product exploration explored 100000 steps with 0 reset in 518 ms.
Built C files in :
/tmp/ltsmin13249258585141997313
[2026-05-25 07:41:47] [INFO ] Too many transitions (1584) to apply POR reductions. Disabling POR matrices.
[2026-05-25 07:41:47] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13249258585141997313
Running compilation step : cd /tmp/ltsmin13249258585141997313;'/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 2718 ms.
Running link step : cd /tmp/ltsmin13249258585141997313;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin13249258585141997313;'/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/stateBased12486982655418768678.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 605 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 605/605 places, 1584/1584 transitions.
Applied a total of 0 rules in 75 ms. Remains 605 /605 variables (removed 0) and now considering 1584/1584 (removed 0) transitions.
[2026-05-25 07:42:02] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 07:42:02] [INFO ] Invariant cache hit.
[2026-05-25 07:42:02] [INFO ] Implicit Places using invariants in 522 ms returned []
[2026-05-25 07:42:02] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2026-05-25 07:42:02] [INFO ] Invariant cache hit.
[2026-05-25 07:42:03] [INFO ] State equation strengthened by 262 read => feed constraints.
[2026-05-25 07:42:06] [INFO ] Implicit Places using invariants and state equation in 3434 ms returned []
Implicit Place search using SMT with State Equation took 3985 ms to find 0 implicit places.
[2026-05-25 07:42:06] [INFO ] Redundant transitions in 33 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4102 ms. Remains : 605/605 places, 1584/1584 transitions.
Built C files in :
/tmp/ltsmin5983944046466781656
[2026-05-25 07:42:06] [INFO ] Too many transitions (1584) to apply POR reductions. Disabling POR matrices.
[2026-05-25 07:42:06] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5983944046466781656
Running compilation step : cd /tmp/ltsmin5983944046466781656;'/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 2719 ms.
Running link step : cd /tmp/ltsmin5983944046466781656;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin5983944046466781656;'/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/stateBased15531481676921032869.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 07:42:21] [INFO ] Flatten gal took : 55 ms
[2026-05-25 07:42:21] [INFO ] Flatten gal took : 44 ms
[2026-05-25 07:42:21] [INFO ] Time to serialize gal into /tmp/LTL17516936731573274539.gal : 9 ms
[2026-05-25 07:42:21] [INFO ] Time to serialize properties into /tmp/LTL17271462970354590480.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/LTL17516936731573274539.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5312896452061570515.hoa' '-atoms' '/tmp/LTL17271462970354590480.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...319
Loading property file /tmp/LTL17271462970354590480.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5312896452061570515.hoa
Detected timeout of ITS tools.
[2026-05-25 07:42:36] [INFO ] Flatten gal took : 21 ms
[2026-05-25 07:42:36] [INFO ] Flatten gal took : 21 ms
[2026-05-25 07:42:36] [INFO ] Time to serialize gal into /tmp/LTL16507800865591792159.gal : 5 ms
[2026-05-25 07:42:36] [INFO ] Time to serialize properties into /tmp/LTL10980365916912669223.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/LTL16507800865591792159.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10980365916912669223.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 : !((F(G("(l2681<=l509)"))))
Formula 0 simplified : GF!"(l2681<=l509)"
Detected timeout of ITS tools.
[2026-05-25 07:42:51] [INFO ] Flatten gal took : 21 ms
[2026-05-25 07:42:51] [INFO ] Applying decomposition
[2026-05-25 07:42:51] [INFO ] Flatten gal took : 21 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/graph5284077955146842190.txt' '-o' '/tmp/graph5284077955146842190.bin' '-w' '/tmp/graph5284077955146842190.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5284077955146842190.bin' '-l' '-1' '-v' '-w' '/tmp/graph5284077955146842190.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:42:51] [INFO ] Decomposing Gal with order
[2026-05-25 07:42:51] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:42:51] [INFO ] Removed a total of 469 redundant transitions.
[2026-05-25 07:42:52] [INFO ] Flatten gal took : 52 ms
[2026-05-25 07:42:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 224 labels/synchronizations in 7 ms.
[2026-05-25 07:42:52] [INFO ] Time to serialize gal into /tmp/LTL15358319970668673292.gal : 6 ms
[2026-05-25 07:42:52] [INFO ] Time to serialize properties into /tmp/LTL4143793993680511413.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/LTL15358319970668673292.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL4143793993680511413.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...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(gu1.l2681<=gu1.l509)"))))
Formula 0 simplified : GF!"(gu1.l2681<=gu1.l509)"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c016-LTLCardinality-15 finished in 158925 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||(F(p0)&&X(X(G(p1)))))))'
Spot run failed in 42 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.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Spot run failed in 40 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 07:43:07] [INFO ] Flatten gal took : 181 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15836147443461863465
[2026-05-25 07:43:07] [INFO ] Too many transitions (1744) to apply POR reductions. Disabling POR matrices.
[2026-05-25 07:43:07] [INFO ] Applying decomposition
[2026-05-25 07:43:07] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15836147443461863465
Running compilation step : cd /tmp/ltsmin15836147443461863465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '360' '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 07:43:07] [INFO ] Flatten gal took : 65 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/graph12552569355008537716.txt' '-o' '/tmp/graph12552569355008537716.bin' '-w' '/tmp/graph12552569355008537716.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12552569355008537716.bin' '-l' '-1' '-v' '-w' '/tmp/graph12552569355008537716.weights' '-q' '0' '-e' '0.001'
[2026-05-25 07:43:07] [INFO ] Decomposing Gal with order
[2026-05-25 07:43:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 07:43:07] [INFO ] Removed a total of 607 redundant transitions.
[2026-05-25 07:43:07] [INFO ] Flatten gal took : 205 ms
[2026-05-25 07:43:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 302 labels/synchronizations in 10 ms.
[2026-05-25 07:43:08] [INFO ] Time to serialize gal into /tmp/LTLCardinality11807739307228247419.gal : 10 ms
[2026-05-25 07:43:08] [INFO ] Time to serialize properties into /tmp/LTLCardinality698804689394019187.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/LTLCardinality11807739307228247419.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality698804689394019187.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...297
Read 2 LTL properties
Checking formula 0 : !((F((G(F("(gi0.gu1.l1007<1)")))||((F("(gi0.gu1.l1007<1)"))&&(X(X(G("(gi0.gu1.l550<1)"))))))))
Formula 0 simplified : G(FG!"(gi0.gu1.l1007<1)" & (G!"(gi0.gu1.l1007<1)" | XXF!"(gi0.gu1.l550<1)"))
Compilation finished in 3533 ms.
Running link step : cd /tmp/ltsmin15836147443461863465;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin15836147443461863465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin15836147443461863465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15836147443461863465;'/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' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137
[2026-05-25 08:01:38] [INFO ] Flatten gal took : 150 ms
[2026-05-25 08:01:38] [INFO ] Time to serialize gal into /tmp/LTLCardinality13989152093055014593.gal : 28 ms
[2026-05-25 08:01:38] [INFO ] Time to serialize properties into /tmp/LTLCardinality15268864095165969732.ltl : 7 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/LTLCardinality13989152093055014593.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15268864095165969732.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 2 LTL properties
Checking formula 0 : !((F((G(F("(l1007<1)")))||((F("(l1007<1)"))&&(X(X(G("(l550<1)"))))))))
Formula 0 simplified : G(FG!"(l1007<1)" & (G!"(l1007<1)" | XXF!"(l550<1)"))
ITS-tools command line returned an error code 137
[2026-05-25 08:11:01] [INFO ] Flatten gal took : 46 ms
[2026-05-25 08:11:01] [INFO ] Input system was already deterministic with 1744 transitions.
[2026-05-25 08:11:01] [INFO ] Transformed 669 places.
[2026-05-25 08:11:01] [INFO ] Transformed 1744 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 08:11:01] [INFO ] Time to serialize gal into /tmp/LTLCardinality5503462619048856196.gal : 5 ms
[2026-05-25 08:11:01] [INFO ] Time to serialize properties into /tmp/LTLCardinality13579329041034818887.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/LTLCardinality5503462619048856196.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality13579329041034818887.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...343
Read 2 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F("(l1007<1)")))||((F("(l1007<1)"))&&(X(X(G("(l550<1)"))))))))
Formula 0 simplified : G(FG!"(l1007<1)" & (G!"(l1007<1)" | XXF!"(l550<1)"))
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin15836147443461863465;'/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' '--ltl' '<>([]((LTLAPp2==true)))' '--buchi-type=spotba'
Retrying LTSmin with larger timeout 14400 s
Running LTSmin : cd /tmp/ltsmin15836147443461863465;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||(<>((LTLAPp0==true))&&X(X([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
ITS-tools command line returned an error code 137

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

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