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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 708K
-rw-r--r-- 1 mcc users 8.9K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 99K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 137K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.2K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 69K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 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 177K 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-18-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-18-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779626743781

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-18
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 12:45:44] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 12:45:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:45:45] [INFO ] Load time of PNML (sax parser for PT used): 94 ms
[2026-05-24 12:45:45] [INFO ] Transformed 717 places.
[2026-05-24 12:45:45] [INFO ] Transformed 642 transitions.
[2026-05-24 12:45:45] [INFO ] Found NUPN structural information;
[2026-05-24 12:45:45] [INFO ] Parsed PT model containing 717 places and 642 transitions and 1860 arcs in 190 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 15 places in 13 ms
Reduce places removed 15 places and 15 transitions.
FORMULA BusinessProcesses-PT-18-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-18-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-18-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 702 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 702/702 places, 627/627 transitions.
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 8 place count 694 transition count 627
Discarding 95 places :
Symmetric choice reduction at 1 with 95 rule applications. Total rules 103 place count 599 transition count 532
Iterating global reduction 1 with 95 rules applied. Total rules applied 198 place count 599 transition count 532
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 199 place count 599 transition count 531
Discarding 48 places :
Symmetric choice reduction at 2 with 48 rule applications. Total rules 247 place count 551 transition count 483
Iterating global reduction 2 with 48 rules applied. Total rules applied 295 place count 551 transition count 483
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 296 place count 550 transition count 482
Iterating global reduction 2 with 1 rules applied. Total rules applied 297 place count 550 transition count 482
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 298 place count 549 transition count 481
Iterating global reduction 2 with 1 rules applied. Total rules applied 299 place count 549 transition count 481
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 300 place count 548 transition count 480
Iterating global reduction 2 with 1 rules applied. Total rules applied 301 place count 548 transition count 480
Applied a total of 301 rules in 245 ms. Remains 548 /702 variables (removed 154) and now considering 480/627 (removed 147) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5051512201612805634.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6733844831979036376.kers'
[2026-05-24 12:45:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5051512201612805634.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6733844831979036376.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 480 rows 548 cols 1525 entries
Finished phase 1 with 361 SingleSign rule and 81 generalized
[2026-05-24 12:45:45] [INFO ] Computed 106 invariants in 3 ms
Computed 106 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6733844831979036376.kers
Total runtime 4 ms.
[2026-05-24 12:45:46] [INFO ] Implicit Places using invariants in 604 ms returned []
[2026-05-24 12:45:46] [INFO ] Invariant cache hit.
[2026-05-24 12:45:47] [INFO ] Implicit Places using invariants and state equation in 1787 ms returned []
Implicit Place search using SMT with State Equation took 2426 ms to find 0 implicit places.
Running 479 sub problems to find dead transitions.
[2026-05-24 12:45:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/548 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 20/146 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 20/166 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1028 variables, and 166 constraints, problems are : Problem set: 0 solved, 479 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/548 constraints, PredecessorRefiner: 479/479 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 479 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 2 (OVERLAPS) 1/548 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 60/166 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 20/186 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 20/206 constraints. Problems are: Problem set: 0 solved, 479 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 20/226 constraints. Problems are: Problem set: 0 solved, 479 unsolved
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD431 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 20/246 constraints. Problems are: Problem set: 7 solved, 472 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 20/266 constraints. Problems are: Problem set: 7 solved, 472 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/548 variables, 20/286 constraints. Problems are: Problem set: 7 solved, 472 unsolved
SMT process timed out in 60307ms, After SMT, problems are : Problem set: 7 solved, 472 unsolved
Search for dead transitions found 7 dead transitions in 60475ms
Found 7 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 7 transitions
Dead transitions reduction (with SMT) removed 7 transitions
Starting structural reductions in LTL mode, iteration 1 : 548/702 places, 473/627 transitions.
Applied a total of 0 rules in 20 ms. Remains 548 /548 variables (removed 0) and now considering 473/473 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63218 ms. Remains : 548/702 places, 473/627 transitions.
Starting structural reductions in LTL mode, iteration 0 : 548/548 places, 473/473 transitions.
Applied a total of 0 rules in 9 ms. Remains 548 /548 variables (removed 0) and now considering 473/473 (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-6574266637683552632.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10154011260242831371.kers'
[2026-05-24 12:46:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6574266637683552632.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10154011260242831371.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 473 rows 548 cols 1483 entries
Finished phase 1 with 360 SingleSign rule and 82 generalized
[2026-05-24 12:46:48] [INFO ] Computed 106 invariants in 5 ms
Computed 106 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-10154011260242831371.kers
Total runtime 6 ms.
[2026-05-24 12:46:48] [INFO ] Implicit Places using invariants in 328 ms returned []
[2026-05-24 12:46:48] [INFO ] Invariant cache hit.
[2026-05-24 12:46:50] [INFO ] Implicit Places using invariants and state equation in 1586 ms returned []
Implicit Place search using SMT with State Equation took 1917 ms to find 0 implicit places.
Running 472 sub problems to find dead transitions.
[2026-05-24 12:46:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 2 (OVERLAPS) 1/548 variables, 93/104 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 2/106 constraints. Problems are: Problem set: 0 solved, 472 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 20/126 constraints. Problems are: Problem set: 0 solved, 472 unsolved
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 20/146 constraints. Problems are: Problem set: 2 solved, 470 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 20/166 constraints. Problems are: Problem set: 2 solved, 470 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/1021 variables, and 166 constraints, problems are : Problem set: 2 solved, 470 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 0/548 constraints, PredecessorRefiner: 472/472 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 470 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/547 variables, 11/11 constraints. Problems are: Problem set: 2 solved, 470 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/547 variables, 0/11 constraints. Problems are: Problem set: 2 solved, 470 unsolved
At refinement iteration 2 (OVERLAPS) 1/548 variables, 93/104 constraints. Problems are: Problem set: 2 solved, 470 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/548 variables, 2/106 constraints. Problems are: Problem set: 2 solved, 470 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 60/166 constraints. Problems are: Problem set: 2 solved, 470 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 20/186 constraints. Problems are: Problem set: 2 solved, 470 unsolved
Problem TDEAD401 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD439 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/548 variables, 20/206 constraints. Problems are: Problem set: 9 solved, 463 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 20/226 constraints. Problems are: Problem set: 9 solved, 463 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 20/246 constraints. Problems are: Problem set: 9 solved, 463 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 20/266 constraints. Problems are: Problem set: 9 solved, 463 unsolved
SMT process timed out in 60174ms, After SMT, problems are : Problem set: 9 solved, 463 unsolved
Search for dead transitions found 9 dead transitions in 60181ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 548/548 places, 464/473 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 547 transition count 464
Applied a total of 1 rules in 16 ms. Remains 547 /548 variables (removed 1) and now considering 464/464 (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-14830534575353685490.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-589013804666479628.kers'
[2026-05-24 12:47:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14830534575353685490.kers, --Pflows, --basisKERS=/tmp/petrispot-output-589013804666479628.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 464 rows 547 cols 1427 entries
Finished phase 1 with 362 SingleSign rule and 77 generalized
[2026-05-24 12:47:50] [INFO ] Computed 108 invariants in 2 ms
Computed 108 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-589013804666479628.kers
Total runtime 4 ms.
[2026-05-24 12:47:50] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-24 12:47:50] [INFO ] Invariant cache hit.
[2026-05-24 12:47:52] [INFO ] Implicit Places using invariants and state equation in 1690 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 547/548 places, 464/473 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 64136 ms. Remains : 547/548 places, 464/473 transitions.
Support contains 36 out of 547 places after structural reductions.
[2026-05-24 12:47:52] [INFO ] Flatten gal took : 59 ms
[2026-05-24 12:47:52] [INFO ] Flatten gal took : 27 ms
[2026-05-24 12:47:52] [INFO ] Input system was already deterministic with 464 transitions.
Support contains 35 out of 547 places (down from 36) after GAL structural reductions.
RANDOM walk for 40000 steps (207 resets) in 1266 ms. (31 steps per ms) remains 10/20 properties
BEST_FIRST walk for 40004 steps (36 resets) in 136 ms. (292 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (41 resets) in 126 ms. (314 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (37 resets) in 127 ms. (312 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40004 steps (35 resets) in 148 ms. (268 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (35 resets) in 106 ms. (373 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (37 resets) in 132 ms. (300 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (36 resets) in 106 ms. (373 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (35 resets) in 121 ms. (327 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (34 resets) in 87 ms. (454 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (36 resets) in 95 ms. (416 steps per ms) remains 8/8 properties
[2026-05-24 12:47:53] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 134/147 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 330/477 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 58/535 variables, 15/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/535 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 456/991 variables, 535/643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/991 variables, 0/643 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 17/1008 variables, 9/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1008 variables, 0/652 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/1011 variables, 3/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1011 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/1011 variables, 0/655 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1011/1011 variables, and 655 constraints, problems are : Problem set: 0 solved, 8 unsolved in 1312 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 547/547 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 134/147 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/147 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 330/477 variables, 80/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/477 variables, 19/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/477 variables, 0/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 58/535 variables, 15/127 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 6542ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 13 out of 547 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 547/547 places, 464/464 transitions.
Graph (trivial) has 250 edges and 547 vertex of which 4 / 547 are part of one of the 1 SCC in 11 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 1188 edges and 544 vertex of which 543 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 63 place count 543 transition count 398
Reduce places removed 61 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 125 place count 482 transition count 397
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 481 transition count 397
Performed 104 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 104 Pre rules applied. Total rules applied 126 place count 481 transition count 293
Deduced a syphon composed of 104 places in 0 ms
Ensure Unique test removed 22 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 230 rules applied. Total rules applied 356 place count 355 transition count 293
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 366 place count 345 transition count 283
Ensure Unique test removed 1 places
Iterating global reduction 3 with 11 rules applied. Total rules applied 377 place count 344 transition count 283
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 377 place count 344 transition count 280
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 383 place count 341 transition count 280
Performed 142 Post agglomeration using F-continuation condition.Transition count delta: 142
Deduced a syphon composed of 142 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 3 with 288 rules applied. Total rules applied 671 place count 195 transition count 138
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 673 place count 194 transition count 141
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 675 place count 194 transition count 139
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 677 place count 192 transition count 139
Applied a total of 677 rules in 95 ms. Remains 192 /547 variables (removed 355) and now considering 139/464 (removed 325) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 95 ms. Remains : 192/547 places, 139/464 transitions.
RANDOM walk for 40000 steps (11 resets) in 545 ms. (73 steps per ms) remains 1/8 properties
BEST_FIRST walk for 40000 steps (9 resets) in 200 ms. (199 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-1265235838693422075.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3182846335752915288.kers'
[2026-05-24 12:48:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1265235838693422075.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3182846335752915288.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 139 rows 191 cols 789 entries
Finished phase 1 with 82 SingleSign rule and 29 generalized
[2026-05-24 12:48:00] [INFO ] Computed 81 invariants in 0 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3182846335752915288.kers
Total runtime 1 ms.
[2026-05-24 12:48:00] [INFO ] State equation strengthened by 7 read => feed constraints.
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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/159 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 0/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 28/187 variables, 11/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/187 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 1/188 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/188 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 139/327 variables, 188/269 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/327 variables, 7/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/327 variables, 0/276 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 4/331 variables, 4/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/331 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/331 variables, 0/280 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 331/331 variables, and 280 constraints, problems are : Problem set: 0 solved, 1 unsolved in 617 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 192/192 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/6 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/6 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 153/159 variables, 68/69 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/159 variables, 1/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/159 variables, 0/70 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 28/187 variables, 11/81 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/187 variables, 20/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/187 variables, 0/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 1/188 variables, 1/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/188 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 139/327 variables, 188/290 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/327 variables, 7/297 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/327 variables, 1/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/327 variables, 0/298 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 15 (OVERLAPS) 4/331 variables, 4/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/331 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 17 (OVERLAPS) 0/331 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 331/331 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1565 ms.
Refiners :[Positive P Invariants (semi-flows): 69/69 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 192/192 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 21/21 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2191ms problems are : Problem set: 0 solved, 1 unsolved
Finished Parikh walk after 44 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=22 )
Parikh walk visited 1 properties in 10 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-00 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 490 stabilizing places and 417 stable transitions
Graph (complete) has 1192 edges and 547 vertex of which 546 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.16 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(G(p0))||F(p1))))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 533 transition count 450
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 533 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 531 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 531 transition count 448
Applied a total of 32 rules in 35 ms. Remains 531 /547 variables (removed 16) and now considering 448/464 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10507003119573495593.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12038501043009255823.kers'
[2026-05-24 12:48:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10507003119573495593.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12038501043009255823.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 531 cols 1395 entries
Finished phase 1 with 346 SingleSign rule and 77 generalized
[2026-05-24 12:48:03] [INFO ] Computed 108 invariants in 2 ms
Computed 108 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-12038501043009255823.kers
Total runtime 4 ms.
[2026-05-24 12:48:03] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-24 12:48:03] [INFO ] Invariant cache hit.
[2026-05-24 12:48:05] [INFO ] Implicit Places using invariants and state equation in 1643 ms returned []
Implicit Place search using SMT with State Equation took 1946 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2026-05-24 12:48:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/128 constraints. Problems are: Problem set: 6 solved, 441 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/148 constraints. Problems are: Problem set: 6 solved, 441 unsolved
Problem TDEAD387 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/168 constraints. Problems are: Problem set: 9 solved, 438 unsolved
SMT process timed out in 30077ms, After SMT, problems are : Problem set: 9 solved, 438 unsolved
Search for dead transitions found 9 dead transitions in 30081ms
Found 9 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 9 transitions
Dead transitions reduction (with SMT) removed 9 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/547 places, 439/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 439/439 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32083 ms. Remains : 531/547 places, 439/464 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))||F(p1))))'
Stuttering acceptance computed with spot in 275 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-01
Product exploration explored 100000 steps with 50000 reset in 286 ms.
Product exploration explored 100000 steps with 50000 reset in 215 ms.
Computed a total of 475 stabilizing places and 393 stable transitions
Graph (complete) has 1146 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.10 ms
Computed a total of 475 stabilizing places and 393 stable transitions
Detected a total of 475/531 stabilizing places and 393/439 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 7 factoid took 13 ms. Proved property starting from automaton with 4 states, 5 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLCardinality-01 finished in 32976 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(X(!p0)))) U ((p1&&X((!p0||X(X(!p0)))))||X(G((!p0||X(X(!p0))))))))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 451
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 532 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 532 transition count 449
Applied a total of 30 rules in 48 ms. Remains 532 /547 variables (removed 15) and now considering 449/464 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8393873678979442985.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6867234305325400811.kers'
[2026-05-24 12:48:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8393873678979442985.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6867234305325400811.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 449 rows 532 cols 1397 entries
Finished phase 1 with 347 SingleSign rule and 77 generalized
[2026-05-24 12:48:36] [INFO ] Computed 108 invariants in 2 ms
Computed 108 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-6867234305325400811.kers
Total runtime 3 ms.
[2026-05-24 12:48:36] [INFO ] Implicit Places using invariants in 315 ms returned []
[2026-05-24 12:48:36] [INFO ] Invariant cache hit.
[2026-05-24 12:48:38] [INFO ] Implicit Places using invariants and state equation in 1639 ms returned []
Implicit Place search using SMT with State Equation took 1957 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2026-05-24 12:48:38] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD409 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/168 constraints. Problems are: Problem set: 4 solved, 444 unsolved
SMT process timed out in 30050ms, After SMT, problems are : Problem set: 4 solved, 444 unsolved
Search for dead transitions found 4 dead transitions in 30052ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 532/547 places, 445/464 transitions.
Applied a total of 0 rules in 15 ms. Remains 532 /532 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32076 ms. Remains : 532/547 places, 445/464 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||X(X(!p0)))) U (X(G((!p0||X(X(!p0)))))||(X((!p0||X(X(!p0))))&&p1))))'
Stuttering acceptance computed with spot in 283 ms :[p0, p0, p0, p0, true, p0, p0, p0]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 19 steps with 4 reset in 1 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-02 finished in 32404 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 451
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 533 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 533 transition count 450
Applied a total of 28 rules in 33 ms. Remains 533 /547 variables (removed 14) and now considering 450/464 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7811979903881829881.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15937534222690773654.kers'
[2026-05-24 12:49:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7811979903881829881.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15937534222690773654.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 450 rows 533 cols 1399 entries
Finished phase 1 with 348 SingleSign rule and 77 generalized
[2026-05-24 12:49:08] [INFO ] Computed 108 invariants in 2 ms
Computed 108 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-15937534222690773654.kers
Total runtime 4 ms.
[2026-05-24 12:49:08] [INFO ] Implicit Places using invariants in 315 ms returned []
[2026-05-24 12:49:08] [INFO ] Invariant cache hit.
[2026-05-24 12:49:10] [INFO ] Implicit Places using invariants and state equation in 2052 ms returned []
Implicit Place search using SMT with State Equation took 2371 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2026-05-24 12:49:10] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/532 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/532 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 1/533 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/533 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/533 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/533 variables, 20/148 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Problem TDEAD389 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/533 variables, 20/168 constraints. Problems are: Problem set: 6 solved, 443 unsolved
SMT process timed out in 30062ms, After SMT, problems are : Problem set: 6 solved, 443 unsolved
Search for dead transitions found 6 dead transitions in 30065ms
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 : 533/547 places, 444/464 transitions.
Applied a total of 0 rules in 15 ms. Remains 533 /533 variables (removed 0) and now considering 444/444 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32488 ms. Remains : 533/547 places, 444/464 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 176 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-03 finished in 32695 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 U p1))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Graph (trivial) has 265 edges and 547 vertex of which 7 / 547 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 1185 edges and 541 vertex of which 540 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 539 transition count 389
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 473 transition count 389
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 134 place count 473 transition count 277
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 24 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 248 rules applied. Total rules applied 382 place count 337 transition count 277
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 393 place count 326 transition count 266
Ensure Unique test removed 1 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 405 place count 325 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 405 place count 325 transition count 264
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 409 place count 323 transition count 264
Performed 141 Post agglomeration using F-continuation condition.Transition count delta: 141
Deduced a syphon composed of 141 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 146 places and 0 transitions.
Iterating global reduction 2 with 287 rules applied. Total rules applied 696 place count 177 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 698 place count 176 transition count 126
Applied a total of 698 rules in 52 ms. Remains 176 /547 variables (removed 371) and now considering 126/464 (removed 338) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12327713008801072064.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1864582751029217198.kers'
[2026-05-24 12:49:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12327713008801072064.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1864582751029217198.kers]
Normalized transition count is 125 out of 126 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 175 cols 748 entries
Finished phase 1 with 73 SingleSign rule and 25 generalized
[2026-05-24 12:49:41] [INFO ] Computed 78 invariants in 1 ms
Computed 78 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1864582751029217198.kers
Total runtime 2 ms.
[2026-05-24 12:49:41] [INFO ] Implicit Places using invariants in 156 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 9, 12, 13, 14, 15, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48, 49]
Discarding 29 places :
Implicit Place search using SMT only with invariants took 158 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/547 places, 126/464 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 126/126 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 216 ms. Remains : 147/547 places, 126/464 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 p1))))'
Stuttering acceptance computed with spot in 79 ms :[(NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-04
Product exploration explored 100000 steps with 13042 reset in 310 ms.
Product exploration explored 100000 steps with 13147 reset in 238 ms.
Computed a total of 125 stabilizing places and 109 stable transitions
Computed a total of 125 stabilizing places and 109 stable transitions
Detected a total of 125/147 stabilizing places and 109/126 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Knowledge based reduction with 13 factoid took 59 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 2 states, 5 edges and 2 AP (stutter insensitive).
Reduction of identical properties reduced properties to check from 5 to 4
RANDOM walk for 40000 steps (6309 resets) in 747 ms. (53 steps per ms) remains 1/4 properties
BEST_FIRST walk for 40003 steps (2279 resets) in 152 ms. (261 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-15669735074837023639.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1537005046839591279.kers'
[2026-05-24 12:49:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15669735074837023639.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1537005046839591279.kers]
Normalized transition count is 125 out of 126 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 125 rows 147 cols 630 entries
Finished phase 1 with 78 SingleSign rule and 20 generalized
[2026-05-24 12:49:42] [INFO ] Computed 49 invariants in 0 ms
Computed 49 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-1537005046839591279.kers
Total runtime 1 ms.
[2026-05-24 12:49:42] [INFO ] State equation strengthened by 4 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
Problem apf0 is UNSAT
After SMT solving in domain Real declared 49/273 variables, and 3 constraints, problems are : Problem set: 1 solved, 0 unsolved in 18 ms.
Refiners :[Positive P Invariants (semi-flows): 3/39 constraints, Generalized P Invariants (flows): 0/10 constraints, State Equation: 0/147 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 23ms problems are : Problem set: 1 solved, 0 unsolved
Skipping Parikh replay, no witness traces provided.
Found 1 invariant AP formulas.
Knowledge based reduction with 14 factoid took 90 ms. Reduced automaton from 2 states, 5 edges and 2 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p1)]
Knowledge-based reduction took 460 ms.
Stuttering acceptance computed with spot in 41 ms :[(NOT p1)]
Support contains 2 out of 147 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 : 147/147 places, 126/126 transitions.
Applied a total of 0 rules in 12 ms. Remains 147 /147 variables (removed 0) and now considering 126/126 (removed 0) transitions.
[2026-05-24 12:49:42] [INFO ] Invariant cache hit.
[2026-05-24 12:49:42] [INFO ] Implicit Places using invariants in 87 ms returned []
[2026-05-24 12:49:42] [INFO ] Invariant cache hit.
[2026-05-24 12:49:42] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 12:49:43] [INFO ] Implicit Places using invariants and state equation in 386 ms returned [3, 22, 23, 25, 27, 29, 30, 45, 47, 51, 53, 57, 59, 61, 63, 65, 67, 69, 71, 73, 75, 77, 79, 81, 85, 86, 88, 90, 92]
Discarding 29 places :
Implicit Place search using SMT with State Equation took 477 ms to find 29 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 118/147 places, 126/126 transitions.
Graph (complete) has 344 edges and 118 vertex of which 109 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 109 transition count 109
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 96 transition count 109
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 36 place count 87 transition count 86
Iterating global reduction 2 with 9 rules applied. Total rules applied 45 place count 87 transition count 86
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 48 place count 87 transition count 83
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 51 place count 84 transition count 83
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 54 place count 81 transition count 80
Iterating global reduction 4 with 3 rules applied. Total rules applied 57 place count 81 transition count 80
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 60 place count 81 transition count 77
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 61 place count 80 transition count 77
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 6 with 14 rules applied. Total rules applied 75 place count 73 transition count 70
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 76 place count 73 transition count 70
Applied a total of 76 rules in 21 ms. Remains 73 /118 variables (removed 45) and now considering 70/126 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6172717447423263456.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8870970506632736274.kers'
[2026-05-24 12:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6172717447423263456.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8870970506632736274.kers]
Normalized transition count is 69 out of 70 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 69 rows 73 cols 248 entries
Finished phase 1 with 52 SingleSign rule and 4 generalized
[2026-05-24 12:49:43] [INFO ] Computed 17 invariants in 0 ms
Computed 17 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8870970506632736274.kers
Total runtime 1 ms.
[2026-05-24 12:49:43] [INFO ] Implicit Places using invariants in 57 ms returned [4, 60, 65, 70]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 58 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 69/147 places, 70/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 68 transition count 69
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 68 transition count 69
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 67 transition count 68
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 66 transition count 67
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 66 transition count 67
Applied a total of 6 rules in 6 ms. Remains 66 /69 variables (removed 3) and now considering 67/70 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9858625955984582375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18260373081474132444.kers'
[2026-05-24 12:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9858625955984582375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18260373081474132444.kers]
Normalized transition count is 66 out of 67 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 66 rows 66 cols 226 entries
Finished phase 1 with 52 SingleSign rule and 1 generalized
[2026-05-24 12:49:43] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-18260373081474132444.kers
Total runtime 0 ms.
[2026-05-24 12:49:43] [INFO ] Implicit Places using invariants in 43 ms returned []
[2026-05-24 12:49:43] [INFO ] Invariant cache hit.
[2026-05-24 12:49:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:49:43] [INFO ] Implicit Places using invariants and state equation in 77 ms returned [4, 28]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 121 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 64/147 places, 67/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 63 transition count 66
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 63 transition count 66
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 8 place count 60 transition count 63
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 9 place count 60 transition count 62
Applied a total of 9 rules in 6 ms. Remains 60 /64 variables (removed 4) and now considering 62/67 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4112200183556422192.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17755843559330263843.kers'
[2026-05-24 12:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4112200183556422192.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17755843559330263843.kers]
Normalized transition count is 61 out of 62 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 61 rows 60 cols 203 entries
Finished phase 1 with 48 SingleSign rule and 1 generalized
[2026-05-24 12:49:43] [INFO ] Computed 11 invariants in 0 ms
Computed 11 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-17755843559330263843.kers
Total runtime 0 ms.
[2026-05-24 12:49:43] [INFO ] Implicit Places using invariants in 44 ms returned [55, 59]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 44 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 58/147 places, 62/126 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 57 transition count 61
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 57 transition count 61
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 56 transition count 60
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 54 transition count 57
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 54 transition count 57
Applied a total of 8 rules in 5 ms. Remains 54 /58 variables (removed 4) and now considering 57/62 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2896154398215316630.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3577801034711754268.kers'
[2026-05-24 12:49:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2896154398215316630.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3577801034711754268.kers]
Normalized transition count is 56 out of 57 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 56 rows 54 cols 181 entries
Finished phase 1 with 45 SingleSign rule and 0 generalized
[2026-05-24 12:49:43] [INFO ] Computed 9 invariants in 0 ms
Computed 9 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3577801034711754268.kers
Total runtime 0 ms.
[2026-05-24 12:49:43] [INFO ] Implicit Places using invariants in 45 ms returned []
[2026-05-24 12:49:43] [INFO ] Invariant cache hit.
[2026-05-24 12:49:43] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-24 12:49:43] [INFO ] Implicit Places using invariants and state equation in 64 ms returned [52]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 113 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 5 : 53/147 places, 57/126 transitions.
Applied a total of 0 rules in 3 ms. Remains 53 /53 variables (removed 0) and now considering 57/57 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 6 iterations and 867 ms. Remains : 53/147 places, 57/126 transitions.
Computed a total of 31 stabilizing places and 40 stable transitions
Graph (complete) has 160 edges and 53 vertex of which 52 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 31 stabilizing places and 40 stable transitions
Detected a total of 31/53 stabilizing places and 40/57 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 4 factoid took 55 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
RANDOM walk for 449 steps (74 resets) in 6 ms. (64 steps per ms) remains 0/1 properties
Knowledge based reduction with 4 factoid took 48 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p1)]
Knowledge-based reduction took 149 ms.
Stuttering acceptance computed with spot in 44 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 48 ms :[(NOT p1)]
Product exploration explored 100000 steps with 13069 reset in 92 ms.
Product exploration explored 100000 steps with 13072 reset in 106 ms.
Built C files in :
/tmp/ltsmin9678271315811855257
[2026-05-24 12:49:43] [INFO ] Computing symmetric may disable matrix : 57 transitions.
[2026-05-24 12:49:43] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:49:43] [INFO ] Computing symmetric may enable matrix : 57 transitions.
[2026-05-24 12:49:43] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:49:43] [INFO ] Computing Do-Not-Accords matrix : 57 transitions.
[2026-05-24 12:49:43] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:49:43] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9678271315811855257
Running compilation step : cd /tmp/ltsmin9678271315811855257;'/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 261 ms.
Running link step : cd /tmp/ltsmin9678271315811855257;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 51 ms.
Running LTSmin : cd /tmp/ltsmin9678271315811855257;'/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/stateBased13899984840490068401.hoa' '--buchi-type=spotba'
LTSmin run took 1227 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-18-LTLCardinality-04 finished in 4316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 533 transition count 450
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 533 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 531 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 531 transition count 448
Applied a total of 32 rules in 35 ms. Remains 531 /547 variables (removed 16) and now considering 448/464 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7170675250710623704.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9386290071135161721.kers'
[2026-05-24 12:49:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7170675250710623704.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9386290071135161721.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 448 rows 531 cols 1395 entries
Finished phase 1 with 346 SingleSign rule and 77 generalized
[2026-05-24 12:49:45] [INFO ] Computed 108 invariants in 2 ms
Computed 108 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9386290071135161721.kers
Total runtime 4 ms.
[2026-05-24 12:49:46] [INFO ] Implicit Places using invariants in 529 ms returned []
[2026-05-24 12:49:46] [INFO ] Invariant cache hit.
[2026-05-24 12:49:47] [INFO ] Implicit Places using invariants and state equation in 1445 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2026-05-24 12:49:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/128 constraints. Problems are: Problem set: 4 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/148 constraints. Problems are: Problem set: 4 solved, 443 unsolved
Problem TDEAD389 is UNSAT
Problem TDEAD395 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/168 constraints. Problems are: Problem set: 6 solved, 441 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/979 variables, and 180 constraints, problems are : Problem set: 6 solved, 441 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 6 solved, 441 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 6 solved, 441 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/13 constraints. Problems are: Problem set: 6 solved, 441 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 93/106 constraints. Problems are: Problem set: 6 solved, 441 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 2/108 constraints. Problems are: Problem set: 6 solved, 441 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 72/180 constraints. Problems are: Problem set: 6 solved, 441 unsolved
Problem TDEAD392 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/200 constraints. Problems are: Problem set: 14 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/220 constraints. Problems are: Problem set: 14 solved, 433 unsolved
Problem TDEAD391 is UNSAT
Problem TDEAD406 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/240 constraints. Problems are: Problem set: 16 solved, 431 unsolved
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/260 constraints. Problems are: Problem set: 18 solved, 429 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/280 constraints. Problems are: Problem set: 18 solved, 429 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/531 variables, 20/300 constraints. Problems are: Problem set: 18 solved, 429 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 531/979 variables, and 300 constraints, problems are : Problem set: 18 solved, 429 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 0/447 constraints, Known Traps: 192/192 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60095ms problems are : Problem set: 18 solved, 429 unsolved
Search for dead transitions found 18 dead transitions in 60096ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/547 places, 430/464 transitions.
Applied a total of 0 rules in 10 ms. Remains 531 /531 variables (removed 0) and now considering 430/430 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62119 ms. Remains : 531/547 places, 430/464 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((p0 U X(p1)))'
Stuttering acceptance computed with spot in 139 ms :[(NOT p1), true, (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-06
Product exploration explored 100000 steps with 50000 reset in 155 ms.
Product exploration explored 100000 steps with 50000 reset in 157 ms.
Computed a total of 476 stabilizing places and 385 stable transitions
Graph (complete) has 1128 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 476 stabilizing places and 385 stable transitions
Detected a total of 476/531 stabilizing places and 385/430 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 11 factoid took 19 ms. Proved property starting from automaton with 4 states, 6 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 25 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-06 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLCardinality-06 finished in 62629 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(p0) U p1) U p0)))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 533 transition count 450
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 533 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 531 transition count 448
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 531 transition count 448
Applied a total of 32 rules in 37 ms. Remains 531 /547 variables (removed 16) and now considering 448/464 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-325691679889728082.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3964417478292903924.kers'
[2026-05-24 12:50:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-325691679889728082.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3964417478292903924.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 448 rows 531 cols 1395 entries
Finished phase 1 with 346 SingleSign rule and 77 generalized
[2026-05-24 12:50:48] [INFO ] Computed 108 invariants in 8 ms
Computed 108 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-3964417478292903924.kers
Total runtime 9 ms.
[2026-05-24 12:50:48] [INFO ] Implicit Places using invariants in 320 ms returned []
[2026-05-24 12:50:48] [INFO ] Invariant cache hit.
[2026-05-24 12:50:50] [INFO ] Implicit Places using invariants and state equation in 1592 ms returned []
Implicit Place search using SMT with State Equation took 1915 ms to find 0 implicit places.
Running 447 sub problems to find dead transitions.
[2026-05-24 12:50:50] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD414 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/128 constraints. Problems are: Problem set: 7 solved, 440 unsolved
Problem TDEAD389 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD398 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/148 constraints. Problems are: Problem set: 10 solved, 437 unsolved
Problem TDEAD387 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD408 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/168 constraints. Problems are: Problem set: 13 solved, 434 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/979 variables, and 169 constraints, problems are : Problem set: 13 solved, 434 unsolved in 30012 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 61/61 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 13 solved, 434 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/13 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 93/106 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 2/108 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 61/169 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/189 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/209 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/229 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/249 constraints. Problems are: Problem set: 13 solved, 434 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/269 constraints. Problems are: Problem set: 13 solved, 434 unsolved
SMT process timed out in 60100ms, After SMT, problems are : Problem set: 13 solved, 434 unsolved
Search for dead transitions found 13 dead transitions in 60102ms
Found 13 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 13 transitions
Dead transitions reduction (with SMT) removed 13 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/547 places, 435/464 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62073 ms. Remains : 531/547 places, 435/464 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(p0) U p1) U p0)))'
Stuttering acceptance computed with spot in 136 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-07 finished in 62244 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((G(F(p0)) U (p0 U X(G((X((p0 U p1)) U p2)))))))'
Support contains 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 534 transition count 451
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 534 transition count 451
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 532 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 532 transition count 449
Applied a total of 30 rules in 35 ms. Remains 532 /547 variables (removed 15) and now considering 449/464 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17132516988777817424.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8374709504482915828.kers'
[2026-05-24 12:51:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17132516988777817424.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8374709504482915828.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 449 rows 532 cols 1397 entries
Finished phase 1 with 347 SingleSign rule and 77 generalized
[2026-05-24 12:51:50] [INFO ] Computed 108 invariants in 6 ms
Computed 108 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8374709504482915828.kers
Total runtime 6 ms.
[2026-05-24 12:51:50] [INFO ] Implicit Places using invariants in 308 ms returned []
[2026-05-24 12:51:50] [INFO ] Invariant cache hit.
[2026-05-24 12:51:52] [INFO ] Implicit Places using invariants and state equation in 1490 ms returned []
Implicit Place search using SMT with State Equation took 1802 ms to find 0 implicit places.
Running 448 sub problems to find dead transitions.
[2026-05-24 12:51:52] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/531 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/531 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 2 (OVERLAPS) 1/532 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 448 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 448 unsolved
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD415 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/532 variables, 20/128 constraints. Problems are: Problem set: 5 solved, 443 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/532 variables, 20/148 constraints. Problems are: Problem set: 5 solved, 443 unsolved
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/532 variables, 20/168 constraints. Problems are: Problem set: 12 solved, 436 unsolved
SMT process timed out in 30177ms, After SMT, problems are : Problem set: 12 solved, 436 unsolved
Search for dead transitions found 12 dead transitions in 30178ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 532/547 places, 437/464 transitions.
Applied a total of 0 rules in 13 ms. Remains 532 /532 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32030 ms. Remains : 532/547 places, 437/464 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((G(F(p0)) U (p0 U X(G((X((p0 U p1)) U p2)))))))'
Stuttering acceptance computed with spot in 488 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-08
Product exploration explored 100000 steps with 33327 reset in 139 ms.
Product exploration explored 100000 steps with 33278 reset in 141 ms.
Computed a total of 477 stabilizing places and 392 stable transitions
Graph (complete) has 1143 edges and 532 vertex of which 531 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 477 stabilizing places and 392 stable transitions
Detected a total of 477/532 stabilizing places and 392/437 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 20 factoid took 150 ms. Reduced automaton from 11 states, 36 edges and 3 AP (stutter sensitive) to 11 states, 36 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (203 resets) in 604 ms. (66 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40004 steps (38 resets) in 168 ms. (236 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (34 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (35 resets) in 86 ms. (459 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (37 resets) in 85 ms. (465 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (35 resets) in 94 ms. (421 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (35 resets) in 159 ms. (250 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (35 resets) in 99 ms. (400 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (36 resets) in 103 ms. (384 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (38 resets) in 122 ms. (325 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-196912190325703371.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8932367730057748890.kers'
[2026-05-24 12:52:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-196912190325703371.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8932367730057748890.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 532 cols 1325 entries
Finished phase 1 with 345 SingleSign rule and 78 generalized
[2026-05-24 12:52:23] [INFO ] Computed 109 invariants in 2 ms
Computed 109 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-8932367730057748890.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, 9 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 393/467 variables, 90/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem apf3 is UNSAT
At refinement iteration 5 (OVERLAPS) 53/520 variables, 16/109 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/520 variables, 0/109 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 429/949 variables, 520/629 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/949 variables, 0/629 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 17/966 variables, 9/638 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/966 variables, 0/638 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/969 variables, 3/641 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/969 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/969 variables, 0/641 constraints. Problems are: Problem set: 1 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 969/969 variables, and 641 constraints, problems are : Problem set: 1 solved, 8 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 16/16 constraints, State Equation: 532/532 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 393/467 variables, 90/94 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 16/110 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 2/112 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 0/112 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 53/520 variables, 16/128 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SMT process timed out in 5914ms, After SMT, problems are : Problem set: 1 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 532/532 places, 437/437 transitions.
Graph (trivial) has 247 edges and 532 vertex of which 6 / 532 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 1129 edges and 527 vertex of which 526 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 526 transition count 370
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 467 transition count 370
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 120 place count 467 transition count 259
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 365 place count 333 transition count 259
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 299 rules applied. Total rules applied 664 place count 180 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 666 place count 179 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 667 place count 179 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 668 place count 178 transition count 115
Applied a total of 668 rules in 42 ms. Remains 178 /532 variables (removed 354) and now considering 115/437 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 178/532 places, 115/437 transitions.
RANDOM walk for 40000 steps (1985 resets) in 230 ms. (173 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40001 steps (965 resets) in 169 ms. (235 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (688 resets) in 122 ms. (325 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (747 resets) in 82 ms. (481 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (701 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (925 resets) in 103 ms. (384 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9495921908797508918.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3229386852922526235.kers'
[2026-05-24 12:52:30] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9495921908797508918.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3229386852922526235.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 115 rows 177 cols 686 entries
Finished phase 1 with 72 SingleSign rule and 27 generalized
[2026-05-24 12:52:30] [INFO ] Computed 79 invariants in 0 ms
Computed 79 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-3229386852922526235.kers
Total runtime 1 ms.
[2026-05-24 12:52:30] [INFO ] State equation strengthened by 7 read => feed constraints.
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 135/148 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 26/174 variables, 12/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/174 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 115/289 variables, 174/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/289 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/289 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/293 variables, 4/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/293 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/293 variables, 0/264 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 293/293 variables, and 264 constraints, problems are : Problem set: 0 solved, 5 unsolved in 328 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 135/148 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 26/174 variables, 12/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 4/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 0/104 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 115/289 variables, 174/278 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/289 variables, 7/285 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/289 variables, 5/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/289 variables, 0/290 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 4/293 variables, 4/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/293 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/293 variables, 0/294 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 293/293 variables, and 294 constraints, problems are : Problem set: 0 solved, 5 unsolved in 2090 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 178/178 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2424ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 82 steps, including 1 resets, run visited all 5 properties in 3 ms. (steps per millisecond=27 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 3 ms.
Found 1 invariant AP formulas.
Knowledge based reduction with 21 factoid took 372 ms. Reduced automaton from 11 states, 36 edges and 3 AP (stutter sensitive) to 11 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 478 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 10192 ms.
Stuttering acceptance computed with spot in 442 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Support contains 4 out of 532 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 532/532 places, 437/437 transitions.
Applied a total of 0 rules in 18 ms. Remains 532 /532 variables (removed 0) and now considering 437/437 (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-1508362088444751409.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8385494325899521164.kers'
[2026-05-24 12:52:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1508362088444751409.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8385494325899521164.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 437 rows 532 cols 1325 entries
Finished phase 1 with 345 SingleSign rule and 78 generalized
[2026-05-24 12:52:33] [INFO ] Computed 109 invariants in 8 ms
Computed 109 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-8385494325899521164.kers
Total runtime 9 ms.
[2026-05-24 12:52:34] [INFO ] Implicit Places using invariants in 306 ms returned []
[2026-05-24 12:52:34] [INFO ] Invariant cache hit.
[2026-05-24 12:52:35] [INFO ] Implicit Places using invariants and state equation in 1466 ms returned [119]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1775 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/532 places, 437/437 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 437/437 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1810 ms. Remains : 531/532 places, 437/437 transitions.
Computed a total of 476 stabilizing places and 392 stable transitions
Graph (complete) has 1138 edges and 531 vertex of which 530 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 476 stabilizing places and 392 stable transitions
Detected a total of 476/531 stabilizing places and 392/437 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge based reduction with 20 factoid took 144 ms. Reduced automaton from 11 states, 34 edges and 3 AP (stutter sensitive) to 11 states, 34 edges and 3 AP (stutter sensitive).
RANDOM walk for 40000 steps (210 resets) in 264 ms. (150 steps per ms) remains 8/10 properties
BEST_FIRST walk for 40004 steps (37 resets) in 52 ms. (754 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (34 resets) in 48 ms. (816 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (35 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (35 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (36 resets) in 46 ms. (851 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40004 steps (34 resets) in 45 ms. (869 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40003 steps (35 resets) in 59 ms. (666 steps per ms) remains 8/8 properties
BEST_FIRST walk for 40001 steps (37 resets) in 47 ms. (833 steps per ms) remains 8/8 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10846779984734239646.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2877328303224660465.kers'
[2026-05-24 12:52:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10846779984734239646.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2877328303224660465.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 531 cols 1323 entries
Finished phase 1 with 346 SingleSign rule and 77 generalized
[2026-05-24 12:52:36] [INFO ] Computed 108 invariants in 2 ms
Computed 108 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2877328303224660465.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, 8 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 387/461 variables, 88/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 58/519 variables, 17/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/519 variables, 0/108 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 429/948 variables, 519/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/948 variables, 0/627 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 17/965 variables, 9/636 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/965 variables, 0/636 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (OVERLAPS) 3/968 variables, 3/639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/968 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (OVERLAPS) 0/968 variables, 0/639 constraints. Problems are: Problem set: 0 solved, 8 unsolved
No progress, stopping.
After SMT solving in domain Real declared 968/968 variables, and 639 constraints, problems are : Problem set: 0 solved, 8 unsolved in 825 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 531/531 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 70/74 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/74 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/74 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (OVERLAPS) 387/461 variables, 88/92 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 20/112 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/461 variables, 1/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/461 variables, 0/113 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (OVERLAPS) 58/519 variables, 17/130 constraints. Problems are: Problem set: 0 solved, 8 unsolved
SMT process timed out in 5877ms, After SMT, problems are : Problem set: 0 solved, 8 unsolved
Fused 8 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 4 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 437/437 transitions.
Graph (trivial) has 247 edges and 531 vertex of which 6 / 531 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 1124 edges and 526 vertex of which 525 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 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 525 transition count 370
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 466 transition count 370
Performed 111 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 111 Pre rules applied. Total rules applied 120 place count 466 transition count 259
Deduced a syphon composed of 111 places in 0 ms
Ensure Unique test removed 23 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 245 rules applied. Total rules applied 365 place count 332 transition count 259
Performed 146 Post agglomeration using F-continuation condition.Transition count delta: 146
Deduced a syphon composed of 146 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 153 places and 0 transitions.
Iterating global reduction 2 with 299 rules applied. Total rules applied 664 place count 179 transition count 113
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 666 place count 178 transition count 116
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 667 place count 178 transition count 115
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 668 place count 177 transition count 115
Applied a total of 668 rules in 33 ms. Remains 177 /531 variables (removed 354) and now considering 115/437 (removed 322) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 177/531 places, 115/437 transitions.
RANDOM walk for 40000 steps (1959 resets) in 216 ms. (184 steps per ms) remains 5/8 properties
BEST_FIRST walk for 40002 steps (907 resets) in 133 ms. (298 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (636 resets) in 145 ms. (273 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (730 resets) in 113 ms. (350 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (911 resets) in 163 ms. (243 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (661 resets) in 123 ms. (322 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3611311137545035287.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5080230223819764162.kers'
[2026-05-24 12:52:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3611311137545035287.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5080230223819764162.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 115 rows 176 cols 684 entries
Finished phase 1 with 82 SingleSign rule and 17 generalized
[2026-05-24 12:52:42] [INFO ] Computed 78 invariants in 1 ms
Computed 78 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5080230223819764162.kers
Total runtime 1 ms.
[2026-05-24 12:52:42] [INFO ] State equation strengthened by 7 read => feed constraints.
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, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 135/148 variables, 64/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 25/173 variables, 11/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/78 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 115/288 variables, 173/251 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/288 variables, 7/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/288 variables, 0/258 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 4/292 variables, 4/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/292 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/292 variables, 0/262 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 292/292 variables, and 262 constraints, problems are : Problem set: 0 solved, 5 unsolved in 280 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 177/177 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 9/13 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/13 variables, 1/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/13 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (OVERLAPS) 135/148 variables, 64/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/68 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 25/173 variables, 11/79 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/173 variables, 1/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/173 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 115/288 variables, 173/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/288 variables, 7/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/288 variables, 5/265 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/288 variables, 1/266 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/288 variables, 2/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/288 variables, 0/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 4/292 variables, 4/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/292 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/292 variables, 0/272 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 292/292 variables, and 272 constraints, problems are : Problem set: 0 solved, 5 unsolved in 826 ms.
Refiners :[Positive P Invariants (semi-flows): 67/67 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 177/177 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1113ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 2 different solutions.
Finished Parikh walk after 642 steps, including 15 resets, run visited all 5 properties in 13 ms. (steps per millisecond=49 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 5 properties in 12 ms.
Knowledge based reduction with 20 factoid took 281 ms. Reduced automaton from 11 states, 34 edges and 3 AP (stutter sensitive) to 11 states, 34 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 472 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Knowledge-based reduction took 8479 ms.
Stuttering acceptance computed with spot in 482 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 463 ms :[(AND (NOT p0) (NOT p2)), (NOT p2), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p2)), (NOT p2), (NOT p0), (NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33349 reset in 145 ms.
Product exploration explored 100000 steps with 33228 reset in 146 ms.
Spot run failed in 79 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin9785305292901122444
[2026-05-24 12:52:45] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9785305292901122444
Running compilation step : cd /tmp/ltsmin9785305292901122444;'/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 664 ms.
Running link step : cd /tmp/ltsmin9785305292901122444;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin9785305292901122444;'/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/stateBased5734846829631914022.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 437/437 transitions.
Applied a total of 0 rules in 10 ms. Remains 531 /531 variables (removed 0) and now considering 437/437 (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-8814176477712016410.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16872521477587106094.kers'
[2026-05-24 12:53:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8814176477712016410.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16872521477587106094.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 437 rows 531 cols 1323 entries
Finished phase 1 with 346 SingleSign rule and 77 generalized
[2026-05-24 12:53:00] [INFO ] Computed 108 invariants in 5 ms
Computed 108 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16872521477587106094.kers
Total runtime 7 ms.
[2026-05-24 12:53:00] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-24 12:53:00] [INFO ] Invariant cache hit.
[2026-05-24 12:53:02] [INFO ] Implicit Places using invariants and state equation in 1501 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
Running 436 sub problems to find dead transitions.
[2026-05-24 12:53:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 91/104 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 4/108 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Problem TDEAD381 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/148 constraints. Problems are: Problem set: 1 solved, 435 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/168 constraints. Problems are: Problem set: 1 solved, 435 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 531/968 variables, and 170 constraints, problems are : Problem set: 1 solved, 435 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 91/91 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/531 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 62/62 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 435 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 13/13 constraints. Problems are: Problem set: 1 solved, 435 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 0/13 constraints. Problems are: Problem set: 1 solved, 435 unsolved
At refinement iteration 2 (OVERLAPS) 1/531 variables, 91/104 constraints. Problems are: Problem set: 1 solved, 435 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/531 variables, 4/108 constraints. Problems are: Problem set: 1 solved, 435 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/531 variables, 62/170 constraints. Problems are: Problem set: 1 solved, 435 unsolved
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/531 variables, 20/190 constraints. Problems are: Problem set: 3 solved, 433 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/531 variables, 20/210 constraints. Problems are: Problem set: 3 solved, 433 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/531 variables, 20/230 constraints. Problems are: Problem set: 3 solved, 433 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/531 variables, 20/250 constraints. Problems are: Problem set: 3 solved, 433 unsolved
Problem TDEAD396 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/531 variables, 20/270 constraints. Problems are: Problem set: 4 solved, 432 unsolved
SMT process timed out in 60206ms, After SMT, problems are : Problem set: 4 solved, 432 unsolved
Search for dead transitions found 4 dead transitions in 60208ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 531/531 places, 433/437 transitions.
Applied a total of 0 rules in 15 ms. Remains 531 /531 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62034 ms. Remains : 531/531 places, 433/437 transitions.
Built C files in :
/tmp/ltsmin8353479334235948686
[2026-05-24 12:54:02] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8353479334235948686
Running compilation step : cd /tmp/ltsmin8353479334235948686;'/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 636 ms.
Running link step : cd /tmp/ltsmin8353479334235948686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin8353479334235948686;'/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/stateBased11923514786873265124.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 12:54:17] [INFO ] Flatten gal took : 20 ms
[2026-05-24 12:54:17] [INFO ] Flatten gal took : 28 ms
[2026-05-24 12:54:17] [INFO ] Time to serialize gal into /tmp/LTL16695851492602927690.gal : 20 ms
[2026-05-24 12:54:17] [INFO ] Time to serialize properties into /tmp/LTL16354354200072712567.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16695851492602927690.gal' '-t' 'CGAL' '-hoa' '/tmp/aut420940940959799806.hoa' '-atoms' '/tmp/LTL16354354200072712567.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G((G(F("(p622==1)")))U(("(p622==1)")U(X(G((X(("(p622==1)")U("(p394==1)")))U("((p573==0)||(p74==1))"))))))))
Formula 0 simplified : F(FG!"(p622==1)" R (!"(p622==1)" R XF(!"((p573==0)||(p74==1))" & X(!"((p573==0)||(p74==1))" W (!"(p622==1)" R !"(p394==1)")))))
Detected timeout of ITS tools.
[2026-05-24 12:54:47] [INFO ] Flatten gal took : 16 ms
[2026-05-24 12:54:47] [INFO ] Applying decomposition
[2026-05-24 12:54:47] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph17551962173581066384.txt' '-o' '/tmp/graph17551962173581066384.bin' '-w' '/tmp/graph17551962173581066384.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17551962173581066384.bin' '-l' '-1' '-v' '-w' '/tmp/graph17551962173581066384.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:54:48] [INFO ] Decomposing Gal with order
[2026-05-24 12:54:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:54:48] [INFO ] Removed a total of 157 redundant transitions.
[2026-05-24 12:54:48] [INFO ] Flatten gal took : 79 ms
[2026-05-24 12:54:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 16 ms.
[2026-05-24 12:54:48] [INFO ] Time to serialize gal into /tmp/LTL803904373864443994.gal : 9 ms
[2026-05-24 12:54:48] [INFO ] Time to serialize properties into /tmp/LTL13851644017958173894.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL803904373864443994.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13851644017958173894.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((G(F("(i18.u163.p622==1)")))U(("(i18.u163.p622==1)")U(X(G((X(("(i18.u163.p622==1)")U("(i16.i1.u120.p394==1)")))U("((i19.u176.p573...190
Formula 0 simplified : F(FG!"(i18.u163.p622==1)" R (!"(i18.u163.p622==1)" R XF(!"((i19.u176.p573==0)||(i16.i0.u26.p74==1))" & X(!"((i19.u176.p573==0)||(i16...229
Reverse transition relation is NOT exact ! Due to transitions t4, t6, t295, t312, t320, t364, t381, t384, t441, t446, t448, t450, t451, t453, t455, t460, i...1503
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-18-LTLCardinality-08 finished in 192886 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 4 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Graph (trivial) has 265 edges and 547 vertex of which 7 / 547 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 1185 edges and 541 vertex of which 540 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 539 transition count 389
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 473 transition count 389
Performed 112 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 112 Pre rules applied. Total rules applied 134 place count 473 transition count 277
Deduced a syphon composed of 112 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 137 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 383 place count 336 transition count 277
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 394 place count 325 transition count 266
Ensure Unique test removed 1 places
Iterating global reduction 2 with 12 rules applied. Total rules applied 406 place count 324 transition count 266
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 406 place count 324 transition count 264
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 410 place count 322 transition count 264
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 2 with 281 rules applied. Total rules applied 691 place count 179 transition count 126
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 693 place count 178 transition count 129
Applied a total of 693 rules in 36 ms. Remains 178 /547 variables (removed 369) and now considering 129/464 (removed 335) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7189384812288550351.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6581109312170996880.kers'
[2026-05-24 12:55:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7189384812288550351.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6581109312170996880.kers]
Normalized transition count is 128 out of 129 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 128 rows 177 cols 716 entries
Finished phase 1 with 78 SingleSign rule and 23 generalized
[2026-05-24 12:55:03] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-6581109312170996880.kers
Total runtime 1 ms.
[2026-05-24 12:55:03] [INFO ] Implicit Places using invariants in 168 ms returned [1, 2, 3, 4, 5, 6, 7, 8, 11, 12, 13, 14, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42, 43, 44, 45, 46, 47, 48]
Discarding 28 places :
Implicit Place search using SMT only with invariants took 169 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/547 places, 129/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 129/129 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 209 ms. Remains : 150/547 places, 129/464 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 69 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-09 finished in 307 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Graph (trivial) has 267 edges and 547 vertex of which 7 / 547 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 1185 edges and 541 vertex of which 540 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 66 rules applied. Total rules applied 68 place count 539 transition count 389
Reduce places removed 66 places and 0 transitions.
Iterating post reduction 1 with 66 rules applied. Total rules applied 134 place count 473 transition count 389
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 113 Pre rules applied. Total rules applied 134 place count 473 transition count 276
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 251 rules applied. Total rules applied 385 place count 335 transition count 276
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 397 place count 323 transition count 264
Ensure Unique test removed 1 places
Iterating global reduction 2 with 13 rules applied. Total rules applied 410 place count 322 transition count 264
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 410 place count 322 transition count 262
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 414 place count 320 transition count 262
Performed 139 Post agglomeration using F-continuation condition.Transition count delta: 139
Deduced a syphon composed of 139 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 2 with 283 rules applied. Total rules applied 697 place count 176 transition count 123
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 699 place count 175 transition count 126
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 700 place count 174 transition count 125
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 701 place count 173 transition count 125
Applied a total of 701 rules in 39 ms. Remains 173 /547 variables (removed 374) and now considering 125/464 (removed 339) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1843875284097080683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11219504673002352232.kers'
[2026-05-24 12:55:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1843875284097080683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11219504673002352232.kers]
Normalized transition count is 124 out of 125 initially.
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 124 rows 138 cols 558 entries
Finished phase 1 with 73 SingleSign rule and 24 generalized
[2026-05-24 12:55:03] [INFO ] Computed 76 invariants in 0 ms
Computed 76 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11219504673002352232.kers
Total runtime 1 ms.
[2026-05-24 12:55:03] [INFO ] Implicit Places using invariants in 123 ms returned [49]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 124 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 172/547 places, 125/464 transitions.
Applied a total of 0 rules in 4 ms. Remains 172 /172 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 168 ms. Remains : 172/547 places, 125/464 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-10
Stuttering criterion allowed to conclude after 20 steps with 3 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-10 finished in 218 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(X(X(X(X(!F(p0))))))) U X(p1))))'
Support contains 3 out of 547 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 532 transition count 449
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 532 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 530 transition count 447
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 530 transition count 447
Applied a total of 34 rules in 37 ms. Remains 530 /547 variables (removed 17) and now considering 447/464 (removed 17) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4687549061877327216.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-415272592841334996.kers'
[2026-05-24 12:55:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4687549061877327216.kers, --Pflows, --basisKERS=/tmp/petrispot-output-415272592841334996.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 447 rows 530 cols 1393 entries
Finished phase 1 with 345 SingleSign rule and 77 generalized
[2026-05-24 12:55:03] [INFO ] Computed 108 invariants in 3 ms
Computed 108 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-415272592841334996.kers
Total runtime 5 ms.
[2026-05-24 12:55:04] [INFO ] Implicit Places using invariants in 310 ms returned []
[2026-05-24 12:55:04] [INFO ] Invariant cache hit.
[2026-05-24 12:55:05] [INFO ] Implicit Places using invariants and state equation in 1509 ms returned []
Implicit Place search using SMT with State Equation took 1822 ms to find 0 implicit places.
Running 446 sub problems to find dead transitions.
[2026-05-24 12:55:05] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 2 (OVERLAPS) 1/530 variables, 93/106 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 2/108 constraints. Problems are: Problem set: 0 solved, 446 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 20/128 constraints. Problems are: Problem set: 0 solved, 446 unsolved
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD413 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/148 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 20/168 constraints. Problems are: Problem set: 7 solved, 439 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/977 variables, and 168 constraints, problems are : Problem set: 7 solved, 439 unsolved in 30022 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 446/446 constraints, Known Traps: 60/60 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 439 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 13/13 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 0/13 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 2 (OVERLAPS) 1/530 variables, 93/106 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 2/108 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/530 variables, 60/168 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/530 variables, 20/188 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/530 variables, 20/208 constraints. Problems are: Problem set: 7 solved, 439 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/530 variables, 20/228 constraints. Problems are: Problem set: 7 solved, 439 unsolved
Problem TDEAD379 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/530 variables, 20/248 constraints. Problems are: Problem set: 14 solved, 432 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/530 variables, 20/268 constraints. Problems are: Problem set: 14 solved, 432 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/977 variables, and 268 constraints, problems are : Problem set: 14 solved, 432 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 93/93 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 0/530 constraints, PredecessorRefiner: 0/446 constraints, Known Traps: 160/160 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60092ms problems are : Problem set: 14 solved, 432 unsolved
Search for dead transitions found 14 dead transitions in 60093ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in LTL mode, iteration 1 : 530/547 places, 433/464 transitions.
Applied a total of 0 rules in 14 ms. Remains 530 /530 variables (removed 0) and now considering 433/433 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61968 ms. Remains : 530/547 places, 433/464 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(X(X(X(X(!F(p0))))))) U X(p1))))'
Stuttering acceptance computed with spot in 305 ms :[(NOT p1), (NOT p1), (NOT p1), (OR (NOT p1) p0), p0, p0, p0, true]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-11
Product exploration explored 100000 steps with 33333 reset in 127 ms.
Product exploration explored 100000 steps with 33333 reset in 129 ms.
Computed a total of 475 stabilizing places and 388 stable transitions
Graph (complete) has 1135 edges and 530 vertex of which 529 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 475 stabilizing places and 388 stable transitions
Detected a total of 475/530 stabilizing places and 388/433 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 3 factoid took 15 ms. Proved property starting from automaton with 8 states, 10 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 21 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-11 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-18-LTLCardinality-11 finished in 62592 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 547 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 547/547 places, 464/464 transitions.
Graph (trivial) has 267 edges and 547 vertex of which 7 / 547 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 1185 edges and 541 vertex of which 540 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 65 transitions
Trivial Post-agglo rules discarded 65 transitions
Performed 65 trivial Post agglomeration. Transition count delta: 65
Iterating post reduction 0 with 65 rules applied. Total rules applied 67 place count 539 transition count 390
Reduce places removed 65 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 66 rules applied. Total rules applied 133 place count 474 transition count 389
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 134 place count 473 transition count 389
Performed 113 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 113 Pre rules applied. Total rules applied 134 place count 473 transition count 276
Deduced a syphon composed of 113 places in 0 ms
Ensure Unique test removed 25 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 385 place count 335 transition count 276
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 398 place count 322 transition count 263
Ensure Unique test removed 1 places
Iterating global reduction 3 with 14 rules applied. Total rules applied 412 place count 321 transition count 263
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 412 place count 321 transition count 260
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 418 place count 318 transition count 260
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 143 places and 0 transitions.
Iterating global reduction 3 with 281 rules applied. Total rules applied 699 place count 175 transition count 122
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 701 place count 174 transition count 125
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 702 place count 173 transition count 124
Applied a total of 702 rules in 41 ms. Remains 173 /547 variables (removed 374) and now considering 124/464 (removed 340) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3543496210815888766.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14804428778341776907.kers'
[2026-05-24 12:56:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3543496210815888766.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14804428778341776907.kers]
Normalized transition count is 123 out of 124 initially.
Culling duplicate invariants (modulo rational): removing 35 columns.
Culled 35 columns in 0 ms.
// Phase 1: matrix 123 rows 138 cols 560 entries
Finished phase 1 with 73 SingleSign rule and 23 generalized
[2026-05-24 12:56:06] [INFO ] Computed 77 invariants in 1 ms
Computed 77 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14804428778341776907.kers
Total runtime 2 ms.
[2026-05-24 12:56:06] [INFO ] Implicit Places using invariants in 128 ms returned []
[2026-05-24 12:56:06] [INFO ] Invariant cache hit.
[2026-05-24 12:56:06] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 12:56:07] [INFO ] Implicit Places using invariants and state equation in 427 ms returned [51, 52, 54, 56, 58, 59, 74, 76, 80, 82, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 106, 108, 110, 112, 114, 116, 118, 120]
Discarding 28 places :
Implicit Place search using SMT with State Equation took 558 ms to find 28 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/547 places, 124/464 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 145 transition count 109
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 130 transition count 109
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 34 place count 126 transition count 104
Iterating global reduction 2 with 4 rules applied. Total rules applied 38 place count 126 transition count 104
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 2 with 3 rules applied. Total rules applied 41 place count 126 transition count 101
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 44 place count 123 transition count 101
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 60 place count 115 transition count 93
Applied a total of 60 rules in 10 ms. Remains 115 /145 variables (removed 30) and now considering 93/124 (removed 31) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13010876932083195688.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2143945585715568844.kers'
[2026-05-24 12:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13010876932083195688.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2143945585715568844.kers]
Normalized transition count is 92 out of 93 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 92 rows 85 cols 348 entries
Finished phase 1 with 45 SingleSign rule and 19 generalized
[2026-05-24 12:56:07] [INFO ] Computed 51 invariants in 1 ms
Computed 51 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-2143945585715568844.kers
Total runtime 1 ms.
[2026-05-24 12:56:07] [INFO ] Implicit Places using invariants in 84 ms returned [21, 26, 31, 102, 107, 112]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 85 ms to find 6 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 109/547 places, 93/464 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 107 transition count 91
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 107 transition count 91
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 105 transition count 89
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 103 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 103 transition count 82
Applied a total of 12 rules in 5 ms. Remains 103 /109 variables (removed 6) and now considering 82/93 (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-11661603854710167019.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12539821299969638838.kers'
[2026-05-24 12:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11661603854710167019.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12539821299969638838.kers]
Normalized transition count is 81 out of 82 initially.
Culling duplicate invariants (modulo rational): removing 30 columns.
Culled 30 columns in 0 ms.
// Phase 1: matrix 81 rows 73 cols 293 entries
Finished phase 1 with 46 SingleSign rule and 12 generalized
[2026-05-24 12:56:07] [INFO ] Computed 45 invariants in 0 ms
Computed 45 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-12539821299969638838.kers
Total runtime 1 ms.
[2026-05-24 12:56:07] [INFO ] Implicit Places using invariants in 70 ms returned []
[2026-05-24 12:56:07] [INFO ] Invariant cache hit.
[2026-05-24 12:56:07] [INFO ] State equation strengthened by 31 read => feed constraints.
[2026-05-24 12:56:07] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [2, 9, 12, 13, 14, 15, 16, 28, 29, 30, 31, 32, 33, 34, 35, 36, 37, 38, 39, 40, 41, 42]
Discarding 22 places :
Implicit Place search using SMT with State Equation took 314 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 81/547 places, 82/464 transitions.
Graph (complete) has 287 edges and 81 vertex of which 77 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.0 ms
Discarding 4 places :
Also discarding 2 output transitions
Drop transitions (Output transitions of discarded places.) removed 2 transitions
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 8 place count 70 transition count 65
Iterating global reduction 0 with 7 rules applied. Total rules applied 15 place count 70 transition count 65
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 17 place count 70 transition count 63
Applied a total of 17 rules in 7 ms. Remains 70 /81 variables (removed 11) and now considering 63/82 (removed 19) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1366146019122801813.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9080129884610554284.kers'
[2026-05-24 12:56:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1366146019122801813.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9080129884610554284.kers]
Normalized transition count is 62 out of 63 initially.
Culling duplicate invariants (modulo rational): removing 9 columns.
Culled 9 columns in 0 ms.
// Phase 1: matrix 62 rows 61 cols 200 entries
Finished phase 1 with 48 SingleSign rule and 1 generalized
[2026-05-24 12:56:07] [INFO ] Computed 21 invariants in 0 ms
Computed 21 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9080129884610554284.kers
Total runtime 1 ms.
[2026-05-24 12:56:07] [INFO ] Implicit Places using invariants in 52 ms returned [11]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 53 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 69/547 places, 63/464 transitions.
Applied a total of 0 rules in 1 ms. Remains 69 /69 variables (removed 0) and now considering 63/63 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 5 iterations and 1074 ms. Remains : 69/547 places, 63/464 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 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-18-LTLCardinality-13
Stuttering criterion allowed to conclude after 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-18-LTLCardinality-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-18-LTLCardinality-13 finished in 1184 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((G(F(p0)) U (p0 U X(G((X((p0 U p1)) U p2)))))))'
Spot run failed in 47 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-24 12:56:07] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12766128597723897670
[2026-05-24 12:56:07] [INFO ] Applying decomposition
[2026-05-24 12:56:07] [INFO ] Computing symmetric may disable matrix : 464 transitions.
[2026-05-24 12:56:07] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:56:07] [INFO ] Computing symmetric may enable matrix : 464 transitions.
[2026-05-24 12:56:07] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:56:07] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph3956255633345940399.txt' '-o' '/tmp/graph3956255633345940399.bin' '-w' '/tmp/graph3956255633345940399.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3956255633345940399.bin' '-l' '-1' '-v' '-w' '/tmp/graph3956255633345940399.weights' '-q' '0' '-e' '0.001'
[2026-05-24 12:56:07] [INFO ] Computing Do-Not-Accords matrix : 464 transitions.
[2026-05-24 12:56:07] [INFO ] Decomposing Gal with order
[2026-05-24 12:56:07] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:56:07] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 12:56:07] [INFO ] Built C files in 96ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12766128597723897670
Running compilation step : cd /tmp/ltsmin12766128597723897670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-24 12:56:07] [INFO ] Removed a total of 211 redundant transitions.
[2026-05-24 12:56:07] [INFO ] Flatten gal took : 37 ms
[2026-05-24 12:56:07] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2026-05-24 12:56:07] [INFO ] Time to serialize gal into /tmp/LTLCardinality16796012095901404945.gal : 13 ms
[2026-05-24 12:56:07] [INFO ] Time to serialize properties into /tmp/LTLCardinality11719059776344878266.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality16796012095901404945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality11719059776344878266.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G((G(F("(i4.u173.p622==1)")))U(("(i4.u173.p622==1)")U(X(G((X(("(i4.u173.p622==1)")U("(i15.i1.u122.p394==1)")))U("((i1.i2.u152.p573=...185
Formula 0 simplified : F(FG!"(i4.u173.p622==1)" R (!"(i4.u173.p622==1)" R XF(!"((i1.i2.u152.p573==0)||(i6.u28.p74==1))" & X(!"((i1.i2.u152.p573==0)||(i6.u2...222
Compilation finished in 1023 ms.
Running link step : cd /tmp/ltsmin12766128597723897670;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12766128597723897670;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' '[](([](<>((LTLAPp0==true))) U ((LTLAPp0==true) U X([]((X(((LTLAPp0==true) U (LTLAPp1==true))) U (LTLAPp2==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t4, t5, t6, t7, t295, t312, t320, t324, t381, t446, t448, t451, t453, t455, t460, i0.i0.u151....1659
Computing Next relation with stutter on 62480 deadlock states
207 unique states visited
105 strongly connected components in search stack
208 transitions explored
105 items max in DFS search stack
5625 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,56.3226,958360,1,0,1.69752e+06,1120,8466,3.56282e+06,331,4854,3386754
an accepting run exists (use option '-e' to print it)
Formula 0 is FALSE accepting run found.
FORMULA BusinessProcesses-PT-18-LTLCardinality-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 684684 ms.

BK_STOP 1779627429592

--------------------
content from stderr:

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

This is useful if one wants to reexecute the tool in the VM from the submitted image disk.

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-18"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-18, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842100587"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-18.tgz
mv BusinessProcesses-PT-18 execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;