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.r066-tall-177946967700444.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 CO4-PT-21, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r066-tall-177946967700444
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 760K
-rw-r--r-- 1 mcc users 6.8K Mar 6 13:30 CTLCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 6 13:30 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.5K Mar 6 13:30 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 13:30 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 08:34 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 08:34 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Mar 15 08:34 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 08:34 LTLFireability.xml
-rw-r--r-- 1 mcc users 13K Mar 6 13:30 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 141K Mar 6 13:30 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Mar 6 13:30 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 39K Mar 6 13:30 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Mar 15 08:34 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Mar 15 08:34 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 344K 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 CO4-PT-21-LTLFireability-00
FORMULA_NAME CO4-PT-21-LTLFireability-01
FORMULA_NAME CO4-PT-21-LTLFireability-02
FORMULA_NAME CO4-PT-21-LTLFireability-03
FORMULA_NAME CO4-PT-21-LTLFireability-04
FORMULA_NAME CO4-PT-21-LTLFireability-05
FORMULA_NAME CO4-PT-21-LTLFireability-06
FORMULA_NAME CO4-PT-21-LTLFireability-07
FORMULA_NAME CO4-PT-21-LTLFireability-08
FORMULA_NAME CO4-PT-21-LTLFireability-09
FORMULA_NAME CO4-PT-21-LTLFireability-10
FORMULA_NAME CO4-PT-21-LTLFireability-11
FORMULA_NAME CO4-PT-21-LTLFireability-12
FORMULA_NAME CO4-PT-21-LTLFireability-13
FORMULA_NAME CO4-PT-21-LTLFireability-14
FORMULA_NAME CO4-PT-21-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779529190560

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=CO4-PT-21
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-23 09:39:51] [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-23 09:39:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-23 09:39:51] [INFO ] Load time of PNML (sax parser for PT used): 110 ms
[2026-05-23 09:39:51] [INFO ] Transformed 1400 places.
[2026-05-23 09:39:51] [INFO ] Transformed 1583 transitions.
[2026-05-23 09:39:51] [INFO ] Found NUPN structural information;
[2026-05-23 09:39:51] [INFO ] Parsed PT model containing 1400 places and 1583 transitions and 3434 arcs in 204 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 8 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
Deduced a syphon composed of 307 places in 15 ms
Reduce places removed 307 places and 347 transitions.
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-21-LTLFireability-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-06 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA CO4-PT-21-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA CO4-PT-21-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 1093 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1093/1093 places, 1236/1236 transitions.
Reduce places removed 23 places and 0 transitions.
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 1070 transition count 1231
Discarding 165 places :
Symmetric choice reduction at 1 with 165 rule applications. Total rules 193 place count 905 transition count 1066
Iterating global reduction 1 with 165 rules applied. Total rules applied 358 place count 905 transition count 1066
Discarding 149 places :
Symmetric choice reduction at 1 with 149 rule applications. Total rules 507 place count 756 transition count 916
Iterating global reduction 1 with 149 rules applied. Total rules applied 656 place count 756 transition count 916
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 658 place count 756 transition count 914
Discarding 72 places :
Symmetric choice reduction at 2 with 72 rule applications. Total rules 730 place count 684 transition count 842
Iterating global reduction 2 with 72 rules applied. Total rules applied 802 place count 684 transition count 842
Discarding 52 places :
Symmetric choice reduction at 2 with 52 rule applications. Total rules 854 place count 632 transition count 790
Iterating global reduction 2 with 52 rules applied. Total rules applied 906 place count 632 transition count 790
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 908 place count 632 transition count 788
Discarding 26 places :
Symmetric choice reduction at 3 with 26 rule applications. Total rules 934 place count 606 transition count 762
Iterating global reduction 3 with 26 rules applied. Total rules applied 960 place count 606 transition count 762
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 962 place count 606 transition count 760
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 970 place count 598 transition count 752
Iterating global reduction 4 with 8 rules applied. Total rules applied 978 place count 598 transition count 752
Applied a total of 978 rules in 333 ms. Remains 598 /1093 variables (removed 495) and now considering 752/1236 (removed 484) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8296906358905326819.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18287699694446532306.kers'
[2026-05-23 09:39:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8296906358905326819.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18287699694446532306.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 752 rows 598 cols 1688 entries
Finished phase 1 with 593 SingleSign rule and 0 generalized
[2026-05-23 09:39:52] [INFO ] Computed 5 invariants in 2 ms
Computed 5 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-18287699694446532306.kers
Total runtime 4 ms.
[2026-05-23 09:39:52] [INFO ] Implicit Places using invariants in 315 ms returned [7]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 348 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 597/1093 places, 752/1236 transitions.
Applied a total of 0 rules in 14 ms. Remains 597 /597 variables (removed 0) and now considering 752/752 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 709 ms. Remains : 597/1093 places, 752/1236 transitions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Applied a total of 0 rules in 13 ms. Remains 597 /597 variables (removed 0) and now considering 752/752 (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-3656393490922183699.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5562579860309654577.kers'
[2026-05-23 09:39:52] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3656393490922183699.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5562579860309654577.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 752 rows 597 cols 1686 entries
Finished phase 1 with 593 SingleSign rule and 0 generalized
[2026-05-23 09:39:52] [INFO ] Computed 4 invariants in 2 ms
Computed 4 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-5562579860309654577.kers
Total runtime 4 ms.
[2026-05-23 09:39:52] [INFO ] Implicit Places using invariants in 132 ms returned []
[2026-05-23 09:39:52] [INFO ] Invariant cache hit.
[2026-05-23 09:39:53] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 450 ms to find 0 implicit places.
Running 751 sub problems to find dead transitions.
[2026-05-23 09:39:53] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 597/1349 variables, and 4 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 0/597 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 751 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/596 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 1 (OVERLAPS) 1/597 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/597 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 3 (OVERLAPS) 752/1349 variables, 597/601 constraints. Problems are: Problem set: 0 solved, 751 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1349 variables, 751/1352 constraints. Problems are: Problem set: 0 solved, 751 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1349/1349 variables, and 1352 constraints, problems are : Problem set: 0 solved, 751 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 751/751 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60228ms problems are : Problem set: 0 solved, 751 unsolved
Search for dead transitions found 0 dead transitions in 60242ms
Finished structural reductions in LTL mode , in 1 iterations and 60725 ms. Remains : 597/597 places, 752/752 transitions.
Support contains 23 out of 597 places after structural reductions.
[2026-05-23 09:40:53] [INFO ] Flatten gal took : 62 ms
[2026-05-23 09:40:53] [INFO ] Flatten gal took : 31 ms
[2026-05-23 09:40:53] [INFO ] Input system was already deterministic with 752 transitions.
RANDOM walk for 40000 steps (152 resets) in 1440 ms. (27 steps per ms) remains 13/21 properties
BEST_FIRST walk for 40001 steps (80 resets) in 738 ms. (54 steps per ms) remains 12/13 properties
BEST_FIRST walk for 40000 steps (101 resets) in 173 ms. (229 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40001 steps (123 resets) in 196 ms. (203 steps per ms) remains 12/12 properties
BEST_FIRST walk for 40000 steps (35 resets) in 146 ms. (272 steps per ms) remains 11/12 properties
BEST_FIRST walk for 40001 steps (118 resets) in 179 ms. (222 steps per ms) remains 9/11 properties
BEST_FIRST walk for 40000 steps (83 resets) in 116 ms. (341 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (67 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (90 resets) in 106 ms. (373 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (65 resets) in 132 ms. (300 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40001 steps (55 resets) in 118 ms. (336 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40000 steps (86 resets) in 123 ms. (322 steps per ms) remains 9/9 properties
[2026-05-23 09:40:55] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 20/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 102/131 variables, 19/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 328/459 variables, 106/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/459 variables, 0/134 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 12/471 variables, 1/135 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/471 variables, 2/137 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/471 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 17/488 variables, 3/140 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/488 variables, 0/140 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 489/977 variables, 243/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/977 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 260/1237 variables, 146/529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1237 variables, 0/529 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 94/1331 variables, 59/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1331 variables, 0/588 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 16/1347 variables, 11/599 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1347 variables, 0/599 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 2/1349 variables, 2/601 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1349 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 0/1349 variables, 0/601 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1349/1349 variables, and 601 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1694 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 20/29 variables, 9/9 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/29 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (OVERLAPS) 102/131 variables, 19/29 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 328/459 variables, 106/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/459 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (OVERLAPS) 12/471 variables, 1/144 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/471 variables, 2/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/471 variables, 0/146 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 12 (OVERLAPS) 17/488 variables, 3/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/488 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 14 (OVERLAPS) 489/977 variables, 243/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/977 variables, 0/392 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 16 (OVERLAPS) 260/1237 variables, 146/538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/1237 variables, 0/538 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 18 (OVERLAPS) 94/1331 variables, 59/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 19 (INCLUDED_ONLY) 0/1331 variables, 0/597 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 20 (OVERLAPS) 16/1347 variables, 11/608 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 21 (INCLUDED_ONLY) 0/1347 variables, 0/608 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 22 (OVERLAPS) 2/1349 variables, 2/610 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 23 (INCLUDED_ONLY) 0/1349 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 24 (OVERLAPS) 0/1349 variables, 0/610 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1349/1349 variables, and 610 constraints, problems are : Problem set: 0 solved, 9 unsolved in 3111 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 597/597 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4814ms problems are : Problem set: 0 solved, 9 unsolved
Fused 9 Parikh solutions to 8 different solutions.
Finished Parikh walk after 3427 steps, including 46 resets, run visited all 1 properties in 7 ms. (steps per millisecond=489 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Finished Parikh walk after 0 steps, including 0 resets, run visited all 0 properties in 1 ms. (steps per millisecond=0 )
Parikh walk visited 9 properties in 607 ms.
FORMULA CO4-PT-21-LTLFireability-09 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 943 edges and 597 vertex of which 592 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.11 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Graph (trivial) has 651 edges and 597 vertex of which 3 / 597 are part of one of the 1 SCC in 3 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 941 edges and 595 vertex of which 590 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 262 transitions
Trivial Post-agglo rules discarded 262 transitions
Performed 262 trivial Post agglomeration. Transition count delta: 262
Iterating post reduction 0 with 263 rules applied. Total rules applied 265 place count 589 transition count 480
Reduce places removed 262 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 264 rules applied. Total rules applied 529 place count 327 transition count 478
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 530 place count 326 transition count 478
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 530 place count 326 transition count 414
Deduced a syphon composed of 64 places in 1 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 658 place count 262 transition count 414
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 661 place count 259 transition count 411
Iterating global reduction 3 with 3 rules applied. Total rules applied 664 place count 259 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 664 place count 259 transition count 410
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 666 place count 258 transition count 410
Performed 101 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 868 place count 157 transition count 283
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 875 place count 157 transition count 276
Discarding 9 places :
Symmetric choice reduction at 4 with 9 rule applications. Total rules 884 place count 148 transition count 267
Iterating global reduction 4 with 9 rules applied. Total rules applied 893 place count 148 transition count 267
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 894 place count 148 transition count 266
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 900 place count 145 transition count 263
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 1 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 990 place count 100 transition count 266
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 5 with 29 rules applied. Total rules applied 1019 place count 100 transition count 237
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1059 place count 60 transition count 157
Iterating global reduction 6 with 40 rules applied. Total rules applied 1099 place count 60 transition count 157
Ensure Unique test removed 26 transitions
Reduce isomorphic transitions removed 26 transitions.
Iterating post reduction 6 with 26 rules applied. Total rules applied 1125 place count 60 transition count 131
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1135 place count 50 transition count 102
Iterating global reduction 7 with 10 rules applied. Total rules applied 1145 place count 50 transition count 102
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1152 place count 50 transition count 95
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1154 place count 49 transition count 103
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1166 place count 49 transition count 91
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1168 place count 47 transition count 89
Applied a total of 1168 rules in 96 ms. Remains 47 /597 variables (removed 550) and now considering 89/752 (removed 663) transitions.
[2026-05-23 09:41:00] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-15040691963508784480.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2107035054596180637.kers'
[2026-05-23 09:41:01] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15040691963508784480.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2107035054596180637.kers]
Normalized transition count is 80 out of 81 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 80 rows 47 cols 242 entries
Finished phase 1 with 43 SingleSign rule and 0 generalized
[2026-05-23 09:41:01] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-2107035054596180637.kers
Total runtime 4 ms.
[2026-05-23 09:41:01] [INFO ] Implicit Places using invariants in 47 ms returned []
[2026-05-23 09:41:01] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
[2026-05-23 09:41:01] [INFO ] Invariant cache hit.
[2026-05-23 09:41:01] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:41:01] [INFO ] Implicit Places using invariants and state equation in 73 ms returned []
Implicit Place search using SMT with State Equation took 123 ms to find 0 implicit places.
[2026-05-23 09:41:01] [INFO ] Redundant transitions in 3 ms returned []
Running 76 sub problems to find dead transitions.
[2026-05-23 09:41:01] [INFO ] Flow matrix only has 81 transitions (discarded 8 similar events)
[2026-05-23 09:41:01] [INFO ] Invariant cache hit.
[2026-05-23 09:41:01] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 80/127 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 0/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (OVERLAPS) 1/128 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/128 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (OVERLAPS) 0/128 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Real declared 128/128 variables, and 53 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2015 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 76 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/47 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/47 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 2 (OVERLAPS) 80/127 variables, 47/51 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/127 variables, 1/52 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/127 variables, 76/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/127 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 6 (OVERLAPS) 1/128 variables, 1/129 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 76 unsolved
At refinement iteration 8 (OVERLAPS) 0/128 variables, 0/129 constraints. Problems are: Problem set: 0 solved, 76 unsolved
No progress, stopping.
After SMT solving in domain Int declared 128/128 variables, and 129 constraints, problems are : Problem set: 0 solved, 76 unsolved in 2349 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 47/47 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 76/76 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4397ms problems are : Problem set: 0 solved, 76 unsolved
Search for dead transitions found 0 dead transitions in 4398ms
Starting structural reductions in SI_LTL mode, iteration 1 : 47/597 places, 89/752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4626 ms. Remains : 47/597 places, 89/752 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 159 ms :[(NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-01
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 3 ms.
FORMULA CO4-PT-21-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-01 finished in 4877 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 (p1||F(p2)))&&X(X(p3)))))'
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 592 transition count 747
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 592 transition count 747
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 14 place count 588 transition count 743
Iterating global reduction 0 with 4 rules applied. Total rules applied 18 place count 588 transition count 743
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 19 place count 588 transition count 742
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 587 transition count 741
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 587 transition count 741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 586 transition count 740
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 586 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 24 place count 586 transition count 739
Applied a total of 24 rules in 100 ms. Remains 586 /597 variables (removed 11) and now considering 739/752 (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-8924583639374472393.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5119306251974933529.kers'
[2026-05-23 09:41:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8924583639374472393.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5119306251974933529.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 739 rows 586 cols 1660 entries
Finished phase 1 with 582 SingleSign rule and 0 generalized
[2026-05-23 09:41:05] [INFO ] Computed 4 invariants in 9 ms
Computed 4 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-5119306251974933529.kers
Total runtime 10 ms.
[2026-05-23 09:41:05] [INFO ] Implicit Places using invariants in 124 ms returned []
[2026-05-23 09:41:05] [INFO ] Invariant cache hit.
[2026-05-23 09:41:06] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 423 ms to find 0 implicit places.
Running 738 sub problems to find dead transitions.
[2026-05-23 09:41:06] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1325/1325 variables, and 590 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 738 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/585 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 1 (OVERLAPS) 1/586 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/586 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 3 (OVERLAPS) 739/1325 variables, 586/590 constraints. Problems are: Problem set: 0 solved, 738 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1325 variables, 738/1328 constraints. Problems are: Problem set: 0 solved, 738 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1325/1325 variables, and 1329 constraints, problems are : Problem set: 0 solved, 738 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 586/586 constraints, PredecessorRefiner: 738/738 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60140ms problems are : Problem set: 0 solved, 738 unsolved
Search for dead transitions found 0 dead transitions in 60142ms
Starting structural reductions in LTL mode, iteration 1 : 586/597 places, 739/752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60669 ms. Remains : 586/597 places, 739/752 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 (p1||F(p2)))&&X(X(p3)))))'
Stuttering acceptance computed with spot in 279 ms :[(OR (NOT p3) (AND (NOT p1) (NOT p2))), (OR (NOT p3) (AND (NOT p1) (NOT p2))), (NOT p3), (AND (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (NOT p3), true]
Running random walk in product with property : CO4-PT-21-LTLFireability-03
Stuttering criterion allowed to conclude after 33 steps with 0 reset in 1 ms.
FORMULA CO4-PT-21-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-03 finished in 61003 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((X(p0)||G(p1))))))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 592 transition count 747
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 592 transition count 747
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 15 place count 587 transition count 742
Iterating global reduction 0 with 5 rules applied. Total rules applied 20 place count 587 transition count 742
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 21 place count 587 transition count 741
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 586 transition count 740
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 586 transition count 740
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 585 transition count 739
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 585 transition count 739
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 26 place count 585 transition count 738
Applied a total of 26 rules in 53 ms. Remains 585 /597 variables (removed 12) and now considering 738/752 (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-18351791837776799098.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12923899524222009471.kers'
[2026-05-23 09:42:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-18351791837776799098.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12923899524222009471.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 738 rows 585 cols 1658 entries
Finished phase 1 with 581 SingleSign rule and 0 generalized
[2026-05-23 09:42:06] [INFO ] Computed 4 invariants in 4 ms
Computed 4 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-12923899524222009471.kers
Total runtime 5 ms.
[2026-05-23 09:42:06] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-23 09:42:06] [INFO ] Invariant cache hit.
[2026-05-23 09:42:07] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
Running 737 sub problems to find dead transitions.
[2026-05-23 09:42:07] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1323/1323 variables, and 589 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30025 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 737 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/584 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 1 (OVERLAPS) 1/585 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/585 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 3 (OVERLAPS) 738/1323 variables, 585/589 constraints. Problems are: Problem set: 0 solved, 737 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1323 variables, 737/1326 constraints. Problems are: Problem set: 0 solved, 737 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1323/1323 variables, and 1326 constraints, problems are : Problem set: 0 solved, 737 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 585/585 constraints, PredecessorRefiner: 737/737 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60115ms problems are : Problem set: 0 solved, 737 unsolved
Search for dead transitions found 0 dead transitions in 60117ms
Starting structural reductions in LTL mode, iteration 1 : 585/597 places, 738/752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60629 ms. Remains : 585/597 places, 738/752 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X((X(p0)||G(p1))))))'
Stuttering acceptance computed with spot in 204 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0), (AND (NOT p1) (NOT p0)), true, (NOT p1)]
Running random walk in product with property : CO4-PT-21-LTLFireability-04
Entered a terminal (fully accepting) state of product in 6 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-04 finished in 60869 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||X(X(X(F(p1))))))))'
Support contains 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 591 transition count 746
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 591 transition count 746
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 585 transition count 740
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 585 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 585 transition count 739
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 584 transition count 738
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 584 transition count 738
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 583 transition count 737
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 583 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 583 transition count 736
Applied a total of 30 rules in 55 ms. Remains 583 /597 variables (removed 14) and now considering 736/752 (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-2485076882361067422.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1754141317468859541.kers'
[2026-05-23 09:43:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2485076882361067422.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1754141317468859541.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 736 rows 583 cols 1654 entries
Finished phase 1 with 579 SingleSign rule and 0 generalized
[2026-05-23 09:43:07] [INFO ] Computed 4 invariants in 6 ms
Computed 4 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-1754141317468859541.kers
Total runtime 8 ms.
[2026-05-23 09:43:07] [INFO ] Implicit Places using invariants in 115 ms returned []
[2026-05-23 09:43:07] [INFO ] Invariant cache hit.
[2026-05-23 09:43:08] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 415 ms to find 0 implicit places.
Running 735 sub problems to find dead transitions.
[2026-05-23 09:43:08] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1319/1319 variables, and 587 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 735 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/582 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 1 (OVERLAPS) 1/583 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/583 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 3 (OVERLAPS) 736/1319 variables, 583/587 constraints. Problems are: Problem set: 0 solved, 735 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1319 variables, 735/1322 constraints. Problems are: Problem set: 0 solved, 735 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1319/1319 variables, and 1322 constraints, problems are : Problem set: 0 solved, 735 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 583/583 constraints, PredecessorRefiner: 735/735 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60130ms problems are : Problem set: 0 solved, 735 unsolved
Search for dead transitions found 0 dead transitions in 60132ms
Starting structural reductions in LTL mode, iteration 1 : 583/597 places, 736/752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60604 ms. Remains : 583/597 places, 736/752 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||X(X(X(F(p1))))))))'
Stuttering acceptance computed with spot in 184 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-21-LTLFireability-05
Stuttering criterion allowed to conclude after 34 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-05 finished in 60820 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(!p0)))'
Support contains 1 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 591 transition count 746
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 591 transition count 746
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 18 place count 585 transition count 740
Iterating global reduction 0 with 6 rules applied. Total rules applied 24 place count 585 transition count 740
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 25 place count 585 transition count 739
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 584 transition count 738
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 584 transition count 738
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 583 transition count 737
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 583 transition count 737
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 30 place count 583 transition count 736
Applied a total of 30 rules in 55 ms. Remains 583 /597 variables (removed 14) and now considering 736/752 (removed 16) transitions.
[2026-05-23 09:44:08] [INFO ] Invariant cache hit.
[2026-05-23 09:44:08] [INFO ] Implicit Places using invariants in 125 ms returned []
[2026-05-23 09:44:08] [INFO ] Invariant cache hit.
[2026-05-23 09:44:08] [INFO ] Implicit Places using invariants and state equation in 284 ms returned []
Implicit Place search using SMT with State Equation took 411 ms to find 0 implicit places.
Skipped dead transition search.
Starting structural reductions in LTL mode, iteration 1 : 583/597 places, 736/752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 466 ms. Remains : 583/597 places, 736/752 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(p0)||G(!p0)))'
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p0), false, false, p0]
Running random walk in product with property : CO4-PT-21-LTLFireability-07
Product exploration explored 100000 steps with 8 reset in 169 ms.
Product exploration explored 100000 steps with 1 reset in 105 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 927 edges and 583 vertex of which 578 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Knowledge based reduction with 3 factoid took 43 ms. Reduced automaton from 5 states, 7 edges and 1 AP (stutter sensitive) to 4 states, 7 edges and 1 AP (stutter insensitive).
RANDOM walk for 40000 steps (25 resets) in 128 ms. (310 steps per ms) remains 1/1 properties
BEST_FIRST walk for 32130 steps (123 resets) in 66 ms. (479 steps per ms) remains 0/1 properties
Negative knowledge disproves property using: (G (NOT p0))
Knowledge based reduction with 3 factoid took 31 ms. Proved property starting from automaton with 4 states, 7 edges and 1 AP (stutter insensitive
Knowledge-based reduction took 188 ms.
FORMULA CO4-PT-21-LTLFireability-07 FALSE TECHNIQUES NEGATIVE_KNOWLEDGE
Treatment of property CO4-PT-21-LTLFireability-07 finished in 1107 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 2 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Graph (trivial) has 647 edges and 597 vertex of which 3 / 597 are part of one of the 1 SCC in 2 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 941 edges and 595 vertex of which 590 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.6 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 261 transitions
Trivial Post-agglo rules discarded 261 transitions
Performed 261 trivial Post agglomeration. Transition count delta: 261
Iterating post reduction 0 with 262 rules applied. Total rules applied 264 place count 589 transition count 481
Reduce places removed 261 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 263 rules applied. Total rules applied 527 place count 328 transition count 479
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 530 place count 327 transition count 477
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 532 place count 325 transition count 477
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 64 Pre rules applied. Total rules applied 532 place count 325 transition count 413
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 4 with 128 rules applied. Total rules applied 660 place count 261 transition count 413
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 663 place count 258 transition count 410
Iterating global reduction 4 with 3 rules applied. Total rules applied 666 place count 258 transition count 410
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 666 place count 258 transition count 409
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 668 place count 257 transition count 409
Performed 98 Post agglomeration using F-continuation condition with reduction of 27 identical transitions.
Deduced a syphon composed of 98 places in 0 ms
Reduce places removed 98 places and 0 transitions.
Iterating global reduction 4 with 196 rules applied. Total rules applied 864 place count 159 transition count 284
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 4 with 7 rules applied. Total rules applied 871 place count 159 transition count 277
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 880 place count 150 transition count 268
Iterating global reduction 5 with 9 rules applied. Total rules applied 889 place count 150 transition count 268
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 890 place count 150 transition count 267
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 896 place count 147 transition count 264
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 6 with 90 rules applied. Total rules applied 986 place count 102 transition count 267
Ensure Unique test removed 28 transitions
Reduce isomorphic transitions removed 28 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 1014 place count 102 transition count 239
Discarding 39 places :
Symmetric choice reduction at 7 with 39 rule applications. Total rules 1053 place count 63 transition count 161
Iterating global reduction 7 with 39 rules applied. Total rules applied 1092 place count 63 transition count 161
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 7 with 24 rules applied. Total rules applied 1116 place count 63 transition count 137
Discarding 10 places :
Symmetric choice reduction at 8 with 10 rule applications. Total rules 1126 place count 53 transition count 108
Iterating global reduction 8 with 10 rules applied. Total rules applied 1136 place count 53 transition count 108
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1142 place count 53 transition count 102
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1144 place count 52 transition count 111
Drop transitions (Redundant composition of simpler transitions.) removed 16 transitions
Redundant transition composition rules discarded 16 transitions
Iterating global reduction 9 with 16 rules applied. Total rules applied 1160 place count 52 transition count 95
Partial Post-agglomeration rule applied 5 times.
Drop transitions (Partial Post agglomeration) removed 5 transitions
Iterating global reduction 9 with 5 rules applied. Total rules applied 1165 place count 52 transition count 95
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1167 place count 50 transition count 93
Applied a total of 1167 rules in 74 ms. Remains 50 /597 variables (removed 547) and now considering 93/752 (removed 659) transitions.
[2026-05-23 09:44:09] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-555575812422890947.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8154264401016969780.kers'
[2026-05-23 09:44:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-555575812422890947.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8154264401016969780.kers]
Normalized transition count is 84 out of 85 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 84 rows 50 cols 250 entries
Finished phase 1 with 46 SingleSign rule and 0 generalized
[2026-05-23 09:44:09] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-8154264401016969780.kers
Total runtime 0 ms.
[2026-05-23 09:44:09] [INFO ] Implicit Places using invariants in 37 ms returned []
[2026-05-23 09:44:09] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2026-05-23 09:44:09] [INFO ] Invariant cache hit.
[2026-05-23 09:44:09] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:44:09] [INFO ] Implicit Places using invariants and state equation in 49 ms returned []
Implicit Place search using SMT with State Equation took 89 ms to find 0 implicit places.
[2026-05-23 09:44:09] [INFO ] Redundant transitions in 1 ms returned []
Running 80 sub problems to find dead transitions.
[2026-05-23 09:44:09] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2026-05-23 09:44:09] [INFO ] Invariant cache hit.
[2026-05-23 09:44:09] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 84/134 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (OVERLAPS) 1/135 variables, 1/56 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (OVERLAPS) 0/135 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Real declared 135/135 variables, and 56 constraints, problems are : Problem set: 0 solved, 80 unsolved in 1829 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 80 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 2 (OVERLAPS) 84/134 variables, 50/54 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 1/55 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 80/135 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/134 variables, 0/135 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 6 (OVERLAPS) 1/135 variables, 1/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
At refinement iteration 8 (OVERLAPS) 0/135 variables, 0/136 constraints. Problems are: Problem set: 0 solved, 80 unsolved
No progress, stopping.
After SMT solving in domain Int declared 135/135 variables, and 136 constraints, problems are : Problem set: 0 solved, 80 unsolved in 2653 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 50/50 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 80/80 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4493ms problems are : Problem set: 0 solved, 80 unsolved
Search for dead transitions found 0 dead transitions in 4494ms
Starting structural reductions in SI_LTL mode, iteration 1 : 50/597 places, 93/752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 4662 ms. Remains : 50/597 places, 93/752 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 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : CO4-PT-21-LTLFireability-10
Product exploration explored 100000 steps with 7 reset in 73 ms.
Product exploration explored 100000 steps with 23 reset in 83 ms.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge based reduction with 9 factoid took 42 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 27960 steps (2618 resets) in 205 ms. (135 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 73 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 276 ms.
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 50 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 50/50 places, 93/93 transitions.
Applied a total of 0 rules in 5 ms. Remains 50 /50 variables (removed 0) and now considering 93/93 (removed 0) transitions.
[2026-05-23 09:44:14] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2026-05-23 09:44:14] [INFO ] Invariant cache hit.
[2026-05-23 09:44:14] [INFO ] Implicit Places using invariants in 30 ms returned []
[2026-05-23 09:44:14] [INFO ] Flow matrix only has 85 transitions (discarded 8 similar events)
[2026-05-23 09:44:14] [INFO ] Invariant cache hit.
[2026-05-23 09:44:14] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:44:14] [INFO ] Implicit Places using invariants and state equation in 47 ms returned []
Implicit Place search using SMT with State Equation took 87 ms to find 0 implicit places.
[2026-05-23 09:44:14] [INFO ] Redundant transitions in 2 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 98 ms. Remains : 50/50 places, 93/93 transitions.
Computed a total of 7 stabilizing places and 15 stable transitions
Computed a total of 7 stabilizing places and 15 stable transitions
Knowledge based reduction with 9 factoid took 46 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 12247 steps (1154 resets) in 62 ms. (194 steps per ms) remains 0/4 properties
Knowledge based reduction with 9 factoid took 82 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 250 ms.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 7 reset in 35 ms.
Product exploration explored 100000 steps with 5 reset in 39 ms.
Built C files in :
/tmp/ltsmin12511284336560289160
[2026-05-23 09:44:15] [INFO ] Computing symmetric may disable matrix : 93 transitions.
[2026-05-23 09:44:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 09:44:15] [INFO ] Computing symmetric may enable matrix : 93 transitions.
[2026-05-23 09:44:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 09:44:15] [INFO ] Computing Do-Not-Accords matrix : 93 transitions.
[2026-05-23 09:44:15] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-23 09:44:15] [INFO ] Built C files in 26ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12511284336560289160
Running compilation step : cd /tmp/ltsmin12511284336560289160;'/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 282 ms.
Running link step : cd /tmp/ltsmin12511284336560289160;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin12511284336560289160;'/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/stateBased14938791044421710462.hoa' '--buchi-type=spotba'
LTSmin run took 60 ms.
FORMULA CO4-PT-21-LTLFireability-10 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property CO4-PT-21-LTLFireability-10 finished in 6327 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 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Graph (trivial) has 651 edges and 597 vertex of which 3 / 597 are part of one of the 1 SCC in 0 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 941 edges and 595 vertex of which 590 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 263 transitions
Trivial Post-agglo rules discarded 263 transitions
Performed 263 trivial Post agglomeration. Transition count delta: 263
Iterating post reduction 0 with 264 rules applied. Total rules applied 266 place count 589 transition count 479
Reduce places removed 263 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 265 rules applied. Total rules applied 531 place count 326 transition count 477
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 532 place count 325 transition count 477
Performed 64 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 64 Pre rules applied. Total rules applied 532 place count 325 transition count 413
Deduced a syphon composed of 64 places in 0 ms
Reduce places removed 64 places and 0 transitions.
Iterating global reduction 3 with 128 rules applied. Total rules applied 660 place count 261 transition count 413
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 662 place count 259 transition count 411
Iterating global reduction 3 with 2 rules applied. Total rules applied 664 place count 259 transition count 411
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 664 place count 259 transition count 410
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 666 place count 258 transition count 410
Performed 101 Post agglomeration using F-continuation condition with reduction of 28 identical transitions.
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 868 place count 157 transition count 281
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 3 with 7 rules applied. Total rules applied 875 place count 157 transition count 274
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 883 place count 149 transition count 266
Iterating global reduction 4 with 8 rules applied. Total rules applied 891 place count 149 transition count 266
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 892 place count 149 transition count 265
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 898 place count 146 transition count 262
Performed 45 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 5 with 90 rules applied. Total rules applied 988 place count 101 transition count 265
Ensure Unique test removed 30 transitions
Reduce isomorphic transitions removed 30 transitions.
Iterating post reduction 5 with 30 rules applied. Total rules applied 1018 place count 101 transition count 235
Discarding 40 places :
Symmetric choice reduction at 6 with 40 rule applications. Total rules 1058 place count 61 transition count 155
Iterating global reduction 6 with 40 rules applied. Total rules applied 1098 place count 61 transition count 155
Ensure Unique test removed 27 transitions
Reduce isomorphic transitions removed 27 transitions.
Iterating post reduction 6 with 27 rules applied. Total rules applied 1125 place count 61 transition count 128
Discarding 10 places :
Symmetric choice reduction at 7 with 10 rule applications. Total rules 1135 place count 51 transition count 99
Iterating global reduction 7 with 10 rules applied. Total rules applied 1145 place count 51 transition count 99
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Iterating post reduction 7 with 7 rules applied. Total rules applied 1152 place count 51 transition count 92
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1154 place count 50 transition count 100
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 8 with 12 rules applied. Total rules applied 1166 place count 50 transition count 88
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 1168 place count 48 transition count 86
Applied a total of 1168 rules in 44 ms. Remains 48 /597 variables (removed 549) and now considering 86/752 (removed 666) transitions.
[2026-05-23 09:44:15] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16826504302771261458.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16210269783047949307.kers'
[2026-05-23 09:44:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16826504302771261458.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16210269783047949307.kers]
Normalized transition count is 77 out of 78 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 77 rows 48 cols 235 entries
Finished phase 1 with 44 SingleSign rule and 0 generalized
[2026-05-23 09:44:15] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-16210269783047949307.kers
Total runtime 0 ms.
[2026-05-23 09:44:15] [INFO ] Implicit Places using invariants in 35 ms returned []
[2026-05-23 09:44:15] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-23 09:44:15] [INFO ] Invariant cache hit.
[2026-05-23 09:44:15] [INFO ] State equation strengthened by 2 read => feed constraints.
[2026-05-23 09:44:15] [INFO ] Implicit Places using invariants and state equation in 54 ms returned []
Implicit Place search using SMT with State Equation took 103 ms to find 0 implicit places.
[2026-05-23 09:44:16] [INFO ] Redundant transitions in 1 ms returned []
Running 73 sub problems to find dead transitions.
[2026-05-23 09:44:16] [INFO ] Flow matrix only has 78 transitions (discarded 8 similar events)
[2026-05-23 09:44:16] [INFO ] Invariant cache hit.
[2026-05-23 09:44:16] [INFO ] State equation strengthened by 2 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (OVERLAPS) 1/126 variables, 1/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (OVERLAPS) 0/126 variables, 0/54 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Real declared 126/126 variables, and 54 constraints, problems are : Problem set: 0 solved, 73 unsolved in 1593 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 73 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/48 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/48 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 2 (OVERLAPS) 77/125 variables, 48/52 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/53 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 73/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/125 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 6 (OVERLAPS) 1/126 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
At refinement iteration 8 (OVERLAPS) 0/126 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 73 unsolved
No progress, stopping.
After SMT solving in domain Int declared 126/126 variables, and 127 constraints, problems are : Problem set: 0 solved, 73 unsolved in 2218 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 48/48 constraints, ReadFeed: 2/2 constraints, PredecessorRefiner: 73/73 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3820ms problems are : Problem set: 0 solved, 73 unsolved
Search for dead transitions found 0 dead transitions in 3820ms
Starting structural reductions in SI_LTL mode, iteration 1 : 48/597 places, 86/752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3972 ms. Remains : 48/597 places, 86/752 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 67 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : CO4-PT-21-LTLFireability-11
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-11 finished in 4067 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))||G(p1)) U (X(p2) U ((p3&&X(p2))||X(G(p2))))))'
Support contains 4 out of 597 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 594 transition count 749
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 594 transition count 749
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 9 place count 591 transition count 746
Iterating global reduction 0 with 3 rules applied. Total rules applied 12 place count 591 transition count 746
Applied a total of 12 rules in 39 ms. Remains 591 /597 variables (removed 6) and now considering 746/752 (removed 6) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14525194493467500722.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-533811471474390546.kers'
[2026-05-23 09:44:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14525194493467500722.kers, --Pflows, --basisKERS=/tmp/petrispot-output-533811471474390546.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 746 rows 591 cols 1674 entries
Finished phase 1 with 587 SingleSign rule and 0 generalized
[2026-05-23 09:44:19] [INFO ] Computed 4 invariants in 5 ms
Computed 4 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-533811471474390546.kers
Total runtime 5 ms.
[2026-05-23 09:44:20] [INFO ] Implicit Places using invariants in 116 ms returned []
[2026-05-23 09:44:20] [INFO ] Invariant cache hit.
[2026-05-23 09:44:20] [INFO ] Implicit Places using invariants and state equation in 287 ms returned []
Implicit Place search using SMT with State Equation took 405 ms to find 0 implicit places.
Running 745 sub problems to find dead transitions.
[2026-05-23 09:44:20] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 3 (OVERLAPS) 746/1337 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 1337/1337 variables, and 595 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 745 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/590 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 1 (OVERLAPS) 1/591 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/591 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 3 (OVERLAPS) 746/1337 variables, 591/595 constraints. Problems are: Problem set: 0 solved, 745 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1337 variables, 745/1340 constraints. Problems are: Problem set: 0 solved, 745 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1337/1337 variables, and 1340 constraints, problems are : Problem set: 0 solved, 745 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 591/591 constraints, PredecessorRefiner: 745/745 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60109ms problems are : Problem set: 0 solved, 745 unsolved
Search for dead transitions found 0 dead transitions in 60111ms
Starting structural reductions in LTL mode, iteration 1 : 591/597 places, 746/752 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 60557 ms. Remains : 591/597 places, 746/752 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(G(p0))||G(p1)) U (X(p2) U (X(G(p2))||(p3&&X(p2))))))'
Stuttering acceptance computed with spot in 271 ms :[(AND (NOT p2) (NOT p0)), (NOT p2), (AND (NOT p0) p1 (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : CO4-PT-21-LTLFireability-13
Product exploration explored 100000 steps with 50000 reset in 226 ms.
Product exploration explored 100000 steps with 50000 reset in 290 ms.
Computed a total of 15 stabilizing places and 18 stable transitions
Graph (complete) has 937 edges and 591 vertex of which 586 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.3 ms
Computed a total of 15 stabilizing places and 18 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 33 factoid took 11 ms. Proved property starting from automaton with 7 states, 24 edges and 4 AP (stutter sensitive
Knowledge-based reduction took 17 ms.
FORMULA CO4-PT-21-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property CO4-PT-21-LTLFireability-13 finished in 61416 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||G(p1)))&&F(p2)))'
Support contains 5 out of 597 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 597/597 places, 752/752 transitions.
Graph (trivial) has 642 edges and 597 vertex of which 3 / 597 are part of one of the 1 SCC in 1 ms
Free SCC test removed 2 places
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Graph (complete) has 941 edges and 595 vertex of which 590 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 6 output transitions
Drop transitions (Output transitions of discarded places.) removed 6 transitions
Reduce places removed 1 places and 1 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 258 transitions
Trivial Post-agglo rules discarded 258 transitions
Performed 258 trivial Post agglomeration. Transition count delta: 258
Iterating post reduction 0 with 259 rules applied. Total rules applied 261 place count 589 transition count 484
Reduce places removed 258 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 260 rules applied. Total rules applied 521 place count 331 transition count 482
Reduce places removed 1 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 3 rules applied. Total rules applied 524 place count 330 transition count 480
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 526 place count 328 transition count 480
Performed 63 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 63 Pre rules applied. Total rules applied 526 place count 328 transition count 417
Deduced a syphon composed of 63 places in 0 ms
Reduce places removed 63 places and 0 transitions.
Iterating global reduction 4 with 126 rules applied. Total rules applied 652 place count 265 transition count 417
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 655 place count 262 transition count 414
Iterating global reduction 4 with 3 rules applied. Total rules applied 658 place count 262 transition count 414
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 658 place count 262 transition count 413
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 660 place count 261 transition count 413
Performed 99 Post agglomeration using F-continuation condition with reduction of 26 identical transitions.
Deduced a syphon composed of 99 places in 0 ms
Reduce places removed 99 places and 0 transitions.
Iterating global reduction 4 with 198 rules applied. Total rules applied 858 place count 162 transition count 288
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 4 with 6 rules applied. Total rules applied 864 place count 162 transition count 282
Discarding 9 places :
Symmetric choice reduction at 5 with 9 rule applications. Total rules 873 place count 153 transition count 273
Iterating global reduction 5 with 9 rules applied. Total rules applied 882 place count 153 transition count 273
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 883 place count 153 transition count 272
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 6 with 6 rules applied. Total rules applied 889 place count 150 transition count 269
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 6 with 88 rules applied. Total rules applied 977 place count 106 transition count 272
Ensure Unique test removed 29 transitions
Reduce isomorphic transitions removed 29 transitions.
Iterating post reduction 6 with 29 rules applied. Total rules applied 1006 place count 106 transition count 243
Discarding 38 places :
Symmetric choice reduction at 7 with 38 rule applications. Total rules 1044 place count 68 transition count 167
Iterating global reduction 7 with 38 rules applied. Total rules applied 1082 place count 68 transition count 167
Ensure Unique test removed 25 transitions
Reduce isomorphic transitions removed 25 transitions.
Iterating post reduction 7 with 25 rules applied. Total rules applied 1107 place count 68 transition count 142
Discarding 9 places :
Symmetric choice reduction at 8 with 9 rule applications. Total rules 1116 place count 59 transition count 116
Iterating global reduction 8 with 9 rules applied. Total rules applied 1125 place count 59 transition count 116
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 8 with 6 rules applied. Total rules applied 1131 place count 59 transition count 110
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1134 place count 59 transition count 107
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1136 place count 58 transition count 116
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 1139 place count 58 transition count 113
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1141 place count 56 transition count 111
Applied a total of 1141 rules in 52 ms. Remains 56 /597 variables (removed 541) and now considering 111/752 (removed 641) transitions.
[2026-05-23 09:45:21] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2100314577749759215.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9842923419283942366.kers'
[2026-05-23 09:45:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2100314577749759215.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9842923419283942366.kers]
Normalized transition count is 102 out of 103 initially.
Culled 0 columns in 0 ms.
// Phase 1: matrix 102 rows 56 cols 322 entries
Finished phase 1 with 52 SingleSign rule and 0 generalized
[2026-05-23 09:45:21] [INFO ] Computed 4 invariants in 0 ms
Computed 4 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-9842923419283942366.kers
Total runtime 2 ms.
[2026-05-23 09:45:21] [INFO ] Implicit Places using invariants in 40 ms returned []
[2026-05-23 09:45:21] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2026-05-23 09:45:21] [INFO ] Invariant cache hit.
[2026-05-23 09:45:21] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-23 09:45:21] [INFO ] Implicit Places using invariants and state equation in 50 ms returned []
Implicit Place search using SMT with State Equation took 91 ms to find 0 implicit places.
[2026-05-23 09:45:21] [INFO ] Redundant transitions in 2 ms returned []
Running 98 sub problems to find dead transitions.
[2026-05-23 09:45:21] [INFO ] Flow matrix only has 103 transitions (discarded 8 similar events)
[2026-05-23 09:45:21] [INFO ] Invariant cache hit.
[2026-05-23 09:45:21] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 102/157 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (OVERLAPS) 1/158 variables, 1/62 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/158 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (OVERLAPS) 1/159 variables, 1/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/159 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 0/159 variables, 0/63 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Real declared 159/159 variables, and 63 constraints, problems are : Problem set: 0 solved, 98 unsolved in 3343 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 98 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/55 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/55 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 2 (OVERLAPS) 102/157 variables, 55/59 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/157 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/157 variables, 30/91 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/157 variables, 0/91 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 6 (OVERLAPS) 1/158 variables, 1/92 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/158 variables, 68/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/158 variables, 0/160 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 9 (OVERLAPS) 1/159 variables, 1/161 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/159 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 98 unsolved
At refinement iteration 11 (OVERLAPS) 0/159 variables, 0/161 constraints. Problems are: Problem set: 0 solved, 98 unsolved
No progress, stopping.
After SMT solving in domain Int declared 159/159 variables, and 161 constraints, problems are : Problem set: 0 solved, 98 unsolved in 4113 ms.
Refiners :[Positive P Invariants (semi-flows): 4/4 constraints, State Equation: 56/56 constraints, ReadFeed: 3/3 constraints, PredecessorRefiner: 98/98 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7480ms problems are : Problem set: 0 solved, 98 unsolved
Search for dead transitions found 0 dead transitions in 7480ms
Starting structural reductions in SI_LTL mode, iteration 1 : 56/597 places, 111/752 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 7630 ms. Remains : 56/597 places, 111/752 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||G(p1)))&&F(p2)))'
Stuttering acceptance computed with spot in 122 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : CO4-PT-21-LTLFireability-14
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 0 ms.
FORMULA CO4-PT-21-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property CO4-PT-21-LTLFireability-14 finished in 7781 ms.
All properties solved by simple procedures.
Total runtime 337467 ms.

BK_STOP 1779529529153

--------------------
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="CO4-PT-21"
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 CO4-PT-21, 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 r066-tall-177946967700444"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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