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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 8.3K Mar 7 07:31 CTLCardinality.txt
-rw-r--r-- 1 mcc users 91K Mar 7 07:31 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Mar 7 07:31 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 7 07:31 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:25 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 10:25 LTLFireability.xml
-rw-r--r-- 1 mcc users 7.4K Mar 7 07:31 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 7 07:31 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 07:31 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 82K Mar 7 07:31 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:25 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 10:25 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-c004-LTLCardinality-00
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-01
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-02
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-03
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-04
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-05
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-06
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-07
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-08
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-09
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-10
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-11
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-12
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-13
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-14
FORMULA_NAME FunctionPointer-PT-c004-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779687025914

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-c004
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-25 05:30:27] [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 05:30:27] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 05:30:27] [INFO ] Load time of PNML (sax parser for PT used): 369 ms
[2026-05-25 05:30:27] [INFO ] Transformed 2826 places.
[2026-05-25 05:30:27] [INFO ] Transformed 8960 transitions.
[2026-05-25 05:30:27] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 514 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 12 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1198 places in 47 ms
Reduce places removed 1198 places and 2998 transitions.
Initial state reduction rules removed 2 formulas.
FORMULA FunctionPointer-PT-c004-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 4 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 301 places :
Symmetric choice reduction at 1 with 301 rule applications. Total rules 318 place count 1310 transition count 3678
Iterating global reduction 1 with 301 rules applied. Total rules applied 619 place count 1310 transition count 3678
Ensure Unique test removed 362 transitions
Reduce isomorphic transitions removed 362 transitions.
Iterating post reduction 1 with 362 rules applied. Total rules applied 981 place count 1310 transition count 3316
Discarding 157 places :
Symmetric choice reduction at 2 with 157 rule applications. Total rules 1138 place count 1153 transition count 3002
Iterating global reduction 2 with 157 rules applied. Total rules applied 1295 place count 1153 transition count 3002
Ensure Unique test removed 68 transitions
Reduce isomorphic transitions removed 68 transitions.
Iterating post reduction 2 with 68 rules applied. Total rules applied 1363 place count 1153 transition count 2934
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1377 place count 1139 transition count 2906
Iterating global reduction 3 with 14 rules applied. Total rules applied 1391 place count 1139 transition count 2906
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1405 place count 1125 transition count 2878
Iterating global reduction 3 with 14 rules applied. Total rules applied 1419 place count 1125 transition count 2878
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1433 place count 1111 transition count 2850
Iterating global reduction 3 with 14 rules applied. Total rules applied 1447 place count 1111 transition count 2850
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1461 place count 1097 transition count 2822
Iterating global reduction 3 with 14 rules applied. Total rules applied 1475 place count 1097 transition count 2822
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1489 place count 1083 transition count 2794
Iterating global reduction 3 with 14 rules applied. Total rules applied 1503 place count 1083 transition count 2794
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1517 place count 1069 transition count 2766
Iterating global reduction 3 with 14 rules applied. Total rules applied 1531 place count 1069 transition count 2766
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 1545 place count 1055 transition count 2738
Iterating global reduction 3 with 14 rules applied. Total rules applied 1559 place count 1055 transition count 2738
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1621 place count 993 transition count 2504
Iterating global reduction 3 with 62 rules applied. Total rules applied 1683 place count 993 transition count 2504
Discarding 62 places :
Symmetric choice reduction at 3 with 62 rule applications. Total rules 1745 place count 931 transition count 2256
Iterating global reduction 3 with 62 rules applied. Total rules applied 1807 place count 931 transition count 2256
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1868 place count 870 transition count 2120
Iterating global reduction 3 with 61 rules applied. Total rules applied 1929 place count 870 transition count 2120
Discarding 61 places :
Symmetric choice reduction at 3 with 61 rule applications. Total rules 1990 place count 809 transition count 1998
Iterating global reduction 3 with 61 rules applied. Total rules applied 2051 place count 809 transition count 1998
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2111 place count 749 transition count 1878
Iterating global reduction 3 with 60 rules applied. Total rules applied 2171 place count 749 transition count 1878
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2231 place count 689 transition count 1758
Iterating global reduction 3 with 60 rules applied. Total rules applied 2291 place count 689 transition count 1758
Discarding 60 places :
Symmetric choice reduction at 3 with 60 rule applications. Total rules 2351 place count 629 transition count 1638
Iterating global reduction 3 with 60 rules applied. Total rules applied 2411 place count 629 transition count 1638
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 2418 place count 622 transition count 1624
Iterating global reduction 3 with 7 rules applied. Total rules applied 2425 place count 622 transition count 1624
Applied a total of 2425 rules in 1338 ms. Remains 622 /1628 variables (removed 1006) and now considering 1624/5962 (removed 4338) transitions.
[2026-05-25 05:30:29] [INFO ] Flow matrix only has 1088 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-14273654386206853347.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12585458235904292634.kers'
[2026-05-25 05:30:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14273654386206853347.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12585458235904292634.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1088 rows 622 cols 2994 entries
Finished phase 1 with 619 SingleSign rule and 1 generalized
[2026-05-25 05:30:29] [INFO ] Computed 2 invariants in 11 ms
Computed 2 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-12585458235904292634.kers
Total runtime 12 ms.
[2026-05-25 05:30:29] [INFO ] Implicit Places using invariants in 707 ms returned []
[2026-05-25 05:30:29] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
[2026-05-25 05:30:29] [INFO ] Invariant cache hit.
[2026-05-25 05:30:30] [INFO ] State equation strengthened by 270 read => feed constraints.
[2026-05-25 05:30:32] [INFO ] Implicit Places using invariants and state equation in 2695 ms returned []
Implicit Place search using SMT with State Equation took 3432 ms to find 0 implicit places.
Running 1622 sub problems to find dead transitions.
[2026-05-25 05:30:32] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
[2026-05-25 05:30:32] [INFO ] Invariant cache hit.
[2026-05-25 05:30:32] [INFO ] State equation strengthened by 270 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 622/1710 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 1622/1622 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1622 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/622 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/622 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1622 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 622/1710 variables, and 2 constraints, problems are : Problem set: 0 solved, 1622 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/622 constraints, ReadFeed: 0/270 constraints, PredecessorRefiner: 0/1622 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 63062ms problems are : Problem set: 0 solved, 1622 unsolved
Search for dead transitions found 0 dead transitions in 63090ms
Starting structural reductions in LTL mode, iteration 1 : 622/1628 places, 1624/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 67900 ms. Remains : 622/1628 places, 1624/5962 transitions.
Starting structural reductions in LTL mode, iteration 0 : 622/622 places, 1624/1624 transitions.
Applied a total of 0 rules in 15 ms. Remains 622 /622 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2026-05-25 05:31:35] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
[2026-05-25 05:31:35] [INFO ] Invariant cache hit.
[2026-05-25 05:31:36] [INFO ] Implicit Places using invariants in 498 ms returned []
[2026-05-25 05:31:36] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
[2026-05-25 05:31:36] [INFO ] Invariant cache hit.
[2026-05-25 05:31:36] [INFO ] State equation strengthened by 270 read => feed constraints.
[2026-05-25 05:31:38] [INFO ] Implicit Places using invariants and state equation in 2561 ms returned []
Implicit Place search using SMT with State Equation took 3067 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 3083 ms. Remains : 622/622 places, 1624/1624 transitions.
Support contains 4 out of 622 places after structural reductions.
[2026-05-25 05:31:39] [INFO ] Flatten gal took : 114 ms
[2026-05-25 05:31:39] [INFO ] Flatten gal took : 74 ms
[2026-05-25 05:31:39] [INFO ] Input system was already deterministic with 1624 transitions.
RANDOM walk for 40000 steps (8 resets) in 2587 ms. (15 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (8 resets) in 259 ms. (153 steps per ms) remains 1/1 properties
[2026-05-25 05:31:40] [INFO ] Flow matrix only has 1088 transitions (discarded 536 similar events)
[2026-05-25 05:31:40] [INFO ] Invariant cache hit.
[2026-05-25 05:31:40] [INFO ] State equation strengthened by 270 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 553/560 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/567 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 940/1507 variables, 474/487 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1507 variables, 269/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1507 variables, 0/756 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1569 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1569 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 136/1705 variables, 134/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1705 variables, 0/891 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1709 variables, 2/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1709 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1710 variables, 1/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1710 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1710 variables, 0/894 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1710/1710 variables, and 894 constraints, problems are : Problem set: 0 solved, 1 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 553/560 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/560 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/560 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/560 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/567 variables, 1/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 940/1507 variables, 474/488 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1507 variables, 269/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1507 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 62/1569 variables, 1/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1569 variables, 0/758 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 136/1705 variables, 134/892 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/1705 variables, 1/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1705 variables, 0/893 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 4/1709 variables, 2/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1709 variables, 0/895 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 1/1710 variables, 1/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1710 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (OVERLAPS) 0/1710 variables, 0/896 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1710/1710 variables, and 896 constraints, problems are : Problem set: 0 solved, 1 unsolved in 864 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 622/622 constraints, ReadFeed: 270/270 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1534ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 24 ms.
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 622/622 places, 1624/1624 transitions.
Graph (complete) has 2712 edges and 622 vertex of which 430 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.6 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 430 transition count 1240
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 386 place count 429 transition count 1238
Iterating global reduction 1 with 1 rules applied. Total rules applied 387 place count 429 transition count 1238
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 388 place count 428 transition count 1236
Iterating global reduction 1 with 1 rules applied. Total rules applied 389 place count 428 transition count 1236
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 390 place count 427 transition count 1234
Iterating global reduction 1 with 1 rules applied. Total rules applied 391 place count 427 transition count 1234
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 392 place count 426 transition count 1232
Iterating global reduction 1 with 1 rules applied. Total rules applied 393 place count 426 transition count 1232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 394 place count 425 transition count 1230
Iterating global reduction 1 with 1 rules applied. Total rules applied 395 place count 425 transition count 1230
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 1 with 4 rules applied. Total rules applied 399 place count 425 transition count 1226
Applied a total of 399 rules in 256 ms. Remains 425 /622 variables (removed 197) and now considering 1226/1624 (removed 398) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 256 ms. Remains : 425/622 places, 1226/1624 transitions.
RANDOM walk for 40001 steps (8 resets) in 260 ms. (153 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 69 ms. (571 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 559618 steps, run timeout after 3001 ms. (steps per millisecond=186 ) properties seen :0 out of 1
Probabilistic random walk after 559618 steps, saw 343149 distinct states, run finished after 3005 ms. (steps per millisecond=186 ) properties seen :0
[2026-05-25 05:31:45] [INFO ] Flow matrix only has 695 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-11058350993501775388.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6077155871664640143.kers'
[2026-05-25 05:31:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11058350993501775388.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6077155871664640143.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 695 rows 425 cols 2070 entries
Finished phase 1 with 422 SingleSign rule and 0 generalized
[2026-05-25 05:31:45] [INFO ] Computed 3 invariants in 2 ms
Computed 3 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6077155871664640143.kers
Total runtime 4 ms.
[2026-05-25 05:31:45] [INFO ] State equation strengthened by 77 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) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 357/364 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 7/371 variables, 2/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/371 variables, 3/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 611/982 variables, 340/356 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/982 variables, 76/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (OVERLAPS) 62/1044 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1044 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 71/1115 variables, 69/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1115 variables, 0/502 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 4/1119 variables, 2/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1119 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (OVERLAPS) 1/1120 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (OVERLAPS) 0/1120 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1120/1120 variables, and 505 constraints, problems are : Problem set: 0 solved, 1 unsolved in 362 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 5/7 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/7 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 357/364 variables, 8/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/364 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/364 variables, 1/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/364 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 7/371 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/371 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/371 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 611/982 variables, 340/357 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/982 variables, 76/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/982 variables, 1/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/982 variables, 0/434 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 62/1044 variables, 1/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1044 variables, 0/435 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 71/1115 variables, 69/504 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1115 variables, 1/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/1115 variables, 0/505 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 19 (OVERLAPS) 4/1119 variables, 2/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/1119 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 21 (OVERLAPS) 1/1120 variables, 1/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 22 (INCLUDED_ONLY) 0/1120 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 23 (OVERLAPS) 0/1120 variables, 0/508 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 508 constraints, problems are : Problem set: 0 solved, 1 unsolved in 643 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 1035ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 425 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1226/1226 transitions.
Applied a total of 0 rules in 56 ms. Remains 425 /425 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 57 ms. Remains : 425/425 places, 1226/1226 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 425/425 places, 1226/1226 transitions.
Applied a total of 0 rules in 74 ms. Remains 425 /425 variables (removed 0) and now considering 1226/1226 (removed 0) transitions.
[2026-05-25 05:31:46] [INFO ] Flow matrix only has 695 transitions (discarded 531 similar events)
[2026-05-25 05:31:46] [INFO ] Invariant cache hit.
[2026-05-25 05:31:46] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-25 05:31:46] [INFO ] Flow matrix only has 695 transitions (discarded 531 similar events)
[2026-05-25 05:31:46] [INFO ] Invariant cache hit.
[2026-05-25 05:31:46] [INFO ] State equation strengthened by 77 read => feed constraints.
[2026-05-25 05:31:48] [INFO ] Implicit Places using invariants and state equation in 1506 ms returned []
Implicit Place search using SMT with State Equation took 1830 ms to find 0 implicit places.
[2026-05-25 05:31:48] [INFO ] Redundant transitions in 82 ms returned []
Running 1224 sub problems to find dead transitions.
[2026-05-25 05:31:48] [INFO ] Flow matrix only has 695 transitions (discarded 531 similar events)
[2026-05-25 05:31:48] [INFO ] Invariant cache hit.
[2026-05-25 05:31:48] [INFO ] State equation strengthened by 77 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 425/1120 variables, and 4 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 0/425 constraints, ReadFeed: 0/77 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1224 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/425 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/425 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/425 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 3 (OVERLAPS) 695/1120 variables, 425/429 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1120 variables, 77/506 constraints. Problems are: Problem set: 0 solved, 1224 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1120/1120 variables, and 1730 constraints, problems are : Problem set: 0 solved, 1224 unsolved in 30840 ms.
Refiners :[Positive P Invariants (semi-flows): 3/3 constraints, State Equation: 425/425 constraints, ReadFeed: 77/77 constraints, PredecessorRefiner: 1224/1224 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 61996ms problems are : Problem set: 0 solved, 1224 unsolved
Search for dead transitions found 0 dead transitions in 62001ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64004 ms. Remains : 425/425 places, 1226/1226 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 425 transition count 685
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 415 transition count 685
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 551 place count 415 transition count 611
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 699 place count 341 transition count 611
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 953 place count 214 transition count 484
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1017 place count 150 transition count 356
Iterating global reduction 2 with 64 rules applied. Total rules applied 1081 place count 150 transition count 356
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1082 place count 150 transition count 355
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1145 place count 87 transition count 229
Iterating global reduction 3 with 63 rules applied. Total rules applied 1208 place count 87 transition count 229
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1271 place count 24 transition count 103
Iterating global reduction 3 with 63 rules applied. Total rules applied 1334 place count 24 transition count 103
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1397 place count 24 transition count 40
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1397 place count 24 transition count 39
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 1399 place count 23 transition count 39
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 22 transition count 38
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
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 1403 place count 21 transition count 38
Applied a total of 1403 rules in 69 ms. Remains 21 /425 variables (removed 404) and now considering 38/1226 (removed 1188) 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-3062040840396562592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4878150555121560137.kers'
[2026-05-25 05:32:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3062040840396562592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4878150555121560137.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 38 rows 21 cols 124 entries
Finished phase 1 with 18 SingleSign rule and 0 generalized
[2026-05-25 05:32:50] [INFO ] Computed 3 invariants in 0 ms
Computed 3 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-4878150555121560137.kers
Total runtime 4 ms.
[2026-05-25 05:32:50] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 05:32:50] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-25 05:32:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2026-05-25 05:32:50] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2026-05-25 05:32:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-25 05:32:50] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-25 05:32:50] [INFO ] After 7ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-25 05:32:50] [INFO ] After 37ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 194 ms.
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' '!(G(F(p0)))'
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1624/1624 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 620 transition count 1620
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 620 transition count 1620
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 618 transition count 1616
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 618 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 616 transition count 1610
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 616 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 615 transition count 1606
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 615 transition count 1606
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 614 transition count 1604
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 614 transition count 1604
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 613 transition count 1602
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 613 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 612 transition count 1600
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 612 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 611 transition count 1598
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 611 transition count 1598
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 610 transition count 1596
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 610 transition count 1596
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 610 transition count 1594
Applied a total of 26 rules in 470 ms. Remains 610 /622 variables (removed 12) and now considering 1594/1624 (removed 30) transitions.
[2026-05-25 05:32:50] [INFO ] Flow matrix only has 1066 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-9060258227593248358.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7825979945177929083.kers'
[2026-05-25 05:32:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9060258227593248358.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7825979945177929083.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1066 rows 610 cols 2934 entries
Finished phase 1 with 607 SingleSign rule and 1 generalized
[2026-05-25 05:32:51] [INFO ] Computed 2 invariants in 9 ms
Computed 2 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7825979945177929083.kers
Total runtime 10 ms.
[2026-05-25 05:32:51] [INFO ] Implicit Places using invariants in 415 ms returned []
[2026-05-25 05:32:51] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2026-05-25 05:32:51] [INFO ] Invariant cache hit.
[2026-05-25 05:32:51] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 05:32:53] [INFO ] Implicit Places using invariants and state equation in 2443 ms returned []
Implicit Place search using SMT with State Equation took 2861 ms to find 0 implicit places.
[2026-05-25 05:32:53] [INFO ] Redundant transitions in 41 ms returned []
Running 1592 sub problems to find dead transitions.
[2026-05-25 05:32:53] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2026-05-25 05:32:53] [INFO ] Invariant cache hit.
[2026-05-25 05:32:53] [INFO ] State equation strengthened by 265 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 610/1676 variables, and 2 constraints, problems are : Problem set: 0 solved, 1592 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/610 constraints, ReadFeed: 0/265 constraints, PredecessorRefiner: 1592/1592 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1592 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/610 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/610 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/610 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1592 unsolved
SMT process timed out in 62036ms, After SMT, problems are : Problem set: 0 solved, 1592 unsolved
Search for dead transitions found 0 dead transitions in 62040ms
Starting structural reductions in SI_LTL mode, iteration 1 : 610/622 places, 1594/1624 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65421 ms. Remains : 610/622 places, 1594/1624 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 183 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-07
Product exploration explored 100000 steps with 0 reset in 575 ms.
Product exploration explored 100000 steps with 0 reset in 479 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 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 33362 steps (7 resets) in 186 ms. (178 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 280 ms.
Stuttering acceptance computed with spot in 58 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 610 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 610/610 places, 1594/1594 transitions.
Applied a total of 0 rules in 85 ms. Remains 610 /610 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2026-05-25 05:33:57] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2026-05-25 05:33:57] [INFO ] Invariant cache hit.
[2026-05-25 05:33:58] [INFO ] Implicit Places using invariants in 524 ms returned []
[2026-05-25 05:33:58] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2026-05-25 05:33:58] [INFO ] Invariant cache hit.
[2026-05-25 05:33:58] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 05:34:00] [INFO ] Implicit Places using invariants and state equation in 2376 ms returned []
Implicit Place search using SMT with State Equation took 2904 ms to find 0 implicit places.
[2026-05-25 05:34:00] [INFO ] Redundant transitions in 31 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3027 ms. Remains : 610/610 places, 1594/1594 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 41 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 36695 steps (8 resets) in 150 ms. (243 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 229 ms.
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 68 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 423 ms.
Product exploration explored 100000 steps with 0 reset in 457 ms.
Built C files in :
/tmp/ltsmin247985995438721254
[2026-05-25 05:34:01] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2026-05-25 05:34:01] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin247985995438721254
Running compilation step : cd /tmp/ltsmin247985995438721254;'/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 3004 ms.
Running link step : cd /tmp/ltsmin247985995438721254;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 54 ms.
Running LTSmin : cd /tmp/ltsmin247985995438721254;'/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/stateBased8748997123769688049.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 610 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 610/610 places, 1594/1594 transitions.
Applied a total of 0 rules in 76 ms. Remains 610 /610 variables (removed 0) and now considering 1594/1594 (removed 0) transitions.
[2026-05-25 05:34:16] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2026-05-25 05:34:16] [INFO ] Invariant cache hit.
[2026-05-25 05:34:17] [INFO ] Implicit Places using invariants in 409 ms returned []
[2026-05-25 05:34:17] [INFO ] Flow matrix only has 1066 transitions (discarded 528 similar events)
[2026-05-25 05:34:17] [INFO ] Invariant cache hit.
[2026-05-25 05:34:17] [INFO ] State equation strengthened by 265 read => feed constraints.
[2026-05-25 05:34:19] [INFO ] Implicit Places using invariants and state equation in 2336 ms returned []
Implicit Place search using SMT with State Equation took 2756 ms to find 0 implicit places.
[2026-05-25 05:34:19] [INFO ] Redundant transitions in 29 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2865 ms. Remains : 610/610 places, 1594/1594 transitions.
Built C files in :
/tmp/ltsmin12564137137113421129
[2026-05-25 05:34:19] [INFO ] Too many transitions (1594) to apply POR reductions. Disabling POR matrices.
[2026-05-25 05:34:19] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12564137137113421129
Running compilation step : cd /tmp/ltsmin12564137137113421129;'/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 2881 ms.
Running link step : cd /tmp/ltsmin12564137137113421129;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin12564137137113421129;'/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/stateBased15616092084458310628.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 05:34:34] [INFO ] Flatten gal took : 52 ms
[2026-05-25 05:34:35] [INFO ] Flatten gal took : 51 ms
[2026-05-25 05:34:35] [INFO ] Time to serialize gal into /tmp/LTL11112065116807134991.gal : 13 ms
[2026-05-25 05:34:35] [INFO ] Time to serialize properties into /tmp/LTL6388549957260562998.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/LTL11112065116807134991.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2619158580634644966.hoa' '-atoms' '/tmp/LTL6388549957260562998.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL6388549957260562998.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2619158580634644966.hoa
Detected timeout of ITS tools.
[2026-05-25 05:34:50] [INFO ] Flatten gal took : 44 ms
[2026-05-25 05:34:50] [INFO ] Flatten gal took : 38 ms
[2026-05-25 05:34:50] [INFO ] Time to serialize gal into /tmp/LTL14494185411588506244.gal : 9 ms
[2026-05-25 05:34:50] [INFO ] Time to serialize properties into /tmp/LTL6043986372313752177.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14494185411588506244.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6043986372313752177.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 : !((G(F("(l452<=l1371)"))))
Formula 0 simplified : FG!"(l452<=l1371)"
Detected timeout of ITS tools.
[2026-05-25 05:35:05] [INFO ] Flatten gal took : 31 ms
[2026-05-25 05:35:05] [INFO ] Applying decomposition
[2026-05-25 05:35:05] [INFO ] Flatten gal took : 30 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/graph11988503211041627020.txt' '-o' '/tmp/graph11988503211041627020.bin' '-w' '/tmp/graph11988503211041627020.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11988503211041627020.bin' '-l' '-1' '-v' '-w' '/tmp/graph11988503211041627020.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:35:05] [INFO ] Decomposing Gal with order
[2026-05-25 05:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:35:05] [INFO ] Removed a total of 541 redundant transitions.
[2026-05-25 05:35:05] [INFO ] Flatten gal took : 333 ms
[2026-05-25 05:35:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 258 labels/synchronizations in 24 ms.
[2026-05-25 05:35:06] [INFO ] Time to serialize gal into /tmp/LTL18253810536678114217.gal : 11 ms
[2026-05-25 05:35:06] [INFO ] Time to serialize properties into /tmp/LTL12657818523857191675.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/LTL18253810536678114217.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12657818523857191675.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 : !((G(F("(gu1.l452<=gu1.l1371)"))))
Formula 0 simplified : FG!"(gu1.l452<=gu1.l1371)"
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-c004-LTLCardinality-07 finished in 150793 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))'
Support contains 2 out of 622 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 622/622 places, 1624/1624 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 621 transition count 1622
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 621 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 620 transition count 1620
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 620 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 619 transition count 1618
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 619 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 618 transition count 1616
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 618 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 617 transition count 1614
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 617 transition count 1614
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 14 place count 617 transition count 1610
Applied a total of 14 rules in 238 ms. Remains 617 /622 variables (removed 5) and now considering 1610/1624 (removed 14) transitions.
[2026-05-25 05:35:21] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2473708113663246471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-248645670156803209.kers'
[2026-05-25 05:35:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2473708113663246471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-248645670156803209.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1077 rows 617 cols 2962 entries
Finished phase 1 with 614 SingleSign rule and 1 generalized
[2026-05-25 05:35:21] [INFO ] Computed 2 invariants in 3 ms
Computed 2 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-248645670156803209.kers
Total runtime 7 ms.
[2026-05-25 05:35:22] [INFO ] Implicit Places using invariants in 592 ms returned []
[2026-05-25 05:35:22] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2026-05-25 05:35:22] [INFO ] Invariant cache hit.
[2026-05-25 05:35:22] [INFO ] State equation strengthened by 267 read => feed constraints.
[2026-05-25 05:35:24] [INFO ] Implicit Places using invariants and state equation in 2236 ms returned []
Implicit Place search using SMT with State Equation took 2830 ms to find 0 implicit places.
[2026-05-25 05:35:24] [INFO ] Redundant transitions in 32 ms returned []
Running 1608 sub problems to find dead transitions.
[2026-05-25 05:35:24] [INFO ] Flow matrix only has 1077 transitions (discarded 533 similar events)
[2026-05-25 05:35:24] [INFO ] Invariant cache hit.
[2026-05-25 05:35:24] [INFO ] State equation strengthened by 267 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 617/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 1608/1608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1608 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/617 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/617 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 1608 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 617/1694 variables, and 2 constraints, problems are : Problem set: 0 solved, 1608 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 0/617 constraints, ReadFeed: 0/267 constraints, PredecessorRefiner: 0/1608 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 62043ms problems are : Problem set: 0 solved, 1608 unsolved
Search for dead transitions found 0 dead transitions in 62047ms
Starting structural reductions in SI_LTL mode, iteration 1 : 617/622 places, 1610/1624 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 65158 ms. Remains : 617/622 places, 1610/1624 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))'
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLCardinality-11
Product exploration explored 100000 steps with 0 reset in 463 ms.
Stack based approach found an accepted trace after 65 steps with 0 reset with depth 66 and stack size 66 in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLCardinality-11 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLCardinality-11 finished in 65706 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Spot run failed in 66 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 05:36:27] [INFO ] Flatten gal took : 63 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin7077633299167904023
[2026-05-25 05:36:27] [INFO ] Too many transitions (1624) to apply POR reductions. Disabling POR matrices.
[2026-05-25 05:36:27] [INFO ] Applying decomposition
[2026-05-25 05:36:27] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7077633299167904023
Running compilation step : cd /tmp/ltsmin7077633299167904023;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-25 05:36:27] [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/graph11886096154574574916.txt' '-o' '/tmp/graph11886096154574574916.bin' '-w' '/tmp/graph11886096154574574916.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11886096154574574916.bin' '-l' '-1' '-v' '-w' '/tmp/graph11886096154574574916.weights' '-q' '0' '-e' '0.001'
[2026-05-25 05:36:27] [INFO ] Decomposing Gal with order
[2026-05-25 05:36:27] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 05:36:27] [INFO ] Removed a total of 568 redundant transitions.
[2026-05-25 05:36:27] [INFO ] Flatten gal took : 126 ms
[2026-05-25 05:36:27] [INFO ] Fuse similar labels procedure discarded/fused a total of 270 labels/synchronizations in 11 ms.
[2026-05-25 05:36:27] [INFO ] Time to serialize gal into /tmp/LTLCardinality12532485564501159656.gal : 16 ms
[2026-05-25 05:36:27] [INFO ] Time to serialize properties into /tmp/LTLCardinality15428172866561936358.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/LTLCardinality12532485564501159656.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15428172866561936358.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...299
Read 1 LTL properties
Checking formula 0 : !((G(F("(gu1.l452<=gu1.l1371)"))))
Formula 0 simplified : FG!"(gu1.l452<=gu1.l1371)"
Compilation finished in 2870 ms.
Running link step : cd /tmp/ltsmin7077633299167904023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin7077633299167904023;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 05:58:30] [INFO ] Flatten gal took : 421 ms
[2026-05-25 05:58:30] [INFO ] Time to serialize gal into /tmp/LTLCardinality6330913693338370134.gal : 71 ms
[2026-05-25 05:58:30] [INFO ] Time to serialize properties into /tmp/LTLCardinality15091714183647738134.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality6330913693338370134.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality15091714183647738134.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...298
Read 1 LTL properties
Checking formula 0 : !((G(F("(l452<=l1371)"))))
Formula 0 simplified : FG!"(l452<=l1371)"
Detected timeout of ITS tools.
[2026-05-25 06:20:46] [INFO ] Flatten gal took : 359 ms
[2026-05-25 06:20:47] [INFO ] Input system was already deterministic with 1624 transitions.
[2026-05-25 06:20:48] [INFO ] Transformed 622 places.
[2026-05-25 06:20:48] [INFO ] Transformed 1624 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 06:20:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality6412536604936140632.gal : 19 ms
[2026-05-25 06:20:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality4747645034913079114.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/LTLCardinality6412536604936140632.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality4747645034913079114.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(l452<=l1371)"))))
Formula 0 simplified : FG!"(l452<=l1371)"

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

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