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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.8K Mar 5 17:49 CTLCardinality.txt
-rw-r--r-- 1 mcc users 86K Mar 5 17:49 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:49 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K Mar 5 17:49 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 4.2K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 30K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:49 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 17:49 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:49 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 40K Mar 5 17:49 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:47 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 156K 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-14-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-14-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779620962781

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-14
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 11:09:23] [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 11:09:23] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 11:09:24] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2026-05-24 11:09:24] [INFO ] Transformed 624 places.
[2026-05-24 11:09:24] [INFO ] Transformed 564 transitions.
[2026-05-24 11:09:24] [INFO ] Found NUPN structural information;
[2026-05-24 11:09:24] [INFO ] Parsed PT model containing 624 places and 564 transitions and 1657 arcs in 189 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 2 formulas.
Deduced a syphon composed of 8 places in 9 ms
Reduce places removed 8 places and 8 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA BusinessProcesses-PT-14-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-14-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 29 out of 616 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 616/616 places, 556/556 transitions.
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 611 transition count 556
Discarding 86 places :
Symmetric choice reduction at 1 with 86 rule applications. Total rules 91 place count 525 transition count 470
Iterating global reduction 1 with 86 rules applied. Total rules applied 177 place count 525 transition count 470
Discarding 42 places :
Symmetric choice reduction at 1 with 42 rule applications. Total rules 219 place count 483 transition count 428
Iterating global reduction 1 with 42 rules applied. Total rules applied 261 place count 483 transition count 428
Applied a total of 261 rules in 124 ms. Remains 483 /616 variables (removed 133) and now considering 428/556 (removed 128) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10296792795495562467.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14009986911614314503.kers'
[2026-05-24 11:09:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10296792795495562467.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14009986911614314503.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 428 rows 483 cols 1380 entries
Finished phase 1 with 314 SingleSign rule and 75 generalized
[2026-05-24 11:09:24] [INFO ] Computed 94 invariants in 5 ms
Computed 94 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-14009986911614314503.kers
Total runtime 6 ms.
[2026-05-24 11:09:24] [INFO ] Implicit Places using invariants in 503 ms returned []
[2026-05-24 11:09:24] [INFO ] Invariant cache hit.
[2026-05-24 11:09:26] [INFO ] Implicit Places using invariants and state equation in 1342 ms returned []
Implicit Place search using SMT with State Equation took 1890 ms to find 0 implicit places.
Running 427 sub problems to find dead transitions.
[2026-05-24 11:09:26] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/482 variables, 15/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/482 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 2 (OVERLAPS) 1/483 variables, 76/91 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/483 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 427 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/483 variables, 20/114 constraints. Problems are: Problem set: 0 solved, 427 unsolved
Problem TDEAD327 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD364 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/483 variables, 20/134 constraints. Problems are: Problem set: 7 solved, 420 unsolved
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/483 variables, 20/154 constraints. Problems are: Problem set: 13 solved, 414 unsolved
SMT process timed out in 30293ms, After SMT, problems are : Problem set: 13 solved, 414 unsolved
Search for dead transitions found 13 dead transitions in 30308ms
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 : 483/616 places, 415/556 transitions.
Applied a total of 0 rules in 35 ms. Remains 483 /483 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32403 ms. Remains : 483/616 places, 415/556 transitions.
Starting structural reductions in LTL mode, iteration 0 : 483/483 places, 415/415 transitions.
Applied a total of 0 rules in 17 ms. Remains 483 /483 variables (removed 0) and now considering 415/415 (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-6102519396031756544.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11636472460145043661.kers'
[2026-05-24 11:09:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6102519396031756544.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11636472460145043661.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 415 rows 483 cols 1302 entries
Finished phase 1 with 313 SingleSign rule and 76 generalized
[2026-05-24 11:09:56] [INFO ] Computed 94 invariants in 2 ms
Computed 94 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11636472460145043661.kers
Total runtime 4 ms.
[2026-05-24 11:09:56] [INFO ] Implicit Places using invariants in 256 ms returned []
[2026-05-24 11:09:56] [INFO ] Invariant cache hit.
[2026-05-24 11:09:58] [INFO ] Implicit Places using invariants and state equation in 1140 ms returned [435]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1403 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 482/483 places, 415/415 transitions.
Applied a total of 0 rules in 14 ms. Remains 482 /482 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1434 ms. Remains : 482/483 places, 415/415 transitions.
Support contains 29 out of 482 places after structural reductions.
[2026-05-24 11:09:58] [INFO ] Flatten gal took : 55 ms
[2026-05-24 11:09:58] [INFO ] Flatten gal took : 32 ms
[2026-05-24 11:09:58] [INFO ] Input system was already deterministic with 415 transitions.
Reduction of identical properties reduced properties to check from 18 to 17
RANDOM walk for 40000 steps (272 resets) in 1430 ms. (27 steps per ms) remains 10/17 properties
BEST_FIRST walk for 40004 steps (42 resets) in 134 ms. (296 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (46 resets) in 90 ms. (439 steps per ms) remains 10/10 properties
BEST_FIRST walk for 40003 steps (49 resets) in 101 ms. (392 steps per ms) remains 9/10 properties
BEST_FIRST walk for 40003 steps (45 resets) in 185 ms. (215 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (47 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (49 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (46 resets) in 96 ms. (412 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (47 resets) in 84 ms. (470 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (48 resets) in 101 ms. (392 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40002 steps (47 resets) in 102 ms. (388 steps per ms) remains 8/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8643756953671711952.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13251175908296176008.kers'
[2026-05-24 11:09:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8643756953671711952.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13251175908296176008.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 415 rows 482 cols 1300 entries
Finished phase 1 with 314 SingleSign rule and 75 generalized
[2026-05-24 11:09:59] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-13251175908296176008.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 93/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 296/404 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (OVERLAPS) 62/466 variables, 14/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 7/473 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/473 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 409/882 variables, 473/566 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/882 variables, 12/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/882 variables, 0/578 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 13/895 variables, 7/585 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/895 variables, 5/590 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 895/897 variables, and 590 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 480/482 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 17/17 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/15 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 1 (OVERLAPS) 93/108 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/108 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 3 (OVERLAPS) 296/404 variables, 70/76 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/404 variables, 9/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/404 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 6 (OVERLAPS) 62/466 variables, 14/99 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 3/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 0/102 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 9 (OVERLAPS) 7/473 variables, 3/105 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/473 variables, 2/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/473 variables, 0/107 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 12 (OVERLAPS) 409/882 variables, 473/580 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/882 variables, 8/588 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/882 variables, 18/606 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/882 variables, 0/606 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 16 (OVERLAPS) 13/895 variables, 7/613 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/895 variables, 3/616 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/895 variables, 6/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/895 variables, 0/622 constraints. Problems are: Problem set: 0 solved, 8 unsolved
At refinement iteration 20 (OVERLAPS) 2/897 variables, 2/624 constraints. Problems are: Problem set: 0 solved, 8 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 897/897 variables, and 624 constraints, problems are : Problem set: 0 solved, 8 unsolved in 5008 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 482/482 constraints, PredecessorRefiner: 8/8 constraints, Known Traps: 23/23 constraints, Known Traps Along Path: 18/18 constraints]
After SMT, in 10055ms problems are : Problem set: 0 solved, 8 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 15 out of 482 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 482/482 places, 415/415 transitions.
Graph (trivial) has 216 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 7 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 1057 edges and 477 vertex of which 476 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 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 52 place count 476 transition count 357
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 102 place count 426 transition count 357
Performed 95 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 95 Pre rules applied. Total rules applied 102 place count 426 transition count 262
Deduced a syphon composed of 95 places in 1 ms
Ensure Unique test removed 15 places
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 205 rules applied. Total rules applied 307 place count 316 transition count 262
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 312 place count 311 transition count 257
Iterating global reduction 2 with 5 rules applied. Total rules applied 317 place count 311 transition count 257
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 317 place count 311 transition count 256
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 319 place count 310 transition count 256
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 568 place count 183 transition count 134
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 570 place count 182 transition count 138
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 572 place count 182 transition count 136
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 574 place count 180 transition count 136
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 3 with 5 rules applied. Total rules applied 579 place count 180 transition count 136
Applied a total of 579 rules in 98 ms. Remains 180 /482 variables (removed 302) and now considering 136/415 (removed 279) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 98 ms. Remains : 180/482 places, 136/415 transitions.
RANDOM walk for 40000 steps (1560 resets) in 397 ms. (100 steps per ms) remains 1/8 properties
BEST_FIRST walk for 1320 steps (16 resets) in 12 ms. (101 steps per ms) remains 0/1 properties
Computed a total of 130 stabilizing places and 123 stable transitions
Graph (complete) has 1064 edges and 482 vertex of which 481 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.18 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(p1)||p0) U X(!p2)))'
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 473 transition count 406
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 473 transition count 406
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 21 place count 470 transition count 403
Iterating global reduction 0 with 3 rules applied. Total rules applied 24 place count 470 transition count 403
Applied a total of 24 rules in 26 ms. Remains 470 /482 variables (removed 12) and now considering 403/415 (removed 12) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4910908052482584207.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3730025185988911857.kers'
[2026-05-24 11:10:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4910908052482584207.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3730025185988911857.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 403 rows 470 cols 1276 entries
Finished phase 1 with 303 SingleSign rule and 74 generalized
[2026-05-24 11:10:09] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3730025185988911857.kers
Total runtime 3 ms.
[2026-05-24 11:10:10] [INFO ] Implicit Places using invariants in 229 ms returned []
[2026-05-24 11:10:10] [INFO ] Invariant cache hit.
[2026-05-24 11:10:11] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1533 ms to find 0 implicit places.
Running 402 sub problems to find dead transitions.
[2026-05-24 11:10:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 402 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 402 unsolved
Problem TDEAD316 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD351 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 20/113 constraints. Problems are: Problem set: 7 solved, 395 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/133 constraints. Problems are: Problem set: 10 solved, 392 unsolved
Problem TDEAD347 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/153 constraints. Problems are: Problem set: 11 solved, 391 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 470/873 variables, and 165 constraints, problems are : Problem set: 11 solved, 391 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/470 constraints, PredecessorRefiner: 402/402 constraints, Known Traps: 72/72 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 11 solved, 391 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/469 variables, 14/14 constraints. Problems are: Problem set: 11 solved, 391 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/469 variables, 0/14 constraints. Problems are: Problem set: 11 solved, 391 unsolved
At refinement iteration 2 (OVERLAPS) 1/470 variables, 76/90 constraints. Problems are: Problem set: 11 solved, 391 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/470 variables, 3/93 constraints. Problems are: Problem set: 11 solved, 391 unsolved
Problem TDEAD331 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 72/165 constraints. Problems are: Problem set: 14 solved, 388 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 20/185 constraints. Problems are: Problem set: 16 solved, 386 unsolved
Problem TDEAD337 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/470 variables, 20/205 constraints. Problems are: Problem set: 18 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/470 variables, 20/225 constraints. Problems are: Problem set: 18 solved, 384 unsolved
Problem TDEAD317 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD340 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/470 variables, 20/245 constraints. Problems are: Problem set: 20 solved, 382 unsolved
SMT process timed out in 60119ms, After SMT, problems are : Problem set: 20 solved, 382 unsolved
Search for dead transitions found 20 dead transitions in 60124ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 470/482 places, 383/415 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 468 transition count 383
Applied a total of 2 rules in 20 ms. Remains 468 /470 variables (removed 2) and now considering 383/383 (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-15229732060524131031.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11701038199207600688.kers'
[2026-05-24 11:11:11] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15229732060524131031.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11701038199207600688.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 383 rows 468 cols 1152 entries
Finished phase 1 with 304 SingleSign rule and 67 generalized
[2026-05-24 11:11:11] [INFO ] Computed 97 invariants in 6 ms
Computed 97 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11701038199207600688.kers
Total runtime 8 ms.
[2026-05-24 11:11:11] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 11:11:11] [INFO ] Invariant cache hit.
[2026-05-24 11:11:12] [INFO ] Implicit Places using invariants and state equation in 1105 ms returned []
Implicit Place search using SMT with State Equation took 1324 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 468/482 places, 383/415 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 63031 ms. Remains : 468/482 places, 383/415 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(p1)||p0) U X(!p2)))'
Stuttering acceptance computed with spot in 340 ms :[p2, p2, (AND (NOT p1) p2), p2, true, (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-00
Stuttering criterion allowed to conclude after 135 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-00 finished in 63448 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 471 transition count 404
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 471 transition count 404
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 466 transition count 399
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 466 transition count 399
Applied a total of 32 rules in 33 ms. Remains 466 /482 variables (removed 16) and now considering 399/415 (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-8702081208945747246.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5104653240468864457.kers'
[2026-05-24 11:11:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8702081208945747246.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5104653240468864457.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 399 rows 466 cols 1268 entries
Finished phase 1 with 299 SingleSign rule and 74 generalized
[2026-05-24 11:11:13] [INFO ] Computed 93 invariants in 7 ms
Computed 93 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-5104653240468864457.kers
Total runtime 9 ms.
[2026-05-24 11:11:13] [INFO ] Implicit Places using invariants in 241 ms returned []
[2026-05-24 11:11:13] [INFO ] Invariant cache hit.
[2026-05-24 11:11:14] [INFO ] Implicit Places using invariants and state equation in 1300 ms returned []
Implicit Place search using SMT with State Equation took 1543 ms to find 0 implicit places.
Running 398 sub problems to find dead transitions.
[2026-05-24 11:11:14] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 398 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 398 unsolved
Problem TDEAD327 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/113 constraints. Problems are: Problem set: 6 solved, 392 unsolved
Problem TDEAD312 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD347 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/133 constraints. Problems are: Problem set: 11 solved, 387 unsolved
Problem TDEAD320 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/153 constraints. Problems are: Problem set: 18 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/173 constraints. Problems are: Problem set: 18 solved, 380 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 466/865 variables, and 183 constraints, problems are : Problem set: 18 solved, 380 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 398/398 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 18 solved, 380 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 14/14 constraints. Problems are: Problem set: 18 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/14 constraints. Problems are: Problem set: 18 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 76/90 constraints. Problems are: Problem set: 18 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 3/93 constraints. Problems are: Problem set: 18 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 90/183 constraints. Problems are: Problem set: 18 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/203 constraints. Problems are: Problem set: 18 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/223 constraints. Problems are: Problem set: 18 solved, 380 unsolved
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD313 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/243 constraints. Problems are: Problem set: 20 solved, 378 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/466 variables, 20/263 constraints. Problems are: Problem set: 20 solved, 378 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 466/865 variables, and 273 constraints, problems are : Problem set: 20 solved, 378 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/466 constraints, PredecessorRefiner: 0/398 constraints, Known Traps: 180/180 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60079ms problems are : Problem set: 20 solved, 378 unsolved
Search for dead transitions found 20 dead transitions in 60082ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 466/482 places, 379/415 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 464 transition count 379
Applied a total of 2 rules in 16 ms. Remains 464 /466 variables (removed 2) and now considering 379/379 (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-2237805690507234818.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16953297121805661615.kers'
[2026-05-24 11:12:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2237805690507234818.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16953297121805661615.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 379 rows 464 cols 1144 entries
Finished phase 1 with 300 SingleSign rule and 67 generalized
[2026-05-24 11:12:14] [INFO ] Computed 97 invariants in 2 ms
Computed 97 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-16953297121805661615.kers
Total runtime 4 ms.
[2026-05-24 11:12:15] [INFO ] Implicit Places using invariants in 217 ms returned []
[2026-05-24 11:12:15] [INFO ] Invariant cache hit.
[2026-05-24 11:12:16] [INFO ] Implicit Places using invariants and state equation in 1039 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 464/482 places, 379/415 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62945 ms. Remains : 464/482 places, 379/415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 93 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-02
Product exploration explored 100000 steps with 723 reset in 256 ms.
Stack based approach found an accepted trace after 3819 steps with 28 reset with depth 57 and stack size 57 in 9 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-02 finished in 63330 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Graph (trivial) has 228 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 2 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1058 edges and 477 vertex of which 476 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 475 transition count 353
Reduce places removed 54 places and 0 transitions.
Iterating post reduction 1 with 54 rules applied. Total rules applied 110 place count 421 transition count 353
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 110 place count 421 transition count 254
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 215 rules applied. Total rules applied 325 place count 305 transition count 254
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 336 place count 294 transition count 243
Iterating global reduction 2 with 11 rules applied. Total rules applied 347 place count 294 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 347 place count 294 transition count 242
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 349 place count 293 transition count 242
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 249 rules applied. Total rules applied 598 place count 166 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 600 place count 165 transition count 124
Applied a total of 600 rules in 49 ms. Remains 165 /482 variables (removed 317) and now considering 124/415 (removed 291) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-994115039470131499.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4647183884201313992.kers'
[2026-05-24 11:12:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-994115039470131499.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4647183884201313992.kers]
Normalized transition count is 123 out of 124 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 123 rows 164 cols 717 entries
Finished phase 1 with 65 SingleSign rule and 29 generalized
[2026-05-24 11:12:16] [INFO ] Computed 71 invariants in 2 ms
Computed 71 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4647183884201313992.kers
Total runtime 2 ms.
[2026-05-24 11:12:16] [INFO ] Implicit Places using invariants in 136 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 138 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 146/482 places, 124/415 transitions.
Applied a total of 0 rules in 6 ms. Remains 146 /146 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 193 ms. Remains : 146/482 places, 124/415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-05
Stuttering criterion allowed to conclude after 275 steps with 48 reset in 6 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-05 finished in 308 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 482 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Graph (trivial) has 229 edges and 482 vertex of which 6 / 482 are part of one of the 1 SCC in 1 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1058 edges and 477 vertex of which 476 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 54 transitions
Trivial Post-agglo rules discarded 54 transitions
Performed 54 trivial Post agglomeration. Transition count delta: 54
Iterating post reduction 0 with 54 rules applied. Total rules applied 56 place count 475 transition count 353
Reduce places removed 54 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 55 rules applied. Total rules applied 111 place count 421 transition count 352
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 112 place count 420 transition count 352
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 99 Pre rules applied. Total rules applied 112 place count 420 transition count 253
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 3 with 215 rules applied. Total rules applied 327 place count 304 transition count 253
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 337 place count 294 transition count 243
Iterating global reduction 3 with 10 rules applied. Total rules applied 347 place count 294 transition count 243
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 347 place count 294 transition count 242
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 349 place count 293 transition count 242
Performed 122 Post agglomeration using F-continuation condition.Transition count delta: 122
Deduced a syphon composed of 122 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 249 rules applied. Total rules applied 598 place count 166 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 600 place count 165 transition count 124
Applied a total of 600 rules in 45 ms. Remains 165 /482 variables (removed 317) and now considering 124/415 (removed 291) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12605737440576760940.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8955041717991657616.kers'
[2026-05-24 11:12:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12605737440576760940.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8955041717991657616.kers]
Normalized transition count is 123 out of 124 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 123 rows 164 cols 715 entries
Finished phase 1 with 65 SingleSign rule and 29 generalized
[2026-05-24 11:12:16] [INFO ] Computed 71 invariants in 0 ms
Computed 71 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-8955041717991657616.kers
Total runtime 1 ms.
[2026-05-24 11:12:16] [INFO ] Implicit Places using invariants in 135 ms returned [1, 2, 3, 4, 5, 6, 7, 14, 15, 19, 20, 21, 22, 23, 24, 47, 48, 49, 50, 51]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 136 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/482 places, 124/415 transitions.
Applied a total of 0 rules in 5 ms. Remains 145 /145 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 186 ms. Remains : 145/482 places, 124/415 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 44 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-06
Product exploration explored 100000 steps with 15266 reset in 278 ms.
Product exploration explored 100000 steps with 15259 reset in 229 ms.
Computed a total of 14 stabilizing places and 12 stable transitions
Computed a total of 14 stabilizing places and 12 stable transitions
Knowledge based reduction with 3 factoid took 48 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 40000 steps (6692 resets) in 512 ms. (77 steps per ms) remains 1/1 properties
BEST_FIRST walk for 33276 steps (1741 resets) in 109 ms. (302 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 56 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 p0)]
Knowledge-based reduction took 334 ms.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 2 out of 145 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 145/145 places, 124/124 transitions.
Applied a total of 0 rules in 10 ms. Remains 145 /145 variables (removed 0) and now considering 124/124 (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-2689979060856194375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6586283314265581252.kers'
[2026-05-24 11:12:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2689979060856194375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6586283314265581252.kers]
Normalized transition count is 123 out of 124 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 123 rows 145 cols 631 entries
Finished phase 1 with 65 SingleSign rule and 29 generalized
[2026-05-24 11:12:17] [INFO ] Computed 51 invariants in 1 ms
Computed 51 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6586283314265581252.kers
Total runtime 2 ms.
[2026-05-24 11:12:18] [INFO ] Implicit Places using invariants in 96 ms returned []
[2026-05-24 11:12:18] [INFO ] Invariant cache hit.
[2026-05-24 11:12:18] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 11:12:18] [INFO ] Implicit Places using invariants and state equation in 482 ms returned [1, 3, 7, 10, 18, 26, 30, 40, 41, 43, 45, 47, 49, 51, 53, 55, 57, 59, 61, 65, 67, 69, 71, 73, 75, 77, 79, 87, 89, 91, 93, 95]
Discarding 32 places :
Implicit Place search using SMT with State Equation took 581 ms to find 32 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 113/145 places, 124/124 transitions.
Graph (complete) has 339 edges and 113 vertex of which 102 are kept as prefixes of interest. Removing 11 places using SCC suffix rule.1 ms
Discarding 11 places :
Also discarding 5 output transitions
Drop transitions (Output transitions of discarded places.) removed 5 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 0 with 8 rules applied. Total rules applied 9 place count 102 transition count 111
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 17 place count 94 transition count 111
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 26 place count 85 transition count 87
Iterating global reduction 2 with 9 rules applied. Total rules applied 35 place count 85 transition count 87
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 2 with 2 rules applied. Total rules applied 37 place count 85 transition count 85
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 39 place count 83 transition count 85
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 40 place count 82 transition count 84
Iterating global reduction 4 with 1 rules applied. Total rules applied 41 place count 82 transition count 84
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 0 ms
Ensure Unique test removed 1 places
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 15 rules applied. Total rules applied 56 place count 74 transition count 77
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 4 with 2 rules applied. Total rules applied 58 place count 73 transition count 76
Applied a total of 58 rules in 19 ms. Remains 73 /113 variables (removed 40) and now considering 76/124 (removed 48) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7600876576874564297.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15724783715206202344.kers'
[2026-05-24 11:12:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7600876576874564297.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15724783715206202344.kers]
Normalized transition count is 75 out of 76 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 75 rows 73 cols 264 entries
Finished phase 1 with 49 SingleSign rule and 9 generalized
[2026-05-24 11:12:18] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-15724783715206202344.kers
Total runtime 0 ms.
[2026-05-24 11:12:18] [INFO ] Implicit Places using invariants in 53 ms returned [6]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 54 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 72/145 places, 76/124 transitions.
Applied a total of 0 rules in 4 ms. Remains 72 /72 variables (removed 0) and now considering 76/76 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 669 ms. Remains : 72/145 places, 76/124 transitions.
Computed a total of 7 stabilizing places and 8 stable transitions
Computed a total of 7 stabilizing places and 8 stable transitions
Knowledge based reduction with 3 factoid took 51 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 40000 steps (6728 resets) in 87 ms. (454 steps per ms) remains 1/1 properties
BEST_FIRST walk for 26685 steps (1411 resets) in 34 ms. (762 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 60 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 30 ms :[(NOT p0)]
Knowledge-based reduction took 180 ms.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 15465 reset in 91 ms.
Product exploration explored 100000 steps with 15503 reset in 124 ms.
Built C files in :
/tmp/ltsmin18427395417523063340
[2026-05-24 11:12:19] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2026-05-24 11:12:19] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:12:19] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2026-05-24 11:12:19] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:12:19] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2026-05-24 11:12:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:12:19] [INFO ] Built C files in 21ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18427395417523063340
Running compilation step : cd /tmp/ltsmin18427395417523063340;'/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 268 ms.
Running link step : cd /tmp/ltsmin18427395417523063340;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18427395417523063340;'/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/stateBased13365928980647833783.hoa' '--buchi-type=spotba'
LTSmin run took 92 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-06 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-14-LTLCardinality-06 finished in 2755 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||(!p1 U (p2||G(!p1))))))'
Support contains 6 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 471 transition count 404
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 471 transition count 404
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 468 transition count 401
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 468 transition count 401
Applied a total of 28 rules in 30 ms. Remains 468 /482 variables (removed 14) and now considering 401/415 (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-18425572777323115334.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17062007835247235233.kers'
[2026-05-24 11:12:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18425572777323115334.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17062007835247235233.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 401 rows 468 cols 1272 entries
Finished phase 1 with 301 SingleSign rule and 74 generalized
[2026-05-24 11:12:19] [INFO ] Computed 93 invariants in 8 ms
Computed 93 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-17062007835247235233.kers
Total runtime 9 ms.
[2026-05-24 11:12:19] [INFO ] Implicit Places using invariants in 233 ms returned []
[2026-05-24 11:12:19] [INFO ] Invariant cache hit.
[2026-05-24 11:12:21] [INFO ] Implicit Places using invariants and state equation in 1250 ms returned []
Implicit Place search using SMT with State Equation took 1491 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2026-05-24 11:12:21] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Problem TDEAD318 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/113 constraints. Problems are: Problem set: 10 solved, 390 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD344 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/133 constraints. Problems are: Problem set: 15 solved, 385 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/153 constraints. Problems are: Problem set: 15 solved, 385 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/173 constraints. Problems are: Problem set: 15 solved, 385 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 468/869 variables, and 181 constraints, problems are : Problem set: 15 solved, 385 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 400/400 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 15 solved, 385 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 14/14 constraints. Problems are: Problem set: 15 solved, 385 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/14 constraints. Problems are: Problem set: 15 solved, 385 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 76/90 constraints. Problems are: Problem set: 15 solved, 385 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/93 constraints. Problems are: Problem set: 15 solved, 385 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 88/181 constraints. Problems are: Problem set: 15 solved, 385 unsolved
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/201 constraints. Problems are: Problem set: 18 solved, 382 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/221 constraints. Problems are: Problem set: 18 solved, 382 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/241 constraints. Problems are: Problem set: 18 solved, 382 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD335 is UNSAT
At refinement iteration 8 (INCLUDED_ONLY) 0/468 variables, 20/261 constraints. Problems are: Problem set: 20 solved, 380 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/468 variables, 20/281 constraints. Problems are: Problem set: 20 solved, 380 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 468/869 variables, and 288 constraints, problems are : Problem set: 20 solved, 380 unsolved in 30010 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 0/468 constraints, PredecessorRefiner: 0/400 constraints, Known Traps: 195/195 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 20 solved, 380 unsolved
Search for dead transitions found 20 dead transitions in 60060ms
Found 20 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 20 transitions
Dead transitions reduction (with SMT) removed 20 transitions
Starting structural reductions in LTL mode, iteration 1 : 468/482 places, 381/415 transitions.
Ensure Unique test removed 2 places
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 466 transition count 381
Applied a total of 2 rules in 7 ms. Remains 466 /468 variables (removed 2) and now considering 381/381 (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-16934011661048600752.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11486181637714627426.kers'
[2026-05-24 11:13:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16934011661048600752.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11486181637714627426.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 466 cols 1148 entries
Finished phase 1 with 302 SingleSign rule and 67 generalized
[2026-05-24 11:13:21] [INFO ] Computed 97 invariants in 2 ms
Computed 97 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11486181637714627426.kers
Total runtime 3 ms.
[2026-05-24 11:13:21] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-24 11:13:21] [INFO ] Invariant cache hit.
[2026-05-24 11:13:22] [INFO ] Implicit Places using invariants and state equation in 1054 ms returned []
Implicit Place search using SMT with State Equation took 1280 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 466/482 places, 381/415 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62870 ms. Remains : 466/482 places, 381/415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((!p0 U (p1||G(!p0)))||p2)))'
Stuttering acceptance computed with spot in 112 ms :[true, (AND (NOT p1) p0 (NOT p2)), (AND (NOT p1) p0), (AND (NOT p1) p0 (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-07
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-07 finished in 63016 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&F(p1)) U (p2||(p3&&X(p1))))))'
Support contains 6 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 472 transition count 405
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 472 transition count 405
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 467 transition count 400
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 467 transition count 400
Applied a total of 30 rules in 25 ms. Remains 467 /482 variables (removed 15) and now considering 400/415 (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-1594322596318537522.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7843210564132675739.kers'
[2026-05-24 11:13:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1594322596318537522.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7843210564132675739.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 400 rows 467 cols 1270 entries
Finished phase 1 with 300 SingleSign rule and 74 generalized
[2026-05-24 11:13:22] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7843210564132675739.kers
Total runtime 3 ms.
[2026-05-24 11:13:22] [INFO ] Implicit Places using invariants in 213 ms returned []
[2026-05-24 11:13:22] [INFO ] Invariant cache hit.
[2026-05-24 11:13:23] [INFO ] Implicit Places using invariants and state equation in 1164 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Running 399 sub problems to find dead transitions.
[2026-05-24 11:13:24] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 399 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 399 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/113 constraints. Problems are: Problem set: 13 solved, 386 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/133 constraints. Problems are: Problem set: 13 solved, 386 unsolved
Problem TDEAD312 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/153 constraints. Problems are: Problem set: 16 solved, 383 unsolved
Problem TDEAD343 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/173 constraints. Problems are: Problem set: 17 solved, 382 unsolved
SMT process timed out in 30076ms, After SMT, problems are : Problem set: 17 solved, 382 unsolved
Search for dead transitions found 17 dead transitions in 30079ms
Found 17 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 17 transitions
Dead transitions reduction (with SMT) removed 17 transitions
Starting structural reductions in LTL mode, iteration 1 : 467/482 places, 383/415 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 383
Applied a total of 1 rules in 11 ms. Remains 466 /467 variables (removed 1) and now considering 383/383 (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-565717295551142785.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14259944613416730635.kers'
[2026-05-24 11:13:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-565717295551142785.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14259944613416730635.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 383 rows 466 cols 1166 entries
Finished phase 1 with 300 SingleSign rule and 71 generalized
[2026-05-24 11:13:54] [INFO ] Computed 95 invariants in 3 ms
Computed 95 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14259944613416730635.kers
Total runtime 4 ms.
[2026-05-24 11:13:54] [INFO ] Implicit Places using invariants in 200 ms returned []
[2026-05-24 11:13:54] [INFO ] Invariant cache hit.
[2026-05-24 11:13:55] [INFO ] Implicit Places using invariants and state equation in 996 ms returned [419]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1199 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 465/482 places, 383/415 transitions.
Applied a total of 0 rules in 14 ms. Remains 465 /465 variables (removed 0) and now considering 383/383 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 32710 ms. Remains : 465/482 places, 383/415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0)&&F(p1)) U (p2||(p3&&X(p1))))))'
Stuttering acceptance computed with spot in 220 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p2) (NOT p3))), (OR (AND (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p1), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p1) p2) (AND (NOT p0) (NOT p1) p3))]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-08
Product exploration explored 100000 steps with 1256 reset in 466 ms.
Stack based approach found an accepted trace after 132 steps with 1 reset with depth 5 and stack size 5 in 0 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-08 finished in 33444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&F(G(p1)))))))'
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 472 transition count 405
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 472 transition count 405
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 468 transition count 401
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 468 transition count 401
Applied a total of 28 rules in 19 ms. Remains 468 /482 variables (removed 14) and now considering 401/415 (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-13861657906608741182.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16949528480527097290.kers'
[2026-05-24 11:13:56] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13861657906608741182.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16949528480527097290.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 468 cols 1272 entries
Finished phase 1 with 301 SingleSign rule and 74 generalized
[2026-05-24 11:13:56] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-16949528480527097290.kers
Total runtime 6 ms.
[2026-05-24 11:13:56] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-24 11:13:56] [INFO ] Invariant cache hit.
[2026-05-24 11:13:57] [INFO ] Implicit Places using invariants and state equation in 1195 ms returned []
Implicit Place search using SMT with State Equation took 1419 ms to find 0 implicit places.
Running 400 sub problems to find dead transitions.
[2026-05-24 11:13:57] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/467 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/467 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 2 (OVERLAPS) 1/468 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 400 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/468 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 400 unsolved
Problem TDEAD329 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/468 variables, 20/113 constraints. Problems are: Problem set: 7 solved, 393 unsolved
Problem TDEAD313 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/468 variables, 20/133 constraints. Problems are: Problem set: 13 solved, 387 unsolved
Problem TDEAD322 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/468 variables, 20/153 constraints. Problems are: Problem set: 16 solved, 384 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/468 variables, 20/173 constraints. Problems are: Problem set: 16 solved, 384 unsolved
SMT process timed out in 30106ms, After SMT, problems are : Problem set: 16 solved, 384 unsolved
Search for dead transitions found 16 dead transitions in 30108ms
Found 16 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 16 transitions
Dead transitions reduction (with SMT) removed 16 transitions
Starting structural reductions in LTL mode, iteration 1 : 468/482 places, 385/415 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 467 transition count 385
Applied a total of 1 rules in 15 ms. Remains 467 /468 variables (removed 1) and now considering 385/385 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13888883285566254739.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12395283605996030141.kers'
[2026-05-24 11:14:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13888883285566254739.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12395283605996030141.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 385 rows 467 cols 1174 entries
Finished phase 1 with 301 SingleSign rule and 70 generalized
[2026-05-24 11:14:27] [INFO ] Computed 96 invariants in 2 ms
Computed 96 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-12395283605996030141.kers
Total runtime 3 ms.
[2026-05-24 11:14:27] [INFO ] Implicit Places using invariants in 205 ms returned []
[2026-05-24 11:14:27] [INFO ] Invariant cache hit.
[2026-05-24 11:14:28] [INFO ] Implicit Places using invariants and state equation in 1061 ms returned []
Implicit Place search using SMT with State Equation took 1268 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 467/482 places, 385/415 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32832 ms. Remains : 467/482 places, 385/415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((F(G(p0))&&p1)))))'
Stuttering acceptance computed with spot in 200 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-10
Product exploration explored 100000 steps with 677 reset in 155 ms.
Product exploration explored 100000 steps with 680 reset in 213 ms.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 1004 edges and 467 vertex of which 466 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge based reduction with 1 factoid took 39 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (270 resets) in 129 ms. (307 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40003 steps (47 resets) in 56 ms. (701 steps per ms) remains 1/1 properties
[2026-05-24 11:14:29] [INFO ] Invariant cache hit.
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) 27/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 362/391 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 67/458 variables, 20/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/458 variables, 0/96 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 379/837 variables, 458/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/837 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/850 variables, 7/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/850 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/852 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/852 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/852 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 852/852 variables, and 563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 221 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 467/467 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) 27/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 362/391 variables, 75/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/391 variables, 4/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/391 variables, 0/80 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 67/458 variables, 20/100 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/458 variables, 20/120 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5346ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 467 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 467/467 places, 385/385 transitions.
Graph (trivial) has 214 edges and 467 vertex of which 6 / 467 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 997 edges and 462 vertex of which 461 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 461 transition count 331
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 415 transition count 331
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 94 place count 415 transition count 232
Deduced a syphon composed of 99 places in 0 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 308 place count 300 transition count 232
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 309 place count 299 transition count 231
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 299 transition count 231
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 310 place count 299 transition count 230
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 312 place count 298 transition count 230
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 9 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 575 place count 162 transition count 103
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 577 place count 161 transition count 107
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 579 place count 161 transition count 105
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 581 place count 159 transition count 105
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 582 place count 159 transition count 105
Applied a total of 582 rules in 40 ms. Remains 159 /467 variables (removed 308) and now considering 105/385 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 40 ms. Remains : 159/467 places, 105/385 transitions.
RANDOM walk for 177 steps (4 resets) in 5 ms. (29 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 62 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 188 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Knowledge-based reduction took 5766 ms.
Stuttering acceptance computed with spot in 205 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Support contains 4 out of 467 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 467/467 places, 385/385 transitions.
Applied a total of 0 rules in 11 ms. Remains 467 /467 variables (removed 0) and now considering 385/385 (removed 0) transitions.
[2026-05-24 11:14:35] [INFO ] Invariant cache hit.
[2026-05-24 11:14:35] [INFO ] Implicit Places using invariants in 203 ms returned []
[2026-05-24 11:14:35] [INFO ] Invariant cache hit.
[2026-05-24 11:14:36] [INFO ] Implicit Places using invariants and state equation in 1049 ms returned []
Implicit Place search using SMT with State Equation took 1254 ms to find 0 implicit places.
Running 384 sub problems to find dead transitions.
[2026-05-24 11:14:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 76/93 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 3/96 constraints. Problems are: Problem set: 0 solved, 384 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 384 unsolved
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/136 constraints. Problems are: Problem set: 2 solved, 382 unsolved
Problem TDEAD313 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/156 constraints. Problems are: Problem set: 3 solved, 381 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/176 constraints. Problems are: Problem set: 3 solved, 381 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/196 constraints. Problems are: Problem set: 3 solved, 381 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 467/852 variables, and 196 constraints, problems are : Problem set: 3 solved, 381 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 384/384 constraints, Known Traps: 100/100 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 3 solved, 381 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/466 variables, 17/17 constraints. Problems are: Problem set: 3 solved, 381 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/466 variables, 0/17 constraints. Problems are: Problem set: 3 solved, 381 unsolved
At refinement iteration 2 (OVERLAPS) 1/467 variables, 76/93 constraints. Problems are: Problem set: 3 solved, 381 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/467 variables, 3/96 constraints. Problems are: Problem set: 3 solved, 381 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/467 variables, 100/196 constraints. Problems are: Problem set: 3 solved, 381 unsolved
Problem TDEAD314 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/467 variables, 20/216 constraints. Problems are: Problem set: 4 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/467 variables, 20/236 constraints. Problems are: Problem set: 4 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/467 variables, 20/256 constraints. Problems are: Problem set: 4 solved, 380 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/467 variables, 20/276 constraints. Problems are: Problem set: 4 solved, 380 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/467 variables, 20/296 constraints. Problems are: Problem set: 4 solved, 380 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/467 variables, 20/316 constraints. Problems are: Problem set: 4 solved, 380 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/467 variables, 20/336 constraints. Problems are: Problem set: 4 solved, 380 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 467/852 variables, and 337 constraints, problems are : Problem set: 4 solved, 380 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 76/76 constraints, Generalized P Invariants (flows): 20/20 constraints, State Equation: 0/467 constraints, PredecessorRefiner: 0/384 constraints, Known Traps: 241/241 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60060ms problems are : Problem set: 4 solved, 380 unsolved
Search for dead transitions found 4 dead transitions in 60062ms
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 : 467/467 places, 381/385 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 466 transition count 381
Applied a total of 1 rules in 6 ms. Remains 466 /467 variables (removed 1) and now considering 381/381 (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-13225769508572771538.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18020385830546761329.kers'
[2026-05-24 11:15:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13225769508572771538.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18020385830546761329.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 381 rows 466 cols 1148 entries
Finished phase 1 with 302 SingleSign rule and 67 generalized
[2026-05-24 11:15:36] [INFO ] Computed 97 invariants in 6 ms
Computed 97 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18020385830546761329.kers
Total runtime 6 ms.
[2026-05-24 11:15:36] [INFO ] Implicit Places using invariants in 212 ms returned []
[2026-05-24 11:15:36] [INFO ] Invariant cache hit.
[2026-05-24 11:15:37] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1073 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 466/467 places, 381/385 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62410 ms. Remains : 466/467 places, 381/385 transitions.
Computed a total of 123 stabilizing places and 116 stable transitions
Graph (complete) has 991 edges and 466 vertex of which 465 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.9 ms
Computed a total of 123 stabilizing places and 116 stable transitions
Knowledge based reduction with 1 factoid took 46 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
RANDOM walk for 40000 steps (274 resets) in 79 ms. (500 steps per ms) remains 1/2 properties
BEST_FIRST walk for 40004 steps (46 resets) in 33 ms. (1176 steps per ms) remains 1/1 properties
[2026-05-24 11:15:37] [INFO ] Invariant cache hit.
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) 27/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 359/388 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 69/457 variables, 22/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 375/832 variables, 457/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/832 variables, 0/554 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 13/845 variables, 7/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/845 variables, 0/561 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/847 variables, 2/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/847 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/847 variables, 0/563 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 847/847 variables, and 563 constraints, problems are : Problem set: 0 solved, 1 unsolved in 224 ms.
Refiners :[Positive P Invariants (semi-flows): 75/75 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 466/466 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) 27/29 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 359/388 variables, 74/75 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 4/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/388 variables, 0/79 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 69/457 variables, 22/101 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/457 variables, 20/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
SMT process timed out in 5242ms, After SMT, problems are : Problem set: 0 solved, 1 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 2 out of 466 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 466/466 places, 381/381 transitions.
Graph (trivial) has 214 edges and 466 vertex of which 6 / 466 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 984 edges and 461 vertex of which 460 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 48 place count 460 transition count 327
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 414 transition count 327
Performed 99 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 99 Pre rules applied. Total rules applied 94 place count 414 transition count 228
Deduced a syphon composed of 99 places in 1 ms
Ensure Unique test removed 16 places
Reduce places removed 115 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 308 place count 299 transition count 228
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 309 place count 298 transition count 227
Iterating global reduction 2 with 1 rules applied. Total rules applied 310 place count 298 transition count 227
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 310 place count 298 transition count 226
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 312 place count 297 transition count 226
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Ensure Unique test removed 11 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 265 rules applied. Total rules applied 577 place count 159 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 579 place count 158 transition count 103
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 581 place count 158 transition count 101
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 583 place count 156 transition count 101
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 584 place count 156 transition count 101
Applied a total of 584 rules in 38 ms. Remains 156 /466 variables (removed 310) and now considering 101/381 (removed 280) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 156/466 places, 101/381 transitions.
RANDOM walk for 394 steps (14 resets) in 6 ms. (56 steps per ms) remains 0/1 properties
Knowledge based reduction with 1 factoid took 55 ms. Reduced automaton from 6 states, 8 edges and 2 AP (stutter sensitive) to 6 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Knowledge-based reduction took 5609 ms.
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Stuttering acceptance computed with spot in 184 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), true, (NOT p0)]
Product exploration explored 100000 steps with 680 reset in 166 ms.
Product exploration explored 100000 steps with 683 reset in 180 ms.
Spot run failed in 77 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/ltsmin8666458034896607513
[2026-05-24 11:15:44] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8666458034896607513
Running compilation step : cd /tmp/ltsmin8666458034896607513;'/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 575 ms.
Running link step : cd /tmp/ltsmin8666458034896607513;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8666458034896607513;'/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/stateBased15766153043497966349.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 466 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 466/466 places, 381/381 transitions.
Applied a total of 0 rules in 6 ms. Remains 466 /466 variables (removed 0) and now considering 381/381 (removed 0) transitions.
[2026-05-24 11:15:59] [INFO ] Invariant cache hit.
[2026-05-24 11:15:59] [INFO ] Implicit Places using invariants in 208 ms returned []
[2026-05-24 11:15:59] [INFO ] Invariant cache hit.
[2026-05-24 11:16:00] [INFO ] Implicit Places using invariants and state equation in 856 ms returned []
Implicit Place search using SMT with State Equation took 1079 ms to find 0 implicit places.
Running 380 sub problems to find dead transitions.
[2026-05-24 11:16:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/465 variables, 19/19 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/465 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 2 (OVERLAPS) 1/466 variables, 75/94 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/466 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/466 variables, 20/117 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/466 variables, 20/137 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/466 variables, 20/157 constraints. Problems are: Problem set: 0 solved, 380 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/466 variables, 20/177 constraints. Problems are: Problem set: 0 solved, 380 unsolved
SMT process timed out in 30128ms, After SMT, problems are : Problem set: 0 solved, 380 unsolved
Search for dead transitions found 0 dead transitions in 30130ms
Finished structural reductions in LTL mode , in 1 iterations and 31216 ms. Remains : 466/466 places, 381/381 transitions.
Built C files in :
/tmp/ltsmin12077676034931977197
[2026-05-24 11:16:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12077676034931977197
Running compilation step : cd /tmp/ltsmin12077676034931977197;'/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 542 ms.
Running link step : cd /tmp/ltsmin12077676034931977197;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin12077676034931977197;'/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/stateBased17931638435885859236.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2026-05-24 11:16:45] [INFO ] Flatten gal took : 19 ms
[2026-05-24 11:16:45] [INFO ] Flatten gal took : 18 ms
[2026-05-24 11:16:45] [INFO ] Time to serialize gal into /tmp/LTL17049460953785826885.gal : 5 ms
[2026-05-24 11:16:45] [INFO ] Time to serialize properties into /tmp/LTL13266338472893030238.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17049460953785826885.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3888842510358719173.hoa' '-atoms' '/tmp/LTL13266338472893030238.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...319
Loading property file /tmp/LTL13266338472893030238.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3888842510358719173.hoa
Detected timeout of ITS tools.
[2026-05-24 11:17:00] [INFO ] Flatten gal took : 15 ms
[2026-05-24 11:17:00] [INFO ] Flatten gal took : 14 ms
[2026-05-24 11:17:00] [INFO ] Time to serialize gal into /tmp/LTL18050018458151110623.gal : 3 ms
[2026-05-24 11:17:00] [INFO ] Time to serialize properties into /tmp/LTL12203632252668939060.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18050018458151110623.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12203632252668939060.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 : !((X(X(X((F(G("((p277==0)||(p99==1))")))&&("((p521==0)||(p506==1))"))))))
Formula 0 simplified : XXX(!"((p521==0)||(p506==1))" | GF!"((p277==0)||(p99==1))")
Detected timeout of ITS tools.
[2026-05-24 11:17:15] [INFO ] Flatten gal took : 14 ms
[2026-05-24 11:17:15] [INFO ] Applying decomposition
[2026-05-24 11:17:15] [INFO ] Flatten gal took : 14 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/graph15384236155111217065.txt' '-o' '/tmp/graph15384236155111217065.bin' '-w' '/tmp/graph15384236155111217065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph15384236155111217065.bin' '-l' '-1' '-v' '-w' '/tmp/graph15384236155111217065.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:17:15] [INFO ] Decomposing Gal with order
[2026-05-24 11:17:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:17:15] [INFO ] Removed a total of 128 redundant transitions.
[2026-05-24 11:17:16] [INFO ] Flatten gal took : 81 ms
[2026-05-24 11:17:16] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 13 ms.
[2026-05-24 11:17:16] [INFO ] Time to serialize gal into /tmp/LTL8960289339966490958.gal : 9 ms
[2026-05-24 11:17:16] [INFO ] Time to serialize properties into /tmp/LTL5503688801108873698.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/LTL8960289339966490958.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5503688801108873698.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 : !((X(X(X((F(G("((i17.u91.p277==0)||(i10.u32.p99==1))")))&&("((i19.u137.p521==0)||(i5.i0.u135.p506==1))"))))))
Formula 0 simplified : XXX(!"((i19.u137.p521==0)||(i5.i0.u135.p506==1))" | GF!"((i17.u91.p277==0)||(i10.u32.p99==1))")
Detected timeout of ITS tools.
Treatment of property BusinessProcesses-PT-14-LTLCardinality-10 finished in 215070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&X(X(G(p2))))))))'
Support contains 4 out of 482 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 482/482 places, 415/415 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 473 transition count 406
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 473 transition count 406
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 22 place count 469 transition count 402
Iterating global reduction 0 with 4 rules applied. Total rules applied 26 place count 469 transition count 402
Applied a total of 26 rules in 23 ms. Remains 469 /482 variables (removed 13) and now considering 402/415 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2184092980018981423.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15025997529754921841.kers'
[2026-05-24 11:17:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2184092980018981423.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15025997529754921841.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 402 rows 469 cols 1274 entries
Finished phase 1 with 302 SingleSign rule and 74 generalized
[2026-05-24 11:17:31] [INFO ] Computed 93 invariants in 2 ms
Computed 93 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-15025997529754921841.kers
Total runtime 2 ms.
[2026-05-24 11:17:31] [INFO ] Implicit Places using invariants in 249 ms returned []
[2026-05-24 11:17:31] [INFO ] Invariant cache hit.
[2026-05-24 11:17:32] [INFO ] Implicit Places using invariants and state equation in 1475 ms returned []
Implicit Place search using SMT with State Equation took 1726 ms to find 0 implicit places.
Running 401 sub problems to find dead transitions.
[2026-05-24 11:17:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/468 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/468 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 2 (OVERLAPS) 1/469 variables, 76/90 constraints. Problems are: Problem set: 0 solved, 401 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/469 variables, 3/93 constraints. Problems are: Problem set: 0 solved, 401 unsolved
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD346 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/469 variables, 20/113 constraints. Problems are: Problem set: 9 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/469 variables, 20/133 constraints. Problems are: Problem set: 9 solved, 392 unsolved
Problem TDEAD314 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/469 variables, 20/153 constraints. Problems are: Problem set: 14 solved, 387 unsolved
Problem TDEAD348 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/469 variables, 20/173 constraints. Problems are: Problem set: 15 solved, 386 unsolved
SMT process timed out in 30143ms, After SMT, problems are : Problem set: 15 solved, 386 unsolved
Search for dead transitions found 15 dead transitions in 30145ms
Found 15 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 15 transitions
Dead transitions reduction (with SMT) removed 15 transitions
Starting structural reductions in LTL mode, iteration 1 : 469/482 places, 387/415 transitions.
Applied a total of 0 rules in 7 ms. Remains 469 /469 variables (removed 0) and now considering 387/387 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31902 ms. Remains : 469/482 places, 387/415 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((p1&&X(X(G(p2))))))))'
Stuttering acceptance computed with spot in 179 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), true, (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-14-LTLCardinality-15
Entered a terminal (fully accepting) state of product in 220 steps with 1 reset in 1 ms.
FORMULA BusinessProcesses-PT-14-LTLCardinality-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-14-LTLCardinality-15 finished in 32120 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((p0&&F(G(p1)))))))'
Spot run failed in 37 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 11:18:03] [INFO ] Flatten gal took : 17 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin141835236538112704
[2026-05-24 11:18:03] [INFO ] Computing symmetric may disable matrix : 415 transitions.
[2026-05-24 11:18:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:18:03] [INFO ] Computing symmetric may enable matrix : 415 transitions.
[2026-05-24 11:18:03] [INFO ] Applying decomposition
[2026-05-24 11:18:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:18:03] [INFO ] Flatten gal took : 13 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/graph8406734311573250183.txt' '-o' '/tmp/graph8406734311573250183.bin' '-w' '/tmp/graph8406734311573250183.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph8406734311573250183.bin' '-l' '-1' '-v' '-w' '/tmp/graph8406734311573250183.weights' '-q' '0' '-e' '0.001'
[2026-05-24 11:18:03] [INFO ] Decomposing Gal with order
[2026-05-24 11:18:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:18:03] [INFO ] Computing Do-Not-Accords matrix : 415 transitions.
[2026-05-24 11:18:03] [INFO ] Computation of Completed DNA matrix. took 21 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 11:18:03] [INFO ] Removed a total of 224 redundant transitions.
[2026-05-24 11:18:03] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin141835236538112704
Running compilation step : cd /tmp/ltsmin141835236538112704;'/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 11:18:03] [INFO ] Flatten gal took : 25 ms
[2026-05-24 11:18:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 9 ms.
[2026-05-24 11:18:03] [INFO ] Time to serialize gal into /tmp/LTLCardinality9415397046259654856.gal : 6 ms
[2026-05-24 11:18:03] [INFO ] Time to serialize properties into /tmp/LTLCardinality5742895453065522701.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/LTLCardinality9415397046259654856.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality5742895453065522701.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((i17.i1.u145.p521==0)||(i8.i0.u142.p506==1))")&&(F(G("((i15.u94.p277==0)||(i9.u34.p99==1))"))))))))
Formula 0 simplified : XXX(!"((i17.i1.u145.p521==0)||(i8.i0.u142.p506==1))" | GF!"((i15.u94.p277==0)||(i9.u34.p99==1))")
Compilation finished in 892 ms.
Running link step : cd /tmp/ltsmin141835236538112704;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin141835236538112704;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--ltl' 'X(X(X(((LTLAPp0==true)&&<>([]((LTLAPp1==true)))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t7, t8, t9, t180, t254, t282, t386, t395, t402, t407, t408, i0.i0.u78.t183, i0.i0.u82.t174, i...1433
Computing Next relation with stutter on 1206 deadlock states
Detected timeout of ITS tools.
[2026-05-24 11:40:56] [INFO ] Applying decomposition
[2026-05-24 11:40:56] [INFO ] Flatten gal took : 21 ms
[2026-05-24 11:40:56] [INFO ] Decomposing Gal with order
[2026-05-24 11:40:56] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-24 11:40:56] [INFO ] Removed a total of 101 redundant transitions.
[2026-05-24 11:40:56] [INFO ] Flatten gal took : 26 ms
[2026-05-24 11:40:56] [INFO ] Fuse similar labels procedure discarded/fused a total of 58 labels/synchronizations in 152 ms.
[2026-05-24 11:40:56] [INFO ] Time to serialize gal into /tmp/LTLCardinality3352821744823459999.gal : 8 ms
[2026-05-24 11:40:56] [INFO ] Time to serialize properties into /tmp/LTLCardinality6619005400530324970.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality3352821744823459999.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality6619005400530324970.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...276
Read 1 LTL properties
Checking formula 0 : !((X(X(X(("((i1.u204.p521==0)||(i1.u204.p506==1))")&&(F(G("((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i...257
Formula 0 simplified : XXX(!"((i1.u204.p521==0)||(i1.u204.p506==1))" | GF!"((i0.i1.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0.i0....245
Detected timeout of ITS tools.
[2026-05-24 12:04:04] [INFO ] Flatten gal took : 227 ms
[2026-05-24 12:04:06] [INFO ] Input system was already deterministic with 415 transitions.
[2026-05-24 12:04:06] [INFO ] Transformed 482 places.
[2026-05-24 12:04:06] [INFO ] Transformed 415 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2026-05-24 12:04:36] [INFO ] Time to serialize gal into /tmp/LTLCardinality11850805776008112397.gal : 5 ms
[2026-05-24 12:04:36] [INFO ] Time to serialize properties into /tmp/LTLCardinality3000877467627700313.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11850805776008112397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality3000877467627700313.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...343
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X(X(X(("((p521==0)||(p506==1))")&&(F(G("((p277==0)||(p99==1))"))))))))
Formula 0 simplified : XXX(!"((p521==0)||(p506==1))" | GF!"((p277==0)||(p99==1))")

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ 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-14"
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-14, 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-177946842000555"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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