About the Execution of ITS-Tools for FunctionPointer-PT-b008
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 16209.224 | 3600000.00 | 5823165.00 | 458317.00 | ?FFFFFFFFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).

Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r146-tall-177961073900076.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-b008, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r146-tall-177961073900076
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 832K
-rw-r--r-- 1 mcc users 7.3K Mar 7 07:29 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 7 07:29 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 7 07:29 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K Mar 7 07:29 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 10:23 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 10:23 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 10:23 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 10:23 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 7 07:29 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 97K Mar 7 07:29 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.7K Mar 7 07:29 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 85K Mar 7 07:29 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 10:23 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 10:23 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 391K 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-b008-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-b008-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779671513401
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-b008
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-25 01:11:54] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-25 01:11:54] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-25 01:11:54] [INFO ] Load time of PNML (sax parser for PT used): 109 ms
[2026-05-25 01:11:54] [INFO ] Transformed 306 places.
[2026-05-25 01:11:54] [INFO ] Transformed 840 transitions.
[2026-05-25 01:11:54] [INFO ] Parsed PT model containing 306 places and 840 transitions and 3392 arcs in 208 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 84 places in 5 ms
Reduce places removed 84 places and 192 transitions.
FORMULA FunctionPointer-PT-b008-LTLFireability-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-b008-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 222 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 222/222 places, 648/648 transitions.
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 10 place count 212 transition count 648
Discarding 23 places :
Symmetric choice reduction at 1 with 23 rule applications. Total rules 33 place count 189 transition count 568
Iterating global reduction 1 with 23 rules applied. Total rules applied 56 place count 189 transition count 568
Ensure Unique test removed 80 transitions
Reduce isomorphic transitions removed 80 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 136 place count 189 transition count 488
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 145 place count 180 transition count 470
Iterating global reduction 2 with 9 rules applied. Total rules applied 154 place count 180 transition count 470
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 161 place count 173 transition count 456
Iterating global reduction 2 with 7 rules applied. Total rules applied 168 place count 173 transition count 456
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 173 place count 168 transition count 436
Iterating global reduction 2 with 5 rules applied. Total rules applied 178 place count 168 transition count 436
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 182 place count 164 transition count 428
Iterating global reduction 2 with 4 rules applied. Total rules applied 186 place count 164 transition count 428
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 187 place count 163 transition count 424
Iterating global reduction 2 with 1 rules applied. Total rules applied 188 place count 163 transition count 424
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 189 place count 162 transition count 420
Iterating global reduction 2 with 1 rules applied. Total rules applied 190 place count 162 transition count 420
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 191 place count 161 transition count 418
Iterating global reduction 2 with 1 rules applied. Total rules applied 192 place count 161 transition count 418
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 193 place count 160 transition count 416
Iterating global reduction 2 with 1 rules applied. Total rules applied 194 place count 160 transition count 416
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 195 place count 159 transition count 414
Iterating global reduction 2 with 1 rules applied. Total rules applied 196 place count 159 transition count 414
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 197 place count 158 transition count 412
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 158 transition count 412
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 199 place count 157 transition count 410
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 157 transition count 410
Applied a total of 200 rules in 115 ms. Remains 157 /222 variables (removed 65) and now considering 410/648 (removed 238) transitions.
[2026-05-25 01:11:55] [INFO ] Flow matrix only has 272 transitions (discarded 138 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6418760901614785605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17301767571700569522.kers'
[2026-05-25 01:11:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6418760901614785605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17301767571700569522.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 272 rows 157 cols 734 entries
Finished phase 1 with 154 SingleSign rule and 1 generalized
[2026-05-25 01:11:55] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17301767571700569522.kers
Total runtime 2 ms.
[2026-05-25 01:11:55] [INFO ] Implicit Places using invariants in 290 ms returned []
[2026-05-25 01:11:55] [INFO ] Flow matrix only has 272 transitions (discarded 138 similar events)
[2026-05-25 01:11:55] [INFO ] Invariant cache hit.
[2026-05-25 01:11:55] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 01:11:55] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
Running 408 sub problems to find dead transitions.
[2026-05-25 01:11:55] [INFO ] Flow matrix only has 272 transitions (discarded 138 similar events)
[2026-05-25 01:11:55] [INFO ] Invariant cache hit.
[2026-05-25 01:11:55] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 272/429 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 55/214 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 408 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/429 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 408 unsolved
No progress, stopping.
After SMT solving in domain Real declared 429/429 variables, and 214 constraints, problems are : Problem set: 0 solved, 408 unsolved in 15364 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 408 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 3 (OVERLAPS) 272/429 variables, 157/159 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/429 variables, 55/214 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/429 variables, 408/622 constraints. Problems are: Problem set: 0 solved, 408 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/429 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 408 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 429/429 variables, and 624 constraints, problems are : Problem set: 0 solved, 408 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 157/157 constraints, ReadFeed: 55/55 constraints, PredecessorRefiner: 408/408 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 45744ms problems are : Problem set: 0 solved, 408 unsolved
Search for dead transitions found 0 dead transitions in 45759ms
Starting structural reductions in LTL mode, iteration 1 : 157/222 places, 410/648 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 46526 ms. Remains : 157/222 places, 410/648 transitions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Applied a total of 0 rules in 3 ms. Remains 157 /157 variables (removed 0) and now considering 410/410 (removed 0) transitions.
[2026-05-25 01:12:41] [INFO ] Flow matrix only has 272 transitions (discarded 138 similar events)
[2026-05-25 01:12:41] [INFO ] Invariant cache hit.
[2026-05-25 01:12:41] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-25 01:12:41] [INFO ] Flow matrix only has 272 transitions (discarded 138 similar events)
[2026-05-25 01:12:41] [INFO ] Invariant cache hit.
[2026-05-25 01:12:41] [INFO ] State equation strengthened by 55 read => feed constraints.
[2026-05-25 01:12:41] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 445 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 448 ms. Remains : 157/157 places, 410/410 transitions.
Support contains 23 out of 157 places after structural reductions.
[2026-05-25 01:12:42] [INFO ] Flatten gal took : 48 ms
[2026-05-25 01:12:42] [INFO ] Flatten gal took : 26 ms
[2026-05-25 01:12:42] [INFO ] Input system was already deterministic with 410 transitions.
Support contains 21 out of 157 places (down from 23) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 17 to 16
RANDOM walk for 40006 steps (49 resets) in 1631 ms. (24 steps per ms) remains 1/16 properties
BEST_FIRST walk for 40003 steps (8 resets) in 85 ms. (465 steps per ms) remains 1/1 properties
[2026-05-25 01:12:42] [INFO ] Flow matrix only has 272 transitions (discarded 138 similar events)
[2026-05-25 01:12:42] [INFO ] Invariant cache hit.
[2026-05-25 01:12:42] [INFO ] State equation strengthened by 55 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 47/51 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/51 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 161/212 variables, 51/52 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/212 variables, 38/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/212 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp5 is UNSAT
After SMT solving in domain Real declared 347/429 variables, and 155 constraints, problems are : Problem set: 1 solved, 0 unsolved in 73 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 0/1 constraints, State Equation: 116/157 constraints, ReadFeed: 38/55 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 84ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
FORMULA FunctionPointer-PT-b008-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 24 stabilizing places and 64 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' '!(X(X(X(F((p0||G(p1)))))))'
Support contains 3 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 149 transition count 370
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 149 transition count 370
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 23 place count 142 transition count 356
Iterating global reduction 0 with 7 rules applied. Total rules applied 30 place count 142 transition count 356
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 36 place count 136 transition count 332
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 136 transition count 332
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 47 place count 131 transition count 312
Iterating global reduction 0 with 5 rules applied. Total rules applied 52 place count 131 transition count 312
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 57 place count 126 transition count 302
Iterating global reduction 0 with 5 rules applied. Total rules applied 62 place count 126 transition count 302
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 67 place count 121 transition count 292
Iterating global reduction 0 with 5 rules applied. Total rules applied 72 place count 121 transition count 292
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 77 place count 116 transition count 282
Iterating global reduction 0 with 5 rules applied. Total rules applied 82 place count 116 transition count 282
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 87 place count 111 transition count 272
Iterating global reduction 0 with 5 rules applied. Total rules applied 92 place count 111 transition count 272
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 97 place count 106 transition count 262
Iterating global reduction 0 with 5 rules applied. Total rules applied 102 place count 106 transition count 262
Applied a total of 102 rules in 27 ms. Remains 106 /157 variables (removed 51) and now considering 262/410 (removed 148) transitions.
[2026-05-25 01:12:43] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11875969923210106058.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1648197524751312503.kers'
[2026-05-25 01:12:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11875969923210106058.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1648197524751312503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 176 rows 106 cols 484 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 01:12:43] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1648197524751312503.kers
Total runtime 1 ms.
[2026-05-25 01:12:43] [INFO ] Implicit Places using invariants in 168 ms returned []
[2026-05-25 01:12:43] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 01:12:43] [INFO ] Invariant cache hit.
[2026-05-25 01:12:43] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:12:43] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
Running 260 sub problems to find dead transitions.
[2026-05-25 01:12:43] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 01:12:43] [INFO ] Invariant cache hit.
[2026-05-25 01:12:43] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 260 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/282 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Real declared 282/282 variables, and 148 constraints, problems are : Problem set: 0 solved, 260 unsolved in 7019 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 260 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 3 (OVERLAPS) 176/282 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 260/408 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 4/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
At refinement iteration 8 (OVERLAPS) 0/282 variables, 0/412 constraints. Problems are: Problem set: 0 solved, 260 unsolved
No progress, stopping.
After SMT solving in domain Int declared 282/282 variables, and 412 constraints, problems are : Problem set: 0 solved, 260 unsolved in 24998 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 260/260 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 32126ms problems are : Problem set: 0 solved, 260 unsolved
Search for dead transitions found 0 dead transitions in 32127ms
Starting structural reductions in LTL mode, iteration 1 : 106/157 places, 262/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 32657 ms. Remains : 106/157 places, 262/410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((G(p0)||p1))))))'
Stuttering acceptance computed with spot in 256 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-00
Product exploration explored 100000 steps with 302 reset in 361 ms.
Product exploration explored 100000 steps with 292 reset in 288 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 1 factoid took 45 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 23759 steps (26 resets) in 140 ms. (168 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 110 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 365 ms.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 262/262 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-05-25 01:13:17] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 01:13:17] [INFO ] Invariant cache hit.
[2026-05-25 01:13:17] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 01:13:17] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 01:13:17] [INFO ] Invariant cache hit.
[2026-05-25 01:13:17] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:13:17] [INFO ] Implicit Places using invariants and state equation in 260 ms returned []
Implicit Place search using SMT with State Equation took 335 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 339 ms. Remains : 106/106 places, 262/262 transitions.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Knowledge based reduction with 1 factoid took 52 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
RANDOM walk for 34814 steps (35 resets) in 87 ms. (395 steps per ms) remains 0/4 properties
Knowledge based reduction with 1 factoid took 77 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 307 ms.
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 156 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 363 reset in 243 ms.
Product exploration explored 100000 steps with 281 reset in 242 ms.
Spot run failed in 71 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9467639920931329230
[2026-05-25 01:13:18] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9467639920931329230
Running compilation step : cd /tmp/ltsmin9467639920931329230;'/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 474 ms.
Running link step : cd /tmp/ltsmin9467639920931329230;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin9467639920931329230;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased3805384920343917195.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 106/106 places, 262/262 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2026-05-25 01:13:33] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 01:13:33] [INFO ] Invariant cache hit.
[2026-05-25 01:13:33] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-25 01:13:33] [INFO ] Flow matrix only has 176 transitions (discarded 86 similar events)
[2026-05-25 01:13:33] [INFO ] Invariant cache hit.
[2026-05-25 01:13:33] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:13:34] [INFO ] Implicit Places using invariants and state equation in 264 ms returned []
Implicit Place search using SMT with State Equation took 325 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 329 ms. Remains : 106/106 places, 262/262 transitions.
Built C files in :
/tmp/ltsmin10261309293437129594
[2026-05-25 01:13:34] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10261309293437129594
Running compilation step : cd /tmp/ltsmin10261309293437129594;'/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 372 ms.
Running link step : cd /tmp/ltsmin10261309293437129594;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin10261309293437129594;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased13286161042735071063.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-25 01:13:49] [INFO ] Flatten gal took : 17 ms
[2026-05-25 01:13:49] [INFO ] Flatten gal took : 12 ms
[2026-05-25 01:13:49] [INFO ] Time to serialize gal into /tmp/LTL280185948635203297.gal : 14 ms
[2026-05-25 01:13:49] [INFO ] Time to serialize properties into /tmp/LTL17467176082721729383.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL280185948635203297.gal' '-t' 'CGAL' '-hoa' '/tmp/aut5320495644124730252.hoa' '-atoms' '/tmp/LTL17467176082721729383.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL17467176082721729383.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut5320495644124730252.hoa
Detected timeout of ITS tools.
[2026-05-25 01:14:04] [INFO ] Flatten gal took : 14 ms
[2026-05-25 01:14:04] [INFO ] Flatten gal took : 11 ms
[2026-05-25 01:14:04] [INFO ] Time to serialize gal into /tmp/LTL6782017893742897202.gal : 3 ms
[2026-05-25 01:14:04] [INFO ] Time to serialize properties into /tmp/LTL18121721844031080461.ltl : 6 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/LTL6782017893742897202.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18121721844031080461.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 : !((X(X(X(F((G("((s0<1)||(l199<1))"))||("((s0>=1)&&(l158>=1))")))))))
Formula 0 simplified : XXXG(!"((s0>=1)&&(l158>=1))" & F!"((s0<1)||(l199<1))")
Detected timeout of ITS tools.
[2026-05-25 01:14:19] [INFO ] Flatten gal took : 15 ms
[2026-05-25 01:14:19] [INFO ] Applying decomposition
[2026-05-25 01:14:19] [INFO ] Flatten gal took : 10 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/graph11521157865378133097.txt' '-o' '/tmp/graph11521157865378133097.bin' '-w' '/tmp/graph11521157865378133097.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph11521157865378133097.bin' '-l' '-1' '-v' '-w' '/tmp/graph11521157865378133097.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:14:19] [INFO ] Decomposing Gal with order
[2026-05-25 01:14:19] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:14:19] [INFO ] Removed a total of 436 redundant transitions.
[2026-05-25 01:14:19] [INFO ] Flatten gal took : 70 ms
[2026-05-25 01:14:19] [INFO ] Fuse similar labels procedure discarded/fused a total of 145 labels/synchronizations in 11 ms.
[2026-05-25 01:14:19] [INFO ] Time to serialize gal into /tmp/LTL9235079586238411991.gal : 4 ms
[2026-05-25 01:14:19] [INFO ] Time to serialize properties into /tmp/LTL10879157923529347454.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/LTL9235079586238411991.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10879157923529347454.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F((G("((i1.u1.s0<1)||(i9.u25.l199<1))"))||("((i1.u1.s0>=1)&&(i10.u24.l158>=1))")))))))
Formula 0 simplified : XXXG(!"((i1.u1.s0>=1)&&(i10.u24.l158>=1))" & F!"((i1.u1.s0<1)||(i9.u25.l199<1))")
Detected timeout of ITS tools.
Treatment of property FunctionPointer-PT-b008-LTLFireability-00 finished in 111601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (F(p2)&&p1)))))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 148 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 148 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 148 transition count 366
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 139 transition count 348
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 139 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 139 transition count 344
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 133 transition count 320
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 133 transition count 320
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 59 place count 128 transition count 300
Iterating global reduction 2 with 5 rules applied. Total rules applied 64 place count 128 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 69 place count 123 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 74 place count 123 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 79 place count 118 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 84 place count 118 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 89 place count 113 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 94 place count 113 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 99 place count 108 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 104 place count 108 transition count 260
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 109 place count 103 transition count 250
Iterating global reduction 2 with 5 rules applied. Total rules applied 114 place count 103 transition count 250
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 118 place count 103 transition count 246
Applied a total of 118 rules in 59 ms. Remains 103 /157 variables (removed 54) and now considering 246/410 (removed 164) transitions.
[2026-05-25 01:14:34] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10691196708244634381.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8370735646763601203.kers'
[2026-05-25 01:14:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10691196708244634381.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8370735646763601203.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 168 rows 103 cols 468 entries
Finished phase 1 with 100 SingleSign rule and 1 generalized
[2026-05-25 01:14:34] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8370735646763601203.kers
Total runtime 0 ms.
[2026-05-25 01:14:34] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 01:14:34] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 01:14:34] [INFO ] Invariant cache hit.
[2026-05-25 01:14:34] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:14:35] [INFO ] Implicit Places using invariants and state equation in 203 ms returned []
Implicit Place search using SMT with State Equation took 281 ms to find 0 implicit places.
[2026-05-25 01:14:35] [INFO ] Redundant transitions in 12 ms returned []
Running 244 sub problems to find dead transitions.
[2026-05-25 01:14:35] [INFO ] Flow matrix only has 168 transitions (discarded 78 similar events)
[2026-05-25 01:14:35] [INFO ] Invariant cache hit.
[2026-05-25 01:14:35] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/271 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/271 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Real declared 271/271 variables, and 145 constraints, problems are : Problem set: 0 solved, 244 unsolved in 6135 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 244 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/103 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/103 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 3 (OVERLAPS) 168/271 variables, 103/105 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/271 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/271 variables, 244/389 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/271 variables, 4/393 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/271 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 244 unsolved
At refinement iteration 8 (OVERLAPS) 0/271 variables, 0/393 constraints. Problems are: Problem set: 0 solved, 244 unsolved
No progress, stopping.
After SMT solving in domain Int declared 271/271 variables, and 393 constraints, problems are : Problem set: 0 solved, 244 unsolved in 24374 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 103/103 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 244/244 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 30579ms problems are : Problem set: 0 solved, 244 unsolved
Search for dead transitions found 0 dead transitions in 30579ms
Starting structural reductions in SI_LTL mode, iteration 1 : 103/157 places, 246/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 30938 ms. Remains : 103/157 places, 246/410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((G(p0) U (F(p2)&&p1)))))'
Stuttering acceptance computed with spot in 139 ms :[(OR (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-07
Stuttering criterion allowed to conclude after 199 steps with 0 reset in 1 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-07 finished in 31123 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 149 transition count 372
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 149 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 149 transition count 370
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 141 transition count 354
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 141 transition count 354
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 141 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 136 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 131 transition count 310
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 131 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 126 transition count 300
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 126 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 121 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 116 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 116 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 111 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 111 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 106 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 106 transition count 256
Applied a total of 112 rules in 50 ms. Remains 106 /157 variables (removed 51) and now considering 256/410 (removed 154) transitions.
[2026-05-25 01:15:05] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-921390593903486284.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11772576877680834592.kers'
[2026-05-25 01:15:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-921390593903486284.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11772576877680834592.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 106 cols 484 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 01:15:05] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-11772576877680834592.kers
Total runtime 0 ms.
[2026-05-25 01:15:05] [INFO ] Implicit Places using invariants in 60 ms returned []
[2026-05-25 01:15:05] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2026-05-25 01:15:05] [INFO ] Invariant cache hit.
[2026-05-25 01:15:06] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:15:06] [INFO ] Implicit Places using invariants and state equation in 244 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2026-05-25 01:15:06] [INFO ] Redundant transitions in 8 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-25 01:15:06] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2026-05-25 01:15:06] [INFO ] Invariant cache hit.
[2026-05-25 01:15:06] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6671 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 3/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/405 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 405 constraints, problems are : Problem set: 0 solved, 254 unsolved in 24797 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 31516ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 31517ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/157 places, 256/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 31887 ms. Remains : 106/157 places, 256/410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 50 ms :[(NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-08
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-08 finished in 31970 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 149 transition count 374
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 149 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 149 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 141 transition count 356
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 141 transition count 356
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 42 place count 141 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 136 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 136 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 131 transition count 308
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 131 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 126 transition count 298
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 126 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 121 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 121 transition count 288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 116 transition count 278
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 116 transition count 278
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 111 transition count 268
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 111 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 106 transition count 258
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 106 transition count 258
Applied a total of 112 rules in 16 ms. Remains 106 /157 variables (removed 51) and now considering 258/410 (removed 152) transitions.
[2026-05-25 01:15:37] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12649128277445225528.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1696448196185430240.kers'
[2026-05-25 01:15:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12649128277445225528.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1696448196185430240.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 106 cols 480 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 01:15:37] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1696448196185430240.kers
Total runtime 2 ms.
[2026-05-25 01:15:37] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-25 01:15:37] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2026-05-25 01:15:37] [INFO ] Invariant cache hit.
[2026-05-25 01:15:37] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:15:38] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
Running 256 sub problems to find dead transitions.
[2026-05-25 01:15:38] [INFO ] Flow matrix only has 174 transitions (discarded 84 similar events)
[2026-05-25 01:15:38] [INFO ] Invariant cache hit.
[2026-05-25 01:15:38] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 256 unsolved in 6664 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 256 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 256/404 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 3/407 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 256 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/407 constraints. Problems are: Problem set: 0 solved, 256 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 407 constraints, problems are : Problem set: 0 solved, 256 unsolved in 26471 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 256/256 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 33186ms problems are : Problem set: 0 solved, 256 unsolved
Search for dead transitions found 0 dead transitions in 33187ms
Starting structural reductions in LTL mode, iteration 1 : 106/157 places, 258/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33505 ms. Remains : 106/157 places, 258/410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 198 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-09
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-09 finished in 33730 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 148 transition count 368
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 148 transition count 368
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 20 place count 148 transition count 366
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 29 place count 139 transition count 348
Iterating global reduction 1 with 9 rules applied. Total rules applied 38 place count 139 transition count 348
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 42 place count 139 transition count 344
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 48 place count 133 transition count 320
Iterating global reduction 2 with 6 rules applied. Total rules applied 54 place count 133 transition count 320
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 127 transition count 296
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 127 transition count 296
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 72 place count 121 transition count 284
Iterating global reduction 2 with 6 rules applied. Total rules applied 78 place count 121 transition count 284
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 84 place count 115 transition count 272
Iterating global reduction 2 with 6 rules applied. Total rules applied 90 place count 115 transition count 272
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 96 place count 109 transition count 260
Iterating global reduction 2 with 6 rules applied. Total rules applied 102 place count 109 transition count 260
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 108 place count 103 transition count 248
Iterating global reduction 2 with 6 rules applied. Total rules applied 114 place count 103 transition count 248
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 120 place count 97 transition count 236
Iterating global reduction 2 with 6 rules applied. Total rules applied 126 place count 97 transition count 236
Applied a total of 126 rules in 14 ms. Remains 97 /157 variables (removed 60) and now considering 236/410 (removed 174) transitions.
[2026-05-25 01:16:11] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8333714873466447453.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17794466871206137930.kers'
[2026-05-25 01:16:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8333714873466447453.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17794466871206137930.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 159 rows 97 cols 440 entries
Finished phase 1 with 94 SingleSign rule and 1 generalized
[2026-05-25 01:16:11] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17794466871206137930.kers
Total runtime 1 ms.
[2026-05-25 01:16:11] [INFO ] Implicit Places using invariants in 65 ms returned []
[2026-05-25 01:16:11] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 01:16:11] [INFO ] Invariant cache hit.
[2026-05-25 01:16:11] [INFO ] State equation strengthened by 37 read => feed constraints.
[2026-05-25 01:16:11] [INFO ] Implicit Places using invariants and state equation in 188 ms returned []
Implicit Place search using SMT with State Equation took 255 ms to find 0 implicit places.
Running 234 sub problems to find dead transitions.
[2026-05-25 01:16:11] [INFO ] Flow matrix only has 159 transitions (discarded 77 similar events)
[2026-05-25 01:16:11] [INFO ] Invariant cache hit.
[2026-05-25 01:16:11] [INFO ] State equation strengthened by 37 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/256 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Real declared 256/256 variables, and 136 constraints, problems are : Problem set: 0 solved, 234 unsolved in 5859 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 234 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/97 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/97 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/97 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 3 (OVERLAPS) 159/256 variables, 97/99 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/256 variables, 37/136 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/256 variables, 234/370 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/256 variables, 2/372 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/256 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 234 unsolved
At refinement iteration 8 (OVERLAPS) 0/256 variables, 0/372 constraints. Problems are: Problem set: 0 solved, 234 unsolved
No progress, stopping.
After SMT solving in domain Int declared 256/256 variables, and 372 constraints, problems are : Problem set: 0 solved, 234 unsolved in 21624 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 97/97 constraints, ReadFeed: 37/37 constraints, PredecessorRefiner: 234/234 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 27546ms problems are : Problem set: 0 solved, 234 unsolved
Search for dead transitions found 0 dead transitions in 27547ms
Starting structural reductions in LTL mode, iteration 1 : 97/157 places, 236/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 27820 ms. Remains : 97/157 places, 236/410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 95 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-10
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-10 finished in 27950 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 149 transition count 372
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 149 transition count 372
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 149 transition count 370
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 141 transition count 354
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 141 transition count 354
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 141 transition count 350
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 43 place count 136 transition count 330
Iterating global reduction 2 with 5 rules applied. Total rules applied 48 place count 136 transition count 330
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 53 place count 131 transition count 310
Iterating global reduction 2 with 5 rules applied. Total rules applied 58 place count 131 transition count 310
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 63 place count 126 transition count 300
Iterating global reduction 2 with 5 rules applied. Total rules applied 68 place count 126 transition count 300
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 73 place count 121 transition count 290
Iterating global reduction 2 with 5 rules applied. Total rules applied 78 place count 121 transition count 290
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 83 place count 116 transition count 280
Iterating global reduction 2 with 5 rules applied. Total rules applied 88 place count 116 transition count 280
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 93 place count 111 transition count 270
Iterating global reduction 2 with 5 rules applied. Total rules applied 98 place count 111 transition count 270
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 103 place count 106 transition count 260
Iterating global reduction 2 with 5 rules applied. Total rules applied 108 place count 106 transition count 260
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 112 place count 106 transition count 256
Applied a total of 112 rules in 39 ms. Remains 106 /157 variables (removed 51) and now considering 256/410 (removed 154) transitions.
[2026-05-25 01:16:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8161768483413000954.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17833232874214236648.kers'
[2026-05-25 01:16:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8161768483413000954.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17833232874214236648.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 174 rows 106 cols 484 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 01:16:39] [INFO ] Computed 2 invariants in 1 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17833232874214236648.kers
Total runtime 2 ms.
[2026-05-25 01:16:39] [INFO ] Implicit Places using invariants in 73 ms returned []
[2026-05-25 01:16:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2026-05-25 01:16:39] [INFO ] Invariant cache hit.
[2026-05-25 01:16:39] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:16:39] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2026-05-25 01:16:39] [INFO ] Redundant transitions in 7 ms returned []
Running 254 sub problems to find dead transitions.
[2026-05-25 01:16:39] [INFO ] Flow matrix only has 174 transitions (discarded 82 similar events)
[2026-05-25 01:16:39] [INFO ] Invariant cache hit.
[2026-05-25 01:16:39] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/280 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Real declared 280/280 variables, and 148 constraints, problems are : Problem set: 0 solved, 254 unsolved in 6947 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 254 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 3 (OVERLAPS) 174/280 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/280 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/280 variables, 254/402 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/280 variables, 4/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
At refinement iteration 8 (OVERLAPS) 0/280 variables, 0/406 constraints. Problems are: Problem set: 0 solved, 254 unsolved
No progress, stopping.
After SMT solving in domain Int declared 280/280 variables, and 406 constraints, problems are : Problem set: 0 solved, 254 unsolved in 27029 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 254/254 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 34034ms problems are : Problem set: 0 solved, 254 unsolved
Search for dead transitions found 0 dead transitions in 34035ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/157 places, 256/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 34392 ms. Remains : 106/157 places, 256/410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 82 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-11
Stuttering criterion allowed to conclude after 358 steps with 1 reset in 2 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-11 finished in 34512 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((G(p2)||p1)))))'
Support contains 5 out of 157 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 149 transition count 374
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 149 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 149 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 141 transition count 356
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 141 transition count 356
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 42 place count 141 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 136 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 136 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 131 transition count 308
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 131 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 126 transition count 298
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 126 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 121 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 121 transition count 288
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 86 place count 117 transition count 280
Iterating global reduction 2 with 4 rules applied. Total rules applied 90 place count 117 transition count 280
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 94 place count 113 transition count 272
Iterating global reduction 2 with 4 rules applied. Total rules applied 98 place count 113 transition count 272
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 102 place count 109 transition count 264
Iterating global reduction 2 with 4 rules applied. Total rules applied 106 place count 109 transition count 264
Applied a total of 106 rules in 13 ms. Remains 109 /157 variables (removed 48) and now considering 264/410 (removed 146) transitions.
[2026-05-25 01:17:13] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15984009083052120509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1309972047222001419.kers'
[2026-05-25 01:17:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15984009083052120509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1309972047222001419.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 180 rows 109 cols 498 entries
Finished phase 1 with 106 SingleSign rule and 1 generalized
[2026-05-25 01:17:14] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1309972047222001419.kers
Total runtime 1 ms.
[2026-05-25 01:17:14] [INFO ] Implicit Places using invariants in 69 ms returned []
[2026-05-25 01:17:14] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 01:17:14] [INFO ] Invariant cache hit.
[2026-05-25 01:17:14] [INFO ] State equation strengthened by 42 read => feed constraints.
[2026-05-25 01:17:14] [INFO ] Implicit Places using invariants and state equation in 197 ms returned []
Implicit Place search using SMT with State Equation took 268 ms to find 0 implicit places.
Running 262 sub problems to find dead transitions.
[2026-05-25 01:17:14] [INFO ] Flow matrix only has 180 transitions (discarded 84 similar events)
[2026-05-25 01:17:14] [INFO ] Invariant cache hit.
[2026-05-25 01:17:14] [INFO ] State equation strengthened by 42 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 180/289 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 262 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/289 variables, 0/153 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Real declared 289/289 variables, and 153 constraints, problems are : Problem set: 0 solved, 262 unsolved in 7095 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 262 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/109 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/109 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/109 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 3 (OVERLAPS) 180/289 variables, 109/111 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/289 variables, 42/153 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/289 variables, 262/415 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/289 variables, 4/419 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/289 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 262 unsolved
At refinement iteration 8 (OVERLAPS) 0/289 variables, 0/419 constraints. Problems are: Problem set: 0 solved, 262 unsolved
No progress, stopping.
After SMT solving in domain Int declared 289/289 variables, and 419 constraints, problems are : Problem set: 0 solved, 262 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 109/109 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 262/262 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 37191ms problems are : Problem set: 0 solved, 262 unsolved
Search for dead transitions found 0 dead transitions in 37192ms
Starting structural reductions in LTL mode, iteration 1 : 109/157 places, 264/410 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 37474 ms. Remains : 109/157 places, 264/410 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)||G((G(p2)||p1)))))'
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-14
Product exploration explored 100000 steps with 50000 reset in 132 ms.
Product exploration explored 100000 steps with 50000 reset in 141 ms.
Computed a total of 24 stabilizing places and 64 stable transitions
Computed a total of 24 stabilizing places and 64 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 18 ms. Proved property starting from automaton with 4 states, 7 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 26 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FunctionPointer-PT-b008-LTLFireability-14 finished in 37970 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)||G(p1)))'
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 157/157 places, 410/410 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 149 transition count 374
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 149 transition count 374
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 18 place count 149 transition count 372
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 26 place count 141 transition count 356
Iterating global reduction 1 with 8 rules applied. Total rules applied 34 place count 141 transition count 356
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 42 place count 141 transition count 348
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 47 place count 136 transition count 328
Iterating global reduction 2 with 5 rules applied. Total rules applied 52 place count 136 transition count 328
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 131 transition count 308
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 131 transition count 308
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 67 place count 126 transition count 298
Iterating global reduction 2 with 5 rules applied. Total rules applied 72 place count 126 transition count 298
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 77 place count 121 transition count 288
Iterating global reduction 2 with 5 rules applied. Total rules applied 82 place count 121 transition count 288
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 87 place count 116 transition count 278
Iterating global reduction 2 with 5 rules applied. Total rules applied 92 place count 116 transition count 278
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 97 place count 111 transition count 268
Iterating global reduction 2 with 5 rules applied. Total rules applied 102 place count 111 transition count 268
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 107 place count 106 transition count 258
Iterating global reduction 2 with 5 rules applied. Total rules applied 112 place count 106 transition count 258
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 116 place count 106 transition count 254
Applied a total of 116 rules in 38 ms. Remains 106 /157 variables (removed 51) and now considering 254/410 (removed 156) transitions.
[2026-05-25 01:17:51] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12018708971115138944.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17765073730229768147.kers'
[2026-05-25 01:17:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12018708971115138944.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17765073730229768147.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 172 rows 106 cols 476 entries
Finished phase 1 with 103 SingleSign rule and 1 generalized
[2026-05-25 01:17:51] [INFO ] Computed 2 invariants in 0 ms
Computed 2 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-17765073730229768147.kers
Total runtime 1 ms.
[2026-05-25 01:17:52] [INFO ] Implicit Places using invariants in 76 ms returned []
[2026-05-25 01:17:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 01:17:52] [INFO ] Invariant cache hit.
[2026-05-25 01:17:52] [INFO ] State equation strengthened by 40 read => feed constraints.
[2026-05-25 01:17:52] [INFO ] Implicit Places using invariants and state equation in 225 ms returned []
Implicit Place search using SMT with State Equation took 303 ms to find 0 implicit places.
[2026-05-25 01:17:52] [INFO ] Redundant transitions in 2 ms returned []
Running 252 sub problems to find dead transitions.
[2026-05-25 01:17:52] [INFO ] Flow matrix only has 172 transitions (discarded 82 similar events)
[2026-05-25 01:17:52] [INFO ] Invariant cache hit.
[2026-05-25 01:17:52] [INFO ] State equation strengthened by 40 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
All remaining problems are real, not stopping.
At refinement iteration 6 (OVERLAPS) 0/278 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Real declared 278/278 variables, and 148 constraints, problems are : Problem set: 0 solved, 252 unsolved in 6480 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 252 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/106 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/106 variables, 1/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/106 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 3 (OVERLAPS) 172/278 variables, 106/108 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/278 variables, 40/148 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/278 variables, 252/400 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/278 variables, 3/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/278 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
At refinement iteration 8 (OVERLAPS) 0/278 variables, 0/403 constraints. Problems are: Problem set: 0 solved, 252 unsolved
No progress, stopping.
After SMT solving in domain Int declared 278/278 variables, and 403 constraints, problems are : Problem set: 0 solved, 252 unsolved in 25990 ms.
Refiners :[Positive P Invariants (semi-flows): 1/1 constraints, Generalized P Invariants (flows): 1/1 constraints, State Equation: 106/106 constraints, ReadFeed: 40/40 constraints, PredecessorRefiner: 252/252 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 3/3 constraints]
After SMT, in 32538ms problems are : Problem set: 0 solved, 252 unsolved
Search for dead transitions found 0 dead transitions in 32538ms
Starting structural reductions in SI_LTL mode, iteration 1 : 106/157 places, 254/410 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 32892 ms. Remains : 106/157 places, 254/410 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)||G(p1)))'
Stuttering acceptance computed with spot in 62 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-b008-LTLFireability-15
Stuttering criterion allowed to conclude after 1896 steps with 13 reset in 9 ms.
FORMULA FunctionPointer-PT-b008-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FunctionPointer-PT-b008-LTLFireability-15 finished in 32993 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((p0||G(p1)))))))'
Spot run failed in 38 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 01:18:25] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2885117357819520704
[2026-05-25 01:18:25] [INFO ] Computing symmetric may disable matrix : 410 transitions.
[2026-05-25 01:18:25] [INFO ] Applying decomposition
[2026-05-25 01:18:25] [INFO ] Computation of Complete disable matrix. took 20 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 01:18:25] [INFO ] Computing symmetric may enable matrix : 410 transitions.
[2026-05-25 01:18:25] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 01:18:25] [INFO ] Flatten gal took : 29 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/graph9351234967396509836.txt' '-o' '/tmp/graph9351234967396509836.bin' '-w' '/tmp/graph9351234967396509836.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph9351234967396509836.bin' '-l' '-1' '-v' '-w' '/tmp/graph9351234967396509836.weights' '-q' '0' '-e' '0.001'
[2026-05-25 01:18:25] [INFO ] Decomposing Gal with order
[2026-05-25 01:18:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-25 01:18:25] [INFO ] Removed a total of 614 redundant transitions.
[2026-05-25 01:18:25] [INFO ] Flatten gal took : 33 ms
[2026-05-25 01:18:25] [INFO ] Computing Do-Not-Accords matrix : 410 transitions.
[2026-05-25 01:18:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 232 labels/synchronizations in 11 ms.
[2026-05-25 01:18:25] [INFO ] Time to serialize gal into /tmp/LTLFireability4372640930697559574.gal : 3 ms
[2026-05-25 01:18:25] [INFO ] Time to serialize properties into /tmp/LTLFireability9171757884780627666.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/LTLFireability4372640930697559574.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9171757884780627666.ltl' '-c' '-stutter-deadlock'
[2026-05-25 01:18:25] [INFO ] Computation of Completed DNA matrix. took 22 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-25 01:18:25] [INFO ] Built C files in 167ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2885117357819520704
Running compilation step : cd /tmp/ltsmin2885117357819520704;'/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'
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 : !((X(X(X(F(("((u0.s0>=1)&&(i11.u40.l158>=1))")||(G("((u0.s0<1)||(u0.l199<1))"))))))))
Formula 0 simplified : XXXG(!"((u0.s0>=1)&&(i11.u40.l158>=1))" & F!"((u0.s0<1)||(u0.l199<1))")
Compilation finished in 865 ms.
Running link step : cd /tmp/ltsmin2885117357819520704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin2885117357819520704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-25 01:40:35] [INFO ] Flatten gal took : 13 ms
[2026-05-25 01:40:35] [INFO ] Time to serialize gal into /tmp/LTLFireability645703982227876851.gal : 2 ms
[2026-05-25 01:40:35] [INFO ] Time to serialize properties into /tmp/LTLFireability10921099339379434956.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/LTLFireability645703982227876851.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10921099339379434956.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...297
Read 1 LTL properties
Checking formula 0 : !((X(X(X(F(("((s0>=1)&&(l158>=1))")||(G("((s0<1)||(l199<1))"))))))))
Formula 0 simplified : XXXG(!"((s0>=1)&&(l158>=1))" & F!"((s0<1)||(l199<1))")
Detected timeout of ITS tools.
[2026-05-25 02:02:54] [INFO ] Flatten gal took : 232 ms
[2026-05-25 02:02:54] [INFO ] Input system was already deterministic with 410 transitions.
[2026-05-25 02:02:55] [INFO ] Transformed 157 places.
[2026-05-25 02:02:55] [INFO ] Transformed 410 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 02:02:55] [INFO ] Time to serialize gal into /tmp/LTLFireability11973464700066560074.gal : 7 ms
[2026-05-25 02:02:55] [INFO ] Time to serialize properties into /tmp/LTLFireability11165963674600287511.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/LTLFireability11973464700066560074.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11165963674600287511.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...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(F(("((s0>=1)&&(l158>=1))")||(G("((s0<1)||(l199<1))"))))))))
Formula 0 simplified : XXXG(!"((s0>=1)&&(l158>=1))" & F!"((s0<1)||(l199<1))")
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
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FunctionPointer-PT-b008"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FunctionPointer-PT-b008, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r146-tall-177961073900076"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-b008.tgz
mv FunctionPointer-PT-b008 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;
