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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 540K
-rw-r--r-- 1 mcc users 6.8K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 70K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 37K Mar 5 17:50 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.7K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.5K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 60K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 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 148K 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-13-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-13-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779620159817

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-13
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 10:56:00] [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 10:56:00] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:56:01] [INFO ] Load time of PNML (sax parser for PT used): 96 ms
[2026-05-24 10:56:01] [INFO ] Transformed 593 places.
[2026-05-24 10:56:01] [INFO ] Transformed 536 transitions.
[2026-05-24 10:56:01] [INFO ] Found NUPN structural information;
[2026-05-24 10:56:01] [INFO ] Parsed PT model containing 593 places and 536 transitions and 1582 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
FORMULA BusinessProcesses-PT-13-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-13-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 585 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 585/585 places, 528/528 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 580 transition count 528
Discarding 82 places :
Symmetric choice reduction at 1 with 82 rule applications. Total rules 87 place count 498 transition count 446
Iterating global reduction 1 with 82 rules applied. Total rules applied 169 place count 498 transition count 446
Discarding 39 places :
Symmetric choice reduction at 1 with 39 rule applications. Total rules 208 place count 459 transition count 407
Iterating global reduction 1 with 39 rules applied. Total rules applied 247 place count 459 transition count 407
Applied a total of 247 rules in 120 ms. Remains 459 /585 variables (removed 126) and now considering 407/528 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17274378152801092999.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-635616444149972251.kers'
[2026-05-24 10:56:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17274378152801092999.kers, --Pflows, --basisKERS=/tmp/petrispot-output-635616444149972251.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 407 rows 459 cols 1319 entries
Finished phase 1 with 298 SingleSign rule and 71 generalized
[2026-05-24 10:56:01] [INFO ] Computed 90 invariants in 2 ms
Computed 90 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-635616444149972251.kers
Total runtime 3 ms.
[2026-05-24 10:56:01] [INFO ] Implicit Places using invariants in 438 ms returned []
[2026-05-24 10:56:01] [INFO ] Invariant cache hit.
[2026-05-24 10:56:03] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1576 ms to find 0 implicit places.
Running 406 sub problems to find dead transitions.
[2026-05-24 10:56:03] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 72/87 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 3/90 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD359 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/110 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/130 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/150 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/170 constraints. Problems are: Problem set: 5 solved, 401 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 459/866 variables, and 172 constraints, problems are : Problem set: 5 solved, 401 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 72/72 constraints, Generalized P Invariants (flows): 18/18 constraints, State Equation: 0/459 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 82/82 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 5 solved, 401 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 15/15 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/15 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 72/87 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 3/90 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 82/172 constraints. Problems are: Problem set: 5 solved, 401 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/192 constraints. Problems are: Problem set: 5 solved, 401 unsolved
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD358 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/212 constraints. Problems are: Problem set: 17 solved, 389 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/232 constraints. Problems are: Problem set: 17 solved, 389 unsolved
Problem TDEAD324 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 20/252 constraints. Problems are: Problem set: 22 solved, 384 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/459 variables, 20/272 constraints. Problems are: Problem set: 22 solved, 384 unsolved
SMT process timed out in 60209ms, After SMT, problems are : Problem set: 22 solved, 384 unsolved
Search for dead transitions found 22 dead transitions in 60230ms
Found 22 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 22 transitions
Dead transitions reduction (with SMT) removed 22 transitions
Starting structural reductions in LTL mode, iteration 1 : 459/585 places, 385/528 transitions.
Applied a total of 0 rules in 12 ms. Remains 459 /459 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61981 ms. Remains : 459/585 places, 385/528 transitions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 385/385 transitions.
Applied a total of 0 rules in 16 ms. Remains 459 /459 variables (removed 0) and now considering 385/385 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14531697870595847409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6476200964218972545.kers'
[2026-05-24 10:57:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14531697870595847409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6476200964218972545.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 385 rows 459 cols 1187 entries
Finished phase 1 with 297 SingleSign rule and 71 generalized
[2026-05-24 10:57:03] [INFO ] Computed 91 invariants in 2 ms
Computed 91 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6476200964218972545.kers
Total runtime 3 ms.
[2026-05-24 10:57:03] [INFO ] Implicit Places using invariants in 314 ms returned []
[2026-05-24 10:57:03] [INFO ] Invariant cache hit.
[2026-05-24 10:57:04] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2026-05-24 10:57:04] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/458 variables, 16/16 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/458 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/459 variables, 72/88 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/459 variables, 3/91 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 20/111 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Problem TDEAD310 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 20/131 constraints. Problems are: Problem set: 5 solved, 379 unsolved
Problem TDEAD334 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 20/151 constraints. Problems are: Problem set: 6 solved, 378 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/459 variables, 20/171 constraints. Problems are: Problem set: 6 solved, 378 unsolved
SMT process timed out in 30155ms, After SMT, problems are : Problem set: 6 solved, 378 unsolved
Search for dead transitions found 6 dead transitions in 30159ms
Found 6 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 6 transitions
Dead transitions reduction (with SMT) removed 6 transitions
Starting structural reductions in LTL mode, iteration 1 : 459/459 places, 379/385 transitions.
Applied a total of 0 rules in 10 ms. Remains 459 /459 variables (removed 0) and now considering 379/379 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31519 ms. Remains : 459/459 places, 379/385 transitions.
Support contains 50 out of 459 places after structural reductions.
[2026-05-24 10:57:35] [INFO ] Flatten gal took : 57 ms
[2026-05-24 10:57:35] [INFO ] Flatten gal took : 26 ms
[2026-05-24 10:57:35] [INFO ] Input system was already deterministic with 379 transitions.
Support contains 47 out of 459 places (down from 50) after GAL structural reductions.
RANDOM walk for 40000 steps (282 resets) in 1538 ms. (25 steps per ms) remains 15/33 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 29 ms. (133 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 16 ms. (235 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 25 ms. (153 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 9 ms. (400 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 11 ms. (333 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4003 steps (8 resets) in 13 ms. (285 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
BEST_FIRST walk for 4004 steps (8 resets) in 12 ms. (308 steps per ms) remains 15/15 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9665250547258327351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1722774855149109370.kers'
[2026-05-24 10:57:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9665250547258327351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1722774855149109370.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 459 cols 1151 entries
Finished phase 1 with 296 SingleSign rule and 71 generalized
[2026-05-24 10:57:35] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1722774855149109370.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/25 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 102/127 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/127 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 259/386 variables, 59/72 constraints. Problems are: Problem set: 0 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 0/72 constraints. Problems are: Problem set: 0 solved, 15 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp28 is UNSAT
At refinement iteration 5 (OVERLAPS) 63/449 variables, 20/92 constraints. Problems are: Problem set: 2 solved, 13 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/449 variables, 20/112 constraints. Problems are: Problem set: 2 solved, 13 unsolved
SMT process timed out in 5112ms, After SMT, problems are : Problem set: 2 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 18 out of 459 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 459/459 places, 379/379 transitions.
Graph (trivial) has 202 edges and 459 vertex of which 7 / 459 are part of one of the 1 SCC in 10 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 975 edges and 453 vertex of which 452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 452 transition count 326
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 408 transition count 325
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 407 transition count 325
Performed 90 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 90 Pre rules applied. Total rules applied 92 place count 407 transition count 235
Deduced a syphon composed of 90 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 106 places and 0 transitions.
Iterating global reduction 3 with 196 rules applied. Total rules applied 288 place count 301 transition count 235
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 291 place count 298 transition count 232
Iterating global reduction 3 with 3 rules applied. Total rules applied 294 place count 298 transition count 232
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 3 with 237 rules applied. Total rules applied 531 place count 177 transition count 116
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 533 place count 176 transition count 120
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 535 place count 176 transition count 118
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 537 place count 174 transition count 118
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 4 with 5 rules applied. Total rules applied 542 place count 174 transition count 118
Applied a total of 542 rules in 92 ms. Remains 174 /459 variables (removed 285) and now considering 118/379 (removed 261) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 92 ms. Remains : 174/459 places, 118/379 transitions.
RANDOM walk for 40000 steps (1465 resets) in 915 ms. (43 steps per ms) remains 1/13 properties
BEST_FIRST walk for 40002 steps (716 resets) in 131 ms. (303 steps per ms) remains 1/1 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7355414444507022301.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4602442307101348896.kers'
[2026-05-24 10:57:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7355414444507022301.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4602442307101348896.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 118 rows 173 cols 629 entries
Finished phase 1 with 63 SingleSign rule and 40 generalized
[2026-05-24 10:57:41] [INFO ] Computed 71 invariants in 0 ms
Computed 71 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-4602442307101348896.kers
Total runtime 1 ms.
[2026-05-24 10:57:41] [INFO ] State equation strengthened by 13 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 105/134 variables, 51/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 37/171 variables, 16/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/171 variables, 0/71 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 118/289 variables, 171/242 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 13/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 3/292 variables, 3/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 258 constraints, problems are : Problem set: 0 solved, 1 unsolved in 277 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 174/174 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 26/29 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
Problem AtomicPropp0 is UNSAT
After SMT solving in domain Int declared 29/292 variables, and 5 constraints, problems are : Problem set: 1 solved, 0 unsolved in 64 ms.
Refiners :[Positive P Invariants (semi-flows): 4/55 constraints, Generalized P Invariants (flows): 0/16 constraints, State Equation: 0/174 constraints, ReadFeed: 0/13 constraints, PredecessorRefiner: 0/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 351ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Successfully simplified 3 atomic propositions for a total of 13 simplifications.
Computed a total of 121 stabilizing places and 114 stable transitions
Graph (complete) has 983 edges and 459 vertex of which 458 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 ms
FORMULA BusinessProcesses-PT-13-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
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((X(X((p0 U X(p1)))) U (X(!p0)&&F(p1))))))'
Support contains 2 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 369
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 446 transition count 366
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 446 transition count 366
Applied a total of 26 rules in 23 ms. Remains 446 /459 variables (removed 13) and now considering 366/379 (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-13648929242559374389.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2520402673752450274.kers'
[2026-05-24 10:57:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13648929242559374389.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2520402673752450274.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 446 cols 1125 entries
Finished phase 1 with 283 SingleSign rule and 71 generalized
[2026-05-24 10:57:42] [INFO ] Computed 92 invariants in 5 ms
Computed 92 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-2520402673752450274.kers
Total runtime 6 ms.
[2026-05-24 10:57:42] [INFO ] Implicit Places using invariants in 222 ms returned []
[2026-05-24 10:57:42] [INFO ] Invariant cache hit.
[2026-05-24 10:57:43] [INFO ] Implicit Places using invariants and state equation in 892 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1129 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/459 places, 366/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 444 /444 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1166 ms. Remains : 444/459 places, 366/379 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((X(X((p0 U X(p1)))) U (X(!p0)&&F(p1))))))'
Stuttering acceptance computed with spot in 402 ms :[(OR (NOT p1) p0), p0, (NOT p1), (AND (NOT p0) (NOT p1)), (AND p0 (NOT p1)), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-01
Product exploration explored 100000 steps with 3568 reset in 218 ms.
Stack based approach found an accepted trace after 731 steps with 24 reset with depth 5 and stack size 5 in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-01 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-01 finished in 1900 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U X(X(p0)))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 369
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 446 transition count 366
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 446 transition count 366
Applied a total of 26 rules in 27 ms. Remains 446 /459 variables (removed 13) and now considering 366/379 (removed 13) transitions.
[2026-05-24 10:57:43] [INFO ] Invariant cache hit.
[2026-05-24 10:57:44] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-24 10:57:44] [INFO ] Invariant cache hit.
[2026-05-24 10:57:44] [INFO ] Implicit Places using invariants and state equation in 760 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 978 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 444/459 places, 366/379 transitions.
Applied a total of 0 rules in 10 ms. Remains 444 /444 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1016 ms. Remains : 444/459 places, 366/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U p1) U X(X(p0)))))'
Stuttering acceptance computed with spot in 390 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-04
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-04 finished in 1440 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 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Graph (trivial) has 216 edges and 459 vertex of which 7 / 459 are part of one of the 1 SCC in 2 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 976 edges and 453 vertex of which 452 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 451 transition count 322
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 403 transition count 322
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 98 place count 403 transition count 224
Deduced a syphon composed of 98 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 213 rules applied. Total rules applied 311 place count 288 transition count 224
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 320 place count 279 transition count 215
Iterating global reduction 2 with 9 rules applied. Total rules applied 329 place count 279 transition count 215
Performed 115 Post agglomeration using F-continuation condition.Transition count delta: 115
Deduced a syphon composed of 115 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 236 rules applied. Total rules applied 565 place count 158 transition count 100
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 567 place count 157 transition count 104
Applied a total of 567 rules in 37 ms. Remains 157 /459 variables (removed 302) and now considering 104/379 (removed 275) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4087521821621763259.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10295995280761762868.kers'
[2026-05-24 10:57:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4087521821621763259.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10295995280761762868.kers]
Normalized transition count is 103 out of 104 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 103 rows 156 cols 572 entries
Finished phase 1 with 52 SingleSign rule and 36 generalized
[2026-05-24 10:57:45] [INFO ] Computed 69 invariants in 1 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10295995280761762868.kers
Total runtime 1 ms.
[2026-05-24 10:57:45] [INFO ] Implicit Places using invariants in 120 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 20, 21, 22, 23, 44, 45, 46, 47, 48]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 121 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 138/459 places, 104/379 transitions.
Applied a total of 0 rules in 5 ms. Remains 138 /138 variables (removed 0) and now considering 104/104 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 164 ms. Remains : 138/459 places, 104/379 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 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-05
Stuttering criterion allowed to conclude after 15 steps with 2 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-05 finished in 267 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))&&(p2||(!p1 U p3))))))'
Support contains 6 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 370
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 370
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 447 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 447 transition count 367
Applied a total of 24 rules in 46 ms. Remains 447 /459 variables (removed 12) and now considering 367/379 (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-7596342086873878735.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9710872494172083154.kers'
[2026-05-24 10:57:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7596342086873878735.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9710872494172083154.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 447 cols 1127 entries
Finished phase 1 with 284 SingleSign rule and 71 generalized
[2026-05-24 10:57:45] [INFO ] Computed 92 invariants in 6 ms
Computed 92 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9710872494172083154.kers
Total runtime 6 ms.
[2026-05-24 10:57:45] [INFO ] Implicit Places using invariants in 225 ms returned []
[2026-05-24 10:57:45] [INFO ] Invariant cache hit.
[2026-05-24 10:57:46] [INFO ] Implicit Places using invariants and state equation in 777 ms returned [143, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1005 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 445/459 places, 367/379 transitions.
Applied a total of 0 rules in 10 ms. Remains 445 /445 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1062 ms. Remains : 445/459 places, 367/379 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))&&((!p1 U p2)||p3)))))'
Stuttering acceptance computed with spot in 720 ms :[(OR p1 (AND (NOT p2) (NOT p3))), (NOT p0), (OR p1 (AND (NOT p2) (NOT p3))), (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), p1, (AND (NOT p0) (NOT p2)), (OR (AND (NOT p2) (NOT p3)) (AND p1 (NOT p2))), (AND (NOT p0) p1), (OR (AND (NOT p0) p1 p3) (AND (NOT p0) p1 p2)), p1, (AND (NOT p0) (NOT p2) p1), (AND p1 (NOT p2)), p1, (AND (NOT p0) p1 (NOT p2) p3), (AND p1 (NOT p2)), (AND (NOT p0) p1 p3 (NOT p2)), (AND p1 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-06
Stuttering criterion allowed to conclude after 128 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-06 finished in 1862 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((G((X(p1)||p0))&&F(p2)&&F(p3))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 453 transition count 373
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 453 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 452 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 452 transition count 372
Applied a total of 14 rules in 22 ms. Remains 452 /459 variables (removed 7) and now considering 372/379 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9581079414714597965.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3237925011901614143.kers'
[2026-05-24 10:57:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9581079414714597965.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3237925011901614143.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 452 cols 1137 entries
Finished phase 1 with 289 SingleSign rule and 71 generalized
[2026-05-24 10:57:47] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3237925011901614143.kers
Total runtime 2 ms.
[2026-05-24 10:57:47] [INFO ] Implicit Places using invariants in 220 ms returned []
[2026-05-24 10:57:47] [INFO ] Invariant cache hit.
[2026-05-24 10:57:48] [INFO ] Implicit Places using invariants and state equation in 977 ms returned [143, 145]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1204 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 450/459 places, 372/379 transitions.
Applied a total of 0 rules in 11 ms. Remains 450 /450 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1237 ms. Remains : 450/459 places, 372/379 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((G((X(p1)||p0))&&F(p2)&&F(p3))))'
Stuttering acceptance computed with spot in 665 ms :[(OR (NOT p2) (NOT p3) (AND (NOT p0) (NOT p1))), (OR (NOT p3) (NOT p2) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p3), true]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-07
Stuttering criterion allowed to conclude after 132 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-07 finished in 1943 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(F((p0&&X((p1&&(p0 U (p2||G(p0))))))))))'
Support contains 3 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 451 transition count 371
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 451 transition count 371
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 448 transition count 368
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 448 transition count 368
Applied a total of 22 rules in 29 ms. Remains 448 /459 variables (removed 11) and now considering 368/379 (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-12266589701985425306.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4149359940862090674.kers'
[2026-05-24 10:57:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12266589701985425306.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4149359940862090674.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 448 cols 1129 entries
Finished phase 1 with 285 SingleSign rule and 71 generalized
[2026-05-24 10:57:49] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4149359940862090674.kers
Total runtime 3 ms.
[2026-05-24 10:57:49] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-24 10:57:49] [INFO ] Invariant cache hit.
[2026-05-24 10:57:50] [INFO ] Implicit Places using invariants and state equation in 689 ms returned [143, 144]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 929 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 446/459 places, 368/379 transitions.
Applied a total of 0 rules in 12 ms. Remains 446 /446 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 971 ms. Remains : 446/459 places, 368/379 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(F((p0&&X((p1&&(p0 U (p2||G(p0))))))))))'
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (AND (NOT p0) (NOT p2))), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-08
Product exploration explored 100000 steps with 25000 reset in 169 ms.
Product exploration explored 100000 steps with 25000 reset in 177 ms.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 959 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Detected a total of 119/446 stabilizing places and 112/368 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 3 factoid took 61 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 5 states, 9 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (287 resets) in 244 ms. (163 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40004 steps (51 resets) in 143 ms. (277 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (52 resets) in 265 ms. (150 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (50 resets) in 141 ms. (281 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (49 resets) in 101 ms. (392 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (48 resets) in 111 ms. (357 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40002 steps (43 resets) in 227 ms. (175 steps per ms) remains 4/6 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12369462067897681995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15668273660183673600.kers'
[2026-05-24 10:57:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12369462067897681995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15668273660183673600.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 446 cols 1125 entries
Finished phase 1 with 287 SingleSign rule and 69 generalized
[2026-05-24 10:57:51] [INFO ] Computed 90 invariants in 2 ms
Computed 90 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15668273660183673600.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 301/339 variables, 66/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 6/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 76/415 variables, 10/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 20/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/105 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 21/436 variables, 11/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/116 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 361/797 variables, 436/552 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/797 variables, 3/555 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/797 variables, 3/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf3 is UNSAT
At refinement iteration 15 (OVERLAPS) 11/808 variables, 6/564 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/808 variables, 1/565 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/808 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/814 variables, 4/569 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/814 variables, 0/569 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/814 variables, 0/569 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 569 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4487 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 3/3 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 35/38 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/38 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 301/339 variables, 66/69 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 10/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 76/415 variables, 10/89 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 19/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/108 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 21/436 variables, 11/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 361/797 variables, 436/555 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/797 variables, 3/558 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/797 variables, 3/561 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 2/563 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/797 variables, 0/563 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 11/808 variables, 6/569 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/808 variables, 1/570 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/808 variables, 0/570 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 6/814 variables, 4/574 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (INCLUDED_ONLY) 0/814 variables, 0/574 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 21 (OVERLAPS) 0/814 variables, 0/574 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 814/814 variables, and 574 constraints, problems are : Problem set: 1 solved, 3 unsolved in 870 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 30/30 constraints, Known Traps Along Path: 5/5 constraints]
After SMT, in 5369ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 1 different solutions.
Finished Parikh walk after 151 steps, including 0 resets, run visited all 3 properties in 3 ms. (steps per millisecond=50 )
Parikh walk visited 3 properties in 8 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 5 states, 9 edges and 3 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Knowledge-based reduction took 6116 ms.
Stuttering acceptance computed with spot in 171 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Support contains 2 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 368/368 transitions.
Applied a total of 0 rules in 12 ms. Remains 446 /446 variables (removed 0) and now considering 368/368 (removed 0) transitions.
[2026-05-24 10:57:57] [INFO ] Invariant cache hit.
[2026-05-24 10:57:57] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 10:57:57] [INFO ] Invariant cache hit.
[2026-05-24 10:57:58] [INFO ] Implicit Places using invariants and state equation in 932 ms returned []
Implicit Place search using SMT with State Equation took 1166 ms to find 0 implicit places.
Running 367 sub problems to find dead transitions.
[2026-05-24 10:57:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 69/84 constraints. Problems are: Problem set: 0 solved, 367 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 6/90 constraints. Problems are: Problem set: 0 solved, 367 unsolved
Problem TDEAD308 is UNSAT
Problem TDEAD310 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 20/110 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/130 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/150 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/170 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/190 constraints. Problems are: Problem set: 2 solved, 365 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 446/814 variables, and 190 constraints, problems are : Problem set: 2 solved, 365 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 367/367 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 365 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/445 variables, 15/15 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/445 variables, 0/15 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 2 (OVERLAPS) 1/446 variables, 69/84 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/446 variables, 6/90 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/446 variables, 100/190 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/446 variables, 20/210 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/446 variables, 20/230 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/446 variables, 20/250 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/446 variables, 20/270 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/446 variables, 20/290 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/446 variables, 20/310 constraints. Problems are: Problem set: 2 solved, 365 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/446 variables, 20/330 constraints. Problems are: Problem set: 2 solved, 365 unsolved
SMT process timed out in 60067ms, After SMT, problems are : Problem set: 2 solved, 365 unsolved
Search for dead transitions found 2 dead transitions in 60070ms
Found 2 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 2 transitions
Dead transitions reduction (with SMT) removed 2 transitions
Starting structural reductions in LTL mode, iteration 1 : 446/446 places, 366/368 transitions.
Applied a total of 0 rules in 10 ms. Remains 446 /446 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61262 ms. Remains : 446/446 places, 366/368 transitions.
Computed a total of 119 stabilizing places and 112 stable transitions
Graph (complete) has 955 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 119 stabilizing places and 112 stable transitions
Detected a total of 119/446 stabilizing places and 112/366 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (288 resets) in 243 ms. (163 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40004 steps (44 resets) in 50 ms. (784 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (48 resets) in 34 ms. (1142 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16665783752996957487.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17373614507453771282.kers'
[2026-05-24 10:58:58] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16665783752996957487.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17373614507453771282.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 366 rows 446 cols 1113 entries
Finished phase 1 with 287 SingleSign rule and 68 generalized
[2026-05-24 10:58:58] [INFO ] Computed 91 invariants in 2 ms
Computed 91 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17373614507453771282.kers
Total runtime 4 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 306/339 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 75/414 variables, 10/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/414 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 22/436 variables, 12/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/436 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 359/795 variables, 436/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/795 variables, 0/527 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 11/806 variables, 6/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/806 variables, 0/533 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 6/812 variables, 4/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/812 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/812 variables, 0/537 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 812/812 variables, and 537 constraints, problems are : Problem set: 0 solved, 2 unsolved in 423 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 31/33 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/33 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 306/339 variables, 67/69 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/339 variables, 5/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/339 variables, 0/74 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 75/414 variables, 10/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/414 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 22/436 variables, 12/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/436 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 359/795 variables, 436/532 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/795 variables, 2/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/795 variables, 0/534 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 11/806 variables, 6/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/806 variables, 0/540 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 6/812 variables, 4/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/812 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/812 variables, 0/544 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 812/812 variables, and 544 constraints, problems are : Problem set: 0 solved, 2 unsolved in 801 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1233ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 1 properties in 112 ms.
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 366/366 transitions.
Graph (trivial) has 203 edges and 446 vertex of which 4 / 446 are part of one of the 1 SCC in 2 ms
Free SCC test removed 3 places
Drop transitions (Empty/Sink Transition effects.) removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 951 edges and 443 vertex of which 442 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 442 transition count 316
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 397 transition count 316
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 92 place count 397 transition count 220
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 301 place count 284 transition count 220
Performed 121 Post agglomeration using F-continuation condition.Transition count delta: 121
Deduced a syphon composed of 121 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 550 place count 156 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 552 place count 155 transition count 103
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 555 place count 155 transition count 100
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 558 place count 152 transition count 100
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 559 place count 152 transition count 100
Applied a total of 559 rules in 41 ms. Remains 152 /446 variables (removed 294) and now considering 100/366 (removed 266) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 152/446 places, 100/366 transitions.
RANDOM walk for 23399 steps (7 resets) in 73 ms. (316 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 116 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 4 states, 6 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 176 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Knowledge-based reduction took 1894 ms.
Stuttering acceptance computed with spot in 194 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 169 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 25000 reset in 112 ms.
Product exploration explored 100000 steps with 25000 reset in 118 ms.
Spot run failed in 76 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/ltsmin16240521688585480820
[2026-05-24 10:59:01] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16240521688585480820
Running compilation step : cd /tmp/ltsmin16240521688585480820;'/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 661 ms.
Running link step : cd /tmp/ltsmin16240521688585480820;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin16240521688585480820;'/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/stateBased15265496453918492498.hoa' '--buchi-type=spotba'
LTSmin run took 53 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLFireability-08 finished in 72533 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((X((p1&&X(X((p2&&G(p3))))))||p0)))'
Support contains 5 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 370
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 370
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 448 transition count 368
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 448 transition count 368
Applied a total of 22 rules in 25 ms. Remains 448 /459 variables (removed 11) and now considering 368/379 (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-7934260269026123125.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14655374232411882263.kers'
[2026-05-24 10:59:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7934260269026123125.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14655374232411882263.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 368 rows 448 cols 1129 entries
Finished phase 1 with 285 SingleSign rule and 71 generalized
[2026-05-24 10:59:02] [INFO ] Computed 92 invariants in 6 ms
Computed 92 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14655374232411882263.kers
Total runtime 7 ms.
[2026-05-24 10:59:02] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-24 10:59:02] [INFO ] Invariant cache hit.
[2026-05-24 10:59:03] [INFO ] Implicit Places using invariants and state equation in 865 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1086 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 446/459 places, 368/379 transitions.
Applied a total of 0 rules in 12 ms. Remains 446 /446 variables (removed 0) and now considering 368/368 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1124 ms. Remains : 446/459 places, 368/379 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((X((p1&&X(X((p2&&G(p3))))))||p0)))'
Stuttering acceptance computed with spot in 246 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p3))), (OR (NOT p1) (NOT p3) (NOT p2)), true, (OR (NOT p2) (NOT p3)), (OR (NOT p2) (NOT p3)), (NOT p3)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-09
Product exploration explored 100000 steps with 710 reset in 255 ms.
Product exploration explored 100000 steps with 714 reset in 299 ms.
Computed a total of 118 stabilizing places and 111 stable transitions
Graph (complete) has 957 edges and 446 vertex of which 445 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 118 stabilizing places and 111 stable transitions
Detected a total of 118/446 stabilizing places and 111/368 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge based reduction with 3 factoid took 68 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 6 states, 10 edges and 4 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 6 to 5
RANDOM walk for 40000 steps (283 resets) in 192 ms. (207 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (51 resets) in 92 ms. (430 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (50 resets) in 76 ms. (519 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 72 ms. (547 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (51 resets) in 68 ms. (579 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9268178522586595810.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15573597444886852166.kers'
[2026-05-24 10:59:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9268178522586595810.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15573597444886852166.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 368 rows 446 cols 1125 entries
Finished phase 1 with 287 SingleSign rule and 69 generalized
[2026-05-24 10:59:04] [INFO ] Computed 90 invariants in 2 ms
Computed 90 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15573597444886852166.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 315/340 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem apf1 is UNSAT
At refinement iteration 5 (OVERLAPS) 75/415 variables, 10/79 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/415 variables, 8/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 18/105 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 2/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/415 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 21/436 variables, 11/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/436 variables, 0/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 361/797 variables, 436/555 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/797 variables, 4/559 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/797 variables, 0/559 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (OVERLAPS) 11/808 variables, 6/565 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/808 variables, 0/565 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (OVERLAPS) 6/814 variables, 4/569 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/814 variables, 0/569 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 20 (OVERLAPS) 0/814 variables, 0/569 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 814/814 variables, and 569 constraints, problems are : Problem set: 1 solved, 3 unsolved in 4142 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 446/446 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 29/29 constraints, Known Traps Along Path: 4/4 constraints]
Escalating to Integer solving :Problem set: 1 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 21/25 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/25 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 315/340 variables, 68/69 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/340 variables, 19/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/340 variables, 0/88 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 75/415 variables, 10/98 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/415 variables, 9/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/415 variables, 0/107 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 21/436 variables, 11/118 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/436 variables, 1/119 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/436 variables, 20/139 constraints. Problems are: Problem set: 1 solved, 3 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 436/814 variables, and 155 constraints, problems are : Problem set: 1 solved, 3 unsolved in 5007 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 0/446 constraints, PredecessorRefiner: 0/4 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/4 constraints]
After SMT, in 9160ms problems are : Problem set: 1 solved, 3 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 368/368 transitions.
Graph (trivial) has 201 edges and 446 vertex of which 6 / 446 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Graph (complete) has 950 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 440 transition count 316
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 396 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 395 transition count 315
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 92 place count 395 transition count 222
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 294 place count 286 transition count 222
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 246 rules applied. Total rules applied 540 place count 160 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 542 place count 159 transition count 106
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 544 place count 159 transition count 104
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 546 place count 157 transition count 104
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 547 place count 157 transition count 104
Applied a total of 547 rules in 35 ms. Remains 157 /446 variables (removed 289) and now considering 104/368 (removed 264) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 35 ms. Remains : 157/446 places, 104/368 transitions.
RANDOM walk for 948 steps (33 resets) in 7 ms. (118 steps per ms) remains 0/3 properties
Found 2 invariant AP formulas.
Knowledge based reduction with 5 factoid took 101 ms. Reduced automaton from 6 states, 10 edges and 4 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p0), true]
Knowledge-based reduction took 9613 ms.
Stuttering acceptance computed with spot in 50 ms :[(NOT p0), true]
Support contains 2 out of 446 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 368/368 transitions.
Graph (trivial) has 201 edges and 446 vertex of which 6 / 446 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 951 edges and 441 vertex of which 440 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 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 44 transitions
Trivial Post-agglo rules discarded 44 transitions
Performed 44 trivial Post agglomeration. Transition count delta: 44
Iterating post reduction 0 with 44 rules applied. Total rules applied 46 place count 439 transition count 316
Reduce places removed 44 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 45 rules applied. Total rules applied 91 place count 395 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 92 place count 394 transition count 315
Performed 93 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 93 Pre rules applied. Total rules applied 92 place count 394 transition count 222
Deduced a syphon composed of 93 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 294 place count 285 transition count 222
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 534 place count 162 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 536 place count 161 transition count 109
Applied a total of 536 rules in 34 ms. Remains 161 /446 variables (removed 285) and now considering 109/368 (removed 259) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8671429876161846820.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7209112738969258457.kers'
[2026-05-24 10:59:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8671429876161846820.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7209112738969258457.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 108 rows 160 cols 591 entries
Finished phase 1 with 72 SingleSign rule and 21 generalized
[2026-05-24 10:59:13] [INFO ] Computed 68 invariants in 1 ms
Computed 68 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-7209112738969258457.kers
Total runtime 2 ms.
[2026-05-24 10:59:13] [INFO ] Implicit Places using invariants in 188 ms returned [1, 2, 3, 4, 5, 6, 13, 14, 18, 19, 22, 23, 24, 25, 44, 45, 46, 47, 48, 123]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 190 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 141/446 places, 109/368 transitions.
Applied a total of 0 rules in 5 ms. Remains 141 /141 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 230 ms. Remains : 141/446 places, 109/368 transitions.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge based reduction with 3 factoid took 44 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (6631 resets) in 868 ms. (46 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (2308 resets) in 37 ms. (1052 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 181 steps, run visited all 1 properties in 4 ms. (steps per millisecond=45 )
Probabilistic random walk after 181 steps, saw 112 distinct states, run finished after 7 ms. (steps per millisecond=25 ) properties seen :1
Knowledge based reduction with 3 factoid took 62 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 57 ms :[true, (NOT p0)]
Knowledge-based reduction took 413 ms.
Stuttering acceptance computed with spot in 46 ms :[true, (NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[true, (NOT p0)]
Product exploration explored 100000 steps with 15202 reset in 143 ms.
Product exploration explored 100000 steps with 15109 reset in 167 ms.
Built C files in :
/tmp/ltsmin14568795306115139635
[2026-05-24 10:59:14] [INFO ] Computing symmetric may disable matrix : 109 transitions.
[2026-05-24 10:59:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:59:14] [INFO ] Computing symmetric may enable matrix : 109 transitions.
[2026-05-24 10:59:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:59:14] [INFO ] Computing Do-Not-Accords matrix : 109 transitions.
[2026-05-24 10:59:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:59:14] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14568795306115139635
Running compilation step : cd /tmp/ltsmin14568795306115139635;'/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 248 ms.
Running link step : cd /tmp/ltsmin14568795306115139635;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14568795306115139635;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13651150861131155194.hoa' '--buchi-type=spotba'
LTSmin run took 48 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-09 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-13-LTLFireability-09 finished in 13060 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||X(G(p1)))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 370
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 370
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 447 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 447 transition count 367
Applied a total of 24 rules in 29 ms. Remains 447 /459 variables (removed 12) and now considering 367/379 (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-12855663345836903282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6878537728310942254.kers'
[2026-05-24 10:59:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12855663345836903282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6878537728310942254.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 367 rows 447 cols 1127 entries
Finished phase 1 with 284 SingleSign rule and 71 generalized
[2026-05-24 10:59:15] [INFO ] Computed 92 invariants in 2 ms
Computed 92 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6878537728310942254.kers
Total runtime 4 ms.
[2026-05-24 10:59:15] [INFO ] Implicit Places using invariants in 216 ms returned []
[2026-05-24 10:59:15] [INFO ] Invariant cache hit.
[2026-05-24 10:59:16] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1310 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 445/459 places, 367/379 transitions.
Applied a total of 0 rules in 11 ms. Remains 445 /445 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1350 ms. Remains : 445/459 places, 367/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||p1)))'
Stuttering acceptance computed with spot in 140 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-10
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-10 finished in 1523 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 3 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Graph (complete) has 983 edges and 459 vertex of which 458 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 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 46 place count 457 transition count 332
Reduce places removed 45 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 47 rules applied. Total rules applied 93 place count 412 transition count 330
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 95 place count 410 transition count 330
Performed 101 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 101 Pre rules applied. Total rules applied 95 place count 410 transition count 229
Deduced a syphon composed of 101 places in 1 ms
Ensure Unique test removed 17 places
Reduce places removed 118 places and 0 transitions.
Iterating global reduction 3 with 219 rules applied. Total rules applied 314 place count 292 transition count 229
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 324 place count 282 transition count 219
Iterating global reduction 3 with 10 rules applied. Total rules applied 334 place count 282 transition count 219
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 3 with 240 rules applied. Total rules applied 574 place count 159 transition count 102
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 575 place count 159 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 577 place count 158 transition count 105
Applied a total of 577 rules in 35 ms. Remains 158 /459 variables (removed 301) and now considering 105/379 (removed 274) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10838547206490439907.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6885550984346008323.kers'
[2026-05-24 10:59:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10838547206490439907.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6885550984346008323.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 105 rows 157 cols 619 entries
Finished phase 1 with 53 SingleSign rule and 36 generalized
[2026-05-24 10:59:16] [INFO ] Computed 69 invariants in 0 ms
Computed 69 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6885550984346008323.kers
Total runtime 2 ms.
[2026-05-24 10:59:16] [INFO ] Implicit Places using invariants in 122 ms returned [6, 7, 8, 15, 16, 20, 21, 22, 23, 24, 25, 46, 47, 48, 49, 50]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 123 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/459 places, 105/379 transitions.
Applied a total of 0 rules in 3 ms. Remains 142 /142 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 161 ms. Remains : 142/459 places, 105/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-11
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-11 finished in 227 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&&(p1 U G(p2))))))'
Support contains 5 out of 459 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Graph (trivial) has 213 edges and 459 vertex of which 7 / 459 are part of one of the 1 SCC in 1 ms
Free SCC test removed 6 places
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Graph (complete) has 976 edges and 453 vertex of which 452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 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 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 50 place count 451 transition count 322
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 98 place count 403 transition count 322
Performed 94 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 94 Pre rules applied. Total rules applied 98 place count 403 transition count 228
Deduced a syphon composed of 94 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 204 rules applied. Total rules applied 302 place count 293 transition count 228
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 310 place count 285 transition count 220
Iterating global reduction 2 with 8 rules applied. Total rules applied 318 place count 285 transition count 220
Performed 116 Post agglomeration using F-continuation condition.Transition count delta: 116
Deduced a syphon composed of 116 places in 0 ms
Ensure Unique test removed 6 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 556 place count 163 transition count 104
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 558 place count 162 transition count 108
Applied a total of 558 rules in 33 ms. Remains 162 /459 variables (removed 297) and now considering 108/379 (removed 271) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-289729867746484997.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15606190283826492647.kers'
[2026-05-24 10:59:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-289729867746484997.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15606190283826492647.kers]
Normalized transition count is 107 out of 108 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 107 rows 161 cols 606 entries
Finished phase 1 with 48 SingleSign rule and 44 generalized
[2026-05-24 10:59:16] [INFO ] Computed 70 invariants in 1 ms
Computed 70 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-15606190283826492647.kers
Total runtime 3 ms.
[2026-05-24 10:59:16] [INFO ] Implicit Places using invariants in 132 ms returned [8, 9, 10, 17, 18, 22, 23, 24, 25, 26, 27, 48, 49, 50, 51, 52]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 133 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/459 places, 108/379 transitions.
Applied a total of 0 rules in 4 ms. Remains 146 /146 variables (removed 0) and now considering 108/108 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 170 ms. Remains : 146/459 places, 108/379 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 U G(p1))&&p2))))'
Stuttering acceptance computed with spot in 107 ms :[(OR (NOT p2) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-12
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-12 finished in 305 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(X((p1||F(G(p2)))))))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 450 transition count 370
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 450 transition count 370
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 447 transition count 367
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 447 transition count 367
Applied a total of 24 rules in 39 ms. Remains 447 /459 variables (removed 12) and now considering 367/379 (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-14467040729295243940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4830945683195547234.kers'
[2026-05-24 10:59:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14467040729295243940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4830945683195547234.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 367 rows 447 cols 1127 entries
Finished phase 1 with 284 SingleSign rule and 71 generalized
[2026-05-24 10:59:17] [INFO ] Computed 92 invariants in 8 ms
Computed 92 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4830945683195547234.kers
Total runtime 10 ms.
[2026-05-24 10:59:17] [INFO ] Implicit Places using invariants in 232 ms returned []
[2026-05-24 10:59:17] [INFO ] Invariant cache hit.
[2026-05-24 10:59:18] [INFO ] Implicit Places using invariants and state equation in 911 ms returned [142, 143]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1146 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 445/459 places, 367/379 transitions.
Applied a total of 0 rules in 13 ms. Remains 445 /445 variables (removed 0) and now considering 367/367 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1201 ms. Remains : 445/459 places, 367/379 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(X((p1||F(G(p2)))))))'
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-13
Stuttering criterion allowed to conclude after 131 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-13 finished in 1423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Support contains 4 out of 459 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 459/459 places, 379/379 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 449 transition count 369
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 449 transition count 369
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 446 transition count 366
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 446 transition count 366
Applied a total of 26 rules in 27 ms. Remains 446 /459 variables (removed 13) and now considering 366/379 (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-7794446887993788248.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16444551259227595223.kers'
[2026-05-24 10:59:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7794446887993788248.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16444551259227595223.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 366 rows 446 cols 1125 entries
Finished phase 1 with 283 SingleSign rule and 71 generalized
[2026-05-24 10:59:18] [INFO ] Computed 92 invariants in 8 ms
Computed 92 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-16444551259227595223.kers
Total runtime 10 ms.
[2026-05-24 10:59:18] [INFO ] Implicit Places using invariants in 226 ms returned []
[2026-05-24 10:59:18] [INFO ] Invariant cache hit.
[2026-05-24 10:59:19] [INFO ] Implicit Places using invariants and state equation in 1005 ms returned [142]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1235 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 445/459 places, 366/379 transitions.
Applied a total of 0 rules in 11 ms. Remains 445 /445 variables (removed 0) and now considering 366/366 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1273 ms. Remains : 445/459 places, 366/379 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)&&F(p1)))'
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-13-LTLFireability-15
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-13-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-13-LTLFireability-15 finished in 1457 ms.
All properties solved by simple procedures.
Total runtime 199027 ms.

BK_STOP 1779620360011

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

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