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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 600K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:53 CTLCardinality.txt
-rw-r--r-- 1 mcc users 72K Mar 5 17:53 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Mar 5 17:53 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 5 17:53 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 4.0K Mar 15 07:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.8K Mar 5 17:53 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 5 17:53 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 17:53 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 90K Mar 5 17:53 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 161K 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-17-LTLFireability-00
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-01
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-02
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-03
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-04
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-05
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-06
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-07
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-08
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-09
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-10
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-11
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-12
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-13
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-14
FORMULA_NAME BusinessProcesses-PT-17-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779625355845

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-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-24 12:22:36] [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 12:22:37] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 12:22:37] [INFO ] Load time of PNML (sax parser for PT used): 103 ms
[2026-05-24 12:22:37] [INFO ] Transformed 650 places.
[2026-05-24 12:22:37] [INFO ] Transformed 580 transitions.
[2026-05-24 12:22:37] [INFO ] Found NUPN structural information;
[2026-05-24 12:22:37] [INFO ] Parsed PT model containing 650 places and 580 transitions and 1709 arcs in 212 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 4 places in 11 ms
Reduce places removed 4 places and 4 transitions.
FORMULA BusinessProcesses-PT-17-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-17-LTLFireability-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 45 out of 646 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 646/646 places, 576/576 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 643 transition count 576
Discarding 85 places :
Symmetric choice reduction at 1 with 85 rule applications. Total rules 88 place count 558 transition count 491
Iterating global reduction 1 with 85 rules applied. Total rules applied 173 place count 558 transition count 491
Discarding 41 places :
Symmetric choice reduction at 1 with 41 rule applications. Total rules 214 place count 517 transition count 450
Iterating global reduction 1 with 41 rules applied. Total rules applied 255 place count 517 transition count 450
Applied a total of 255 rules in 145 ms. Remains 517 /646 variables (removed 129) and now considering 450/576 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8938388026302228686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2250566927817531447.kers'
[2026-05-24 12:22:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8938388026302228686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2250566927817531447.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 450 rows 517 cols 1446 entries
Finished phase 1 with 333 SingleSign rule and 79 generalized
[2026-05-24 12:22:37] [INFO ] Computed 105 invariants in 3 ms
Computed 105 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2250566927817531447.kers
Total runtime 5 ms.
[2026-05-24 12:22:38] [INFO ] Implicit Places using invariants in 513 ms returned []
[2026-05-24 12:22:38] [INFO ] Invariant cache hit.
[2026-05-24 12:22:39] [INFO ] Implicit Places using invariants and state equation in 1324 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
Running 449 sub problems to find dead transitions.
[2026-05-24 12:22:39] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 449 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 449 unsolved
Problem TDEAD401 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD421 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 20/165 constraints. Problems are: Problem set: 4 solved, 445 unsolved
SMT process timed out in 30164ms, After SMT, problems are : Problem set: 4 solved, 445 unsolved
Search for dead transitions found 4 dead transitions in 30184ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in LTL mode, iteration 1 : 517/646 places, 446/576 transitions.
Applied a total of 0 rules in 28 ms. Remains 517 /517 variables (removed 0) and now considering 446/446 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 32283 ms. Remains : 517/646 places, 446/576 transitions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 446/446 transitions.
Applied a total of 0 rules in 20 ms. Remains 517 /517 variables (removed 0) and now considering 446/446 (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-14059476982614295342.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6464104692623793948.kers'
[2026-05-24 12:23:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14059476982614295342.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6464104692623793948.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 446 rows 517 cols 1422 entries
Finished phase 1 with 333 SingleSign rule and 79 generalized
[2026-05-24 12:23:09] [INFO ] Computed 105 invariants in 8 ms
Computed 105 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-6464104692623793948.kers
Total runtime 10 ms.
[2026-05-24 12:23:10] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-24 12:23:10] [INFO ] Invariant cache hit.
[2026-05-24 12:23:11] [INFO ] Implicit Places using invariants and state equation in 1086 ms returned []
Implicit Place search using SMT with State Equation took 1378 ms to find 0 implicit places.
Running 445 sub problems to find dead transitions.
[2026-05-24 12:23:11] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/516 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/516 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 2 (OVERLAPS) 1/517 variables, 81/98 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/517 variables, 7/105 constraints. Problems are: Problem set: 0 solved, 445 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/517 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 445 unsolved
Problem TDEAD382 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/517 variables, 20/145 constraints. Problems are: Problem set: 11 solved, 434 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/517 variables, 20/165 constraints. Problems are: Problem set: 11 solved, 434 unsolved
SMT process timed out in 30129ms, After SMT, problems are : Problem set: 11 solved, 434 unsolved
Search for dead transitions found 11 dead transitions in 30134ms
Found 11 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 11 transitions
Dead transitions reduction (with SMT) removed 11 transitions
Starting structural reductions in LTL mode, iteration 1 : 517/517 places, 435/446 transitions.
Applied a total of 0 rules in 15 ms. Remains 517 /517 variables (removed 0) and now considering 435/435 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31551 ms. Remains : 517/517 places, 435/446 transitions.
Support contains 45 out of 517 places after structural reductions.
[2026-05-24 12:23:41] [INFO ] Flatten gal took : 59 ms
[2026-05-24 12:23:41] [INFO ] Flatten gal took : 29 ms
[2026-05-24 12:23:41] [INFO ] Input system was already deterministic with 435 transitions.
Support contains 43 out of 517 places (down from 45) after GAL structural reductions.
RANDOM walk for 40000 steps (261 resets) in 1615 ms. (24 steps per ms) remains 13/30 properties
BEST_FIRST walk for 40004 steps (42 resets) in 193 ms. (206 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40004 steps (44 resets) in 160 ms. (248 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (45 resets) in 124 ms. (320 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (42 resets) in 144 ms. (275 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (48 resets) in 152 ms. (261 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (46 resets) in 129 ms. (307 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40004 steps (44 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (45 resets) in 117 ms. (339 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40003 steps (43 resets) in 112 ms. (354 steps per ms) remains 9/12 properties
BEST_FIRST walk for 40004 steps (46 resets) in 142 ms. (279 steps per ms) remains 9/9 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10189893777912854604.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7706726949881431741.kers'
[2026-05-24 12:23:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10189893777912854604.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7706726949881431741.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 435 rows 517 cols 1356 entries
Finished phase 1 with 333 SingleSign rule and 79 generalized
[2026-05-24 12:23:42] [INFO ] Computed 105 invariants in 2 ms
Computed 105 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-7706726949881431741.kers
Total runtime 3 ms.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 109/128 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/128 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 311/439 variables, 75/83 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/439 variables, 6/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/439 variables, 0/89 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem AtomicPropp16 is UNSAT
At refinement iteration 6 (OVERLAPS) 72/511 variables, 22/111 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp9 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/511 variables, 20/131 constraints. Problems are: Problem set: 3 solved, 6 unsolved
SMT process timed out in 5029ms, After SMT, problems are : Problem set: 3 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 12 out of 517 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 517/517 places, 435/435 transitions.
Graph (trivial) has 236 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 8 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 1121 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 511 transition count 369
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 453 transition count 369
Performed 102 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 102 Pre rules applied. Total rules applied 118 place count 453 transition count 267
Deduced a syphon composed of 102 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 122 places and 0 transitions.
Iterating global reduction 2 with 224 rules applied. Total rules applied 342 place count 331 transition count 267
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 352 place count 321 transition count 257
Iterating global reduction 2 with 10 rules applied. Total rules applied 362 place count 321 transition count 257
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 132 places and 0 transitions.
Iterating global reduction 2 with 260 rules applied. Total rules applied 622 place count 189 transition count 129
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 624 place count 188 transition count 133
Free-agglomeration rule applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 626 place count 188 transition count 131
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 628 place count 186 transition count 131
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 633 place count 186 transition count 131
Applied a total of 633 rules in 122 ms. Remains 186 /517 variables (removed 331) and now considering 131/435 (removed 304) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 122 ms. Remains : 186/517 places, 131/435 transitions.
RANDOM walk for 40000 steps (1028 resets) in 1205 ms. (33 steps per ms) remains 2/6 properties
BEST_FIRST walk for 40002 steps (528 resets) in 248 ms. (160 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (564 resets) in 190 ms. (209 steps per ms) remains 2/2 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4134212003404080957.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1614071013956846588.kers'
[2026-05-24 12:23:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4134212003404080957.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1614071013956846588.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 131 rows 185 cols 751 entries
Finished phase 1 with 60 SingleSign rule and 45 generalized
[2026-05-24 12:23:48] [INFO ] Computed 81 invariants in 0 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-1614071013956846588.kers
Total runtime 1 ms.
[2026-05-24 12:23:48] [INFO ] State equation strengthened by 13 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 27/31 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Problem AtomicPropp28 is UNSAT
At refinement iteration 2 (INCLUDED_ONLY) 0/31 variables, 2/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/31 variables, 0/8 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 117/148 variables, 58/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/184 variables, 17/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 131/315 variables, 184/267 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 13/280 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 0/280 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 2/317 variables, 2/282 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/317 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/317 variables, 0/282 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 317/317 variables, and 282 constraints, problems are : Problem set: 1 solved, 1 unsolved in 234 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 186/186 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 4/5 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/5 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 143/148 variables, 63/64 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/148 variables, 2/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/148 variables, 0/66 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 36/184 variables, 17/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/184 variables, 0/83 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 131/315 variables, 184/267 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/315 variables, 13/280 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/315 variables, 1/281 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/315 variables, 0/281 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 12 (OVERLAPS) 2/317 variables, 2/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/317 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/317 variables, 0/283 constraints. Problems are: Problem set: 1 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 317/317 variables, and 283 constraints, problems are : Problem set: 1 solved, 1 unsolved in 188 ms.
Refiners :[Positive P Invariants (semi-flows): 64/64 constraints, Generalized P Invariants (flows): 17/17 constraints, State Equation: 186/186 constraints, ReadFeed: 13/13 constraints, PredecessorRefiner: 1/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 434ms problems are : Problem set: 1 solved, 1 unsolved
Finished Parikh walk after 2808 steps, including 74 resets, run visited all 1 properties in 17 ms. (steps per millisecond=165 )
Parikh walk visited 1 properties in 26 ms.
Successfully simplified 4 atomic propositions for a total of 12 simplifications.
FORMULA BusinessProcesses-PT-17-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 217 stabilizing places and 189 stable transitions
Graph (complete) has 1128 edges and 517 vertex of which 516 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.15 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 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Graph (trivial) has 242 edges and 517 vertex of which 6 / 517 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 1122 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 510 transition count 369
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 452 transition count 369
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 118 place count 452 transition count 262
Deduced a syphon composed of 107 places in 2 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 352 place count 325 transition count 262
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 362 place count 315 transition count 252
Iterating global reduction 2 with 10 rules applied. Total rules applied 372 place count 315 transition count 252
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 372 place count 315 transition count 251
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 374 place count 314 transition count 251
Performed 131 Post agglomeration using F-continuation condition.Transition count delta: 131
Deduced a syphon composed of 131 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 136 places and 0 transitions.
Iterating global reduction 2 with 267 rules applied. Total rules applied 641 place count 178 transition count 120
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 643 place count 177 transition count 124
Applied a total of 643 rules in 48 ms. Remains 177 /517 variables (removed 340) and now considering 124/435 (removed 311) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10852493754733004481.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14761772075388797404.kers'
[2026-05-24 12:23:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10852493754733004481.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14761772075388797404.kers]
Normalized transition count is 123 out of 124 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 123 rows 176 cols 733 entries
Finished phase 1 with 56 SingleSign rule and 41 generalized
[2026-05-24 12:23:49] [INFO ] Computed 80 invariants in 0 ms
Computed 80 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14761772075388797404.kers
Total runtime 4 ms.
[2026-05-24 12:23:49] [INFO ] Implicit Places using invariants in 209 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 210 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 155/517 places, 124/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 155 /155 variables (removed 0) and now considering 124/124 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 267 ms. Remains : 155/517 places, 124/435 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 271 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-01
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-01 finished in 607 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)&&F(G(p1)))))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Graph (trivial) has 243 edges and 517 vertex of which 6 / 517 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 1122 edges and 512 vertex of which 511 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 59 transitions
Trivial Post-agglo rules discarded 59 transitions
Performed 59 trivial Post agglomeration. Transition count delta: 59
Iterating post reduction 0 with 59 rules applied. Total rules applied 61 place count 510 transition count 368
Reduce places removed 59 places and 0 transitions.
Iterating post reduction 1 with 59 rules applied. Total rules applied 120 place count 451 transition count 368
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 120 place count 451 transition count 261
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 234 rules applied. Total rules applied 354 place count 324 transition count 261
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 364 place count 314 transition count 251
Iterating global reduction 2 with 10 rules applied. Total rules applied 374 place count 314 transition count 251
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 374 place count 314 transition count 250
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 376 place count 313 transition count 250
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 639 place count 179 transition count 121
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 641 place count 178 transition count 125
Applied a total of 641 rules in 41 ms. Remains 178 /517 variables (removed 339) and now considering 125/435 (removed 310) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17020397499359882817.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5494075131655974703.kers'
[2026-05-24 12:23:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17020397499359882817.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5494075131655974703.kers]
Normalized transition count is 124 out of 125 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 124 rows 177 cols 730 entries
Finished phase 1 with 57 SingleSign rule and 41 generalized
[2026-05-24 12:23:49] [INFO ] Computed 80 invariants in 0 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-5494075131655974703.kers
Total runtime 1 ms.
[2026-05-24 12:23:49] [INFO ] Implicit Places using invariants in 162 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 164 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 156/517 places, 125/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 156 /156 variables (removed 0) and now considering 125/125 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 212 ms. Remains : 156/517 places, 125/435 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)&&F(G(p1)))))'
Stuttering acceptance computed with spot in 143 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-03
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-03 finished in 384 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(F(p0))))||(p1 U (p2||G(p1)))))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Graph (trivial) has 239 edges and 517 vertex of which 6 / 517 are part of one of the 1 SCC in 4 ms
Free SCC test removed 5 places
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1122 edges and 512 vertex of which 511 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 510 transition count 371
Reduce places removed 56 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 57 rules applied. Total rules applied 115 place count 454 transition count 370
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 116 place count 453 transition count 370
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 106 Pre rules applied. Total rules applied 116 place count 453 transition count 264
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 3 with 232 rules applied. Total rules applied 348 place count 327 transition count 264
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 358 place count 317 transition count 254
Iterating global reduction 3 with 10 rules applied. Total rules applied 368 place count 317 transition count 254
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 368 place count 317 transition count 253
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 370 place count 316 transition count 253
Performed 130 Post agglomeration using F-continuation condition.Transition count delta: 130
Deduced a syphon composed of 130 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 3 with 264 rules applied. Total rules applied 634 place count 182 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 3 with 2 rules applied. Total rules applied 636 place count 181 transition count 127
Applied a total of 636 rules in 55 ms. Remains 181 /517 variables (removed 336) and now considering 127/435 (removed 308) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-723436159023974186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13050883307037879017.kers'
[2026-05-24 12:23:50] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-723436159023974186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13050883307037879017.kers]
Normalized transition count is 126 out of 127 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 126 rows 180 cols 742 entries
Finished phase 1 with 57 SingleSign rule and 43 generalized
[2026-05-24 12:23:50] [INFO ] Computed 81 invariants in 1 ms
Computed 81 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13050883307037879017.kers
Total runtime 1 ms.
[2026-05-24 12:23:50] [INFO ] Implicit Places using invariants in 150 ms returned [1, 2, 3, 4, 5, 6, 9, 10, 33, 34, 35, 36, 43, 44, 45, 50, 51, 55, 56, 57, 60]
Discarding 21 places :
Implicit Place search using SMT only with invariants took 152 ms to find 21 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/517 places, 127/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 127/127 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 213 ms. Remains : 160/517 places, 127/435 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(X(F(p0))))||(p1 U (p2||G(p1)))))))'
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-04
Product exploration explored 100000 steps with 21220 reset in 294 ms.
Product exploration explored 100000 steps with 21409 reset in 258 ms.
Computed a total of 38 stabilizing places and 28 stable transitions
Computed a total of 38 stabilizing places and 28 stable transitions
Detected a total of 38/160 stabilizing places and 28/127 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 14 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (9623 resets) in 598 ms. (66 steps per ms) remains 1/5 properties
BEST_FIRST walk for 31999 steps (2436 resets) in 75 ms. (421 steps per ms) remains 0/1 properties
Knowledge based reduction with 14 factoid took 475 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 90 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 861 ms.
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 160 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 160/160 places, 127/127 transitions.
Applied a total of 0 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 127/127 (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-1801148139213126341.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16125594718575254403.kers'
[2026-05-24 12:23:51] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1801148139213126341.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16125594718575254403.kers]
Normalized transition count is 126 out of 127 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 126 rows 160 cols 658 entries
Finished phase 1 with 59 SingleSign rule and 41 generalized
[2026-05-24 12:23:51] [INFO ] Computed 60 invariants in 0 ms
Computed 60 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16125594718575254403.kers
Total runtime 1 ms.
[2026-05-24 12:23:51] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-24 12:23:51] [INFO ] Invariant cache hit.
[2026-05-24 12:23:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 12:23:52] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [3, 7, 25, 27, 29, 35, 38, 41, 43, 45, 47, 49, 56, 58, 64, 66, 68, 70, 72, 74, 76, 78, 80, 82, 84, 86, 88, 90, 92, 94, 96, 98, 100, 102, 104, 146, 148, 150]
Discarding 38 places :
Implicit Place search using SMT with State Equation took 549 ms to find 38 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 122/160 places, 127/127 transitions.
Graph (complete) has 356 edges and 122 vertex of which 113 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.1 ms
Discarding 9 places :
Also discarding 4 output transitions
Drop transitions (Output transitions of discarded places.) removed 4 transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 13 place count 113 transition count 111
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 25 place count 101 transition count 111
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 31 place count 95 transition count 98
Iterating global reduction 2 with 6 rules applied. Total rules applied 37 place count 95 transition count 98
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 1 rules applied. Total rules applied 38 place count 95 transition count 97
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 39 place count 94 transition count 97
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 41 place count 92 transition count 95
Iterating global reduction 4 with 2 rules applied. Total rules applied 43 place count 92 transition count 95
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Deduced a syphon composed of 8 places in 0 ms
Ensure Unique test removed 4 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 63 place count 80 transition count 87
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 67 place count 78 transition count 85
Applied a total of 67 rules in 17 ms. Remains 78 /122 variables (removed 44) and now considering 85/127 (removed 42) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2608271946273042728.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14396971360625024992.kers'
[2026-05-24 12:23:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2608271946273042728.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14396971360625024992.kers]
Normalized transition count is 84 out of 85 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 84 rows 77 cols 294 entries
Finished phase 1 with 63 SingleSign rule and 2 generalized
[2026-05-24 12:23:52] [INFO ] Computed 13 invariants in 0 ms
Computed 13 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-14396971360625024992.kers
Total runtime 1 ms.
[2026-05-24 12:23:52] [INFO ] Implicit Places using invariants in 57 ms returned []
[2026-05-24 12:23:52] [INFO ] Invariant cache hit.
[2026-05-24 12:23:52] [INFO ] State equation strengthened by 5 read => feed constraints.
[2026-05-24 12:23:52] [INFO ] Implicit Places using invariants and state equation in 129 ms returned [3, 4, 5, 13]
Discarding 4 places :
Implicit Place search using SMT with State Equation took 188 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 74/160 places, 85/127 transitions.
Applied a total of 0 rules in 5 ms. Remains 74 /74 variables (removed 0) and now considering 85/85 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 770 ms. Remains : 74/160 places, 85/127 transitions.
Computed a total of 17 stabilizing places and 19 stable transitions
Graph (complete) has 237 edges and 74 vertex of which 71 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.1 ms
Computed a total of 17 stabilizing places and 19 stable transitions
Detected a total of 17/74 stabilizing places and 19/85 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 3/3 atomic propositions.
Knowledge based reduction with 14 factoid took 63 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
RANDOM walk for 35037 steps (8438 resets) in 130 ms. (267 steps per ms) remains 0/5 properties
Knowledge based reduction with 14 factoid took 139 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Knowledge-based reduction took 345 ms.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 93 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 21301 reset in 144 ms.
Product exploration explored 100000 steps with 21446 reset in 138 ms.
Built C files in :
/tmp/ltsmin3677566831701249634
[2026-05-24 12:23:53] [INFO ] Computing symmetric may disable matrix : 85 transitions.
[2026-05-24 12:23:53] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:23:53] [INFO ] Computing symmetric may enable matrix : 85 transitions.
[2026-05-24 12:23:53] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:23:53] [INFO ] Computing Do-Not-Accords matrix : 85 transitions.
[2026-05-24 12:23:53] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 12:23:53] [INFO ] Built C files in 34ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3677566831701249634
Running compilation step : cd /tmp/ltsmin3677566831701249634;'/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 314 ms.
Running link step : cd /tmp/ltsmin3677566831701249634;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin3677566831701249634;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16668087331012731622.hoa' '--buchi-type=spotba'
LTSmin run took 196 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-04 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-17-LTLFireability-04 finished in 4087 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 506 transition count 424
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 506 transition count 424
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 501 transition count 419
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 501 transition count 419
Applied a total of 32 rules in 28 ms. Remains 501 /517 variables (removed 16) and now considering 419/435 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3324088532478035875.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3859411122843179735.kers'
[2026-05-24 12:23:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3324088532478035875.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3859411122843179735.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 419 rows 501 cols 1324 entries
Finished phase 1 with 317 SingleSign rule and 79 generalized
[2026-05-24 12:23:54] [INFO ] Computed 105 invariants in 2 ms
Computed 105 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3859411122843179735.kers
Total runtime 3 ms.
[2026-05-24 12:23:54] [INFO ] Implicit Places using invariants in 294 ms returned []
[2026-05-24 12:23:54] [INFO ] Invariant cache hit.
[2026-05-24 12:23:55] [INFO ] Implicit Places using invariants and state equation in 1088 ms returned []
Implicit Place search using SMT with State Equation took 1385 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-24 12:23:55] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Problem TDEAD387 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 1 solved, 417 unsolved
SMT process timed out in 30158ms, After SMT, problems are : Problem set: 1 solved, 417 unsolved
Search for dead transitions found 1 dead transitions in 30161ms
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 : 501/517 places, 418/435 transitions.
Applied a total of 0 rules in 13 ms. Remains 501 /501 variables (removed 0) and now considering 418/418 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 31590 ms. Remains : 501/517 places, 418/435 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 84 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-06
Stuttering criterion allowed to conclude after 144 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-06 finished in 31708 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p1) U p2))&&(p1 U G(!p0))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Graph (trivial) has 241 edges and 517 vertex of which 6 / 517 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 1122 edges and 512 vertex of which 511 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 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 60 place count 510 transition count 369
Reduce places removed 58 places and 0 transitions.
Iterating post reduction 1 with 58 rules applied. Total rules applied 118 place count 452 transition count 369
Performed 106 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 106 Pre rules applied. Total rules applied 118 place count 452 transition count 263
Deduced a syphon composed of 106 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 126 places and 0 transitions.
Iterating global reduction 2 with 232 rules applied. Total rules applied 350 place count 326 transition count 263
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 360 place count 316 transition count 253
Iterating global reduction 2 with 10 rules applied. Total rules applied 370 place count 316 transition count 253
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 134 places and 0 transitions.
Iterating global reduction 2 with 263 rules applied. Total rules applied 633 place count 182 transition count 124
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 635 place count 181 transition count 128
Applied a total of 635 rules in 37 ms. Remains 181 /517 variables (removed 336) and now considering 128/435 (removed 307) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13605175349690529673.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13057628223608677699.kers'
[2026-05-24 12:24:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13605175349690529673.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13057628223608677699.kers]
Normalized transition count is 127 out of 128 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 127 rows 180 cols 709 entries
Finished phase 1 with 60 SingleSign rule and 41 generalized
[2026-05-24 12:24:25] [INFO ] Computed 80 invariants in 1 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-13057628223608677699.kers
Total runtime 1 ms.
[2026-05-24 12:24:25] [INFO ] Implicit Places using invariants in 139 ms returned [1, 2, 3, 4, 5, 10, 11, 35, 36, 37, 38, 45, 46, 47, 52, 53, 54, 55, 56, 57, 58, 59]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 140 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/517 places, 128/435 transitions.
Applied a total of 0 rules in 6 ms. Remains 159 /159 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 183 ms. Remains : 159/517 places, 128/435 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U (G(p1) U p2))&&(p1 U G(!p0))))'
Stuttering acceptance computed with spot in 263 ms :[(OR (NOT p2) p0), true, (NOT p1), (NOT p2), p0, p0, (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-07
Product exploration explored 100000 steps with 15703 reset in 283 ms.
Product exploration explored 100000 steps with 15589 reset in 288 ms.
Computed a total of 32 stabilizing places and 24 stable transitions
Computed a total of 32 stabilizing places and 24 stable transitions
Detected a total of 32/159 stabilizing places and 24/128 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge based reduction with 20 factoid took 165 ms. Reduced automaton from 7 states, 22 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (6884 resets) in 155 ms. (256 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (2469 resets) in 81 ms. (487 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 615 steps, run visited all 1 properties in 11 ms. (steps per millisecond=55 )
Probabilistic random walk after 615 steps, saw 288 distinct states, run finished after 20 ms. (steps per millisecond=30 ) properties seen :1
Negative knowledge disproves property using: (G (NOT p0))
Knowledge based reduction with 20 factoid took 212 ms. Proved property starting from automaton with 2 states, 3 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 479 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-07 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-07 finished in 1529 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 425
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 425
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 24 place count 503 transition count 421
Iterating global reduction 0 with 4 rules applied. Total rules applied 28 place count 503 transition count 421
Applied a total of 28 rules in 30 ms. Remains 503 /517 variables (removed 14) and now considering 421/435 (removed 14) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1183013867590681792.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15346814027419961238.kers'
[2026-05-24 12:24:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1183013867590681792.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15346814027419961238.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 421 rows 503 cols 1328 entries
Finished phase 1 with 319 SingleSign rule and 79 generalized
[2026-05-24 12:24:27] [INFO ] Computed 105 invariants in 9 ms
Computed 105 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15346814027419961238.kers
Total runtime 10 ms.
[2026-05-24 12:24:27] [INFO ] Implicit Places using invariants in 311 ms returned []
[2026-05-24 12:24:27] [INFO ] Invariant cache hit.
[2026-05-24 12:24:29] [INFO ] Implicit Places using invariants and state equation in 1405 ms returned []
Implicit Place search using SMT with State Equation took 1719 ms to find 0 implicit places.
Running 420 sub problems to find dead transitions.
[2026-05-24 12:24:29] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 503/924 variables, and 181 constraints, problems are : Problem set: 0 solved, 420 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 420/420 constraints, Known Traps: 76/76 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 420 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/502 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/502 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 2 (OVERLAPS) 1/503 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/503 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/503 variables, 76/181 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/503 variables, 20/201 constraints. Problems are: Problem set: 0 solved, 420 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 20/221 constraints. Problems are: Problem set: 0 solved, 420 unsolved
Problem TDEAD359 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 20/241 constraints. Problems are: Problem set: 10 solved, 410 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/503 variables, 20/261 constraints. Problems are: Problem set: 10 solved, 410 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 20/281 constraints. Problems are: Problem set: 10 solved, 410 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 503/924 variables, and 281 constraints, problems are : Problem set: 10 solved, 410 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/503 constraints, PredecessorRefiner: 0/420 constraints, Known Traps: 176/176 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60080ms problems are : Problem set: 10 solved, 410 unsolved
Search for dead transitions found 10 dead transitions in 60082ms
Found 10 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 10 transitions
Dead transitions reduction (with SMT) removed 10 transitions
Starting structural reductions in LTL mode, iteration 1 : 503/517 places, 411/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 503 /503 variables (removed 0) and now considering 411/411 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61842 ms. Remains : 503/517 places, 411/435 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0)&&X(X(G(p1)))))'
Stuttering acceptance computed with spot in 158 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-08
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-08 finished in 62041 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(((p0&&X(X(X(G(p1))))) U p1))))'
Support contains 2 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 425
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 425
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 502 transition count 420
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 502 transition count 420
Applied a total of 30 rules in 23 ms. Remains 502 /517 variables (removed 15) and now considering 420/435 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17492200835914906106.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4373598458710680186.kers'
[2026-05-24 12:25:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17492200835914906106.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4373598458710680186.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 420 rows 502 cols 1326 entries
Finished phase 1 with 318 SingleSign rule and 79 generalized
[2026-05-24 12:25:29] [INFO ] Computed 105 invariants in 5 ms
Computed 105 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-4373598458710680186.kers
Total runtime 7 ms.
[2026-05-24 12:25:29] [INFO ] Implicit Places using invariants in 278 ms returned []
[2026-05-24 12:25:29] [INFO ] Invariant cache hit.
[2026-05-24 12:25:30] [INFO ] Implicit Places using invariants and state equation in 1110 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2026-05-24 12:25:30] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 502/922 variables, and 170 constraints, problems are : Problem set: 0 solved, 419 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/502 constraints, PredecessorRefiner: 419/419 constraints, Known Traps: 65/65 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 419 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 65/170 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/190 constraints. Problems are: Problem set: 0 solved, 419 unsolved
Problem TDEAD363 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/210 constraints. Problems are: Problem set: 2 solved, 417 unsolved
Problem TDEAD367 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD374 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/502 variables, 20/230 constraints. Problems are: Problem set: 6 solved, 413 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 20/250 constraints. Problems are: Problem set: 6 solved, 413 unsolved
Problem TDEAD359 is UNSAT
Problem TDEAD388 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 20/270 constraints. Problems are: Problem set: 8 solved, 411 unsolved
SMT process timed out in 60072ms, After SMT, problems are : Problem set: 8 solved, 411 unsolved
Search for dead transitions found 8 dead transitions in 60075ms
Found 8 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 8 transitions
Dead transitions reduction (with SMT) removed 8 transitions
Starting structural reductions in LTL mode, iteration 1 : 502/517 places, 412/435 transitions.
Applied a total of 0 rules in 9 ms. Remains 502 /502 variables (removed 0) and now considering 412/412 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61500 ms. Remains : 502/517 places, 412/435 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(((p0&&X(X(X(G(p1))))) U p1))))'
Stuttering acceptance computed with spot in 276 ms :[(NOT p1), (NOT p1), (NOT p1), true, (NOT p1), (NOT p1), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-09
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-09 finished in 61811 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 506 transition count 424
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 506 transition count 424
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 501 transition count 419
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 501 transition count 419
Applied a total of 32 rules in 24 ms. Remains 501 /517 variables (removed 16) and now considering 419/435 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9460893677877173014.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13016848969463801553.kers'
[2026-05-24 12:26:31] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9460893677877173014.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13016848969463801553.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 419 rows 501 cols 1324 entries
Finished phase 1 with 317 SingleSign rule and 79 generalized
[2026-05-24 12:26:31] [INFO ] Computed 105 invariants in 6 ms
Computed 105 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13016848969463801553.kers
Total runtime 7 ms.
[2026-05-24 12:26:31] [INFO ] Implicit Places using invariants in 274 ms returned []
[2026-05-24 12:26:31] [INFO ] Invariant cache hit.
[2026-05-24 12:26:32] [INFO ] Implicit Places using invariants and state equation in 1358 ms returned []
Implicit Place search using SMT with State Equation took 1634 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-24 12:26:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Problem TDEAD387 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 1 solved, 417 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/185 constraints. Problems are: Problem set: 1 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/920 variables, and 185 constraints, problems are : Problem set: 1 solved, 417 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 80/80 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 83/100 constraints. Problems are: Problem set: 1 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 1 solved, 417 unsolved
Problem TDEAD367 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 80/185 constraints. Problems are: Problem set: 2 solved, 416 unsolved
Problem TDEAD357 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/205 constraints. Problems are: Problem set: 15 solved, 403 unsolved
Problem TDEAD363 is UNSAT
Problem TDEAD393 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/225 constraints. Problems are: Problem set: 17 solved, 401 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/245 constraints. Problems are: Problem set: 17 solved, 401 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/265 constraints. Problems are: Problem set: 17 solved, 401 unsolved
Problem TDEAD370 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/285 constraints. Problems are: Problem set: 18 solved, 400 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/305 constraints. Problems are: Problem set: 18 solved, 400 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/920 variables, and 306 constraints, problems are : Problem set: 18 solved, 400 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/418 constraints, Known Traps: 201/201 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60077ms problems are : Problem set: 18 solved, 400 unsolved
Search for dead transitions found 18 dead transitions in 60079ms
Found 18 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 18 transitions
Dead transitions reduction (with SMT) removed 18 transitions
Starting structural reductions in LTL mode, iteration 1 : 501/517 places, 401/435 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 500 transition count 401
Applied a total of 1 rules in 7 ms. Remains 500 /501 variables (removed 1) and now considering 401/401 (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-10015921485331394995.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8079600574683240763.kers'
[2026-05-24 12:27:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10015921485331394995.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8079600574683240763.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 401 rows 500 cols 1214 entries
Finished phase 1 with 318 SingleSign rule and 72 generalized
[2026-05-24 12:27:32] [INFO ] Computed 110 invariants in 5 ms
Computed 110 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-8079600574683240763.kers
Total runtime 7 ms.
[2026-05-24 12:27:33] [INFO ] Implicit Places using invariants in 277 ms returned []
[2026-05-24 12:27:33] [INFO ] Invariant cache hit.
[2026-05-24 12:27:34] [INFO ] Implicit Places using invariants and state equation in 1007 ms returned [85, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 1294 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 498/517 places, 401/435 transitions.
Applied a total of 0 rules in 11 ms. Remains 498 /498 variables (removed 0) and now considering 401/401 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 63052 ms. Remains : 498/517 places, 401/435 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(G(p0)))))'
Stuttering acceptance computed with spot in 194 ms :[true, (NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-10
Entered a terminal (fully accepting) state of product in 10031 steps with 64 reset in 24 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-10 finished in 63301 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||(p1&&((p1&&X(G(p0))) U p2)))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Graph (trivial) has 238 edges and 517 vertex of which 6 / 517 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 1122 edges and 512 vertex of which 511 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 56 transitions
Trivial Post-agglo rules discarded 56 transitions
Performed 56 trivial Post agglomeration. Transition count delta: 56
Iterating post reduction 0 with 56 rules applied. Total rules applied 58 place count 510 transition count 371
Reduce places removed 56 places and 0 transitions.
Iterating post reduction 1 with 56 rules applied. Total rules applied 114 place count 454 transition count 371
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 114 place count 454 transition count 266
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 20 places
Reduce places removed 125 places and 0 transitions.
Iterating global reduction 2 with 230 rules applied. Total rules applied 344 place count 329 transition count 266
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 352 place count 321 transition count 258
Iterating global reduction 2 with 8 rules applied. Total rules applied 360 place count 321 transition count 258
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 360 place count 321 transition count 257
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 362 place count 320 transition count 257
Performed 133 Post agglomeration using F-continuation condition.Transition count delta: 133
Deduced a syphon composed of 133 places in 0 ms
Ensure Unique test removed 5 places
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 2 with 271 rules applied. Total rules applied 633 place count 182 transition count 124
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 635 place count 181 transition count 128
Applied a total of 635 rules in 34 ms. Remains 181 /517 variables (removed 336) and now considering 128/435 (removed 307) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14852622406844702933.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3008667372892851766.kers'
[2026-05-24 12:27:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14852622406844702933.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3008667372892851766.kers]
Normalized transition count is 127 out of 128 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 127 rows 180 cols 741 entries
Finished phase 1 with 60 SingleSign rule and 41 generalized
[2026-05-24 12:27:34] [INFO ] Computed 80 invariants in 0 ms
Computed 80 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-3008667372892851766.kers
Total runtime 1 ms.
[2026-05-24 12:27:34] [INFO ] Implicit Places using invariants in 158 ms returned [1, 2, 3, 4, 5, 8, 9, 32, 33, 34, 35, 42, 43, 44, 49, 50, 51, 52, 53, 54, 55, 56]
Discarding 22 places :
Implicit Place search using SMT only with invariants took 159 ms to find 22 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 159/517 places, 128/435 transitions.
Applied a total of 0 rules in 3 ms. Remains 159 /159 variables (removed 0) and now considering 128/128 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 196 ms. Remains : 159/517 places, 128/435 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||(p1&&((p1&&X(G(p0))) U p2)))))'
Stuttering acceptance computed with spot in 30 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2)))]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-11
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-11 finished in 260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U G(p1))&&X(X(X(F(p2)))))))'
Support contains 5 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 507 transition count 425
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 507 transition count 425
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 25 place count 502 transition count 420
Iterating global reduction 0 with 5 rules applied. Total rules applied 30 place count 502 transition count 420
Applied a total of 30 rules in 26 ms. Remains 502 /517 variables (removed 15) and now considering 420/435 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6687867596267978758.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11582072605115115518.kers'
[2026-05-24 12:27:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6687867596267978758.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11582072605115115518.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 420 rows 502 cols 1326 entries
Finished phase 1 with 318 SingleSign rule and 79 generalized
[2026-05-24 12:27:34] [INFO ] Computed 105 invariants in 6 ms
Computed 105 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-11582072605115115518.kers
Total runtime 7 ms.
[2026-05-24 12:27:35] [INFO ] Implicit Places using invariants in 283 ms returned []
[2026-05-24 12:27:35] [INFO ] Invariant cache hit.
[2026-05-24 12:27:36] [INFO ] Implicit Places using invariants and state equation in 1087 ms returned []
Implicit Place search using SMT with State Equation took 1372 ms to find 0 implicit places.
Running 419 sub problems to find dead transitions.
[2026-05-24 12:27:36] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/501 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/501 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 2 (OVERLAPS) 1/502 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/502 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/502 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/502 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 419 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/502 variables, 20/165 constraints. Problems are: Problem set: 0 solved, 419 unsolved
SMT process timed out in 30114ms, After SMT, problems are : Problem set: 0 solved, 419 unsolved
Search for dead transitions found 0 dead transitions in 30116ms
Starting structural reductions in LTL mode, iteration 1 : 502/517 places, 420/435 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 31515 ms. Remains : 502/517 places, 420/435 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U G(p1))&&X(X(X(F(p2)))))))'
Stuttering acceptance computed with spot in 310 ms :[(OR (NOT p1) (NOT p2)), (OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-12
Stuttering criterion allowed to conclude after 151 steps with 0 reset in 2 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-17-LTLFireability-12 finished in 31897 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(!p0))))'
Support contains 3 out of 517 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 517/517 places, 435/435 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 506 transition count 424
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 506 transition count 424
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 27 place count 501 transition count 419
Iterating global reduction 0 with 5 rules applied. Total rules applied 32 place count 501 transition count 419
Applied a total of 32 rules in 22 ms. Remains 501 /517 variables (removed 16) and now considering 419/435 (removed 16) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4410757370802066029.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10702640566941464928.kers'
[2026-05-24 12:28:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4410757370802066029.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10702640566941464928.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 419 rows 501 cols 1324 entries
Finished phase 1 with 317 SingleSign rule and 79 generalized
[2026-05-24 12:28:06] [INFO ] Computed 105 invariants in 6 ms
Computed 105 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-10702640566941464928.kers
Total runtime 8 ms.
[2026-05-24 12:28:06] [INFO ] Implicit Places using invariants in 317 ms returned []
[2026-05-24 12:28:06] [INFO ] Invariant cache hit.
[2026-05-24 12:28:08] [INFO ] Implicit Places using invariants and state equation in 1234 ms returned []
Implicit Place search using SMT with State Equation took 1556 ms to find 0 implicit places.
Running 418 sub problems to find dead transitions.
[2026-05-24 12:28:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 83/100 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 20/125 constraints. Problems are: Problem set: 0 solved, 418 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/145 constraints. Problems are: Problem set: 0 solved, 418 unsolved
Problem TDEAD387 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/165 constraints. Problems are: Problem set: 1 solved, 417 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 501/920 variables, and 184 constraints, problems are : Problem set: 1 solved, 417 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 418/418 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/500 variables, 17/17 constraints. Problems are: Problem set: 1 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/500 variables, 0/17 constraints. Problems are: Problem set: 1 solved, 417 unsolved
At refinement iteration 2 (OVERLAPS) 1/501 variables, 83/100 constraints. Problems are: Problem set: 1 solved, 417 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/501 variables, 5/105 constraints. Problems are: Problem set: 1 solved, 417 unsolved
Problem TDEAD367 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/501 variables, 79/184 constraints. Problems are: Problem set: 2 solved, 416 unsolved
Problem TDEAD386 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/501 variables, 20/204 constraints. Problems are: Problem set: 8 solved, 410 unsolved
Problem TDEAD382 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/501 variables, 20/224 constraints. Problems are: Problem set: 9 solved, 409 unsolved
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD371 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/501 variables, 20/244 constraints. Problems are: Problem set: 13 solved, 405 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/501 variables, 20/264 constraints. Problems are: Problem set: 13 solved, 405 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/501 variables, 20/284 constraints. Problems are: Problem set: 13 solved, 405 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/501 variables, 20/304 constraints. Problems are: Problem set: 13 solved, 405 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 501/920 variables, and 318 constraints, problems are : Problem set: 13 solved, 405 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 83/83 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/501 constraints, PredecessorRefiner: 0/418 constraints, Known Traps: 213/213 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 13 solved, 405 unsolved
Search for dead transitions found 13 dead transitions in 60065ms
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 : 501/517 places, 406/435 transitions.
Applied a total of 0 rules in 7 ms. Remains 501 /501 variables (removed 0) and now considering 406/406 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 61653 ms. Remains : 501/517 places, 406/435 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 105 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-17-LTLFireability-13
Product exploration explored 100000 steps with 33333 reset in 155 ms.
Product exploration explored 100000 steps with 33333 reset in 163 ms.
Computed a total of 206 stabilizing places and 178 stable transitions
Graph (complete) has 1079 edges and 501 vertex of which 500 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.4 ms
Computed a total of 206 stabilizing places and 178 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 2 factoid took 17 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 24 ms.
FORMULA BusinessProcesses-PT-17-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-17-LTLFireability-13 finished in 62134 ms.
All properties solved by simple procedures.
Total runtime 391748 ms.

BK_STOP 1779625748790

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

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

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