About the Execution of ITS-Tools for Champagne-PT-H05T2O
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 517.355 | 502152.00 | 593375.00 | 1228.20 | FTFFFFTFFTFFFFFF | 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.r050-smll-177946901000044.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 Champagne-PT-H05T2O, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r050-smll-177946901000044
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 7.7K Mar 6 10:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 6 10:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 6 10:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 61K Mar 6 10:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:58 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:58 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:58 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:58 LTLFireability.xml
-rw-r--r-- 1 mcc users 14K Mar 6 10:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 151K Mar 6 10:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 6 10:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 64K Mar 6 10:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:58 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:58 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 7 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 149K 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 Champagne-PT-H05T2O-LTLFireability-00
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-01
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-02
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-03
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-04
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-05
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-06
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-07
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-08
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-09
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-10
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-11
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-12
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-13
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-14
FORMULA_NAME Champagne-PT-H05T2O-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779489253606
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Champagne-PT-H05T2O
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 22:34:15] [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-22 22:34:15] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 22:34:16] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2026-05-22 22:34:16] [INFO ] Transformed 569 places.
[2026-05-22 22:34:16] [INFO ] Transformed 686 transitions.
[2026-05-22 22:34:16] [INFO ] Found NUPN structural information;
[2026-05-22 22:34:16] [INFO ] Parsed PT model containing 569 places and 686 transitions and 1566 arcs in 370 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 16 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 5 formulas.
FORMULA Champagne-PT-H05T2O-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Champagne-PT-H05T2O-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 569 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 569/569 places, 686/686 transitions.
Discarding 98 places :
Symmetric choice reduction at 0 with 98 rule applications. Total rules 98 place count 471 transition count 588
Iterating global reduction 0 with 98 rules applied. Total rules applied 196 place count 471 transition count 588
Discarding 68 places :
Symmetric choice reduction at 0 with 68 rule applications. Total rules 264 place count 403 transition count 520
Iterating global reduction 0 with 68 rules applied. Total rules applied 332 place count 403 transition count 520
Discarding 39 places :
Symmetric choice reduction at 0 with 39 rule applications. Total rules 371 place count 364 transition count 481
Iterating global reduction 0 with 39 rules applied. Total rules applied 410 place count 364 transition count 481
Applied a total of 410 rules in 185 ms. Remains 364 /569 variables (removed 205) and now considering 481/686 (removed 205) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15942951314535040983.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12666289323952543899.kers'
[2026-05-22 22:34:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15942951314535040983.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12666289323952543899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 364 cols 1156 entries
Finished phase 1 with 349 SingleSign rule and 0 generalized
[2026-05-22 22:34:16] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12666289323952543899.kers
Total runtime 6 ms.
[2026-05-22 22:34:17] [INFO ] Implicit Places using invariants in 569 ms returned []
[2026-05-22 22:34:17] [INFO ] Invariant cache hit.
[2026-05-22 22:34:18] [INFO ] Implicit Places using invariants and state equation in 596 ms returned []
Implicit Place search using SMT with State Equation took 1225 ms to find 0 implicit places.
Running 480 sub problems to find dead transitions.
[2026-05-22 22:34:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (OVERLAPS) 481/845 variables, 364/379 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 845/845 variables, and 379 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 480 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/363 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 1 (OVERLAPS) 1/364 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/364 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 3 (OVERLAPS) 481/845 variables, 364/379 constraints. Problems are: Problem set: 0 solved, 480 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/845 variables, 480/859 constraints. Problems are: Problem set: 0 solved, 480 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 845/845 variables, and 861 constraints, problems are : Problem set: 0 solved, 480 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 364/364 constraints, PredecessorRefiner: 480/480 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 2/2 constraints]
After SMT, in 60344ms problems are : Problem set: 0 solved, 480 unsolved
Search for dead transitions found 0 dead transitions in 60381ms
Starting structural reductions in LTL mode, iteration 1 : 364/569 places, 481/686 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61910 ms. Remains : 364/569 places, 481/686 transitions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Applied a total of 0 rules in 17 ms. Remains 364 /364 variables (removed 0) and now considering 481/481 (removed 0) transitions.
[2026-05-22 22:35:18] [INFO ] Invariant cache hit.
[2026-05-22 22:35:18] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-22 22:35:18] [INFO ] Invariant cache hit.
[2026-05-22 22:35:19] [INFO ] Implicit Places using invariants and state equation in 489 ms returned []
Implicit Place search using SMT with State Equation took 687 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 704 ms. Remains : 364/364 places, 481/481 transitions.
Support contains 26 out of 364 places after structural reductions.
[2026-05-22 22:35:19] [INFO ] Flatten gal took : 89 ms
[2026-05-22 22:35:19] [INFO ] Flatten gal took : 39 ms
[2026-05-22 22:35:19] [INFO ] Input system was already deterministic with 481 transitions.
RANDOM walk for 24629 steps (67 resets) in 976 ms. (25 steps per ms) remains 0/22 properties
FORMULA Champagne-PT-H05T2O-LTLFireability-13 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 18 stabilizing places and 18 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Graph (trivial) has 381 edges and 364 vertex of which 228 / 364 are part of one of the 17 SCC in 4 ms
Free SCC test removed 211 places
Ensure Unique test removed 232 transitions
Reduce isomorphic transitions removed 232 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 152 transition count 202
Reduce places removed 46 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 72 rules applied. Total rules applied 119 place count 106 transition count 176
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 132 place count 93 transition count 176
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 132 place count 93 transition count 175
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 134 place count 92 transition count 175
Discarding 14 places :
Symmetric choice reduction at 3 with 14 rule applications. Total rules 148 place count 78 transition count 139
Iterating global reduction 3 with 14 rules applied. Total rules applied 162 place count 78 transition count 139
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 172 place count 78 transition count 129
Performed 25 Post agglomeration using F-continuation condition.Transition count delta: 25
Deduced a syphon composed of 25 places in 0 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 4 with 50 rules applied. Total rules applied 222 place count 53 transition count 104
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 223 place count 52 transition count 100
Iterating global reduction 4 with 1 rules applied. Total rules applied 224 place count 52 transition count 100
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 225 place count 52 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 227 place count 51 transition count 102
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 229 place count 49 transition count 100
Applied a total of 229 rules in 66 ms. Remains 49 /364 variables (removed 315) and now considering 100/481 (removed 381) transitions.
[2026-05-22 22:35:20] [INFO ] Flow matrix only has 58 transitions (discarded 42 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15742044477551409440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2932920957627162484.kers'
[2026-05-22 22:35:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15742044477551409440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2932920957627162484.kers]
Normalized transition count is 57 out of 58 initially.
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 57 rows 47 cols 150 entries
Finished phase 1 with 34 SingleSign rule and 0 generalized
[2026-05-22 22:35:20] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2932920957627162484.kers
Total runtime 0 ms.
[2026-05-22 22:35:20] [INFO ] Implicit Places using invariants in 59 ms returned []
[2026-05-22 22:35:20] [INFO ] Flow matrix only has 58 transitions (discarded 42 similar events)
[2026-05-22 22:35:20] [INFO ] Invariant cache hit.
[2026-05-22 22:35:20] [INFO ] Implicit Places using invariants and state equation in 75 ms returned []
Implicit Place search using SMT with State Equation took 136 ms to find 0 implicit places.
[2026-05-22 22:35:20] [INFO ] Redundant transitions in 2 ms returned []
Running 57 sub problems to find dead transitions.
[2026-05-22 22:35:20] [INFO ] Flow matrix only has 58 transitions (discarded 42 similar events)
[2026-05-22 22:35:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 57/106 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (OVERLAPS) 0/106 variables, 0/64 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Real declared 106/107 variables, and 64 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1392 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 57 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/46 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/46 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 2 (OVERLAPS) 3/49 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/49 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 4 (OVERLAPS) 57/106 variables, 49/64 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/106 variables, 57/121 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 57 unsolved
At refinement iteration 7 (OVERLAPS) 0/106 variables, 0/121 constraints. Problems are: Problem set: 0 solved, 57 unsolved
No progress, stopping.
After SMT solving in domain Int declared 106/107 variables, and 121 constraints, problems are : Problem set: 0 solved, 57 unsolved in 1708 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 49/49 constraints, PredecessorRefiner: 57/57 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3110ms problems are : Problem set: 0 solved, 57 unsolved
Search for dead transitions found 0 dead transitions in 3112ms
Starting structural reductions in SI_LTL mode, iteration 1 : 49/364 places, 100/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3325 ms. Remains : 49/364 places, 100/481 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 384 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-00
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-00 finished in 3846 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))&&(p0 U X((p1||X(X(F(!p2))))))))'
Support contains 4 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 355 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 355 transition count 472
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 349 transition count 466
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 349 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 346 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 346 transition count 463
Applied a total of 36 rules in 67 ms. Remains 346 /364 variables (removed 18) and now considering 463/481 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16370143966140380034.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17205181957076474997.kers'
[2026-05-22 22:35:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16370143966140380034.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17205181957076474997.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 346 cols 1120 entries
Finished phase 1 with 331 SingleSign rule and 0 generalized
[2026-05-22 22:35:24] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17205181957076474997.kers
Total runtime 3 ms.
[2026-05-22 22:35:24] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-22 22:35:24] [INFO ] Invariant cache hit.
[2026-05-22 22:35:25] [INFO ] Implicit Places using invariants and state equation in 393 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2026-05-22 22:35:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/809 variables, 346/361 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 809/809 variables, and 361 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/809 variables, 346/361 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 462/823 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/809 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60165ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60170ms
Starting structural reductions in LTL mode, iteration 1 : 346/364 places, 463/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60819 ms. Remains : 346/364 places, 463/481 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))&&(p0 U X((p1||X(X(F(!p2))))))))'
Stuttering acceptance computed with spot in 436 ms :[(OR (NOT p0) (AND (NOT p1) p2)), (NOT p0), (AND (NOT p1) p2), (AND (NOT p1) p2), p2, p2, (AND p2 (NOT p1)), (AND (NOT p1) p2), (AND p2 (NOT p1)), (AND (NOT p1) p2)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-02
Stuttering criterion allowed to conclude after 362 steps with 2 reset in 7 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-02 finished in 61317 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 1 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Graph (trivial) has 386 edges and 364 vertex of which 234 / 364 are part of one of the 16 SCC in 1 ms
Free SCC test removed 218 places
Ensure Unique test removed 242 transitions
Reduce isomorphic transitions removed 242 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 145 transition count 194
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 70 rules applied. Total rules applied 115 place count 101 transition count 168
Reduce places removed 13 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 14 rules applied. Total rules applied 129 place count 88 transition count 167
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 130 place count 87 transition count 167
Discarding 13 places :
Symmetric choice reduction at 4 with 13 rule applications. Total rules 143 place count 74 transition count 133
Iterating global reduction 4 with 13 rules applied. Total rules applied 156 place count 74 transition count 133
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 165 place count 74 transition count 124
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: 26
Deduced a syphon composed of 26 places in 0 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 5 with 52 rules applied. Total rules applied 217 place count 48 transition count 98
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 220 place count 45 transition count 88
Iterating global reduction 5 with 3 rules applied. Total rules applied 223 place count 45 transition count 88
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 226 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 228 place count 43 transition count 83
Applied a total of 228 rules in 29 ms. Remains 43 /364 variables (removed 321) and now considering 83/481 (removed 398) transitions.
[2026-05-22 22:36:25] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8279145614588433076.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13296273884326042726.kers'
[2026-05-22 22:36:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8279145614588433076.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13296273884326042726.kers]
Normalized transition count is 45 out of 46 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 45 rows 40 cols 120 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 22:36:25] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-13296273884326042726.kers
Total runtime 0 ms.
[2026-05-22 22:36:25] [INFO ] Implicit Places using invariants in 56 ms returned []
[2026-05-22 22:36:25] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
[2026-05-22 22:36:25] [INFO ] Invariant cache hit.
[2026-05-22 22:36:25] [INFO ] Implicit Places using invariants and state equation in 70 ms returned []
Implicit Place search using SMT with State Equation took 129 ms to find 0 implicit places.
[2026-05-22 22:36:25] [INFO ] Redundant transitions in 1 ms returned []
Running 43 sub problems to find dead transitions.
[2026-05-22 22:36:25] [INFO ] Flow matrix only has 46 transitions (discarded 37 similar events)
[2026-05-22 22:36:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (OVERLAPS) 0/88 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Real declared 88/89 variables, and 58 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1073 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 43 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/40 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/40 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 2 (OVERLAPS) 3/43 variables, 3/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 4 (OVERLAPS) 45/88 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/88 variables, 43/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/88 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
At refinement iteration 7 (OVERLAPS) 0/88 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 43 unsolved
No progress, stopping.
After SMT solving in domain Int declared 88/89 variables, and 101 constraints, problems are : Problem set: 0 solved, 43 unsolved in 1233 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 43/43 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2316ms problems are : Problem set: 0 solved, 43 unsolved
Search for dead transitions found 0 dead transitions in 2316ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/364 places, 83/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2486 ms. Remains : 43/364 places, 83/481 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 45 ms :[(NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-04
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-04 finished in 2557 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) U p1) U ((p1 U p2)||X(p2))))'
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 354 transition count 471
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 354 transition count 471
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 26 place count 348 transition count 465
Iterating global reduction 0 with 6 rules applied. Total rules applied 32 place count 348 transition count 465
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 345 transition count 462
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 345 transition count 462
Applied a total of 38 rules in 24 ms. Remains 345 /364 variables (removed 19) and now considering 462/481 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15601375203068150840.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5080629895966287114.kers'
[2026-05-22 22:36:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15601375203068150840.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5080629895966287114.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 345 cols 1118 entries
Finished phase 1 with 330 SingleSign rule and 0 generalized
[2026-05-22 22:36:28] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5080629895966287114.kers
Total runtime 3 ms.
[2026-05-22 22:36:28] [INFO ] Implicit Places using invariants in 181 ms returned []
[2026-05-22 22:36:28] [INFO ] Invariant cache hit.
[2026-05-22 22:36:28] [INFO ] Implicit Places using invariants and state equation in 407 ms returned []
Implicit Place search using SMT with State Equation took 590 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-22 22:36:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/807 variables, and 360 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 461/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/807 variables, and 822 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60088ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60089ms
Starting structural reductions in LTL mode, iteration 1 : 345/364 places, 462/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60706 ms. Remains : 345/364 places, 462/481 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) U p1) U ((p1 U p2)||X(p2))))'
Stuttering acceptance computed with spot in 234 ms :[(NOT p2), (AND (NOT p0) (NOT p2) p1), (AND (NOT p1) (NOT p2)), (NOT p0), (NOT p1)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-07
Stuttering criterion allowed to conclude after 208 steps with 2 reset in 5 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-07 finished in 61003 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)))))'
Support contains 1 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 354 transition count 471
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 354 transition count 471
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 27 place count 347 transition count 464
Iterating global reduction 0 with 7 rules applied. Total rules applied 34 place count 347 transition count 464
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 37 place count 344 transition count 461
Iterating global reduction 0 with 3 rules applied. Total rules applied 40 place count 344 transition count 461
Applied a total of 40 rules in 24 ms. Remains 344 /364 variables (removed 20) and now considering 461/481 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7059904833983625497.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6496860164889315716.kers'
[2026-05-22 22:37:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7059904833983625497.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6496860164889315716.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 461 rows 344 cols 1116 entries
Finished phase 1 with 329 SingleSign rule and 0 generalized
[2026-05-22 22:37:29] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6496860164889315716.kers
Total runtime 3 ms.
[2026-05-22 22:37:29] [INFO ] Implicit Places using invariants in 133 ms returned []
[2026-05-22 22:37:29] [INFO ] Invariant cache hit.
[2026-05-22 22:37:29] [INFO ] Implicit Places using invariants and state equation in 405 ms returned []
Implicit Place search using SMT with State Equation took 541 ms to find 0 implicit places.
Running 460 sub problems to find dead transitions.
[2026-05-22 22:37:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 805/805 variables, and 359 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 460 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/343 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 1 (OVERLAPS) 1/344 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/344 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 3 (OVERLAPS) 461/805 variables, 344/359 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/805 variables, 460/819 constraints. Problems are: Problem set: 0 solved, 460 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/805 variables, 1/820 constraints. Problems are: Problem set: 0 solved, 460 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 805/805 variables, and 820 constraints, problems are : Problem set: 0 solved, 460 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 344/344 constraints, PredecessorRefiner: 460/460 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60078ms problems are : Problem set: 0 solved, 460 unsolved
Search for dead transitions found 0 dead transitions in 60079ms
Starting structural reductions in LTL mode, iteration 1 : 344/364 places, 461/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60646 ms. Remains : 344/364 places, 461/481 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)))))'
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-08
Stuttering criterion allowed to conclude after 270 steps with 0 reset in 3 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-08 finished in 60825 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 364 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Graph (trivial) has 388 edges and 364 vertex of which 237 / 364 are part of one of the 15 SCC in 1 ms
Free SCC test removed 222 places
Ensure Unique test removed 248 transitions
Reduce isomorphic transitions removed 248 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 141 transition count 188
Reduce places removed 44 places and 0 transitions.
Ensure Unique test removed 13 transitions
Reduce isomorphic transitions removed 13 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 1 with 70 rules applied. Total rules applied 115 place count 97 transition count 162
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 128 place count 84 transition count 162
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 141 place count 71 transition count 128
Iterating global reduction 3 with 13 rules applied. Total rules applied 154 place count 71 transition count 128
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 9 rules applied. Total rules applied 163 place count 71 transition count 119
Performed 24 Post agglomeration using F-continuation condition.Transition count delta: 24
Deduced a syphon composed of 24 places in 0 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 4 with 48 rules applied. Total rules applied 211 place count 47 transition count 95
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 213 place count 45 transition count 87
Iterating global reduction 4 with 2 rules applied. Total rules applied 215 place count 45 transition count 87
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 217 place count 45 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 219 place count 43 transition count 83
Applied a total of 219 rules in 25 ms. Remains 43 /364 variables (removed 321) and now considering 83/481 (removed 398) transitions.
[2026-05-22 22:38:30] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1182862867731826812.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8080886056156713956.kers'
[2026-05-22 22:38:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1182862867731826812.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8080886056156713956.kers]
Normalized transition count is 41 out of 42 initially.
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 0 ms.
// Phase 1: matrix 41 rows 40 cols 104 entries
Finished phase 1 with 28 SingleSign rule and 0 generalized
[2026-05-22 22:38:30] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8080886056156713956.kers
Total runtime 0 ms.
[2026-05-22 22:38:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2026-05-22 22:38:30] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
[2026-05-22 22:38:30] [INFO ] Invariant cache hit.
[2026-05-22 22:38:30] [INFO ] Implicit Places using invariants and state equation in 61 ms returned []
Implicit Place search using SMT with State Equation took 115 ms to find 0 implicit places.
[2026-05-22 22:38:30] [INFO ] Redundant transitions in 2 ms returned []
Running 41 sub problems to find dead transitions.
[2026-05-22 22:38:30] [INFO ] Flow matrix only has 42 transitions (discarded 41 similar events)
[2026-05-22 22:38:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (OVERLAPS) 0/84 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Real declared 84/85 variables, and 58 constraints, problems are : Problem set: 0 solved, 41 unsolved in 948 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 41 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 2 (OVERLAPS) 2/43 variables, 2/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/43 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 4 (OVERLAPS) 41/84 variables, 43/58 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/84 variables, 41/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
At refinement iteration 7 (OVERLAPS) 0/84 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 41 unsolved
No progress, stopping.
After SMT solving in domain Int declared 84/85 variables, and 99 constraints, problems are : Problem set: 0 solved, 41 unsolved in 899 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 43/43 constraints, PredecessorRefiner: 41/41 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1852ms problems are : Problem set: 0 solved, 41 unsolved
Search for dead transitions found 0 dead transitions in 1853ms
Starting structural reductions in SI_LTL mode, iteration 1 : 43/364 places, 83/481 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2003 ms. Remains : 43/364 places, 83/481 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 81 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-10
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-10 finished in 2116 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' '!(((p0 U (p0&&(p1 U p2))) U X(G(p0))))'
Support contains 3 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 356 transition count 473
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 356 transition count 473
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 22 place count 350 transition count 467
Iterating global reduction 0 with 6 rules applied. Total rules applied 28 place count 350 transition count 467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 348 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 348 transition count 465
Applied a total of 32 rules in 34 ms. Remains 348 /364 variables (removed 16) and now considering 465/481 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2913250873945659158.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6054567626554539412.kers'
[2026-05-22 22:38:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2913250873945659158.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6054567626554539412.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 465 rows 348 cols 1124 entries
Finished phase 1 with 333 SingleSign rule and 0 generalized
[2026-05-22 22:38:32] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6054567626554539412.kers
Total runtime 4 ms.
[2026-05-22 22:38:32] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-22 22:38:32] [INFO ] Invariant cache hit.
[2026-05-22 22:38:32] [INFO ] Implicit Places using invariants and state equation in 419 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
Running 464 sub problems to find dead transitions.
[2026-05-22 22:38:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/348 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/813 variables, 348/363 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 813/813 variables, and 363 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 464 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/347 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 1 (OVERLAPS) 1/348 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/348 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 3 (OVERLAPS) 465/813 variables, 348/363 constraints. Problems are: Problem set: 0 solved, 464 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/813 variables, 464/827 constraints. Problems are: Problem set: 0 solved, 464 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 813/813 variables, and 828 constraints, problems are : Problem set: 0 solved, 464 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 348/348 constraints, PredecessorRefiner: 464/464 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60091ms problems are : Problem set: 0 solved, 464 unsolved
Search for dead transitions found 0 dead transitions in 60092ms
Starting structural reductions in LTL mode, iteration 1 : 348/364 places, 465/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60674 ms. Remains : 348/364 places, 465/481 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' '!(((p0 U (p0&&(p1 U p2))) U X(G(p0))))'
Stuttering acceptance computed with spot in 213 ms :[true, (OR (NOT p2) (NOT p0)), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-11 finished in 60932 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(G((F(p0)&&X(p1))))))'
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 355 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 355 transition count 472
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 25 place count 348 transition count 465
Iterating global reduction 0 with 7 rules applied. Total rules applied 32 place count 348 transition count 465
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 345 transition count 462
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 345 transition count 462
Applied a total of 38 rules in 21 ms. Remains 345 /364 variables (removed 19) and now considering 462/481 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2180380401336352021.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5966885075673304537.kers'
[2026-05-22 22:39:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2180380401336352021.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5966885075673304537.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 462 rows 345 cols 1118 entries
Finished phase 1 with 330 SingleSign rule and 0 generalized
[2026-05-22 22:39:33] [INFO ] Computed 15 invariants in 4 ms
Computed 15 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5966885075673304537.kers
Total runtime 5 ms.
[2026-05-22 22:39:33] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-22 22:39:33] [INFO ] Invariant cache hit.
[2026-05-22 22:39:33] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 437 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2026-05-22 22:39:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 807/807 variables, and 360 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/344 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/345 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/345 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (OVERLAPS) 462/807 variables, 345/360 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/807 variables, 461/821 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/807 variables, 1/822 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 807/807 variables, and 825 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 345/345 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60083ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 60084ms
Starting structural reductions in LTL mode, iteration 1 : 345/364 places, 462/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60544 ms. Remains : 345/364 places, 462/481 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(G((F(p0)&&X(p1))))))'
Stuttering acceptance computed with spot in 198 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-12
Entered a terminal (fully accepting) state of product in 31 steps with 2 reset in 1 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-12 finished in 60779 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&&F((X(X(p1))||G(p0))))||G(F((p1||G(p0))))))))))'
Support contains 2 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 356 transition count 473
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 356 transition count 473
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 351 transition count 468
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 351 transition count 468
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 349 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 349 transition count 466
Applied a total of 30 rules in 19 ms. Remains 349 /364 variables (removed 15) and now considering 466/481 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17596714524816986724.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7492284427358319336.kers'
[2026-05-22 22:40:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17596714524816986724.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7492284427358319336.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 466 rows 349 cols 1126 entries
Finished phase 1 with 334 SingleSign rule and 0 generalized
[2026-05-22 22:40:33] [INFO ] Computed 15 invariants in 2 ms
Computed 15 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7492284427358319336.kers
Total runtime 3 ms.
[2026-05-22 22:40:34] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-22 22:40:34] [INFO ] Invariant cache hit.
[2026-05-22 22:40:34] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 466 ms to find 0 implicit places.
Running 465 sub problems to find dead transitions.
[2026-05-22 22:40:34] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (OVERLAPS) 466/815 variables, 349/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 815/815 variables, and 364 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 465 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/348 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 1 (OVERLAPS) 1/349 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/349 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 3 (OVERLAPS) 466/815 variables, 349/364 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/815 variables, 465/829 constraints. Problems are: Problem set: 0 solved, 465 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/815 variables, 1/830 constraints. Problems are: Problem set: 0 solved, 465 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 815/815 variables, and 830 constraints, problems are : Problem set: 0 solved, 465 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 349/349 constraints, PredecessorRefiner: 465/465 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60075ms problems are : Problem set: 0 solved, 465 unsolved
Search for dead transitions found 0 dead transitions in 60076ms
Starting structural reductions in LTL mode, iteration 1 : 349/364 places, 466/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60563 ms. Remains : 349/364 places, 466/481 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(F((p0||G(p1))))||(!p1&&F((X(X(p0))||G(p1))))))))))'
Stuttering acceptance computed with spot in 313 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-14
Stuttering criterion allowed to conclude after 528 steps with 0 reset in 4 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-14 finished in 60939 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(!p1)) U ((p2&&X(X(!p1)))||X(X(G(!p1)))))&&p0)))'
Support contains 5 out of 364 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 364/364 places, 481/481 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 355 transition count 472
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 355 transition count 472
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 349 transition count 466
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 349 transition count 466
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 346 transition count 463
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 346 transition count 463
Applied a total of 36 rules in 32 ms. Remains 346 /364 variables (removed 18) and now considering 463/481 (removed 18) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3247460668897517354.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5105444982376646577.kers'
[2026-05-22 22:41:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3247460668897517354.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5105444982376646577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 463 rows 346 cols 1120 entries
Finished phase 1 with 331 SingleSign rule and 0 generalized
[2026-05-22 22:41:34] [INFO ] Computed 15 invariants in 3 ms
Computed 15 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-5105444982376646577.kers
Total runtime 5 ms.
[2026-05-22 22:41:35] [INFO ] Implicit Places using invariants in 194 ms returned []
[2026-05-22 22:41:35] [INFO ] Invariant cache hit.
[2026-05-22 22:41:35] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 524 ms to find 0 implicit places.
Running 462 sub problems to find dead transitions.
[2026-05-22 22:41:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/809 variables, 346/361 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 809/809 variables, and 361 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 462 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/345 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 1 (OVERLAPS) 1/346 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/346 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 3 (OVERLAPS) 463/809 variables, 346/361 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/809 variables, 462/823 constraints. Problems are: Problem set: 0 solved, 462 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/809 variables, 1/824 constraints. Problems are: Problem set: 0 solved, 462 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 809/809 variables, and 824 constraints, problems are : Problem set: 0 solved, 462 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, State Equation: 346/346 constraints, PredecessorRefiner: 462/462 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 60074ms problems are : Problem set: 0 solved, 462 unsolved
Search for dead transitions found 0 dead transitions in 60075ms
Starting structural reductions in LTL mode, iteration 1 : 346/364 places, 463/481 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60633 ms. Remains : 346/364 places, 463/481 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(!p1)) U ((p2&&X(X(!p1)))||X(X(G(!p1)))))&&p0)))'
Stuttering acceptance computed with spot in 206 ms :[(OR (NOT p0) p1), (OR (NOT p0) p1), true, p1, p1, p1]
Running random walk in product with property : Champagne-PT-H05T2O-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Champagne-PT-H05T2O-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Champagne-PT-H05T2O-LTLFireability-15 finished in 60891 ms.
All properties solved by simple procedures.
Total runtime 499759 ms.
BK_STOP 1779489755758
--------------------
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="Champagne-PT-H05T2O"
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 Champagne-PT-H05T2O, 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 r050-smll-177946901000044"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/Champagne-PT-H05T2O.tgz
mv Champagne-PT-H05T2O 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 ;