About the Execution of ITS-Tools for BusinessProcesses-PT-12
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 686.359 | 156450.00 | 204897.00 | 1227.50 | FFFFFFFFFFTFFFFT | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2026-input.r034-tall-177946842000540.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-12, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r034-tall-177946842000540
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 636K
-rw-r--r-- 1 mcc users 6.2K Mar 5 17:51 CTLCardinality.txt
-rw-r--r-- 1 mcc users 63K Mar 5 17:51 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K Mar 5 17:51 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:51 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:46 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:46 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 126K Mar 5 17:51 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 12K Mar 5 17:51 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 111K Mar 5 17:51 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:46 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:46 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 146K 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-12-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-12-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1779619601475
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-12
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 10:46:42] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 10:46:42] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 10:46:42] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-24 10:46:42] [INFO ] Transformed 586 places.
[2026-05-24 10:46:42] [INFO ] Transformed 525 transitions.
[2026-05-24 10:46:42] [INFO ] Found NUPN structural information;
[2026-05-24 10:46:42] [INFO ] Parsed PT model containing 586 places and 525 transitions and 1560 arcs in 205 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Deduced a syphon composed of 4 places in 10 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-12-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 42 out of 582 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 582/582 places, 521/521 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 579 transition count 521
Discarding 80 places :
Symmetric choice reduction at 1 with 80 rule applications. Total rules 83 place count 499 transition count 441
Iterating global reduction 1 with 80 rules applied. Total rules applied 163 place count 499 transition count 441
Discarding 36 places :
Symmetric choice reduction at 1 with 36 rule applications. Total rules 199 place count 463 transition count 405
Iterating global reduction 1 with 36 rules applied. Total rules applied 235 place count 463 transition count 405
Applied a total of 235 rules in 125 ms. Remains 463 /582 variables (removed 119) and now considering 405/521 (removed 116) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3610404365724570716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12900397078455177548.kers'
[2026-05-24 10:46:43] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3610404365724570716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12900397078455177548.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 405 rows 463 cols 1317 entries
Finished phase 1 with 296 SingleSign rule and 72 generalized
[2026-05-24 10:46:43] [INFO ] Computed 95 invariants in 3 ms
Computed 95 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12900397078455177548.kers
Total runtime 4 ms.
[2026-05-24 10:46:43] [INFO ] Implicit Places using invariants in 530 ms returned []
[2026-05-24 10:46:43] [INFO ] Invariant cache hit.
[2026-05-24 10:46:45] [INFO ] Implicit Places using invariants and state equation in 1435 ms returned []
Implicit Place search using SMT with State Equation took 2007 ms to find 0 implicit places.
Running 404 sub problems to find dead transitions.
[2026-05-24 10:46:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 404 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 404 unsolved
Problem TDEAD335 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/135 constraints. Problems are: Problem set: 4 solved, 400 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/155 constraints. Problems are: Problem set: 4 solved, 400 unsolved
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/175 constraints. Problems are: Problem set: 12 solved, 392 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 463/868 variables, and 176 constraints, problems are : Problem set: 12 solved, 392 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 73/73 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/463 constraints, PredecessorRefiner: 404/404 constraints, Known Traps: 81/81 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 12 solved, 392 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 17/17 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/17 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 73/90 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 5/95 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 81/176 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/196 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/216 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/236 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/463 variables, 20/256 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 20/276 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/463 variables, 20/296 constraints. Problems are: Problem set: 12 solved, 392 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 20/316 constraints. Problems are: Problem set: 12 solved, 392 unsolved
SMT process timed out in 60188ms, After SMT, problems are : Problem set: 12 solved, 392 unsolved
Search for dead transitions found 12 dead transitions in 60207ms
Found 12 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 12 transitions
Dead transitions reduction (with SMT) removed 12 transitions
Starting structural reductions in LTL mode, iteration 1 : 463/582 places, 393/521 transitions.
Applied a total of 0 rules in 20 ms. Remains 463 /463 variables (removed 0) and now considering 393/393 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 62409 ms. Remains : 463/582 places, 393/521 transitions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 393/393 transitions.
Applied a total of 0 rules in 15 ms. Remains 463 /463 variables (removed 0) and now considering 393/393 (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-7641973006830375778.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9895958524851256258.kers'
[2026-05-24 10:47:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7641973006830375778.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9895958524851256258.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 393 rows 463 cols 1245 entries
Finished phase 1 with 296 SingleSign rule and 72 generalized
[2026-05-24 10:47:45] [INFO ] Computed 95 invariants in 7 ms
Computed 95 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9895958524851256258.kers
Total runtime 9 ms.
[2026-05-24 10:47:45] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 10:47:45] [INFO ] Invariant cache hit.
[2026-05-24 10:47:46] [INFO ] Implicit Places using invariants and state equation in 1226 ms returned []
Implicit Place search using SMT with State Equation took 1454 ms to find 0 implicit places.
Running 392 sub problems to find dead transitions.
[2026-05-24 10:47:46] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/462 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/462 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 2 (OVERLAPS) 1/463 variables, 73/90 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/463 variables, 5/95 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/463 variables, 20/115 constraints. Problems are: Problem set: 0 solved, 392 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/463 variables, 20/135 constraints. Problems are: Problem set: 0 solved, 392 unsolved
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD376 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/463 variables, 20/155 constraints. Problems are: Problem set: 3 solved, 389 unsolved
Problem TDEAD335 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD372 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/463 variables, 20/175 constraints. Problems are: Problem set: 13 solved, 379 unsolved
SMT process timed out in 30086ms, After SMT, problems are : Problem set: 13 solved, 379 unsolved
Search for dead transitions found 13 dead transitions in 30091ms
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 : 463/463 places, 380/393 transitions.
Applied a total of 0 rules in 14 ms. Remains 463 /463 variables (removed 0) and now considering 380/380 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31576 ms. Remains : 463/463 places, 380/393 transitions.
Support contains 42 out of 463 places after structural reductions.
[2026-05-24 10:48:17] [INFO ] Flatten gal took : 52 ms
[2026-05-24 10:48:17] [INFO ] Flatten gal took : 23 ms
[2026-05-24 10:48:17] [INFO ] Input system was already deterministic with 380 transitions.
RANDOM walk for 40000 steps (289 resets) in 2018 ms. (19 steps per ms) remains 17/34 properties
BEST_FIRST walk for 4004 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 39 ms. (100 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 34 ms. (114 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 27 ms. (143 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 11 ms. (333 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 20 ms. (190 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4001 steps (8 resets) in 31 ms. (125 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 35 ms. (111 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 10 ms. (364 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7311687359235287816.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4761742848737531208.kers'
[2026-05-24 10:48:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7311687359235287816.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4761742848737531208.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 380 rows 463 cols 1167 entries
Finished phase 1 with 296 SingleSign rule and 70 generalized
[2026-05-24 10:48:18] [INFO ] Computed 97 invariants in 2 ms
Computed 97 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4761742848737531208.kers
Total runtime 3 ms.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 110/136 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/136 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 252/388 variables, 62/73 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/388 variables, 0/73 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp14 is UNSAT
At refinement iteration 5 (OVERLAPS) 69/457 variables, 24/97 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
Problem AtomicPropp10 is UNSAT
Problem AtomicPropp12 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/457 variables, 20/117 constraints. Problems are: Problem set: 3 solved, 14 unsolved
Problem AtomicPropp15 is UNSAT
SMT process timed out in 5121ms, After SMT, problems are : Problem set: 4 solved, 13 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 22 out of 463 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 463/463 places, 380/380 transitions.
Graph (trivial) has 201 edges and 463 vertex of which 6 / 463 are part of one of the 1 SCC in 6 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 988 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 457 transition count 327
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 412 transition count 327
Performed 92 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 92 Pre rules applied. Total rules applied 92 place count 412 transition count 235
Deduced a syphon composed of 92 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 2 with 201 rules applied. Total rules applied 293 place count 303 transition count 235
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 297 place count 299 transition count 231
Iterating global reduction 2 with 4 rules applied. Total rules applied 301 place count 299 transition count 231
Performed 108 Post agglomeration using F-continuation condition.Transition count delta: 108
Deduced a syphon composed of 108 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 112 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 521 place count 187 transition count 123
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 523 place count 186 transition count 127
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 525 place count 186 transition count 125
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 527 place count 184 transition count 125
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 532 place count 184 transition count 125
Applied a total of 532 rules in 77 ms. Remains 184 /463 variables (removed 279) and now considering 125/380 (removed 255) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 184/463 places, 125/380 transitions.
RANDOM walk for 40000 steps (1149 resets) in 818 ms. (48 steps per ms) remains 4/13 properties
BEST_FIRST walk for 40002 steps (541 resets) in 169 ms. (235 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (537 resets) in 136 ms. (291 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (535 resets) in 159 ms. (250 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (554 resets) in 184 ms. (216 steps per ms) remains 4/4 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2572502966393801449.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11967534435317183675.kers'
[2026-05-24 10:48:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2572502966393801449.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11967534435317183675.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 125 rows 183 cols 650 entries
Finished phase 1 with 67 SingleSign rule and 41 generalized
[2026-05-24 10:48:23] [INFO ] Computed 76 invariants in 1 ms
Computed 76 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11967534435317183675.kers
Total runtime 1 ms.
[2026-05-24 10:48:23] [INFO ] State equation strengthened by 12 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 124/136 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/179 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 3/182 variables, 3/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/182 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 125/307 variables, 182/267 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/307 variables, 12/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/307 variables, 0/279 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 2/309 variables, 2/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/309 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/309 variables, 0/281 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 309/309 variables, and 281 constraints, problems are : Problem set: 0 solved, 4 unsolved in 958 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 184/184 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 6/12 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/12 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 124/136 variables, 53/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 43/179 variables, 18/73 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/179 variables, 9/82 constraints. Problems are: Problem set: 0 solved, 4 unsolved
Problem AtomicPropp31 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/179 variables, 4/86 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/179 variables, 1/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/179 variables, 0/87 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 3/182 variables, 3/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/182 variables, 0/90 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 12 (OVERLAPS) 125/307 variables, 182/272 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/307 variables, 12/284 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/307 variables, 3/287 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/307 variables, 1/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/307 variables, 0/288 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 17 (OVERLAPS) 2/309 variables, 2/290 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/309 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 3 unsolved
At refinement iteration 19 (OVERLAPS) 0/309 variables, 0/290 constraints. Problems are: Problem set: 1 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 309/309 variables, and 290 constraints, problems are : Problem set: 1 solved, 3 unsolved in 700 ms.
Refiners :[Positive P Invariants (semi-flows): 55/55 constraints, Generalized P Invariants (flows): 21/21 constraints, State Equation: 184/184 constraints, ReadFeed: 12/12 constraints, PredecessorRefiner: 3/4 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 1669ms problems are : Problem set: 1 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Finished Parikh walk after 2872 steps, including 74 resets, run visited all 3 properties in 40 ms. (steps per millisecond=71 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 3 properties in 44 ms.
Successfully simplified 5 atomic propositions for a total of 14 simplifications.
FORMULA BusinessProcesses-PT-12-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-12-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 448 stabilizing places and 365 stable transitions
Graph (complete) has 995 edges and 463 vertex of which 462 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.14 ms
FORMULA BusinessProcesses-PT-12-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G((X((p0&&X(p1)))||F(p2))))))'
Support contains 5 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 457 transition count 374
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 457 transition count 374
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 455 transition count 372
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 455 transition count 372
Applied a total of 16 rules in 24 ms. Remains 455 /463 variables (removed 8) and now considering 372/380 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7711875892495630668.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9440707968656104899.kers'
[2026-05-24 10:48:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7711875892495630668.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9440707968656104899.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 455 cols 1151 entries
Finished phase 1 with 288 SingleSign rule and 70 generalized
[2026-05-24 10:48:26] [INFO ] Computed 97 invariants in 6 ms
Computed 97 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-9440707968656104899.kers
Total runtime 7 ms.
[2026-05-24 10:48:26] [INFO ] Implicit Places using invariants in 236 ms returned []
[2026-05-24 10:48:26] [INFO ] Invariant cache hit.
[2026-05-24 10:48:27] [INFO ] Implicit Places using invariants and state equation in 1520 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1767 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/463 places, 372/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 454 /454 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1804 ms. Remains : 454/463 places, 372/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G((X((p0&&X(p1)))||F(p2))))))'
Stuttering acceptance computed with spot in 650 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), false]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-00
Stuttering criterion allowed to conclude after 140 steps with 0 reset in 5 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-00 finished in 2566 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((G(F(!p0))||(p1&&F(!p0))))&&F(p2)))||(F(p3)&&F((p2&&F((G(F(!p0))||(p1&&F(!p0)))))))))'
Support contains 3 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Graph (trivial) has 209 edges and 463 vertex of which 6 / 463 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 989 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 45 transitions
Trivial Post-agglo rules discarded 45 transitions
Performed 45 trivial Post agglomeration. Transition count delta: 45
Iterating post reduction 0 with 45 rules applied. Total rules applied 47 place count 456 transition count 327
Reduce places removed 45 places and 0 transitions.
Iterating post reduction 1 with 45 rules applied. Total rules applied 92 place count 411 transition count 327
Performed 96 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 96 Pre rules applied. Total rules applied 92 place count 411 transition count 231
Deduced a syphon composed of 96 places in 0 ms
Ensure Unique test removed 17 places
Reduce places removed 113 places and 0 transitions.
Iterating global reduction 2 with 209 rules applied. Total rules applied 301 place count 298 transition count 231
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 306 place count 293 transition count 226
Iterating global reduction 2 with 5 rules applied. Total rules applied 311 place count 293 transition count 226
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 311 place count 293 transition count 225
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 313 place count 292 transition count 225
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 557 place count 168 transition count 105
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 559 place count 167 transition count 109
Applied a total of 559 rules in 47 ms. Remains 167 /463 variables (removed 296) and now considering 109/380 (removed 271) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10729530258116532680.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7607798970783713693.kers'
[2026-05-24 10:48:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10729530258116532680.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7607798970783713693.kers]
Normalized transition count is 108 out of 109 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 108 rows 166 cols 627 entries
Finished phase 1 with 51 SingleSign rule and 40 generalized
[2026-05-24 10:48:28] [INFO ] Computed 76 invariants in 1 ms
Computed 76 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7607798970783713693.kers
Total runtime 2 ms.
[2026-05-24 10:48:28] [INFO ] Implicit Places using invariants in 138 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 20 places :
Implicit Place search using SMT only with invariants took 139 ms to find 20 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 147/463 places, 109/380 transitions.
Applied a total of 0 rules in 6 ms. Remains 147 /147 variables (removed 0) and now considering 109/109 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 192 ms. Remains : 147/463 places, 109/380 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((G(F(p0))||(p1&&F(p0))))&&F(p2)))||(F(p3)&&F((p2&&F((G(F(p0))||(p1&&F(p0)))))))))'
Stuttering acceptance computed with spot in 351 ms :[(OR (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p3)), (NOT p0), (NOT p0), (AND (NOT p2) (NOT p3)), (NOT p2), (OR (AND (NOT p0) (NOT p3)) (AND (NOT p2) (NOT p3))), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-01 finished in 593 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 456 transition count 373
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 373
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 455 transition count 372
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 455 transition count 372
Applied a total of 16 rules in 29 ms. Remains 455 /463 variables (removed 8) and now considering 372/380 (removed 8) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12301879450346262562.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10831430463558561673.kers'
[2026-05-24 10:48:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12301879450346262562.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10831430463558561673.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 372 rows 455 cols 1151 entries
Finished phase 1 with 288 SingleSign rule and 70 generalized
[2026-05-24 10:48:29] [INFO ] Computed 97 invariants in 2 ms
Computed 97 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10831430463558561673.kers
Total runtime 2 ms.
[2026-05-24 10:48:29] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-24 10:48:29] [INFO ] Invariant cache hit.
[2026-05-24 10:48:31] [INFO ] Implicit Places using invariants and state equation in 1724 ms returned [383]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1976 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 454/463 places, 372/380 transitions.
Applied a total of 0 rules in 22 ms. Remains 454 /454 variables (removed 0) and now considering 372/372 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 2027 ms. Remains : 454/463 places, 372/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 172 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-05
Stuttering criterion allowed to conclude after 197 steps with 0 reset in 4 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-05 finished in 2243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((p1 U (p2||G(p1))))&&p0)))))'
Support contains 8 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 456 transition count 373
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 454 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 454 transition count 371
Applied a total of 18 rules in 29 ms. Remains 454 /463 variables (removed 9) and now considering 371/380 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3919521458654235859.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16161027584123745713.kers'
[2026-05-24 10:48:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3919521458654235859.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16161027584123745713.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 371 rows 454 cols 1149 entries
Finished phase 1 with 287 SingleSign rule and 70 generalized
[2026-05-24 10:48:31] [INFO ] Computed 97 invariants in 5 ms
Computed 97 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-16161027584123745713.kers
Total runtime 7 ms.
[2026-05-24 10:48:31] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-24 10:48:31] [INFO ] Invariant cache hit.
[2026-05-24 10:48:33] [INFO ] Implicit Places using invariants and state equation in 1672 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1925 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/463 places, 371/380 transitions.
Applied a total of 0 rules in 10 ms. Remains 453 /453 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1966 ms. Remains : 453/463 places, 371/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G((X((p1 U (p2||G(p1))))&&p0)))))'
Stuttering acceptance computed with spot in 182 ms :[true, (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-06
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-06 finished in 2184 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Graph (trivial) has 213 edges and 463 vertex of which 6 / 463 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 989 edges and 458 vertex of which 457 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 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 456 transition count 325
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 409 transition count 325
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 96 place count 409 transition count 227
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 310 place count 293 transition count 227
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 317 place count 286 transition count 220
Iterating global reduction 2 with 7 rules applied. Total rules applied 324 place count 286 transition count 220
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 324 place count 286 transition count 219
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 326 place count 285 transition count 219
Performed 117 Post agglomeration using F-continuation condition.Transition count delta: 117
Deduced a syphon composed of 117 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 2 with 238 rules applied. Total rules applied 564 place count 164 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 566 place count 163 transition count 106
Applied a total of 566 rules in 42 ms. Remains 163 /463 variables (removed 300) and now considering 106/380 (removed 274) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16672453436476052273.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12092309414250712412.kers'
[2026-05-24 10:48:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16672453436476052273.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12092309414250712412.kers]
Normalized transition count is 105 out of 106 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 105 rows 162 cols 603 entries
Finished phase 1 with 48 SingleSign rule and 40 generalized
[2026-05-24 10:48:33] [INFO ] Computed 75 invariants in 0 ms
Computed 75 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12092309414250712412.kers
Total runtime 1 ms.
[2026-05-24 10:48:33] [INFO ] Implicit Places using invariants in 135 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 136 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 144/463 places, 106/380 transitions.
Applied a total of 0 rules in 6 ms. Remains 144 /144 variables (removed 0) and now considering 106/106 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 184 ms. Remains : 144/463 places, 106/380 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 92 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-07
Stuttering criterion allowed to conclude after 12 steps with 2 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-07 finished in 299 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X((!p1||X(p2)))) U (p3&&G(p0)))))'
Support contains 6 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 456 transition count 373
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 454 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 454 transition count 371
Applied a total of 18 rules in 27 ms. Remains 454 /463 variables (removed 9) and now considering 371/380 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6576015627362169033.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11595468080659288586.kers'
[2026-05-24 10:48:33] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6576015627362169033.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11595468080659288586.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 371 rows 454 cols 1149 entries
Finished phase 1 with 287 SingleSign rule and 70 generalized
[2026-05-24 10:48:33] [INFO ] Computed 97 invariants in 6 ms
Computed 97 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11595468080659288586.kers
Total runtime 7 ms.
[2026-05-24 10:48:34] [INFO ] Implicit Places using invariants in 237 ms returned []
[2026-05-24 10:48:34] [INFO ] Invariant cache hit.
[2026-05-24 10:48:35] [INFO ] Implicit Places using invariants and state equation in 1593 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1834 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/463 places, 371/380 transitions.
Applied a total of 0 rules in 11 ms. Remains 453 /453 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1872 ms. Remains : 453/463 places, 371/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||X((!p1||X(p2)))) U (p3&&G(p0)))))'
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p3) (NOT p0)), (OR (NOT p3) (NOT p0)), (AND p1 (NOT p2)), (NOT p0), (NOT p2), true]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-08
Product exploration explored 100000 steps with 25069 reset in 213 ms.
Stack based approach found an accepted trace after 334 steps with 82 reset with depth 5 and stack size 5 in 1 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-08 FALSE TECHNIQUES STACK_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-08 finished in 2370 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U (G(p0)||(p0&&(G(p1)||(p1&&F(!p2))))))))'
Support contains 5 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 456 transition count 373
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 454 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 454 transition count 371
Applied a total of 18 rules in 29 ms. Remains 454 /463 variables (removed 9) and now considering 371/380 (removed 9) transitions.
[2026-05-24 10:48:36] [INFO ] Invariant cache hit.
[2026-05-24 10:48:36] [INFO ] Implicit Places using invariants in 224 ms returned []
[2026-05-24 10:48:36] [INFO ] Invariant cache hit.
[2026-05-24 10:48:38] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1927 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/463 places, 371/380 transitions.
Applied a total of 0 rules in 14 ms. Remains 453 /453 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1971 ms. Remains : 453/463 places, 371/380 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 (G(p0)||(p0&&(G(p1)||(p1&&F(!p2))))))))'
Stuttering acceptance computed with spot in 286 ms :[true, p2, (NOT p0), (NOT p0), (AND (NOT p0) p2), (AND p2 (NOT p0) (NOT p1)), (AND p2 (NOT p1))]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-10
Product exploration explored 100000 steps with 50000 reset in 165 ms.
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Computed a total of 438 stabilizing places and 356 stable transitions
Graph (complete) has 977 edges and 453 vertex of which 452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Computed a total of 438 stabilizing places and 356 stable transitions
Detected a total of 438/453 stabilizing places and 356/371 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 12 ms. Proved property starting from automaton with 7 states, 15 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 28 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-12-LTLFireability-10 finished in 2675 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U ((!p0&&X(X(p0)))||X(X(G(p0)))))))'
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 456 transition count 373
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 454 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 454 transition count 371
Applied a total of 18 rules in 27 ms. Remains 454 /463 variables (removed 9) and now considering 371/380 (removed 9) transitions.
[2026-05-24 10:48:38] [INFO ] Invariant cache hit.
[2026-05-24 10:48:39] [INFO ] Implicit Places using invariants in 239 ms returned []
[2026-05-24 10:48:39] [INFO ] Invariant cache hit.
[2026-05-24 10:48:40] [INFO ] Implicit Places using invariants and state equation in 1638 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1881 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/463 places, 371/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 453 /453 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1920 ms. Remains : 453/463 places, 371/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(X(p0)) U (X(X(G(p0)))||(!p0&&X(X(p0)))))))'
Stuttering acceptance computed with spot in 176 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0), true]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-11
Entered a terminal (fully accepting) state of product in 7 steps with 1 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-11 finished in 2126 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Graph (trivial) has 213 edges and 463 vertex of which 6 / 463 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 989 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 49 place count 456 transition count 325
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 96 place count 409 transition count 325
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 96 place count 409 transition count 227
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 310 place count 293 transition count 227
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 316 place count 287 transition count 221
Iterating global reduction 2 with 6 rules applied. Total rules applied 322 place count 287 transition count 221
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 120
Deduced a syphon composed of 120 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 124 places and 0 transitions.
Iterating global reduction 2 with 244 rules applied. Total rules applied 566 place count 163 transition count 101
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 568 place count 162 transition count 105
Applied a total of 568 rules in 43 ms. Remains 162 /463 variables (removed 301) and now considering 105/380 (removed 275) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3875021982190881231.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11440036800574850243.kers'
[2026-05-24 10:48:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3875021982190881231.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11440036800574850243.kers]
Normalized transition count is 104 out of 105 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 104 rows 161 cols 617 entries
Finished phase 1 with 47 SingleSign rule and 40 generalized
[2026-05-24 10:48:41] [INFO ] Computed 75 invariants in 0 ms
Computed 75 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-11440036800574850243.kers
Total runtime 1 ms.
[2026-05-24 10:48:41] [INFO ] Implicit Places using invariants in 128 ms returned [1, 2, 6, 7, 30, 31, 32, 33, 40, 41, 42, 47, 48, 49, 50, 51, 52, 53, 54]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 130 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/463 places, 105/380 transitions.
Applied a total of 0 rules in 5 ms. Remains 143 /143 variables (removed 0) and now considering 105/105 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 178 ms. Remains : 143/463 places, 105/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-13
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-13 finished in 243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !p1))'
Support contains 2 out of 463 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Graph (trivial) has 211 edges and 463 vertex of which 6 / 463 are part of one of the 1 SCC in 0 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 989 edges and 458 vertex of which 457 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 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 456 transition count 326
Reduce places removed 46 places and 0 transitions.
Iterating post reduction 1 with 46 rules applied. Total rules applied 94 place count 410 transition count 326
Performed 98 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 98 Pre rules applied. Total rules applied 94 place count 410 transition count 228
Deduced a syphon composed of 98 places in 1 ms
Ensure Unique test removed 18 places
Reduce places removed 116 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 308 place count 294 transition count 228
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 313 place count 289 transition count 223
Iterating global reduction 2 with 5 rules applied. Total rules applied 318 place count 289 transition count 223
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 318 place count 289 transition count 222
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 320 place count 288 transition count 222
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 119
Deduced a syphon composed of 119 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 123 places and 0 transitions.
Iterating global reduction 2 with 242 rules applied. Total rules applied 562 place count 165 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 564 place count 164 transition count 107
Applied a total of 564 rules in 44 ms. Remains 164 /463 variables (removed 299) and now considering 107/380 (removed 273) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10268265956907856529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12451187603138671446.kers'
[2026-05-24 10:48:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10268265956907856529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12451187603138671446.kers]
Normalized transition count is 106 out of 107 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 106 rows 163 cols 621 entries
Finished phase 1 with 49 SingleSign rule and 40 generalized
[2026-05-24 10:48:41] [INFO ] Computed 75 invariants in 0 ms
Computed 75 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12451187603138671446.kers
Total runtime 2 ms.
[2026-05-24 10:48:41] [INFO ] Implicit Places using invariants in 132 ms returned [1, 2, 5, 6, 29, 30, 31, 32, 39, 40, 41, 46, 47, 48, 49, 50, 51, 52, 53]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 133 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 145/463 places, 107/380 transitions.
Applied a total of 0 rules in 4 ms. Remains 145 /145 variables (removed 0) and now considering 107/107 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 182 ms. Remains : 145/463 places, 107/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U !p1))'
Stuttering acceptance computed with spot in 63 ms :[p1, (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-14
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-12-LTLFireability-14 finished in 268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 463 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 463/463 places, 380/380 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 456 transition count 373
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 456 transition count 373
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 454 transition count 371
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 454 transition count 371
Applied a total of 18 rules in 29 ms. Remains 454 /463 variables (removed 9) and now considering 371/380 (removed 9) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17703771111948475375.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16032336247061834993.kers'
[2026-05-24 10:48:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17703771111948475375.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16032336247061834993.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 371 rows 454 cols 1149 entries
Finished phase 1 with 287 SingleSign rule and 70 generalized
[2026-05-24 10:48:41] [INFO ] Computed 97 invariants in 6 ms
Computed 97 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-16032336247061834993.kers
Total runtime 8 ms.
[2026-05-24 10:48:41] [INFO ] Implicit Places using invariants in 250 ms returned []
[2026-05-24 10:48:41] [INFO ] Invariant cache hit.
[2026-05-24 10:48:43] [INFO ] Implicit Places using invariants and state equation in 1617 ms returned [382]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 1870 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 453/463 places, 371/380 transitions.
Applied a total of 0 rules in 12 ms. Remains 453 /453 variables (removed 0) and now considering 371/371 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1911 ms. Remains : 453/463 places, 371/380 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Stuttering acceptance computed with spot in 158 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-12-LTLFireability-15
Product exploration explored 100000 steps with 25000 reset in 114 ms.
Product exploration explored 100000 steps with 25000 reset in 126 ms.
Computed a total of 438 stabilizing places and 356 stable transitions
Graph (complete) has 977 edges and 453 vertex of which 452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 438 stabilizing places and 356 stable transitions
Detected a total of 438/453 stabilizing places and 356/371 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 50 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 37569 steps (272 resets) in 205 ms. (182 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 48 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 123 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 308 ms.
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 1 out of 453 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 453/453 places, 371/371 transitions.
Applied a total of 0 rules in 9 ms. Remains 453 /453 variables (removed 0) and now considering 371/371 (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-10741527897833042605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1206371472471397340.kers'
[2026-05-24 10:48:44] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10741527897833042605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1206371472471397340.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 371 rows 453 cols 1147 entries
Finished phase 1 with 288 SingleSign rule and 69 generalized
[2026-05-24 10:48:44] [INFO ] Computed 96 invariants in 2 ms
Computed 96 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1206371472471397340.kers
Total runtime 2 ms.
[2026-05-24 10:48:44] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-24 10:48:44] [INFO ] Invariant cache hit.
[2026-05-24 10:48:45] [INFO ] Implicit Places using invariants and state equation in 1352 ms returned []
Implicit Place search using SMT with State Equation took 1578 ms to find 0 implicit places.
Running 370 sub problems to find dead transitions.
[2026-05-24 10:48:45] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/452 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/452 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 2 (OVERLAPS) 1/453 variables, 73/91 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/453 variables, 5/96 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/453 variables, 20/116 constraints. Problems are: Problem set: 0 solved, 370 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/453 variables, 20/136 constraints. Problems are: Problem set: 0 solved, 370 unsolved
Problem TDEAD341 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/453 variables, 20/156 constraints. Problems are: Problem set: 1 solved, 369 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/453 variables, 20/176 constraints. Problems are: Problem set: 1 solved, 369 unsolved
SMT process timed out in 30096ms, After SMT, problems are : Problem set: 1 solved, 369 unsolved
Search for dead transitions found 1 dead transitions in 30100ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in LTL mode, iteration 1 : 453/453 places, 370/371 transitions.
Applied a total of 0 rules in 12 ms. Remains 453 /453 variables (removed 0) and now considering 370/370 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31702 ms. Remains : 453/453 places, 370/371 transitions.
Computed a total of 438 stabilizing places and 355 stable transitions
Graph (complete) has 975 edges and 453 vertex of which 452 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.5 ms
Computed a total of 438 stabilizing places and 355 stable transitions
Detected a total of 438/453 stabilizing places and 355/370 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge based reduction with 2 factoid took 55 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
RANDOM walk for 28379 steps (204 resets) in 63 ms. (443 steps per ms) remains 0/1 properties
Knowledge based reduction with 2 factoid took 61 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Knowledge-based reduction took 307 ms.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 175 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 121 ms.
Product exploration explored 100000 steps with 25000 reset in 124 ms.
Spot run failed in 78 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/ltsmin16353779611832908778
[2026-05-24 10:49:17] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16353779611832908778
Running compilation step : cd /tmp/ltsmin16353779611832908778;'/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 687 ms.
Running link step : cd /tmp/ltsmin16353779611832908778;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 49 ms.
Running LTSmin : cd /tmp/ltsmin16353779611832908778;'/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/stateBased14479861529736423760.hoa' '--buchi-type=spotba'
LTSmin run took 55 ms.
FORMULA BusinessProcesses-PT-12-LTLFireability-15 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-12-LTLFireability-15 finished in 36344 ms.
All properties solved by simple procedures.
Total runtime 155231 ms.
BK_STOP 1779619757925
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
+ VERSION=202604301425
+ echo 'Running Version 202604301425'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="BusinessProcesses-PT-12"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is BusinessProcesses-PT-12, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r034-tall-177946842000540"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/BusinessProcesses-PT-12.tgz
mv BusinessProcesses-PT-12 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh
echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;