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.r034-tall-177946842000484.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 BusinessProcesses-PT-05, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000484
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 444K
-rw-r--r-- 1 mcc users 5.7K Mar 5 18:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 56K Mar 5 18:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Mar 5 18:44 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Mar 5 18:44 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:44 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:44 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:44 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Mar 15 07:44 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 5 18:44 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 76K Mar 5 18:44 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 18:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 5 18:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:44 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:44 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 85K 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 BusinessProcesses-PT-05-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-05-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779611701117

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-05
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 08:35:02] [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-24 08:35:02] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 08:35:02] [INFO ] Load time of PNML (sax parser for PT used): 78 ms
[2026-05-24 08:35:02] [INFO ] Transformed 368 places.
[2026-05-24 08:35:02] [INFO ] Transformed 319 transitions.
[2026-05-24 08:35:02] [INFO ] Found NUPN structural information;
[2026-05-24 08:35:02] [INFO ] Parsed PT model containing 368 places and 319 transitions and 854 arcs in 176 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Deduced a syphon composed of 1 places in 10 ms
Reduce places removed 1 places and 1 transitions.
FORMULA BusinessProcesses-PT-05-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-05-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 38 out of 367 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 367/367 places, 318/318 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 365 transition count 318
Discarding 54 places :
Symmetric choice reduction at 1 with 54 rule applications. Total rules 56 place count 311 transition count 264
Iterating global reduction 1 with 54 rules applied. Total rules applied 110 place count 311 transition count 264
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 111 place count 311 transition count 263
Discarding 30 places :
Symmetric choice reduction at 2 with 30 rule applications. Total rules 141 place count 281 transition count 233
Iterating global reduction 2 with 30 rules applied. Total rules applied 171 place count 281 transition count 233
Applied a total of 171 rules in 122 ms. Remains 281 /367 variables (removed 86) and now considering 233/318 (removed 85) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6126987171723177418.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14417565981024123892.kers'
[2026-05-24 08:35:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6126987171723177418.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14417565981024123892.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 233 rows 281 cols 680 entries
Finished phase 1 with 226 SingleSign rule and 0 generalized
[2026-05-24 08:35:02] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14417565981024123892.kers
Total runtime 13 ms.
[2026-05-24 08:35:03] [INFO ] Implicit Places using invariants in 633 ms returned []
[2026-05-24 08:35:03] [INFO ] Invariant cache hit.
[2026-05-24 08:35:04] [INFO ] Implicit Places using invariants and state equation in 721 ms returned []
Implicit Place search using SMT with State Equation took 1401 ms to find 0 implicit places.
Running 232 sub problems to find dead transitions.
[2026-05-24 08:35:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 20/95 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/281 variables, 2/97 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/281 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (OVERLAPS) 233/514 variables, 281/378 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 6/384 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/514 variables, 1/385 constraints. Problems are: Problem set: 0 solved, 232 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Stream closed")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 514/514 variables, and 387 constraints, problems are : Problem set: 0 solved, 232 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 232/232 constraints, Known Traps: 49/49 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 232 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/280 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 1 (OVERLAPS) 1/281 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/281 variables, 49/104 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/281 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 4 (OVERLAPS) 233/514 variables, 281/385 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/514 variables, 232/617 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/514 variables, 7/624 constraints. Problems are: Problem set: 0 solved, 232 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/514 variables, 20/644 constraints. Problems are: Problem set: 0 solved, 232 unsolved
SMT process timed out in 60118ms, After SMT, problems are : Problem set: 0 solved, 232 unsolved
Search for dead transitions found 0 dead transitions in 60143ms
Starting structural reductions in LTL mode, iteration 1 : 281/367 places, 233/318 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 61715 ms. Remains : 281/367 places, 233/318 transitions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Applied a total of 0 rules in 6 ms. Remains 281 /281 variables (removed 0) and now considering 233/233 (removed 0) transitions.
[2026-05-24 08:36:04] [INFO ] Invariant cache hit.
[2026-05-24 08:36:04] [INFO ] Implicit Places using invariants in 94 ms returned []
[2026-05-24 08:36:04] [INFO ] Invariant cache hit.
[2026-05-24 08:36:04] [INFO ] Implicit Places using invariants and state equation in 425 ms returned []
Implicit Place search using SMT with State Equation took 522 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 528 ms. Remains : 281/281 places, 233/233 transitions.
Support contains 38 out of 281 places after structural reductions.
[2026-05-24 08:36:05] [INFO ] Flatten gal took : 40 ms
[2026-05-24 08:36:05] [INFO ] Flatten gal took : 15 ms
[2026-05-24 08:36:05] [INFO ] Input system was already deterministic with 233 transitions.
Support contains 37 out of 281 places (down from 38) after GAL structural reductions.
RANDOM walk for 40000 steps (371 resets) in 2606 ms. (15 steps per ms) remains 7/27 properties
BEST_FIRST walk for 40004 steps (70 resets) in 90 ms. (439 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (69 resets) in 131 ms. (303 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (54 resets) in 130 ms. (305 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40002 steps (71 resets) in 86 ms. (459 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (70 resets) in 107 ms. (370 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (71 resets) in 77 ms. (512 steps per ms) remains 6/6 properties
[2026-05-24 08:36:06] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (OVERLAPS) 208/270 variables, 47/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (OVERLAPS) 224/494 variables, 270/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/494 variables, 0/325 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 18/512 variables, 10/335 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/512 variables, 6/341 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/512 variables, 3/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/512 variables, 0/344 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (OVERLAPS) 2/514 variables, 1/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (OVERLAPS) 0/514 variables, 0/345 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Real declared 514/514 variables, and 345 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1612 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 0 solved, 6 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 1 (OVERLAPS) 52/62 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/62 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 4 (OVERLAPS) 208/270 variables, 47/56 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 3/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 7 (OVERLAPS) 224/494 variables, 270/329 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/494 variables, 4/333 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/494 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/494 variables, 1/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/494 variables, 0/337 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 18/512 variables, 10/347 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/512 variables, 2/349 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/512 variables, 2/351 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/512 variables, 1/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/512 variables, 0/352 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 17 (OVERLAPS) 2/514 variables, 1/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/514 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
At refinement iteration 19 (OVERLAPS) 0/514 variables, 0/353 constraints. Problems are: Problem set: 0 solved, 6 unsolved
No progress, stopping.
After SMT solving in domain Int declared 514/514 variables, and 353 constraints, problems are : Problem set: 0 solved, 6 unsolved in 1839 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 281/281 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 3457ms problems are : Problem set: 0 solved, 6 unsolved
Finished Parikh walk after 12089 steps, including 79 resets, run visited all 2 properties in 32 ms. (steps per millisecond=377 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 6 properties in 421 ms.
Computed a total of 275 stabilizing places and 225 stable transitions
Graph (complete) has 594 edges and 281 vertex of which 280 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 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 X(X((F(p0) U p1)))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 271 transition count 223
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 267 transition count 219
Applied a total of 28 rules in 13 ms. Remains 267 /281 variables (removed 14) and now considering 219/233 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2867094895823981220.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3414708619503542393.kers'
[2026-05-24 08:36:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2867094895823981220.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3414708619503542393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 267 cols 652 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 08:36:10] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3414708619503542393.kers
Total runtime 2 ms.
[2026-05-24 08:36:10] [INFO ] Implicit Places using invariants in 97 ms returned []
[2026-05-24 08:36:10] [INFO ] Invariant cache hit.
[2026-05-24 08:36:11] [INFO ] Implicit Places using invariants and state equation in 503 ms returned []
Implicit Place search using SMT with State Equation took 604 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 08:36:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 358 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/368 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/586 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/606 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 19/625 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 633 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 93/93 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60052ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60053ms
Starting structural reductions in LTL mode, iteration 1 : 267/281 places, 219/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60671 ms. Remains : 267/281 places, 219/233 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 X(X((F(p0) U p1)))))'
Stuttering acceptance computed with spot in 448 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-00
Product exploration explored 100000 steps with 1894 reset in 266 ms.
Stack based approach found an accepted trace after 693 steps with 14 reset with depth 30 and stack size 30 in 2 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-00 finished in 61470 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(X(X(X(G(p0))))))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 271 transition count 223
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 267 transition count 219
Applied a total of 28 rules in 17 ms. Remains 267 /281 variables (removed 14) and now considering 219/233 (removed 14) transitions.
[2026-05-24 08:37:11] [INFO ] Invariant cache hit.
[2026-05-24 08:37:12] [INFO ] Implicit Places using invariants in 99 ms returned []
[2026-05-24 08:37:12] [INFO ] Invariant cache hit.
[2026-05-24 08:37:12] [INFO ] Implicit Places using invariants and state equation in 463 ms returned []
Implicit Place search using SMT with State Equation took 577 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 267/281 places, 219/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 594 ms. Remains : 267/281 places, 219/233 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(X(X(X(G(p0))))))))'
Stuttering acceptance computed with spot in 271 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-01
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-01 finished in 920 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||G(p1)))))'
Support contains 2 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Graph (trivial) has 145 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 3 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 587 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 37 transitions
Trivial Post-agglo rules discarded 37 transitions
Performed 37 trivial Post agglomeration. Transition count delta: 37
Iterating post reduction 0 with 37 rules applied. Total rules applied 39 place count 274 transition count 188
Reduce places removed 37 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 38 rules applied. Total rules applied 77 place count 237 transition count 187
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 78 place count 236 transition count 187
Performed 53 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 53 Pre rules applied. Total rules applied 78 place count 236 transition count 134
Deduced a syphon composed of 53 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 65 places and 0 transitions.
Iterating global reduction 3 with 118 rules applied. Total rules applied 196 place count 171 transition count 134
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 204 place count 163 transition count 126
Iterating global reduction 3 with 8 rules applied. Total rules applied 212 place count 163 transition count 126
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 79 places and 0 transitions.
Iterating global reduction 3 with 156 rules applied. Total rules applied 368 place count 84 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 369 place count 83 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 370 place count 82 transition count 48
Applied a total of 370 rules in 56 ms. Remains 82 /281 variables (removed 199) and now considering 48/233 (removed 185) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11911601745609167921.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7540574267663075783.kers'
[2026-05-24 08:37:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11911601745609167921.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7540574267663075783.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 38 columns.
Culled 38 columns in 0 ms.
// Phase 1: matrix 47 rows 44 cols 142 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-24 08:37:12] [INFO ] Computed 40 invariants in 0 ms
Computed 40 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7540574267663075783.kers
Total runtime 4 ms.
[2026-05-24 08:37:13] [INFO ] Implicit Places using invariants in 68 ms returned [2, 8]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 78 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 80/281 places, 48/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 80 /80 variables (removed 0) and now considering 48/48 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 137 ms. Remains : 80/281 places, 48/233 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||G(p1)))))'
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-02
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-02 finished in 242 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1)&&(p2 U (p3||G(p2))))))'
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 273 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 273 transition count 225
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 20 place count 269 transition count 221
Iterating global reduction 0 with 4 rules applied. Total rules applied 24 place count 269 transition count 221
Applied a total of 24 rules in 22 ms. Remains 269 /281 variables (removed 12) and now considering 221/233 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3716524780904960360.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16137342516506457037.kers'
[2026-05-24 08:37:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3716524780904960360.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16137342516506457037.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 269 cols 656 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 08:37:13] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16137342516506457037.kers
Total runtime 11 ms.
[2026-05-24 08:37:13] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-24 08:37:13] [INFO ] Invariant cache hit.
[2026-05-24 08:37:13] [INFO ] Implicit Places using invariants and state equation in 561 ms returned []
Implicit Place search using SMT with State Equation took 728 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 08:37:13] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 14/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/358 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 3/361 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 4/366 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 2/368 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 369 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30038 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 45/45 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 45/100 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 8/108 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/377 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/597 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 12/609 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 6/615 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 490/490 variables, and 615 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 71/71 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60084ms problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60085ms
Starting structural reductions in LTL mode, iteration 1 : 269/281 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60837 ms. Remains : 269/281 places, 221/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(p1)&&(p2 U (p3||G(p2))))))'
Stuttering acceptance computed with spot in 127 ms :[(OR (NOT p0) (NOT p1) (AND (NOT p2) (NOT p3))), (NOT p1), (AND (NOT p2) (NOT p3))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 166 ms.
Product exploration explored 100000 steps with 50000 reset in 199 ms.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 576 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 4/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 29 factoid took 24 ms. Proved property starting from automaton with 3 states, 8 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 44 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-03 finished in 61415 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!X((p0 U p1)))) U p2)&&F(G(p0))))'
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 272 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 272 transition count 224
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 268 transition count 220
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 268 transition count 220
Applied a total of 26 rules in 11 ms. Remains 268 /281 variables (removed 13) and now considering 220/233 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6293837113697252457.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5000745241330862572.kers'
[2026-05-24 08:38:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6293837113697252457.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5000745241330862572.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 220 rows 268 cols 654 entries
Finished phase 1 with 213 SingleSign rule and 0 generalized
[2026-05-24 08:38:14] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5000745241330862572.kers
Total runtime 1 ms.
[2026-05-24 08:38:14] [INFO ] Implicit Places using invariants in 113 ms returned []
[2026-05-24 08:38:14] [INFO ] Invariant cache hit.
[2026-05-24 08:38:15] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 650 ms to find 0 implicit places.
Running 219 sub problems to find dead transitions.
[2026-05-24 08:38:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 1/82 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/268 variables, 1/83 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/268 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (OVERLAPS) 220/488 variables, 268/352 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/488 variables, 7/359 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/488 variables, 2/361 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 1/362 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/488 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 488/488 variables, and 363 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 38/38 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 219 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/267 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 1 (OVERLAPS) 1/268 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/268 variables, 38/93 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/268 variables, 8/101 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/268 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 5 (OVERLAPS) 220/488 variables, 268/369 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/488 variables, 219/588 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/488 variables, 14/602 constraints. Problems are: Problem set: 0 solved, 219 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/488 variables, 8/610 constraints. Problems are: Problem set: 0 solved, 219 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 488/488 variables, and 611 constraints, problems are : Problem set: 0 solved, 219 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 268/268 constraints, PredecessorRefiner: 219/219 constraints, Known Traps: 69/69 constraints, Known Traps Along Path: 0/2 constraints]
After SMT, in 60063ms problems are : Problem set: 0 solved, 219 unsolved
Search for dead transitions found 0 dead transitions in 60063ms
Starting structural reductions in LTL mode, iteration 1 : 268/281 places, 220/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60728 ms. Remains : 268/281 places, 220/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((X(X(!X((p0 U p1)))) U p2)&&F(G(p0))))'
Stuttering acceptance computed with spot in 264 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) p1), p1, p1, true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-06
Stuttering criterion allowed to conclude after 123 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-06 finished in 61052 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1 U (!p0||X(p2))))))'
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 273 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 273 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 270 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 270 transition count 222
Applied a total of 22 rules in 17 ms. Remains 270 /281 variables (removed 11) and now considering 222/233 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11973093203505784332.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15682361733101755436.kers'
[2026-05-24 08:39:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11973093203505784332.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15682361733101755436.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 270 cols 658 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-24 08:39:15] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15682361733101755436.kers
Total runtime 2 ms.
[2026-05-24 08:39:15] [INFO ] Implicit Places using invariants in 93 ms returned []
[2026-05-24 08:39:15] [INFO ] Invariant cache hit.
[2026-05-24 08:39:16] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 609 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-24 08:39:16] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 11/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/356 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 8/364 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 1/365 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 3/368 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 369 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 42/42 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 42/97 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 2/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/369 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 221/590 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 13/603 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 4/607 constraints. Problems are: Problem set: 0 solved, 221 unsolved
SMT process timed out in 60050ms, After SMT, problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60051ms
Starting structural reductions in LTL mode, iteration 1 : 270/281 places, 222/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60680 ms. Remains : 270/281 places, 222/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0) U X((p1 U (!p0||X(p2))))))'
Stuttering acceptance computed with spot in 318 ms :[(AND p0 (NOT p2)), (AND p0 (NOT p2)), (AND p0 (NOT p2)), (NOT p2), (AND p0 (NOT p2)), true, (AND (NOT p0) (NOT p2)), (AND p0 (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 99 ms.
Product exploration explored 100000 steps with 50000 reset in 109 ms.
Computed a total of 264 stabilizing places and 214 stable transitions
Graph (complete) has 577 edges and 270 vertex of which 269 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 264 stabilizing places and 214 stable transitions
Detected a total of 264/270 stabilizing places and 214/222 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 15 factoid took 10 ms. Proved property starting from automaton with 9 states, 16 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 13 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-05-LTLFireability-07 finished in 61257 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) U X(X(p1)))||(p0&&G(p2)))))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 272 transition count 224
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 272 transition count 224
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 269 transition count 221
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 269 transition count 221
Applied a total of 24 rules in 9 ms. Remains 269 /281 variables (removed 12) and now considering 221/233 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10184905596552976199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13979401597685088820.kers'
[2026-05-24 08:40:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10184905596552976199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13979401597685088820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 221 rows 269 cols 656 entries
Finished phase 1 with 214 SingleSign rule and 0 generalized
[2026-05-24 08:40:16] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13979401597685088820.kers
Total runtime 4 ms.
[2026-05-24 08:40:17] [INFO ] Implicit Places using invariants in 130 ms returned []
[2026-05-24 08:40:17] [INFO ] Invariant cache hit.
[2026-05-24 08:40:17] [INFO ] Implicit Places using invariants and state equation in 579 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
Running 220 sub problems to find dead transitions.
[2026-05-24 08:40:17] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 5/80 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (OVERLAPS) 221/490 variables, 269/350 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 6/356 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 3/359 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 1/360 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/360 constraints. Problems are: Problem set: 0 solved, 220 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 490/490 variables, and 360 constraints, problems are : Problem set: 0 solved, 220 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 220/220 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 220 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/268 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 1 (OVERLAPS) 1/269 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/269 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/269 variables, 12/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 5 (OVERLAPS) 221/490 variables, 269/371 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/490 variables, 220/591 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 13/604 constraints. Problems are: Problem set: 0 solved, 220 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 15/619 constraints. Problems are: Problem set: 0 solved, 220 unsolved
SMT process timed out in 60058ms, After SMT, problems are : Problem set: 0 solved, 220 unsolved
Search for dead transitions found 0 dead transitions in 60060ms
Starting structural reductions in LTL mode, iteration 1 : 269/281 places, 221/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60793 ms. Remains : 269/281 places, 221/233 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) U X(X(p1)))||(p0&&G(p2)))))'
Stuttering acceptance computed with spot in 413 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p1) (NOT p2)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-08
Product exploration explored 100000 steps with 28515 reset in 108 ms.
Product exploration explored 100000 steps with 28577 reset in 124 ms.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 578 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 14 factoid took 151 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 9 states, 18 edges and 3 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 10 to 9
RANDOM walk for 40000 steps (377 resets) in 420 ms. (95 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (70 resets) in 99 ms. (400 steps per ms) remains 7/9 properties
BEST_FIRST walk for 40004 steps (69 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (69 resets) in 132 ms. (300 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (68 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (65 resets) in 98 ms. (404 steps per ms) remains 3/7 properties
BEST_FIRST walk for 40002 steps (68 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
[2026-05-24 08:41:18] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 29/32 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/32 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 228/260 variables, 52/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 211/471 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 2/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf1 is UNSAT
Problem apf7 is UNSAT
At refinement iteration 10 (OVERLAPS) 14/485 variables, 6/327 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 1/328 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 0/328 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 5/490 variables, 3/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/490 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 0/490 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 331 constraints, problems are : Problem set: 2 solved, 1 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 2/2 constraints]
Escalating to Integer solving :Problem set: 2 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 14/15 variables, 1/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/15 variables, 0/1 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 245/260 variables, 54/55 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 4/59 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/59 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 211/471 variables, 260/319 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/320 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 2/322 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 2/324 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/324 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 14/485 variables, 6/330 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 1/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/485 variables, 0/331 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 5/490 variables, 3/334 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 0/334 constraints. Problems are: Problem set: 2 solved, 1 unsolved
At refinement iteration 16 (OVERLAPS) 0/490 variables, 0/334 constraints. Problems are: Problem set: 2 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 334 constraints, problems are : Problem set: 2 solved, 1 unsolved in 297 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 1/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 4/4 constraints]
After SMT, in 1259ms problems are : Problem set: 2 solved, 1 unsolved
Finished Parikh walk after 153 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=76 )
Parikh walk visited 1 properties in 2 ms.
Found 3 invariant AP formulas.
Knowledge based reduction with 17 factoid took 400 ms. Reduced automaton from 9 states, 18 edges and 3 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Knowledge-based reduction took 2508 ms.
Stuttering acceptance computed with spot in 315 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 269 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 221/221 transitions.
Applied a total of 0 rules in 6 ms. Remains 269 /269 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-24 08:41:21] [INFO ] Invariant cache hit.
[2026-05-24 08:41:21] [INFO ] Implicit Places using invariants in 101 ms returned []
[2026-05-24 08:41:21] [INFO ] Invariant cache hit.
[2026-05-24 08:41:21] [INFO ] Implicit Places using invariants and state equation in 530 ms returned []
Implicit Place search using SMT with State Equation took 634 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 641 ms. Remains : 269/269 places, 221/221 transitions.
Computed a total of 263 stabilizing places and 213 stable transitions
Graph (complete) has 578 edges and 269 vertex of which 268 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 263 stabilizing places and 213 stable transitions
Detected a total of 263/269 stabilizing places and 213/221 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 7 factoid took 71 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (378 resets) in 228 ms. (174 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (68 resets) in 116 ms. (341 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (69 resets) in 68 ms. (579 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (70 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1230886 steps, run timeout after 3001 ms. (steps per millisecond=410 ) properties seen :0 out of 3
Probabilistic random walk after 1230886 steps, saw 156537 distinct states, run finished after 3007 ms. (steps per millisecond=409 ) properties seen :0
[2026-05-24 08:41:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 232/260 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 211/471 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 1/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 0/319 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 14/485 variables, 6/325 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/485 variables, 1/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/485 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 5/490 variables, 3/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/490 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/490 variables, 0/329 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 490/490 variables, and 329 constraints, problems are : Problem set: 0 solved, 3 unsolved in 800 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 26/28 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/28 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 232/260 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/260 variables, 3/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/260 variables, 0/58 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 211/471 variables, 260/318 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/471 variables, 3/321 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 1/322 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 4/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 0/326 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 14/485 variables, 6/332 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/485 variables, 1/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/485 variables, 0/333 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 5/490 variables, 3/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/490 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 0/490 variables, 0/336 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 490/490 variables, and 336 constraints, problems are : Problem set: 0 solved, 3 unsolved in 602 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 269/269 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 1405ms problems are : Problem set: 0 solved, 3 unsolved
Finished Parikh walk after 145 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=72 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 32 ms.
Knowledge based reduction with 7 factoid took 137 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 290 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Knowledge-based reduction took 5135 ms.
Stuttering acceptance computed with spot in 320 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 294 ms :[(NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 28575 reset in 109 ms.
Product exploration explored 100000 steps with 28680 reset in 112 ms.
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin12903216818301061025
[2026-05-24 08:41:27] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12903216818301061025
Running compilation step : cd /tmp/ltsmin12903216818301061025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 464 ms.
Running link step : cd /tmp/ltsmin12903216818301061025;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin12903216818301061025;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased14369843300435480016.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 269 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 269/269 places, 221/221 transitions.
Applied a total of 0 rules in 3 ms. Remains 269 /269 variables (removed 0) and now considering 221/221 (removed 0) transitions.
[2026-05-24 08:41:42] [INFO ] Invariant cache hit.
[2026-05-24 08:41:43] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 08:41:43] [INFO ] Invariant cache hit.
[2026-05-24 08:41:43] [INFO ] Implicit Places using invariants and state equation in 568 ms returned []
Implicit Place search using SMT with State Equation took 665 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 671 ms. Remains : 269/269 places, 221/221 transitions.
Built C files in :
/tmp/ltsmin317082603440764564
[2026-05-24 08:41:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin317082603440764564
Running compilation step : cd /tmp/ltsmin317082603440764564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 337 ms.
Running link step : cd /tmp/ltsmin317082603440764564;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin317082603440764564;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8733758666493334953.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 08:41:58] [INFO ] Flatten gal took : 11 ms
[2026-05-24 08:41:58] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:41:58] [INFO ] Time to serialize gal into /tmp/LTL15525995476921067963.gal : 4 ms
[2026-05-24 08:41:58] [INFO ] Time to serialize properties into /tmp/LTL12237027124509848039.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15525995476921067963.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11970086868356182507.hoa' '-atoms' '/tmp/LTL12237027124509848039.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12237027124509848039.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11970086868356182507.hoa
Detected timeout of ITS tools.
[2026-05-24 08:42:13] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:42:13] [INFO ] Flatten gal took : 10 ms
[2026-05-24 08:42:13] [INFO ] Time to serialize gal into /tmp/LTL17372985164297330498.gal : 3 ms
[2026-05-24 08:42:13] [INFO ] Time to serialize properties into /tmp/LTL11963202546581066548.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17372985164297330498.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11963202546581066548.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(((F("(p102==1)"))U(X(X("(p316!=1)"))))||(("(p102==1)")&&(G("(p129==1)"))))))
Formula 0 simplified : F((G!"(p102==1)" R XX!"(p316!=1)") & (!"(p102==1)" | F!"(p129==1)"))
Detected timeout of ITS tools.
[2026-05-24 08:42:28] [INFO ] Flatten gal took : 13 ms
[2026-05-24 08:42:28] [INFO ] Applying decomposition
[2026-05-24 08:42:28] [INFO ] Flatten gal took : 10 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17196192103947790419.txt' '-o' '/tmp/graph17196192103947790419.bin' '-w' '/tmp/graph17196192103947790419.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17196192103947790419.bin' '-l' '-1' '-v' '-w' '/tmp/graph17196192103947790419.weights' '-q' '0' '-e' '0.001'
[2026-05-24 08:42:28] [INFO ] Decomposing Gal with order
[2026-05-24 08:42:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 08:42:28] [INFO ] Removed a total of 69 redundant transitions.
[2026-05-24 08:42:29] [INFO ] Flatten gal took : 60 ms
[2026-05-24 08:42:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2026-05-24 08:42:29] [INFO ] Time to serialize gal into /tmp/LTL6612286168184071896.gal : 5 ms
[2026-05-24 08:42:29] [INFO ] Time to serialize properties into /tmp/LTL2593228229575263631.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6612286168184071896.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2593228229575263631.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(((F("(u32.p102==1)"))U(X(X("(i7.i2.u85.p316!=1)"))))||(("(u32.p102==1)")&&(G("(i11.i1.u42.p129==1)"))))))
Formula 0 simplified : F((G!"(u32.p102==1)" R XX!"(i7.i2.u85.p316!=1)") & (!"(u32.p102==1)" | F!"(i11.i1.u42.p129==1)"))
Reverse transition relation is NOT exact ! Due to transitions t113, t163, t167, t172, t211, t214, t215, t218, t224, i0.u35.t124, i0.u37.t120, i1.u29.t136, ...868
Computing Next relation with stutter on 24 deadlock states
6 unique states visited
6 strongly connected components in search stack
7 transitions explored
6 items max in DFS search stack
331 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,3.34073,138608,1,0,247490,333,3469,378522,167,915,564890
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-05-LTLFireability-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property BusinessProcesses-PT-05-LTLFireability-08 finished in 136180 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Graph (trivial) has 142 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 587 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 35 transitions
Trivial Post-agglo rules discarded 35 transitions
Performed 35 trivial Post agglomeration. Transition count delta: 35
Iterating post reduction 0 with 35 rules applied. Total rules applied 37 place count 274 transition count 190
Reduce places removed 35 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 36 rules applied. Total rules applied 73 place count 239 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 74 place count 238 transition count 189
Performed 54 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 54 Pre rules applied. Total rules applied 74 place count 238 transition count 135
Deduced a syphon composed of 54 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 3 with 121 rules applied. Total rules applied 195 place count 171 transition count 135
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 203 place count 163 transition count 127
Iterating global reduction 3 with 8 rules applied. Total rules applied 211 place count 163 transition count 127
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 2 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 363 place count 86 transition count 52
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 364 place count 85 transition count 51
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 365 place count 84 transition count 51
Applied a total of 365 rules in 38 ms. Remains 84 /281 variables (removed 197) and now considering 51/233 (removed 182) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3461541430459037269.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2054000435739799121.kers'
[2026-05-24 08:42:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3461541430459037269.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2054000435739799121.kers]
Normalized transition count is 50 out of 51 initially.
Culling duplicate invariants (modulo rational): removing 36 columns.
Culled 36 columns in 0 ms.
// Phase 1: matrix 50 rows 48 cols 150 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-24 08:42:33] [INFO ] Computed 39 invariants in 0 ms
Computed 39 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-2054000435739799121.kers
Total runtime 1 ms.
[2026-05-24 08:42:33] [INFO ] Implicit Places using invariants in 63 ms returned [3]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 64 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 83/281 places, 51/233 transitions.
Applied a total of 0 rules in 3 ms. Remains 83 /83 variables (removed 0) and now considering 51/51 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 105 ms. Remains : 83/281 places, 51/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-09
Entered a terminal (fully accepting) state of product in 1755 steps with 394 reset in 8 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-09 finished in 279 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1))) U X(G(p2))))'
Support contains 5 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 271 transition count 223
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 271 transition count 223
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 267 transition count 219
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 267 transition count 219
Applied a total of 28 rules in 15 ms. Remains 267 /281 variables (removed 14) and now considering 219/233 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16738608242364973091.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6558994161265789975.kers'
[2026-05-24 08:42:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16738608242364973091.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6558994161265789975.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 219 rows 267 cols 652 entries
Finished phase 1 with 212 SingleSign rule and 0 generalized
[2026-05-24 08:42:33] [INFO ] Computed 55 invariants in 1 ms
Computed 55 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6558994161265789975.kers
Total runtime 2 ms.
[2026-05-24 08:42:33] [INFO ] Implicit Places using invariants in 90 ms returned []
[2026-05-24 08:42:33] [INFO ] Invariant cache hit.
[2026-05-24 08:42:33] [INFO ] Implicit Places using invariants and state equation in 485 ms returned []
Implicit Place search using SMT with State Equation took 576 ms to find 0 implicit places.
Running 218 sub problems to find dead transitions.
[2026-05-24 08:42:33] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 6/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/348 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 6/354 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 3/357 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 1/358 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/486 variables, 0/358 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 486/486 variables, and 358 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 35/35 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 218 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 1 (OVERLAPS) 1/267 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/267 variables, 35/90 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/267 variables, 11/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/267 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 5 (OVERLAPS) 219/486 variables, 267/368 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 218/586 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/486 variables, 20/606 constraints. Problems are: Problem set: 0 solved, 218 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/486 variables, 19/625 constraints. Problems are: Problem set: 0 solved, 218 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 486/486 variables, and 633 constraints, problems are : Problem set: 0 solved, 218 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 267/267 constraints, PredecessorRefiner: 218/218 constraints, Known Traps: 93/93 constraints, Known Traps Along Path: 0/1 constraints]
After SMT, in 60047ms problems are : Problem set: 0 solved, 218 unsolved
Search for dead transitions found 0 dead transitions in 60048ms
Starting structural reductions in LTL mode, iteration 1 : 267/281 places, 219/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60641 ms. Remains : 267/281 places, 219/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0||G(p1))) U X(G(p2))))'
Stuttering acceptance computed with spot in 281 ms :[(NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (NOT p2), true, (NOT p1), (AND (NOT p1) p2 (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-11
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-11 finished in 60966 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 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Graph (trivial) has 147 edges and 281 vertex of which 6 / 281 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 587 edges and 276 vertex of which 275 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 38 transitions
Trivial Post-agglo rules discarded 38 transitions
Performed 38 trivial Post agglomeration. Transition count delta: 38
Iterating post reduction 0 with 38 rules applied. Total rules applied 40 place count 274 transition count 187
Reduce places removed 38 places and 0 transitions.
Iterating post reduction 1 with 38 rules applied. Total rules applied 78 place count 236 transition count 187
Performed 55 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 55 Pre rules applied. Total rules applied 78 place count 236 transition count 132
Deduced a syphon composed of 55 places in 1 ms
Ensure Unique test removed 13 places
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 2 with 123 rules applied. Total rules applied 201 place count 168 transition count 132
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 210 place count 159 transition count 123
Iterating global reduction 2 with 9 rules applied. Total rules applied 219 place count 159 transition count 123
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 2 with 151 rules applied. Total rules applied 370 place count 82 transition count 49
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 371 place count 81 transition count 48
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 372 place count 80 transition count 48
Applied a total of 372 rules in 26 ms. Remains 80 /281 variables (removed 201) and now considering 48/233 (removed 185) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11660747738327779850.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18420430650085655026.kers'
[2026-05-24 08:43:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11660747738327779850.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18420430650085655026.kers]
Normalized transition count is 47 out of 48 initially.
Culling duplicate invariants (modulo rational): removing 31 columns.
Culled 31 columns in 0 ms.
// Phase 1: matrix 47 rows 49 cols 161 entries
Finished phase 1 with 42 SingleSign rule and 0 generalized
[2026-05-24 08:43:34] [INFO ] Computed 38 invariants in 1 ms
Computed 38 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-18420430650085655026.kers
Total runtime 2 ms.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants in 61 ms returned []
[2026-05-24 08:43:34] [INFO ] Invariant cache hit.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants and state equation in 127 ms returned [9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 189 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 49/281 places, 48/233 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 49 transition count 40
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 41 transition count 40
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 21 place count 36 transition count 35
Iterating global reduction 2 with 5 rules applied. Total rules applied 26 place count 36 transition count 35
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 29 place count 36 transition count 32
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 32 place count 33 transition count 32
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 33 place count 32 transition count 31
Iterating global reduction 4 with 1 rules applied. Total rules applied 34 place count 32 transition count 31
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 44 place count 27 transition count 26
Applied a total of 44 rules in 5 ms. Remains 27 /49 variables (removed 22) and now considering 26/48 (removed 22) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2514302410146614533.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1457587353127516593.kers'
[2026-05-24 08:43:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2514302410146614533.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1457587353127516593.kers]
Normalized transition count is 25 out of 26 initially.
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 25 rows 21 cols 48 entries
Finished phase 1 with 20 SingleSign rule and 0 generalized
[2026-05-24 08:43:34] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1457587353127516593.kers
Total runtime 0 ms.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants in 26 ms returned []
[2026-05-24 08:43:34] [INFO ] Invariant cache hit.
[2026-05-24 08:43:34] [INFO ] State equation strengthened by 9 read => feed constraints.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants and state equation in 37 ms returned [2, 3, 7]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 65 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 24/281 places, 26/233 transitions.
Applied a total of 0 rules in 1 ms. Remains 24 /24 variables (removed 0) and now considering 26/26 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 286 ms. Remains : 24/281 places, 26/233 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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-12 finished in 388 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 3 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Graph (complete) has 594 edges and 281 vertex of which 280 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 36 transitions
Trivial Post-agglo rules discarded 36 transitions
Performed 36 trivial Post agglomeration. Transition count delta: 36
Iterating post reduction 0 with 36 rules applied. Total rules applied 37 place count 279 transition count 195
Reduce places removed 36 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 38 rules applied. Total rules applied 75 place count 243 transition count 193
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 77 place count 241 transition count 193
Performed 57 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 57 Pre rules applied. Total rules applied 77 place count 241 transition count 136
Deduced a syphon composed of 57 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 3 with 127 rules applied. Total rules applied 204 place count 171 transition count 136
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 214 place count 161 transition count 126
Iterating global reduction 3 with 10 rules applied. Total rules applied 224 place count 161 transition count 126
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Ensure Unique test removed 3 places
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 3 with 153 rules applied. Total rules applied 377 place count 83 transition count 51
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 378 place count 83 transition count 50
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 379 place count 82 transition count 49
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 380 place count 81 transition count 49
Applied a total of 380 rules in 36 ms. Remains 81 /281 variables (removed 200) and now considering 49/233 (removed 184) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12838474895091196335.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9798092827325191019.kers'
[2026-05-24 08:43:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12838474895091196335.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9798092827325191019.kers]
Culling duplicate invariants (modulo rational): removing 31 columns.
Culled 31 columns in 0 ms.
// Phase 1: matrix 49 rows 50 cols 169 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-24 08:43:34] [INFO ] Computed 38 invariants in 0 ms
Computed 38 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9798092827325191019.kers
Total runtime 0 ms.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants in 53 ms returned []
[2026-05-24 08:43:34] [INFO ] Invariant cache hit.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants and state equation in 117 ms returned [9, 10, 11, 12, 13, 14, 15, 16, 17, 19, 21, 23, 25, 27, 29, 31, 33, 35, 37, 39, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61]
Discarding 31 places :
Implicit Place search using SMT with State Equation took 171 ms to find 31 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 50/281 places, 49/233 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 50 transition count 41
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 16 place count 42 transition count 41
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 38 transition count 37
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 38 transition count 37
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 38 transition count 35
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 36 transition count 35
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 29 place count 35 transition count 34
Iterating global reduction 4 with 1 rules applied. Total rules applied 30 place count 35 transition count 34
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 4 with 10 rules applied. Total rules applied 40 place count 30 transition count 29
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 30 transition count 29
Applied a total of 41 rules in 7 ms. Remains 30 /50 variables (removed 20) and now considering 29/49 (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-11296092307180061597.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3230248749466654664.kers'
[2026-05-24 08:43:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11296092307180061597.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3230248749466654664.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 29 rows 24 cols 106 entries
Finished phase 1 with 23 SingleSign rule and 0 generalized
[2026-05-24 08:43:34] [INFO ] Computed 7 invariants in 0 ms
Computed 7 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3230248749466654664.kers
Total runtime 0 ms.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants in 32 ms returned []
[2026-05-24 08:43:34] [INFO ] Invariant cache hit.
[2026-05-24 08:43:34] [INFO ] State equation strengthened by 8 read => feed constraints.
[2026-05-24 08:43:34] [INFO ] Implicit Places using invariants and state equation in 41 ms returned [1, 2, 6]
Discarding 3 places :
Implicit Place search using SMT with State Equation took 74 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 27/281 places, 29/233 transitions.
Applied a total of 0 rules in 1 ms. Remains 27 /27 variables (removed 0) and now considering 29/29 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 289 ms. Remains : 27/281 places, 29/233 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 36 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-13
Stuttering criterion allowed to conclude after 7 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-13 finished in 348 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&(p2 U X(p3))))'
Support contains 6 out of 281 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 281/281 places, 233/233 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 273 transition count 225
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 273 transition count 225
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 270 transition count 222
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 270 transition count 222
Applied a total of 22 rules in 13 ms. Remains 270 /281 variables (removed 11) and now considering 222/233 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5364678500445244071.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12987605346870475692.kers'
[2026-05-24 08:43:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5364678500445244071.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12987605346870475692.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 222 rows 270 cols 658 entries
Finished phase 1 with 215 SingleSign rule and 0 generalized
[2026-05-24 08:43:35] [INFO ] Computed 55 invariants in 4 ms
Computed 55 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12987605346870475692.kers
Total runtime 5 ms.
[2026-05-24 08:43:35] [INFO ] Implicit Places using invariants in 91 ms returned []
[2026-05-24 08:43:35] [INFO ] Invariant cache hit.
[2026-05-24 08:43:35] [INFO ] Implicit Places using invariants and state equation in 502 ms returned []
Implicit Place search using SMT with State Equation took 596 ms to find 0 implicit places.
Running 221 sub problems to find dead transitions.
[2026-05-24 08:43:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 20/75 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/270 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/270 variables, 2/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/270 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (OVERLAPS) 222/492 variables, 270/353 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 7/360 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/492 variables, 2/362 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/492 variables, 1/363 constraints. Problems are: Problem set: 0 solved, 221 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 492/492 variables, and 363 constraints, problems are : Problem set: 0 solved, 221 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, State Equation: 270/270 constraints, PredecessorRefiner: 221/221 constraints, Known Traps: 37/37 constraints, Known Traps Along Path: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 221 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/269 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 1 (OVERLAPS) 1/270 variables, 55/55 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/270 variables, 37/92 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/270 variables, 12/104 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/270 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 5 (OVERLAPS) 222/492 variables, 270/374 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/492 variables, 221/595 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/492 variables, 8/603 constraints. Problems are: Problem set: 0 solved, 221 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 7/610 constraints. Problems are: Problem set: 0 solved, 221 unsolved
SMT process timed out in 60043ms, After SMT, problems are : Problem set: 0 solved, 221 unsolved
Search for dead transitions found 0 dead transitions in 60045ms
Starting structural reductions in LTL mode, iteration 1 : 270/281 places, 222/233 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60655 ms. Remains : 270/281 places, 222/233 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(p1)&&(p2 U X(p3))))'
Stuttering acceptance computed with spot in 230 ms :[(OR (NOT p1) (NOT p0) (NOT p3)), (NOT p0), (NOT p1), (NOT p3), (NOT p3), true]
Running random walk in product with property : BusinessProcesses-PT-05-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-05-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-05-LTLFireability-15 finished in 60925 ms.
All properties solved by simple procedures.
Total runtime 573654 ms.

BK_STOP 1779612275965

--------------------
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="BusinessProcesses-PT-05"
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 BusinessProcesses-PT-05, 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 r034-tall-177946842000484"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-05.tgz
mv BusinessProcesses-PT-05 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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
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 ;