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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 588K
-rw-r--r-- 1 mcc users 7.0K Mar 5 17:50 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 17:50 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Mar 5 17:50 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Mar 5 17:50 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.8K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:45 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:45 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:45 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 15 07:45 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 5 17:50 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 140K Mar 5 17:50 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.7K Mar 5 17:50 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Mar 5 17:50 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.7K Mar 15 07:45 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:45 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 131K 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-10-LTLCardinality-00
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-01
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-02
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-03
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-04
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-05
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-06
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-07
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-08
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-09
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-10
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-11
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-12
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-13
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-14
FORMULA_NAME BusinessProcesses-PT-10-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779616424529

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=BusinessProcesses-PT-10
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-24 09:53:45] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-24 09:53:45] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-24 09:53:45] [INFO ] Load time of PNML (sax parser for PT used): 88 ms
[2026-05-24 09:53:45] [INFO ] Transformed 518 places.
[2026-05-24 09:53:45] [INFO ] Transformed 471 transitions.
[2026-05-24 09:53:45] [INFO ] Found NUPN structural information;
[2026-05-24 09:53:45] [INFO ] Parsed PT model containing 518 places and 471 transitions and 1415 arcs in 195 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA BusinessProcesses-PT-10-LTLCardinality-01 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA BusinessProcesses-PT-10-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 32 out of 518 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 518/518 places, 471/471 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 517 transition count 471
Discarding 69 places :
Symmetric choice reduction at 1 with 69 rule applications. Total rules 70 place count 448 transition count 402
Iterating global reduction 1 with 69 rules applied. Total rules applied 139 place count 448 transition count 402
Discarding 32 places :
Symmetric choice reduction at 1 with 32 rule applications. Total rules 171 place count 416 transition count 370
Iterating global reduction 1 with 32 rules applied. Total rules applied 203 place count 416 transition count 370
Applied a total of 203 rules in 106 ms. Remains 416 /518 variables (removed 102) and now considering 370/471 (removed 101) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12840222185837663716.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7726344215542053726.kers'
[2026-05-24 09:53:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12840222185837663716.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7726344215542053726.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 370 rows 416 cols 1212 entries
Finished phase 1 with 268 SingleSign rule and 64 generalized
[2026-05-24 09:53:46] [INFO ] Computed 84 invariants in 3 ms
Computed 84 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-7726344215542053726.kers
Total runtime 4 ms.
[2026-05-24 09:53:46] [INFO ] Implicit Places using invariants in 420 ms returned []
[2026-05-24 09:53:46] [INFO ] Invariant cache hit.
[2026-05-24 09:53:47] [INFO ] Implicit Places using invariants and state equation in 581 ms returned []
Implicit Place search using SMT with State Equation took 1035 ms to find 0 implicit places.
Running 369 sub problems to find dead transitions.
[2026-05-24 09:53:47] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 2 (OVERLAPS) 1/416 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 369 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 369 unsolved
Problem TDEAD284 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD320 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 20/104 constraints. Problems are: Problem set: 3 solved, 366 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 20/124 constraints. Problems are: Problem set: 3 solved, 366 unsolved
Problem TDEAD282 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD309 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 20/144 constraints. Problems are: Problem set: 9 solved, 360 unsolved
Problem TDEAD301 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 20/164 constraints. Problems are: Problem set: 17 solved, 352 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 20/184 constraints. Problems are: Problem set: 17 solved, 352 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 416/786 variables, and 186 constraints, problems are : Problem set: 17 solved, 352 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/416 constraints, PredecessorRefiner: 369/369 constraints, Known Traps: 102/102 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 17 solved, 352 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/415 variables, 17/17 constraints. Problems are: Problem set: 17 solved, 352 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/415 variables, 0/17 constraints. Problems are: Problem set: 17 solved, 352 unsolved
At refinement iteration 2 (OVERLAPS) 1/416 variables, 62/79 constraints. Problems are: Problem set: 17 solved, 352 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/416 variables, 5/84 constraints. Problems are: Problem set: 17 solved, 352 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/416 variables, 102/186 constraints. Problems are: Problem set: 17 solved, 352 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/416 variables, 20/206 constraints. Problems are: Problem set: 17 solved, 352 unsolved
Problem TDEAD272 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD296 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/416 variables, 20/226 constraints. Problems are: Problem set: 20 solved, 349 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/416 variables, 20/246 constraints. Problems are: Problem set: 20 solved, 349 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/416 variables, 20/266 constraints. Problems are: Problem set: 20 solved, 349 unsolved
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
At refinement iteration 9 (INCLUDED_ONLY) 0/416 variables, 20/286 constraints. Problems are: Problem set: 22 solved, 347 unsolved
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
At refinement iteration 10 (INCLUDED_ONLY) 0/416 variables, 20/306 constraints. Problems are: Problem set: 25 solved, 344 unsolved
Problem TDEAD283 is UNSAT
At refinement iteration 11 (INCLUDED_ONLY) 0/416 variables, 20/326 constraints. Problems are: Problem set: 26 solved, 343 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 416/786 variables, and 326 constraints, problems are : Problem set: 26 solved, 343 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/416 constraints, PredecessorRefiner: 0/369 constraints, Known Traps: 242/242 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60182ms problems are : Problem set: 26 solved, 343 unsolved
Search for dead transitions found 26 dead transitions in 60205ms
Found 26 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 26 transitions
Dead transitions reduction (with SMT) removed 26 transitions
Starting structural reductions in LTL mode, iteration 1 : 416/518 places, 344/471 transitions.
Ensure Unique test removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 415 transition count 344
Applied a total of 1 rules in 17 ms. Remains 415 /416 variables (removed 1) and now considering 344/344 (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-17225206323550588117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7872824720633612516.kers'
[2026-05-24 09:54:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17225206323550588117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7872824720633612516.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 415 cols 1054 entries
Finished phase 1 with 268 SingleSign rule and 61 generalized
[2026-05-24 09:54:47] [INFO ] Computed 86 invariants in 2 ms
Computed 86 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7872824720633612516.kers
Total runtime 3 ms.
[2026-05-24 09:54:47] [INFO ] Implicit Places using invariants in 267 ms returned []
[2026-05-24 09:54:47] [INFO ] Invariant cache hit.
[2026-05-24 09:54:48] [INFO ] Implicit Places using invariants and state equation in 430 ms returned [370, 371]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 701 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 413/518 places, 344/471 transitions.
Applied a total of 0 rules in 18 ms. Remains 413 /413 variables (removed 0) and now considering 344/344 (removed 0) transitions.
Finished structural reductions in LTL mode , in 3 iterations and 62141 ms. Remains : 413/518 places, 344/471 transitions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 344/344 transitions.
Applied a total of 0 rules in 12 ms. Remains 413 /413 variables (removed 0) and now considering 344/344 (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-8378477308297734105.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3255332119820478351.kers'
[2026-05-24 09:54:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8378477308297734105.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3255332119820478351.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 344 rows 413 cols 1050 entries
Finished phase 1 with 270 SingleSign rule and 59 generalized
[2026-05-24 09:54:48] [INFO ] Computed 84 invariants in 2 ms
Computed 84 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-3255332119820478351.kers
Total runtime 3 ms.
[2026-05-24 09:54:48] [INFO ] Implicit Places using invariants in 160 ms returned []
[2026-05-24 09:54:48] [INFO ] Invariant cache hit.
[2026-05-24 09:54:48] [INFO ] Implicit Places using invariants and state equation in 479 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 343 sub problems to find dead transitions.
[2026-05-24 09:54:48] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/413 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 20/184 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 5/189 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 413/757 variables, and 189 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30034 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/413 constraints, PredecessorRefiner: 343/343 constraints, Known Traps: 105/105 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 343 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/412 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/412 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 2 (OVERLAPS) 1/413 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/413 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/413 variables, 105/189 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/413 variables, 9/198 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/413 variables, 8/206 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/413 variables, 1/207 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/413 variables, 4/211 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/413 variables, 5/216 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/413 variables, 3/219 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/413 variables, 3/222 constraints. Problems are: Problem set: 0 solved, 343 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/413 variables, 3/225 constraints. Problems are: Problem set: 0 solved, 343 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 413/757 variables, and 225 constraints, problems are : Problem set: 0 solved, 343 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/413 constraints, PredecessorRefiner: 0/343 constraints, Known Traps: 141/141 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60082ms problems are : Problem set: 0 solved, 343 unsolved
Search for dead transitions found 0 dead transitions in 60086ms
Finished structural reductions in LTL mode , in 1 iterations and 60749 ms. Remains : 413/413 places, 344/344 transitions.
Support contains 32 out of 413 places after structural reductions.
[2026-05-24 09:55:49] [INFO ] Flatten gal took : 47 ms
[2026-05-24 09:55:49] [INFO ] Flatten gal took : 23 ms
[2026-05-24 09:55:49] [INFO ] Input system was already deterministic with 344 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (330 resets) in 1163 ms. (34 steps per ms) remains 4/20 properties
BEST_FIRST walk for 40004 steps (58 resets) in 116 ms. (341 steps per ms) remains 3/4 properties
BEST_FIRST walk for 40002 steps (59 resets) in 100 ms. (396 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 84 ms. (470 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (58 resets) in 77 ms. (512 steps per ms) remains 3/3 properties
[2026-05-24 09:55:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 250/330 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 4/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/66 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 77/407 variables, 21/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 0/87 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (OVERLAPS) 3/410 variables, 1/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/410 variables, 0/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 342/752 variables, 410/498 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/752 variables, 6/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
All remaining problems are real, not stopping.
At refinement iteration 12 (INCLUDED_ONLY) 0/752 variables, 0/504 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 5/757 variables, 3/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/757 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/757 variables, 0/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 757/757 variables, and 507 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1479 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 413/413 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/5 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 75/80 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/80 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 250/330 variables, 58/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/330 variables, 5/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/330 variables, 0/67 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 77/407 variables, 21/88 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/407 variables, 2/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/407 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 3/410 variables, 1/91 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/410 variables, 3/94 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/410 variables, 3/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/410 variables, 0/97 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 342/752 variables, 410/507 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/752 variables, 3/510 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/752 variables, 3/513 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/752 variables, 20/533 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/752 variables, 5/538 constraints. Problems are: Problem set: 0 solved, 3 unsolved
SMT process timed out in 6538ms, After SMT, problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1079 ms.
Support contains 5 out of 413 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 413/413 places, 344/344 transitions.
Graph (trivial) has 191 edges and 413 vertex of which 6 / 413 are part of one of the 1 SCC in 5 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 875 edges and 408 vertex of which 407 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 42 transitions
Trivial Post-agglo rules discarded 42 transitions
Performed 42 trivial Post agglomeration. Transition count delta: 42
Iterating post reduction 0 with 42 rules applied. Total rules applied 44 place count 407 transition count 294
Reduce places removed 42 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 43 rules applied. Total rules applied 87 place count 365 transition count 293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 88 place count 364 transition count 293
Performed 84 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 84 Pre rules applied. Total rules applied 88 place count 364 transition count 209
Deduced a syphon composed of 84 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 96 places and 0 transitions.
Iterating global reduction 3 with 180 rules applied. Total rules applied 268 place count 268 transition count 209
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 278 place count 258 transition count 199
Iterating global reduction 3 with 10 rules applied. Total rules applied 288 place count 258 transition count 199
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 288 place count 258 transition count 197
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 292 place count 256 transition count 197
Performed 102 Post agglomeration using F-continuation condition.Transition count delta: 102
Deduced a syphon composed of 102 places in 0 ms
Ensure Unique test removed 7 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 3 with 211 rules applied. Total rules applied 503 place count 147 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 505 place count 146 transition count 98
Free-agglomeration rule applied 2 times.
Iterating global reduction 3 with 2 rules applied. Total rules applied 507 place count 146 transition count 96
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 509 place count 144 transition count 96
Applied a total of 509 rules in 94 ms. Remains 144 /413 variables (removed 269) and now considering 96/344 (removed 248) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 144/413 places, 96/344 transitions.
RANDOM walk for 1279 steps (58 resets) in 59 ms. (21 steps per ms) remains 0/3 properties
FORMULA BusinessProcesses-PT-10-LTLCardinality-07 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 200 stabilizing places and 182 stable transitions
Graph (complete) has 882 edges and 413 vertex of which 412 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.13 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)||(F(p1)&&G(p0))) U (!p2||X(p3))))'
Support contains 8 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 344/344 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 405 transition count 336
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 405 transition count 336
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 402 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 402 transition count 333
Applied a total of 22 rules in 24 ms. Remains 402 /413 variables (removed 11) and now considering 333/344 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16272861597021524190.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11569675457798084153.kers'
[2026-05-24 09:55:57] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16272861597021524190.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11569675457798084153.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 402 cols 1028 entries
Finished phase 1 with 259 SingleSign rule and 59 generalized
[2026-05-24 09:55:57] [INFO ] Computed 84 invariants in 2 ms
Computed 84 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11569675457798084153.kers
Total runtime 3 ms.
[2026-05-24 09:55:57] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-24 09:55:57] [INFO ] Invariant cache hit.
[2026-05-24 09:55:58] [INFO ] Implicit Places using invariants and state equation in 518 ms returned []
Implicit Place search using SMT with State Equation took 667 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-24 09:55:58] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 20/164 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 10/174 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 4/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/735 variables, and 178 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/402 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 94/94 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 17/17 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 62/79 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 5/84 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 94/178 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 3/181 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 4/185 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 0/185 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 8 (OVERLAPS) 333/735 variables, 402/587 constraints. Problems are: Problem set: 10 solved, 322 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/735 variables, 322/909 constraints. Problems are: Problem set: 10 solved, 322 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/735 variables, 20/929 constraints. Problems are: Problem set: 10 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/735 variables, and 929 constraints, problems are : Problem set: 10 solved, 322 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 322/332 constraints, Known Traps: 121/121 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60066ms problems are : Problem set: 10 solved, 322 unsolved
Search for dead transitions found 10 dead transitions in 60069ms
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 : 402/413 places, 323/344 transitions.
Applied a total of 0 rules in 8 ms. Remains 402 /402 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60771 ms. Remains : 402/413 places, 323/344 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((G(!p0)||(F(p1)&&G(p0))) U (!p2||X(p3))))'
Stuttering acceptance computed with spot in 472 ms :[(AND p2 (NOT p3)), (AND p0 (NOT p3)), (AND p2 (NOT p3)), (AND (NOT p0) (NOT p3)), (AND (NOT p1) (NOT p3)), true, p0, (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-00
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Product exploration explored 100000 steps with 50000 reset in 201 ms.
Computed a total of 197 stabilizing places and 169 stable transitions
Graph (complete) has 845 edges and 402 vertex of which 401 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.8 ms
Computed a total of 197 stabilizing places and 169 stable transitions
Detected a total of 197/402 stabilizing places and 169/323 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/4 atomic propositions.
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 25 factoid took 22 ms. Proved property starting from automaton with 9 states, 19 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 37 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property BusinessProcesses-PT-10-LTLCardinality-00 finished in 61922 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(G(p1))||G(p2))))'
Support contains 5 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 344/344 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 403 transition count 334
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 403 transition count 334
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 23 place count 400 transition count 331
Iterating global reduction 0 with 3 rules applied. Total rules applied 26 place count 400 transition count 331
Applied a total of 26 rules in 27 ms. Remains 400 /413 variables (removed 13) and now considering 331/344 (removed 13) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12297789684065705097.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7203718678818781103.kers'
[2026-05-24 09:56:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12297789684065705097.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7203718678818781103.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 331 rows 400 cols 1024 entries
Finished phase 1 with 257 SingleSign rule and 59 generalized
[2026-05-24 09:56:59] [INFO ] Computed 84 invariants in 4 ms
Computed 84 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7203718678818781103.kers
Total runtime 5 ms.
[2026-05-24 09:56:59] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-24 09:56:59] [INFO ] Invariant cache hit.
[2026-05-24 09:57:00] [INFO ] Implicit Places using invariants and state equation in 429 ms returned []
Implicit Place search using SMT with State Equation took 562 ms to find 0 implicit places.
Running 330 sub problems to find dead transitions.
[2026-05-24 09:57:00] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 20/124 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 20/144 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 9/153 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 14/167 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 9/176 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 400/731 variables, and 176 constraints, problems are : Problem set: 0 solved, 330 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/400 constraints, PredecessorRefiner: 330/330 constraints, Known Traps: 92/92 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 330 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/399 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/399 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 2 (OVERLAPS) 1/400 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/400 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/400 variables, 92/176 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/400 variables, 2/178 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/400 variables, 1/179 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/400 variables, 2/181 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/400 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/400 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 330 unsolved
Problem TDEAD265 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
At refinement iteration 10 (OVERLAPS) 331/731 variables, 400/582 constraints. Problems are: Problem set: 10 solved, 320 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/731 variables, 320/902 constraints. Problems are: Problem set: 10 solved, 320 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 731/731 variables, and 914 constraints, problems are : Problem set: 10 solved, 320 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 400/400 constraints, PredecessorRefiner: 320/330 constraints, Known Traps: 110/110 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60063ms problems are : Problem set: 10 solved, 320 unsolved
Search for dead transitions found 10 dead transitions in 60064ms
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 : 400/413 places, 321/344 transitions.
Applied a total of 0 rules in 8 ms. Remains 400 /400 variables (removed 0) and now considering 321/321 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60663 ms. Remains : 400/413 places, 321/344 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(G(p0))||G(p1)||p2)))'
Stuttering acceptance computed with spot in 160 ms :[true, (AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-02
Entered a terminal (fully accepting) state of product in 4117 steps with 34 reset in 20 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-02 finished in 60879 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((p1&&X(X(X(p2)))))&&F(p3)&&p0)))'
Support contains 5 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 344/344 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 405 transition count 336
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 405 transition count 336
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 19 place count 402 transition count 333
Iterating global reduction 0 with 3 rules applied. Total rules applied 22 place count 402 transition count 333
Applied a total of 22 rules in 23 ms. Remains 402 /413 variables (removed 11) and now considering 333/344 (removed 11) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9397885989902162555.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5576664551274507826.kers'
[2026-05-24 09:58:00] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9397885989902162555.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5576664551274507826.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 333 rows 402 cols 1028 entries
Finished phase 1 with 259 SingleSign rule and 59 generalized
[2026-05-24 09:58:00] [INFO ] Computed 84 invariants in 4 ms
Computed 84 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5576664551274507826.kers
Total runtime 6 ms.
[2026-05-24 09:58:00] [INFO ] Implicit Places using invariants in 157 ms returned []
[2026-05-24 09:58:00] [INFO ] Invariant cache hit.
[2026-05-24 09:58:01] [INFO ] Implicit Places using invariants and state equation in 488 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
Running 332 sub problems to find dead transitions.
[2026-05-24 09:58:01] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 14/118 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/402 variables, 13/131 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/402 variables, 15/146 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/402 variables, 4/150 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/402 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/735 variables, and 154 constraints, problems are : Problem set: 0 solved, 332 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/402 constraints, PredecessorRefiner: 332/332 constraints, Known Traps: 70/70 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 332 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/402 variables, 70/154 constraints. Problems are: Problem set: 0 solved, 332 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/402 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 332 unsolved
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
At refinement iteration 6 (OVERLAPS) 333/735 variables, 402/556 constraints. Problems are: Problem set: 10 solved, 322 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/735 variables, 322/878 constraints. Problems are: Problem set: 10 solved, 322 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/735 variables, 20/898 constraints. Problems are: Problem set: 10 solved, 322 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 735/735 variables, and 912 constraints, problems are : Problem set: 10 solved, 322 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 402/402 constraints, PredecessorRefiner: 322/332 constraints, Known Traps: 104/104 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60059ms problems are : Problem set: 10 solved, 322 unsolved
Search for dead transitions found 10 dead transitions in 60061ms
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 : 402/413 places, 323/344 transitions.
Applied a total of 0 rules in 10 ms. Remains 402 /402 variables (removed 0) and now considering 323/323 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60743 ms. Remains : 402/413 places, 323/344 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((p1&&X(X(X(p2)))))&&F(p3)&&p0)))'
Stuttering acceptance computed with spot in 286 ms :[(OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p3) (NOT p1) (NOT p2)), true, (OR (NOT p1) (NOT p2)), (NOT p3), (NOT p2), (NOT p2), (NOT p2)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-06 finished in 61064 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(((F(p3)||p2)&&p1))||X(p4))&&p0)))'
Support contains 6 out of 413 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 413/413 places, 344/344 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 401 transition count 332
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 401 transition count 332
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 28 place count 397 transition count 328
Iterating global reduction 0 with 4 rules applied. Total rules applied 32 place count 397 transition count 328
Applied a total of 32 rules in 24 ms. Remains 397 /413 variables (removed 16) and now considering 328/344 (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-4066229408951779177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2994536006391561060.kers'
[2026-05-24 09:59:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4066229408951779177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2994536006391561060.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 328 rows 397 cols 1018 entries
Finished phase 1 with 254 SingleSign rule and 59 generalized
[2026-05-24 09:59:01] [INFO ] Computed 84 invariants in 2 ms
Computed 84 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-2994536006391561060.kers
Total runtime 4 ms.
[2026-05-24 09:59:01] [INFO ] Implicit Places using invariants in 131 ms returned []
[2026-05-24 09:59:01] [INFO ] Invariant cache hit.
[2026-05-24 09:59:02] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
Running 327 sub problems to find dead transitions.
[2026-05-24 09:59:02] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 20/104 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 13/117 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 6/123 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 3/126 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/397 variables, 4/130 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/397 variables, 17/147 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 397/725 variables, and 147 constraints, problems are : Problem set: 0 solved, 327 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 0/397 constraints, PredecessorRefiner: 327/327 constraints, Known Traps: 63/63 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 327 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/396 variables, 18/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/396 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 2 (OVERLAPS) 1/397 variables, 62/80 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/397 variables, 4/84 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/397 variables, 63/147 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/397 variables, 3/150 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/397 variables, 4/154 constraints. Problems are: Problem set: 0 solved, 327 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/154 constraints. Problems are: Problem set: 0 solved, 327 unsolved
Problem TDEAD262 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
At refinement iteration 8 (OVERLAPS) 328/725 variables, 397/551 constraints. Problems are: Problem set: 10 solved, 317 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/725 variables, 317/868 constraints. Problems are: Problem set: 10 solved, 317 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/725 variables, 20/888 constraints. Problems are: Problem set: 10 solved, 317 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 725/725 variables, and 888 constraints, problems are : Problem set: 10 solved, 317 unsolved in 30014 ms.
Refiners :[Positive P Invariants (semi-flows): 62/62 constraints, Generalized P Invariants (flows): 22/22 constraints, State Equation: 397/397 constraints, PredecessorRefiner: 317/327 constraints, Known Traps: 90/90 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60051ms problems are : Problem set: 10 solved, 317 unsolved
Search for dead transitions found 10 dead transitions in 60053ms
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 : 397/413 places, 318/344 transitions.
Applied a total of 0 rules in 13 ms. Remains 397 /397 variables (removed 0) and now considering 318/318 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 60640 ms. Remains : 397/413 places, 318/344 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(((F(p3)||p2)&&p1))||X(p4))&&p0)))'
Stuttering acceptance computed with spot in 292 ms :[(OR (NOT p1) (AND (NOT p2) (NOT p3))), (OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p4))), (OR (AND (NOT p1) (NOT p3) (NOT p4)) (AND (NOT p2) (NOT p3) (NOT p4))), (OR (AND (NOT p1) (NOT p3)) (AND (NOT p2) (NOT p3))), true, (OR (NOT p0) (AND (NOT p2) (NOT p3) (NOT p4)) (AND (NOT p1) (NOT p4)))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-08
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-08 finished in 60975 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 344/344 transitions.
Graph (trivial) has 192 edges and 413 vertex of which 6 / 413 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 876 edges and 408 vertex of which 407 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 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 43 rules applied. Total rules applied 45 place count 406 transition count 293
Reduce places removed 43 places and 0 transitions.
Iterating post reduction 1 with 43 rules applied. Total rules applied 88 place count 363 transition count 293
Performed 85 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 85 Pre rules applied. Total rules applied 88 place count 363 transition count 208
Deduced a syphon composed of 85 places in 0 ms
Ensure Unique test removed 13 places
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 2 with 183 rules applied. Total rules applied 271 place count 265 transition count 208
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 282 place count 254 transition count 197
Iterating global reduction 2 with 11 rules applied. Total rules applied 293 place count 254 transition count 197
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 2 Pre rules applied. Total rules applied 293 place count 254 transition count 195
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 297 place count 252 transition count 195
Performed 100 Post agglomeration using F-continuation condition.Transition count delta: 100
Deduced a syphon composed of 100 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 108 places and 0 transitions.
Iterating global reduction 2 with 208 rules applied. Total rules applied 505 place count 144 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 507 place count 143 transition count 98
Applied a total of 507 rules in 39 ms. Remains 143 /413 variables (removed 270) and now considering 98/344 (removed 246) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-5912480545710794796.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7773114880134707211.kers'
[2026-05-24 10:00:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5912480545710794796.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7773114880134707211.kers]
Normalized transition count is 97 out of 98 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 97 rows 142 cols 540 entries
Finished phase 1 with 59 SingleSign rule and 21 generalized
[2026-05-24 10:00:02] [INFO ] Computed 63 invariants in 0 ms
Computed 63 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-7773114880134707211.kers
Total runtime 1 ms.
[2026-05-24 10:00:02] [INFO ] Implicit Places using invariants in 93 ms returned [45]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 94 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 142/413 places, 98/344 transitions.
Applied a total of 0 rules in 5 ms. Remains 142 /142 variables (removed 0) and now considering 98/98 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 138 ms. Remains : 142/413 places, 98/344 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-09
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property BusinessProcesses-PT-10-LTLCardinality-09 finished in 192 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||G(p1)))))'
Support contains 3 out of 413 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 413/413 places, 344/344 transitions.
Graph (trivial) has 190 edges and 413 vertex of which 6 / 413 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 876 edges and 408 vertex of which 407 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions (Output transitions of discarded places.) removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 41 transitions
Trivial Post-agglo rules discarded 41 transitions
Performed 41 trivial Post agglomeration. Transition count delta: 41
Iterating post reduction 0 with 41 rules applied. Total rules applied 43 place count 406 transition count 295
Reduce places removed 41 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 42 rules applied. Total rules applied 85 place count 365 transition count 294
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 86 place count 364 transition count 294
Performed 83 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 83 Pre rules applied. Total rules applied 86 place count 364 transition count 211
Deduced a syphon composed of 83 places in 0 ms
Ensure Unique test removed 12 places
Reduce places removed 95 places and 0 transitions.
Iterating global reduction 3 with 178 rules applied. Total rules applied 264 place count 269 transition count 211
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 274 place count 259 transition count 201
Iterating global reduction 3 with 10 rules applied. Total rules applied 284 place count 259 transition count 201
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 2 Pre rules applied. Total rules applied 284 place count 259 transition count 199
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 288 place count 257 transition count 199
Performed 103 Post agglomeration using F-continuation condition.Transition count delta: 103
Deduced a syphon composed of 103 places in 0 ms
Ensure Unique test removed 8 places
Reduce places removed 111 places and 0 transitions.
Iterating global reduction 3 with 214 rules applied. Total rules applied 502 place count 146 transition count 96
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 504 place count 145 transition count 99
Applied a total of 504 rules in 41 ms. Remains 145 /413 variables (removed 268) and now considering 99/344 (removed 245) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9266687808490355894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14002105171217660753.kers'
[2026-05-24 10:00:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9266687808490355894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14002105171217660753.kers]
Normalized transition count is 98 out of 99 initially.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 98 rows 144 cols 556 entries
Finished phase 1 with 60 SingleSign rule and 21 generalized
[2026-05-24 10:00:02] [INFO ] Computed 64 invariants in 0 ms
Computed 64 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-14002105171217660753.kers
Total runtime 1 ms.
[2026-05-24 10:00:02] [INFO ] Implicit Places using invariants in 91 ms returned [48, 113]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 91 ms to find 2 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 143/413 places, 99/344 transitions.
Applied a total of 0 rules in 6 ms. Remains 143 /143 variables (removed 0) and now considering 99/99 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 139 ms. Remains : 143/413 places, 99/344 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||G(p1)))))'
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : BusinessProcesses-PT-10-LTLCardinality-13
Product exploration explored 100000 steps with 14380 reset in 227 ms.
Product exploration explored 100000 steps with 14554 reset in 231 ms.
Computed a total of 62 stabilizing places and 54 stable transitions
Computed a total of 62 stabilizing places and 54 stable transitions
Detected a total of 62/143 stabilizing places and 54/99 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 61 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 16729 steps (2688 resets) in 224 ms. (74 steps per ms) remains 0/4 properties
Knowledge based reduction with 10 factoid took 101 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 380 ms.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 143 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 143/143 places, 99/99 transitions.
Applied a total of 0 rules in 11 ms. Remains 143 /143 variables (removed 0) and now considering 99/99 (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-3500640204141913100.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6783906190606036415.kers'
[2026-05-24 10:00:03] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3500640204141913100.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6783906190606036415.kers]
Normalized transition count is 98 out of 99 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 98 rows 143 cols 554 entries
Finished phase 1 with 60 SingleSign rule and 21 generalized
[2026-05-24 10:00:03] [INFO ] Computed 62 invariants in 0 ms
Computed 62 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6783906190606036415.kers
Total runtime 1 ms.
[2026-05-24 10:00:03] [INFO ] Implicit Places using invariants in 84 ms returned []
[2026-05-24 10:00:03] [INFO ] Invariant cache hit.
[2026-05-24 10:00:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 10:00:04] [INFO ] Implicit Places using invariants and state equation in 214 ms returned [1, 2, 3, 4, 5, 6, 7, 20, 23, 24, 25, 26, 27, 28, 34, 37, 47, 85, 89, 91, 97, 99, 127, 139]
Discarding 24 places :
Implicit Place search using SMT with State Equation took 300 ms to find 24 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 119/143 places, 99/99 transitions.
Graph (complete) has 378 edges and 119 vertex of which 110 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 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 4 place count 110 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 7 place count 107 transition count 92
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 8 place count 106 transition count 89
Iterating global reduction 2 with 1 rules applied. Total rules applied 9 place count 106 transition count 89
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 17 place count 102 transition count 85
Applied a total of 17 rules in 13 ms. Remains 102 /119 variables (removed 17) and now considering 85/99 (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-18405711223278334092.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8044455650827397027.kers'
[2026-05-24 10:00:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18405711223278334092.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8044455650827397027.kers]
Normalized transition count is 84 out of 85 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 102 cols 375 entries
Finished phase 1 with 49 SingleSign rule and 19 generalized
[2026-05-24 10:00:04] [INFO ] Computed 34 invariants in 0 ms
Computed 34 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8044455650827397027.kers
Total runtime 1 ms.
[2026-05-24 10:00:04] [INFO ] Implicit Places using invariants in 59 ms returned [89, 93, 96]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 60 ms to find 3 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 99/143 places, 85/99 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 98 transition count 84
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 98 transition count 84
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 97 transition count 83
Applied a total of 4 rules in 8 ms. Remains 97 /99 variables (removed 2) and now considering 83/85 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11227393101561152176.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6449211465484827321.kers'
[2026-05-24 10:00:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11227393101561152176.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6449211465484827321.kers]
Normalized transition count is 82 out of 83 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 82 rows 97 cols 365 entries
Finished phase 1 with 64 SingleSign rule and 2 generalized
[2026-05-24 10:00:04] [INFO ] Computed 31 invariants in 0 ms
Computed 31 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-6449211465484827321.kers
Total runtime 0 ms.
[2026-05-24 10:00:04] [INFO ] Implicit Places using invariants in 52 ms returned []
[2026-05-24 10:00:04] [INFO ] Invariant cache hit.
[2026-05-24 10:00:04] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-24 10:00:04] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 163 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 97/143 places, 83/99 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 556 ms. Remains : 97/143 places, 83/99 transitions.
Computed a total of 27 stabilizing places and 38 stable transitions
Graph (complete) has 326 edges and 97 vertex of which 96 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 27 stabilizing places and 38 stable transitions
Detected a total of 27/97 stabilizing places and 38/83 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge based reduction with 10 factoid took 59 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
RANDOM walk for 7661 steps (1245 resets) in 47 ms. (159 steps per ms) remains 0/4 properties
Knowledge based reduction with 10 factoid took 113 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 260 ms.
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 14751 reset in 135 ms.
Product exploration explored 100000 steps with 14866 reset in 262 ms.
Built C files in :
/tmp/ltsmin7188588548830294865
[2026-05-24 10:00:05] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2026-05-24 10:00:05] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:00:05] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2026-05-24 10:00:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:00:05] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2026-05-24 10:00:05] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-24 10:00:05] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7188588548830294865
Running compilation step : cd /tmp/ltsmin7188588548830294865;'/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 316 ms.
Running link step : cd /tmp/ltsmin7188588548830294865;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 260 ms.
Running LTSmin : cd /tmp/ltsmin7188588548830294865;'/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/stateBased12975439237839612902.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA BusinessProcesses-PT-10-LTLCardinality-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property BusinessProcesses-PT-10-LTLCardinality-13 finished in 3341 ms.
All properties solved by simple procedures.
Total runtime 380394 ms.

BK_STOP 1779616806070

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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