Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/sdalzilio/mcc2026-input.r002-oct2-177944366200332.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 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 ASLink-PT-04a, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366200332
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 900K
-rw-r--r-- 1 mcc users 9.6K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 115K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.2K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 29K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.4K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 21K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.2K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.6K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 436K 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 ASLink-PT-04a-LTLFireability-00
FORMULA_NAME ASLink-PT-04a-LTLFireability-01
FORMULA_NAME ASLink-PT-04a-LTLFireability-02
FORMULA_NAME ASLink-PT-04a-LTLFireability-03
FORMULA_NAME ASLink-PT-04a-LTLFireability-04
FORMULA_NAME ASLink-PT-04a-LTLFireability-05
FORMULA_NAME ASLink-PT-04a-LTLFireability-06
FORMULA_NAME ASLink-PT-04a-LTLFireability-07
FORMULA_NAME ASLink-PT-04a-LTLFireability-08
FORMULA_NAME ASLink-PT-04a-LTLFireability-09
FORMULA_NAME ASLink-PT-04a-LTLFireability-10
FORMULA_NAME ASLink-PT-04a-LTLFireability-11
FORMULA_NAME ASLink-PT-04a-LTLFireability-12
FORMULA_NAME ASLink-PT-04a-LTLFireability-13
FORMULA_NAME ASLink-PT-04a-LTLFireability-14
FORMULA_NAME ASLink-PT-04a-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1779474097666

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202604301425
[2026-05-22 18:21:39] [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-22 18:21:39] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:21:39] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2026-05-22 18:21:39] [INFO ] Transformed 1016 places.
[2026-05-22 18:21:39] [INFO ] Transformed 1554 transitions.
[2026-05-22 18:21:39] [INFO ] Found NUPN structural information;
[2026-05-22 18:21:39] [INFO ] Parsed PT model containing 1016 places and 1554 transitions and 5858 arcs in 307 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 24 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 16 transitions
Reduce redundant transitions removed 16 transitions.
FORMULA ASLink-PT-04a-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-15 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 57 out of 1016 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1016/1016 places, 1538/1538 transitions.
Ensure Unique test removed 16 places
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 0 with 23 rules applied. Total rules applied 23 place count 993 transition count 1538
Discarding 8 places :
Symmetric choice reduction at 1 with 8 rule applications. Total rules 31 place count 985 transition count 1507
Ensure Unique test removed 1 places
Iterating global reduction 1 with 9 rules applied. Total rules applied 40 place count 984 transition count 1507
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 42 place count 984 transition count 1505
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 43 place count 983 transition count 1497
Iterating global reduction 2 with 1 rules applied. Total rules applied 44 place count 983 transition count 1497
Applied a total of 44 rules in 294 ms. Remains 983 /1016 variables (removed 33) and now considering 1497/1538 (removed 41) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6969447740384244432.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4696950964844456212.kers'
[2026-05-22 18:21:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6969447740384244432.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4696950964844456212.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1497 rows 983 cols 5620 entries
Finished phase 1 with 377 SingleSign rule and 436 generalized
[2026-05-22 18:21:40] [INFO ] Computed 170 invariants in 10 ms
Computed 170 P flows in 26 ms.
Exported basis to /tmp/petrispot-output-4696950964844456212.kers
Total runtime 27 ms.
[2026-05-22 18:21:42] [INFO ] Implicit Places using invariants in 1663 ms returned [1, 19, 20, 23, 52, 70, 199, 215, 220, 222, 240, 258, 387, 404, 409, 411, 429, 447, 576, 592, 597, 598, 599, 635, 769, 781, 786, 787, 788, 821, 823, 826, 844, 845, 846, 847, 864, 872, 880, 886, 892, 898, 904, 912, 918, 924, 932]
Discarding 47 places :
Implicit Place search using SMT only with invariants took 1717 ms to find 47 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 936/1016 places, 1497/1538 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 923 transition count 1484
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 923 transition count 1484
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 36 place count 913 transition count 1474
Iterating global reduction 0 with 10 rules applied. Total rules applied 46 place count 913 transition count 1474
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 51 place count 908 transition count 1469
Iterating global reduction 0 with 5 rules applied. Total rules applied 56 place count 908 transition count 1469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 58 place count 906 transition count 1467
Iterating global reduction 0 with 2 rules applied. Total rules applied 60 place count 906 transition count 1467
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 904 transition count 1465
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 904 transition count 1465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 903 transition count 1464
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 903 transition count 1464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 902 transition count 1463
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 902 transition count 1463
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 901 transition count 1462
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 901 transition count 1462
Applied a total of 70 rules in 314 ms. Remains 901 /936 variables (removed 35) and now considering 1462/1497 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11573015702380180853.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-430920225097903980.kers'
[2026-05-22 18:21:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11573015702380180853.kers, --Pflows, --basisKERS=/tmp/petrispot-output-430920225097903980.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1462 rows 901 cols 5208 entries
Finished phase 1 with 522 SingleSign rule and 256 generalized
[2026-05-22 18:21:42] [INFO ] Computed 123 invariants in 7 ms
Computed 123 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-430920225097903980.kers
Total runtime 9 ms.
[2026-05-22 18:21:43] [INFO ] Implicit Places using invariants in 948 ms returned []
[2026-05-22 18:21:43] [INFO ] Invariant cache hit.
[2026-05-22 18:21:45] [INFO ] Implicit Places using invariants and state equation in 2251 ms returned []
Implicit Place search using SMT with State Equation took 3205 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 901/1016 places, 1462/1538 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 5557 ms. Remains : 901/1016 places, 1462/1538 transitions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 1462/1462 transitions.
Applied a total of 0 rules in 34 ms. Remains 901 /901 variables (removed 0) and now considering 1462/1462 (removed 0) transitions.
[2026-05-22 18:21:45] [INFO ] Invariant cache hit.
[2026-05-22 18:21:46] [INFO ] Implicit Places using invariants in 954 ms returned []
[2026-05-22 18:21:46] [INFO ] Invariant cache hit.
[2026-05-22 18:21:48] [INFO ] Implicit Places using invariants and state equation in 2308 ms returned []
Implicit Place search using SMT with State Equation took 3269 ms to find 0 implicit places.
Running 1461 sub problems to find dead transitions.
[2026-05-22 18:21:49] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 1461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 900/2363 variables, and 87 constraints, problems are : Problem set: 0 solved, 1461 unsolved in 30071 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, Generalized P Invariants (flows): 87/101 constraints, State Equation: 0/901 constraints, PredecessorRefiner: 1461/1461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/900 variables, 87/87 constraints. Problems are: Problem set: 0 solved, 1461 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 900/2363 variables, and 87 constraints, problems are : Problem set: 0 solved, 1461 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 0/22 constraints, Generalized P Invariants (flows): 87/101 constraints, State Equation: 0/901 constraints, PredecessorRefiner: 0/1461 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60827ms problems are : Problem set: 0 solved, 1461 unsolved
Search for dead transitions found 0 dead transitions in 60852ms
Finished structural reductions in LTL mode , in 1 iterations and 64202 ms. Remains : 901/901 places, 1462/1462 transitions.
Support contains 57 out of 901 places after structural reductions.
[2026-05-22 18:22:50] [INFO ] Flatten gal took : 117 ms
[2026-05-22 18:22:50] [INFO ] Flatten gal took : 69 ms
[2026-05-22 18:22:50] [INFO ] Input system was already deterministic with 1462 transitions.
Support contains 54 out of 901 places (down from 57) after GAL structural reductions.
Reduction of identical properties reduced properties to check from 30 to 29
RANDOM walk for 40000 steps (294 resets) in 1637 ms. (24 steps per ms) remains 17/29 properties
BEST_FIRST walk for 4003 steps (8 resets) in 28 ms. (138 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 21 ms. (182 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 30 ms. (129 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 19 ms. (200 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 13 ms. (286 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 18 ms. (210 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 21 ms. (181 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (9 resets) in 15 ms. (250 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (9 resets) in 17 ms. (222 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 23 ms. (166 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4002 steps (8 resets) in 25 ms. (153 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4004 steps (8 resets) in 14 ms. (266 steps per ms) remains 17/17 properties
BEST_FIRST walk for 4003 steps (8 resets) in 12 ms. (307 steps per ms) remains 17/17 properties
[2026-05-22 18:22:51] [INFO ] Invariant cache hit.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/35 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 1 (OVERLAPS) 231/266 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/266 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 3 (OVERLAPS) 126/392 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/392 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 17 unsolved
Problem AtomicPropp6 is UNSAT
At refinement iteration 5 (OVERLAPS) 491/883 variables, 96/118 constraints. Problems are: Problem set: 1 solved, 16 unsolved
Problem AtomicPropp12 is UNSAT
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 4/122 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 0/122 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (OVERLAPS) 18/901 variables, 5/127 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/901 variables, 0/127 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (OVERLAPS) 1462/2363 variables, 901/1028 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2363/2363 variables, and 1028 constraints, problems are : Problem set: 2 solved, 15 unsolved in 5014 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 901/901 constraints, PredecessorRefiner: 17/17 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 2 solved, 15 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 1 (OVERLAPS) 232/264 variables, 7/7 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/264 variables, 0/7 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 3 (OVERLAPS) 126/390 variables, 15/22 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/390 variables, 0/22 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 5 (OVERLAPS) 493/883 variables, 96/118 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/883 variables, 4/122 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/883 variables, 1/123 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/883 variables, 0/123 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 9 (OVERLAPS) 18/901 variables, 5/128 constraints. Problems are: Problem set: 2 solved, 15 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/901 variables, 0/128 constraints. Problems are: Problem set: 2 solved, 15 unsolved
Problem AtomicPropp0 is UNSAT
Problem AtomicPropp1 is UNSAT
Problem AtomicPropp2 is UNSAT
Problem AtomicPropp3 is UNSAT
Problem AtomicPropp7 is UNSAT
Problem AtomicPropp11 is UNSAT
Problem AtomicPropp14 is UNSAT
Problem AtomicPropp15 is UNSAT
Problem AtomicPropp16 is UNSAT
At refinement iteration 11 (OVERLAPS) 1462/2363 variables, 901/1029 constraints. Problems are: Problem set: 11 solved, 6 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 2363/2363 variables, and 1035 constraints, problems are : Problem set: 11 solved, 6 unsolved in 5062 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 901/901 constraints, PredecessorRefiner: 6/17 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10096ms problems are : Problem set: 11 solved, 6 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 13 out of 901 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 901/901 places, 1462/1462 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 140 transitions
Trivial Post-agglo rules discarded 140 transitions
Performed 140 trivial Post agglomeration. Transition count delta: 140
Iterating post reduction 0 with 141 rules applied. Total rules applied 141 place count 900 transition count 1322
Reduce places removed 140 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 141 rules applied. Total rules applied 282 place count 760 transition count 1321
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 283 place count 759 transition count 1321
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 283 place count 759 transition count 1214
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 534 place count 615 transition count 1214
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 3 with 15 rules applied. Total rules applied 549 place count 609 transition count 1205
Reduce places removed 9 places and 0 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 558 place count 600 transition count 1205
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 558 place count 600 transition count 1197
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 574 place count 592 transition count 1197
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 580 place count 586 transition count 1186
Iterating global reduction 5 with 6 rules applied. Total rules applied 586 place count 586 transition count 1186
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 5 with 5 rules applied. Total rules applied 591 place count 585 transition count 1182
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 592 place count 584 transition count 1182
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 592 place count 584 transition count 1181
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 594 place count 583 transition count 1181
Performed 50 Post agglomeration using F-continuation condition.Transition count delta: 50
Deduced a syphon composed of 50 places in 2 ms
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 7 with 100 rules applied. Total rules applied 694 place count 533 transition count 1131
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 695 place count 532 transition count 1130
Iterating global reduction 7 with 1 rules applied. Total rules applied 696 place count 532 transition count 1130
Free-agglomeration rule applied 3 times.
Iterating global reduction 7 with 3 rules applied. Total rules applied 699 place count 532 transition count 1127
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 7 with 3 rules applied. Total rules applied 702 place count 529 transition count 1127
Free-agglomeration rule (complex) applied 21 times.
Iterating global reduction 8 with 21 rules applied. Total rules applied 723 place count 529 transition count 1106
Ensure Unique test removed 1 places
Reduce places removed 22 places and 0 transitions.
Iterating post reduction 8 with 22 rules applied. Total rules applied 745 place count 507 transition count 1106
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 9 with 1 rules applied. Total rules applied 746 place count 507 transition count 1105
Partial Free-agglomeration rule applied 14 times.
Drop transitions (Partial Free agglomeration) removed 14 transitions
Iterating global reduction 9 with 14 rules applied. Total rules applied 760 place count 507 transition count 1105
Applied a total of 760 rules in 311 ms. Remains 507 /901 variables (removed 394) and now considering 1105/1462 (removed 357) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 311 ms. Remains : 507/901 places, 1105/1462 transitions.
RANDOM walk for 40000 steps (503 resets) in 545 ms. (73 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40004 steps (110 resets) in 181 ms. (219 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (125 resets) in 332 ms. (120 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (111 resets) in 191 ms. (208 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (125 resets) in 150 ms. (264 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (123 resets) in 132 ms. (300 steps per ms) remains 5/5 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1968986319200093036.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13122560735270208190.kers'
[2026-05-22 18:23:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1968986319200093036.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13122560735270208190.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 1105 rows 503 cols 4509 entries
Finished phase 1 with 179 SingleSign rule and 251 generalized
[2026-05-22 18:23:02] [INFO ] Computed 77 invariants in 6 ms
Computed 77 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-13122560735270208190.kers
Total runtime 7 ms.
[2026-05-22 18:23:02] [INFO ] State equation strengthened by 20 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 130/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 188/328 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 179/507 variables, 49/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (OVERLAPS) 1105/1612 variables, 507/584 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1612 variables, 20/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1612 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/1612 variables, 0/604 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1612/1612 variables, and 604 constraints, problems are : Problem set: 0 solved, 5 unsolved in 960 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 507/507 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/10 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 130/140 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/140 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 188/328 variables, 20/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/328 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 179/507 variables, 49/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/507 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 5 unsolved
Problem AtomicPropp24 is UNSAT
Problem AtomicPropp28 is UNSAT
Problem AtomicPropp29 is UNSAT
At refinement iteration 7 (OVERLAPS) 1105/1612 variables, 507/584 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1612 variables, 20/604 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1612 variables, 2/606 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1612 variables, 0/606 constraints. Problems are: Problem set: 3 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1612 variables, 0/606 constraints. Problems are: Problem set: 3 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1612/1612 variables, and 606 constraints, problems are : Problem set: 3 solved, 2 unsolved in 1775 ms.
Refiners :[Positive P Invariants (semi-flows): 28/28 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 507/507 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 2/5 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2786ms problems are : Problem set: 3 solved, 2 unsolved
Parikh walk visited 0 properties in 1433 ms.
Support contains 4 out of 507 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 507/507 places, 1105/1105 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 507 transition count 1104
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 506 transition count 1104
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 505 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 4 place count 504 transition count 1096
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 504 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 503 transition count 1088
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 503 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 502 transition count 1080
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 502 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 501 transition count 1072
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 501 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 500 transition count 1064
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 500 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 499 transition count 1056
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 499 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 498 transition count 1048
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 498 transition count 1048
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 497 transition count 1040
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 497 transition count 1040
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 496 transition count 1032
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 496 transition count 1032
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 495 transition count 1024
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 495 transition count 1024
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 494 transition count 1016
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 494 transition count 1016
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 493 transition count 1008
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 493 transition count 1008
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 492 transition count 1000
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 492 transition count 1000
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 491 transition count 992
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 491 transition count 992
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 490 transition count 984
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 490 transition count 984
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 39 place count 487 transition count 981
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 40 place count 487 transition count 980
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 41 place count 486 transition count 980
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 486 transition count 979
Applied a total of 42 rules in 265 ms. Remains 486 /507 variables (removed 21) and now considering 979/1105 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 265 ms. Remains : 486/507 places, 979/1105 transitions.
RANDOM walk for 40000 steps (554 resets) in 209 ms. (190 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (116 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (110 resets) in 114 ms. (347 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 381898 steps, run timeout after 3001 ms. (steps per millisecond=127 ) properties seen :1 out of 2
Probabilistic random walk after 381898 steps, saw 159840 distinct states, run finished after 3008 ms. (steps per millisecond=126 ) properties seen :1
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-768973593651433074.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17836195122147635973.kers'
[2026-05-22 18:23:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-768973593651433074.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17836195122147635973.kers]
Culling duplicate invariants (modulo rational): removing 4 columns.
Culled 4 columns in 0 ms.
// Phase 1: matrix 979 rows 482 cols 4015 entries
Finished phase 1 with 178 SingleSign rule and 232 generalized
[2026-05-22 18:23:09] [INFO ] Computed 76 invariants in 5 ms
Computed 76 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-17836195122147635973.kers
Total runtime 8 ms.
[2026-05-22 18:23:09] [INFO ] State equation strengthened by 20 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 247/297 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 189/486 variables, 49/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 979/1465 variables, 486/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1465 variables, 20/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1465 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1465 variables, 0/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1465/1465 variables, and 582 constraints, problems are : Problem set: 0 solved, 1 unsolved in 762 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 486/486 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 48/50 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/50 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 247/297 variables, 23/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/297 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 189/486 variables, 49/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/486 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 979/1465 variables, 486/562 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1465 variables, 20/582 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1465 variables, 1/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1465 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1465 variables, 0/583 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1465/1465 variables, and 583 constraints, problems are : Problem set: 0 solved, 1 unsolved in 760 ms.
Refiners :[Positive P Invariants (semi-flows): 27/27 constraints, Generalized P Invariants (flows): 49/49 constraints, State Equation: 486/486 constraints, ReadFeed: 20/20 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1592ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 163 ms.
Support contains 2 out of 486 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 486/486 places, 979/979 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 0 with 5 rules applied. Total rules applied 5 place count 486 transition count 974
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 10 place count 481 transition count 974
Applied a total of 10 rules in 36 ms. Remains 481 /486 variables (removed 5) and now considering 974/979 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 49 ms. Remains : 481/486 places, 974/979 transitions.
RANDOM walk for 40000 steps (585 resets) in 274 ms. (145 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (113 resets) in 62 ms. (634 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 143496 steps, run visited all 1 properties in 741 ms. (steps per millisecond=193 )
Probabilistic random walk after 143496 steps, saw 48169 distinct states, run finished after 760 ms. (steps per millisecond=188 ) properties seen :1
Successfully simplified 15 atomic propositions for a total of 12 simplifications.
FORMULA ASLink-PT-04a-LTLFireability-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 1 stabilizing places and 1 stable transitions
FORMULA ASLink-PT-04a-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-04a-LTLFireability-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Support contains 1 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 1462/1462 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 900 transition count 1462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 898 transition count 1448
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 898 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 897 transition count 1440
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 897 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 896 transition count 1432
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 896 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 895 transition count 1424
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 895 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 894 transition count 1416
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 894 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 893 transition count 1408
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 893 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 892 transition count 1400
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 892 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 891 transition count 1392
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 891 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 890 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 890 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 889 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 889 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 888 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 888 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 887 transition count 1360
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 887 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 886 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 886 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 885 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 885 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 884 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 884 transition count 1336
Applied a total of 33 rules in 463 ms. Remains 884 /901 variables (removed 17) and now considering 1336/1462 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3102958188386130683.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17212532314931362924.kers'
[2026-05-22 18:23:13] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3102958188386130683.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17212532314931362924.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1336 rows 884 cols 4702 entries
Finished phase 1 with 527 SingleSign rule and 235 generalized
[2026-05-22 18:23:13] [INFO ] Computed 122 invariants in 23 ms
Computed 122 P flows in 24 ms.
Exported basis to /tmp/petrispot-output-17212532314931362924.kers
Total runtime 27 ms.
[2026-05-22 18:23:14] [INFO ] Implicit Places using invariants in 943 ms returned [29, 211, 393, 592, 738]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 963 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/901 places, 1336/1462 transitions.
Applied a total of 0 rules in 51 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1477 ms. Remains : 879/901 places, 1336/1462 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(p0)))'
Stuttering acceptance computed with spot in 356 ms :[(NOT p0), (NOT p0), true, (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-01
Entered a terminal (fully accepting) state of product in 5 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-01 finished in 1926 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((G(p1)||p0))) U G((p1 U p2))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 1462/1462 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 149 transitions
Trivial Post-agglo rules discarded 149 transitions
Performed 149 trivial Post agglomeration. Transition count delta: 149
Iterating post reduction 0 with 150 rules applied. Total rules applied 150 place count 900 transition count 1313
Reduce places removed 149 places and 0 transitions.
Iterating post reduction 1 with 149 rules applied. Total rules applied 299 place count 751 transition count 1313
Performed 105 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 105 Pre rules applied. Total rules applied 299 place count 751 transition count 1208
Deduced a syphon composed of 105 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 142 places and 0 transitions.
Iterating global reduction 2 with 247 rules applied. Total rules applied 546 place count 609 transition count 1208
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 2 with 23 rules applied. Total rules applied 569 place count 602 transition count 1192
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 3 with 16 rules applied. Total rules applied 585 place count 586 transition count 1192
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 585 place count 586 transition count 1184
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 601 place count 578 transition count 1184
Discarding 7 places :
Symmetric choice reduction at 4 with 7 rule applications. Total rules 608 place count 571 transition count 1165
Iterating global reduction 4 with 7 rules applied. Total rules applied 615 place count 571 transition count 1165
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
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 4 with 5 rules applied. Total rules applied 620 place count 570 transition count 1161
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 621 place count 569 transition count 1161
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 621 place count 569 transition count 1160
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 623 place count 568 transition count 1160
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 624 place count 567 transition count 1152
Iterating global reduction 6 with 1 rules applied. Total rules applied 625 place count 567 transition count 1152
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 626 place count 566 transition count 1144
Iterating global reduction 6 with 1 rules applied. Total rules applied 627 place count 566 transition count 1144
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 628 place count 565 transition count 1136
Iterating global reduction 6 with 1 rules applied. Total rules applied 629 place count 565 transition count 1136
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 630 place count 564 transition count 1128
Iterating global reduction 6 with 1 rules applied. Total rules applied 631 place count 564 transition count 1128
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 632 place count 563 transition count 1120
Iterating global reduction 6 with 1 rules applied. Total rules applied 633 place count 563 transition count 1120
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 634 place count 562 transition count 1112
Iterating global reduction 6 with 1 rules applied. Total rules applied 635 place count 562 transition count 1112
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 636 place count 561 transition count 1104
Iterating global reduction 6 with 1 rules applied. Total rules applied 637 place count 561 transition count 1104
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 638 place count 560 transition count 1096
Iterating global reduction 6 with 1 rules applied. Total rules applied 639 place count 560 transition count 1096
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 640 place count 559 transition count 1088
Iterating global reduction 6 with 1 rules applied. Total rules applied 641 place count 559 transition count 1088
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 642 place count 558 transition count 1080
Iterating global reduction 6 with 1 rules applied. Total rules applied 643 place count 558 transition count 1080
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 644 place count 557 transition count 1072
Iterating global reduction 6 with 1 rules applied. Total rules applied 645 place count 557 transition count 1072
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 646 place count 556 transition count 1064
Iterating global reduction 6 with 1 rules applied. Total rules applied 647 place count 556 transition count 1064
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 648 place count 555 transition count 1056
Iterating global reduction 6 with 1 rules applied. Total rules applied 649 place count 555 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 650 place count 554 transition count 1048
Iterating global reduction 6 with 1 rules applied. Total rules applied 651 place count 554 transition count 1048
Performed 52 Post agglomeration using F-continuation condition.Transition count delta: 52
Deduced a syphon composed of 52 places in 1 ms
Reduce places removed 52 places and 0 transitions.
Iterating global reduction 6 with 104 rules applied. Total rules applied 755 place count 502 transition count 996
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 756 place count 501 transition count 995
Iterating global reduction 6 with 1 rules applied. Total rules applied 757 place count 501 transition count 995
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 758 place count 501 transition count 995
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 759 place count 500 transition count 994
Iterating global reduction 6 with 1 rules applied. Total rules applied 760 place count 500 transition count 994
Applied a total of 760 rules in 346 ms. Remains 500 /901 variables (removed 401) and now considering 994/1462 (removed 468) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3181937096913769130.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13619167373614258635.kers'
[2026-05-22 18:23:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3181937096913769130.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13619167373614258635.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 13 ms.
// Phase 1: matrix 994 rows 495 cols 3958 entries
Finished phase 1 with 204 SingleSign rule and 219 generalized
[2026-05-22 18:23:15] [INFO ] Computed 77 invariants in 19 ms
Computed 77 P flows in 19 ms.
Exported basis to /tmp/petrispot-output-13619167373614258635.kers
Total runtime 20 ms.
[2026-05-22 18:23:15] [INFO ] Implicit Places using invariants in 438 ms returned [21, 128, 129, 235, 236, 306, 312, 317, 336, 354, 411, 419, 425, 445, 497]
Discarding 15 places :
Implicit Place search using SMT only with invariants took 452 ms to find 15 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 485/901 places, 994/1462 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 11 place count 485 transition count 983
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 22 place count 474 transition count 983
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 22 place count 474 transition count 967
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 54 place count 458 transition count 967
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 58 place count 454 transition count 963
Iterating global reduction 2 with 4 rules applied. Total rules applied 62 place count 454 transition count 963
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 66 place count 450 transition count 959
Iterating global reduction 2 with 4 rules applied. Total rules applied 70 place count 450 transition count 959
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 72 place count 448 transition count 957
Iterating global reduction 2 with 2 rules applied. Total rules applied 74 place count 448 transition count 957
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 94 place count 438 transition count 947
Applied a total of 94 rules in 59 ms. Remains 438 /485 variables (removed 47) and now considering 947/994 (removed 47) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11851574346142499519.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7796030469323560609.kers'
[2026-05-22 18:23:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11851574346142499519.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7796030469323560609.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 947 rows 438 cols 3815 entries
Finished phase 1 with 178 SingleSign rule and 198 generalized
[2026-05-22 18:23:15] [INFO ] Computed 62 invariants in 5 ms
Computed 62 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-7796030469323560609.kers
Total runtime 6 ms.
[2026-05-22 18:23:16] [INFO ] Implicit Places using invariants in 609 ms returned [89, 95, 100, 102, 105, 184, 190, 199, 202, 283, 286, 370, 374]
Discarding 13 places :
Implicit Place search using SMT only with invariants took 611 ms to find 13 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 425/901 places, 947/1462 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 425 transition count 943
Reduce places removed 4 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 5 rules applied. Total rules applied 9 place count 421 transition count 942
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 10 place count 420 transition count 942
Discarding 6 places :
Symmetric choice reduction at 3 with 6 rule applications. Total rules 16 place count 414 transition count 936
Iterating global reduction 3 with 6 rules applied. Total rules applied 22 place count 414 transition count 936
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 3 with 4 rules applied. Total rules applied 26 place count 414 transition count 932
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 28 place count 412 transition count 930
Iterating global reduction 4 with 2 rules applied. Total rules applied 30 place count 412 transition count 930
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 31 place count 411 transition count 929
Iterating global reduction 4 with 1 rules applied. Total rules applied 32 place count 411 transition count 929
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 38 place count 408 transition count 926
Applied a total of 38 rules in 66 ms. Remains 408 /425 variables (removed 17) and now considering 926/947 (removed 21) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14131139958947370802.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13094245902628136694.kers'
[2026-05-22 18:23:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14131139958947370802.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13094245902628136694.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 926 rows 408 cols 3694 entries
Finished phase 1 with 177 SingleSign rule and 182 generalized
[2026-05-22 18:23:16] [INFO ] Computed 49 invariants in 5 ms
Computed 49 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13094245902628136694.kers
Total runtime 6 ms.
[2026-05-22 18:23:16] [INFO ] Implicit Places using invariants in 551 ms returned [72, 151, 240, 323]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 554 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 404/901 places, 926/1462 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 400 transition count 922
Applied a total of 8 rules in 20 ms. Remains 400 /404 variables (removed 4) and now considering 922/926 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8823018892579979587.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6818922645910047274.kers'
[2026-05-22 18:23:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8823018892579979587.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6818922645910047274.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 922 rows 400 cols 3706 entries
Finished phase 1 with 177 SingleSign rule and 178 generalized
[2026-05-22 18:23:16] [INFO ] Computed 45 invariants in 5 ms
Computed 45 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6818922645910047274.kers
Total runtime 6 ms.
[2026-05-22 18:23:17] [INFO ] Implicit Places using invariants in 566 ms returned []
[2026-05-22 18:23:17] [INFO ] Invariant cache hit.
[2026-05-22 18:23:17] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 18:23:18] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1850 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 400/901 places, 922/1462 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 3971 ms. Remains : 400/901 places, 922/1462 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(F((G(p1)||p0))) U G((p1 U p2))))'
Stuttering acceptance computed with spot in 313 ms :[(NOT p2), (AND p2 (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-07
Stuttering criterion allowed to conclude after 40 steps with 1 reset in 1 ms.
FORMULA ASLink-PT-04a-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-07 finished in 4346 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(G(F(p1)) U (p1 U p2))))'
Support contains 5 out of 901 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 901/901 places, 1462/1462 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 900 transition count 1462
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 3 place count 898 transition count 1448
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 898 transition count 1448
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 897 transition count 1440
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 897 transition count 1440
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 8 place count 896 transition count 1432
Iterating global reduction 1 with 1 rules applied. Total rules applied 9 place count 896 transition count 1432
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 895 transition count 1424
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 895 transition count 1424
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 894 transition count 1416
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 894 transition count 1416
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 893 transition count 1408
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 893 transition count 1408
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 892 transition count 1400
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 892 transition count 1400
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 891 transition count 1392
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 891 transition count 1392
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 890 transition count 1384
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 890 transition count 1384
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 889 transition count 1376
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 889 transition count 1376
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 888 transition count 1368
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 888 transition count 1368
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 887 transition count 1360
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 887 transition count 1360
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 886 transition count 1352
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 886 transition count 1352
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 885 transition count 1344
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 885 transition count 1344
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 884 transition count 1336
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 884 transition count 1336
Applied a total of 33 rules in 441 ms. Remains 884 /901 variables (removed 17) and now considering 1336/1462 (removed 126) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6158264369374461443.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15381984375068706174.kers'
[2026-05-22 18:23:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6158264369374461443.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15381984375068706174.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1336 rows 884 cols 4702 entries
Finished phase 1 with 527 SingleSign rule and 235 generalized
[2026-05-22 18:23:19] [INFO ] Computed 122 invariants in 7 ms
Computed 122 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-15381984375068706174.kers
Total runtime 20 ms.
[2026-05-22 18:23:20] [INFO ] Implicit Places using invariants in 1284 ms returned [29, 211, 393, 592, 738]
Discarding 5 places :
Implicit Place search using SMT only with invariants took 1294 ms to find 5 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 879/901 places, 1336/1462 transitions.
Applied a total of 0 rules in 21 ms. Remains 879 /879 variables (removed 0) and now considering 1336/1336 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1756 ms. Remains : 879/901 places, 1336/1462 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(X(p0)))&&(G(F(p1)) U (p1 U p2))))'
Stuttering acceptance computed with spot in 369 ms :[(OR (NOT p2) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), (NOT p2), (NOT p0), (NOT p0), true]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-08
Stuttering criterion allowed to conclude after 89 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-04a-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-04a-LTLFireability-08 finished in 2187 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 6 out of 901 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 901/901 places, 1462/1462 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 144 transitions
Trivial Post-agglo rules discarded 144 transitions
Performed 144 trivial Post agglomeration. Transition count delta: 144
Iterating post reduction 0 with 145 rules applied. Total rules applied 145 place count 900 transition count 1318
Reduce places removed 144 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 145 rules applied. Total rules applied 290 place count 756 transition count 1317
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 291 place count 755 transition count 1317
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 107 Pre rules applied. Total rules applied 291 place count 755 transition count 1210
Deduced a syphon composed of 107 places in 1 ms
Ensure Unique test removed 37 places
Reduce places removed 144 places and 0 transitions.
Iterating global reduction 3 with 251 rules applied. Total rules applied 542 place count 611 transition count 1210
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 3 with 24 rules applied. Total rules applied 566 place count 604 transition count 1193
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 4 with 17 rules applied. Total rules applied 583 place count 587 transition count 1193
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 8 Pre rules applied. Total rules applied 583 place count 587 transition count 1185
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 5 with 16 rules applied. Total rules applied 599 place count 579 transition count 1185
Discarding 7 places :
Symmetric choice reduction at 5 with 7 rule applications. Total rules 606 place count 572 transition count 1166
Iterating global reduction 5 with 7 rules applied. Total rules applied 613 place count 572 transition count 1166
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 5 with 4 rules applied. Total rules applied 617 place count 571 transition count 1163
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 617 place count 571 transition count 1161
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 621 place count 569 transition count 1161
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 622 place count 568 transition count 1153
Iterating global reduction 6 with 1 rules applied. Total rules applied 623 place count 568 transition count 1153
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 624 place count 567 transition count 1145
Iterating global reduction 6 with 1 rules applied. Total rules applied 625 place count 567 transition count 1145
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 626 place count 566 transition count 1137
Iterating global reduction 6 with 1 rules applied. Total rules applied 627 place count 566 transition count 1137
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 628 place count 565 transition count 1129
Iterating global reduction 6 with 1 rules applied. Total rules applied 629 place count 565 transition count 1129
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 630 place count 564 transition count 1121
Iterating global reduction 6 with 1 rules applied. Total rules applied 631 place count 564 transition count 1121
Performed 51 Post agglomeration using F-continuation condition.Transition count delta: 51
Deduced a syphon composed of 51 places in 1 ms
Reduce places removed 51 places and 0 transitions.
Iterating global reduction 6 with 102 rules applied. Total rules applied 733 place count 513 transition count 1070
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 735 place count 511 transition count 1068
Iterating global reduction 6 with 2 rules applied. Total rules applied 737 place count 511 transition count 1068
Applied a total of 737 rules in 183 ms. Remains 511 /901 variables (removed 390) and now considering 1068/1462 (removed 394) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10229891940859477294.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7037176542678458810.kers'
[2026-05-22 18:23:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10229891940859477294.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7037176542678458810.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 1068 rows 505 cols 4244 entries
Finished phase 1 with 199 SingleSign rule and 235 generalized
[2026-05-22 18:23:21] [INFO ] Computed 77 invariants in 10 ms
Computed 77 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-7037176542678458810.kers
Total runtime 11 ms.
[2026-05-22 18:23:21] [INFO ] Implicit Places using invariants in 574 ms returned [21, 128, 129, 231, 232, 307, 313, 318, 337, 355, 412, 420, 426, 432, 446, 508]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 577 ms to find 16 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 495/901 places, 1068/1462 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 12 rules applied. Total rules applied 12 place count 495 transition count 1056
Reduce places removed 12 places and 0 transitions.
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 483 transition count 1056
Performed 16 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 16 Pre rules applied. Total rules applied 24 place count 483 transition count 1040
Deduced a syphon composed of 16 places in 2 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 2 with 32 rules applied. Total rules applied 56 place count 467 transition count 1040
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 463 transition count 1036
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 463 transition count 1036
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 459 transition count 1032
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 459 transition count 1032
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 74 place count 457 transition count 1030
Iterating global reduction 2 with 2 rules applied. Total rules applied 76 place count 457 transition count 1030
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 100 place count 445 transition count 1018
Applied a total of 100 rules in 54 ms. Remains 445 /495 variables (removed 50) and now considering 1018/1068 (removed 50) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16088190696790622440.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-18092724457746947831.kers'
[2026-05-22 18:23:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16088190696790622440.kers, --Pflows, --basisKERS=/tmp/petrispot-output-18092724457746947831.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1018 rows 445 cols 4113 entries
Finished phase 1 with 184 SingleSign rule and 200 generalized
[2026-05-22 18:23:21] [INFO ] Computed 61 invariants in 5 ms
Computed 61 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-18092724457746947831.kers
Total runtime 6 ms.
[2026-05-22 18:23:22] [INFO ] Implicit Places using invariants in 503 ms returned [89, 95, 100, 102, 105, 182, 188, 193, 195, 198, 284, 287, 368, 371]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 530 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 431/901 places, 1018/1462 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 431 transition count 1014
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 8 place count 427 transition count 1014
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 16 place count 419 transition count 1006
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 419 transition count 1006
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 28 place count 419 transition count 1002
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 32 place count 415 transition count 998
Iterating global reduction 3 with 4 rules applied. Total rules applied 36 place count 415 transition count 998
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 38 place count 413 transition count 996
Iterating global reduction 3 with 2 rules applied. Total rules applied 40 place count 413 transition count 996
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 3 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 46 place count 410 transition count 993
Applied a total of 46 rules in 61 ms. Remains 410 /431 variables (removed 21) and now considering 993/1018 (removed 25) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9295582167841038065.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4941093858491885422.kers'
[2026-05-22 18:23:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9295582167841038065.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4941093858491885422.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 993 rows 410 cols 3969 entries
Finished phase 1 with 179 SingleSign rule and 184 generalized
[2026-05-22 18:23:22] [INFO ] Computed 47 invariants in 8 ms
Computed 47 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4941093858491885422.kers
Total runtime 10 ms.
[2026-05-22 18:23:23] [INFO ] Implicit Places using invariants in 462 ms returned [72, 151, 232, 316]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 464 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 406/901 places, 993/1462 transitions.
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 402 transition count 989
Applied a total of 8 rules in 55 ms. Remains 402 /406 variables (removed 4) and now considering 989/993 (removed 4) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2109020402733931434.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1580715314974145575.kers'
[2026-05-22 18:23:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2109020402733931434.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1580715314974145575.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 989 rows 402 cols 3974 entries
Finished phase 1 with 179 SingleSign rule and 180 generalized
[2026-05-22 18:23:23] [INFO ] Computed 43 invariants in 5 ms
Computed 43 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-1580715314974145575.kers
Total runtime 6 ms.
[2026-05-22 18:23:23] [INFO ] Implicit Places using invariants in 387 ms returned []
[2026-05-22 18:23:23] [INFO ] Invariant cache hit.
[2026-05-22 18:23:23] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 18:23:25] [INFO ] Implicit Places using invariants and state equation in 1930 ms returned []
Implicit Place search using SMT with State Equation took 2321 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 4 : 402/901 places, 989/1462 transitions.
Finished structural reductions in SI_LTL mode , in 4 iterations and 4245 ms. Remains : 402/901 places, 989/1462 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 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-04a-LTLFireability-11
Product exploration explored 100000 steps with 1690 reset in 338 ms.
Product exploration explored 100000 steps with 1730 reset in 352 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 98 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 2429 steps (37 resets) in 34 ms. (69 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 251 ms.
Stuttering acceptance computed with spot in 97 ms :[(NOT p0), (NOT p0)]
Support contains 6 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 989/989 transitions.
Applied a total of 0 rules in 29 ms. Remains 402 /402 variables (removed 0) and now considering 989/989 (removed 0) transitions.
[2026-05-22 18:23:26] [INFO ] Invariant cache hit.
[2026-05-22 18:23:27] [INFO ] Implicit Places using invariants in 494 ms returned []
[2026-05-22 18:23:27] [INFO ] Invariant cache hit.
[2026-05-22 18:23:27] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 18:23:28] [INFO ] Implicit Places using invariants and state equation in 1344 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2026-05-22 18:23:28] [INFO ] Redundant transitions in 69 ms returned []
Running 988 sub problems to find dead transitions.
[2026-05-22 18:23:28] [INFO ] Invariant cache hit.
[2026-05-22 18:23:28] [INFO ] State equation strengthened by 3 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 988 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 988 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 402/1391 variables, and 43 constraints, problems are : Problem set: 0 solved, 988 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/402 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 988/988 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 988 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/401 variables, 25/25 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/401 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 2 (OVERLAPS) 1/402 variables, 16/41 constraints. Problems are: Problem set: 0 solved, 988 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/402 variables, 2/43 constraints. Problems are: Problem set: 0 solved, 988 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 402/1391 variables, and 44 constraints, problems are : Problem set: 0 solved, 988 unsolved in 30033 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 27/27 constraints, State Equation: 0/402 constraints, ReadFeed: 0/3 constraints, PredecessorRefiner: 0/988 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60338ms problems are : Problem set: 0 solved, 988 unsolved
Search for dead transitions found 0 dead transitions in 60342ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 62293 ms. Remains : 402/402 places, 989/989 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge based reduction with 3 factoid took 47 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
RANDOM walk for 2562 steps (47 resets) in 23 ms. (106 steps per ms) remains 0/1 properties
Knowledge based reduction with 3 factoid took 58 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Knowledge-based reduction took 202 ms.
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 89 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1642 reset in 240 ms.
Product exploration explored 100000 steps with 1669 reset in 245 ms.
Built C files in :
/tmp/ltsmin2413936862836384718
[2026-05-22 18:24:29] [INFO ] Computing symmetric may disable matrix : 989 transitions.
[2026-05-22 18:24:29] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:24:29] [INFO ] Computing symmetric may enable matrix : 989 transitions.
[2026-05-22 18:24:29] [INFO ] Computation of Complete enable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:24:29] [INFO ] Computing Do-Not-Accords matrix : 989 transitions.
[2026-05-22 18:24:30] [INFO ] Computation of Completed DNA matrix. took 30 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:24:30] [INFO ] Built C files in 263ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2413936862836384718
Running compilation step : cd /tmp/ltsmin2413936862836384718;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2413936862836384718;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2413936862836384718;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
Support contains 6 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 989/989 transitions.
Applied a total of 0 rules in 28 ms. Remains 402 /402 variables (removed 0) and now considering 989/989 (removed 0) transitions.
[2026-05-22 18:24:33] [INFO ] Invariant cache hit.
[2026-05-22 18:24:33] [INFO ] Implicit Places using invariants in 567 ms returned []
[2026-05-22 18:24:33] [INFO ] Invariant cache hit.
[2026-05-22 18:24:34] [INFO ] State equation strengthened by 3 read => feed constraints.
[2026-05-22 18:24:35] [INFO ] Implicit Places using invariants and state equation in 1265 ms returned []
Implicit Place search using SMT with State Equation took 1841 ms to find 0 implicit places.
[2026-05-22 18:24:35] [INFO ] Redundant transitions in 134 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2011 ms. Remains : 402/402 places, 989/989 transitions.
Built C files in :
/tmp/ltsmin2217478659072465406
[2026-05-22 18:24:35] [INFO ] Computing symmetric may disable matrix : 989 transitions.
[2026-05-22 18:24:35] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:24:35] [INFO ] Computing symmetric may enable matrix : 989 transitions.
[2026-05-22 18:24:35] [INFO ] Computation of Complete enable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:24:35] [INFO ] Computing Do-Not-Accords matrix : 989 transitions.
[2026-05-22 18:24:35] [INFO ] Computation of Completed DNA matrix. took 43 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:24:35] [INFO ] Built C files in 240ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2217478659072465406
Running compilation step : cd /tmp/ltsmin2217478659072465406;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2217478659072465406;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2217478659072465406;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:94)
at java.base/java.lang.Thread.run(Thread.java:1583)
[2026-05-22 18:24:38] [INFO ] Flatten gal took : 37 ms
[2026-05-22 18:24:38] [INFO ] Flatten gal took : 38 ms
[2026-05-22 18:24:38] [INFO ] Time to serialize gal into /tmp/LTL8903219457988897131.gal : 11 ms
[2026-05-22 18:24:38] [INFO ] Time to serialize properties into /tmp/LTL11285236627621496262.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8903219457988897131.gal' '-t' 'CGAL' '-hoa' '/tmp/aut11646906090479064792.hoa' '-atoms' '/tmp/LTL11285236627621496262.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL11285236627621496262.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut11646906090479064792.hoa
Detected timeout of ITS tools.
[2026-05-22 18:24:53] [INFO ] Flatten gal took : 31 ms
[2026-05-22 18:24:53] [INFO ] Flatten gal took : 45 ms
[2026-05-22 18:24:53] [INFO ] Time to serialize gal into /tmp/LTL5923766111889641834.gal : 11 ms
[2026-05-22 18:24:53] [INFO ] Time to serialize properties into /tmp/LTL1342584728978827112.ltl : 7 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5923766111889641834.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1342584728978827112.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p853==0)||(p954==0))||(((p442==1)&&(p661==1))||((p635==1)&&(p840==1))))"))))
Formula 0 simplified : FG!"(((p853==0)||(p954==0))||(((p442==1)&&(p661==1))||((p635==1)&&(p840==1))))"
Detected timeout of ITS tools.
[2026-05-22 18:25:09] [INFO ] Flatten gal took : 95 ms
[2026-05-22 18:25:09] [INFO ] Applying decomposition
[2026-05-22 18:25:09] [INFO ] Flatten gal took : 52 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph296175748828296924.txt' '-o' '/tmp/graph296175748828296924.bin' '-w' '/tmp/graph296175748828296924.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph296175748828296924.bin' '-l' '-1' '-v' '-w' '/tmp/graph296175748828296924.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:25:09] [INFO ] Decomposing Gal with order
[2026-05-22 18:25:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:25:09] [INFO ] Removed a total of 2032 redundant transitions.
[2026-05-22 18:25:09] [INFO ] Flatten gal took : 133 ms
[2026-05-22 18:25:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 50 labels/synchronizations in 34 ms.
[2026-05-22 18:25:09] [INFO ] Time to serialize gal into /tmp/LTL12567692159820284756.gal : 27 ms
[2026-05-22 18:25:09] [INFO ] Time to serialize properties into /tmp/LTL1208708086499029029.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12567692159820284756.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1208708086499029029.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i8.u100.p853==0)||(i8.u100.p954==0))||(((i7.u52.p442==1)&&(i7.u76.p661==1))||((i6.u72.p635==1)&&(i6.u91.p840==1))))"))))
Formula 0 simplified : FG!"(((i8.u100.p853==0)||(i8.u100.p954==0))||(((i7.u52.p442==1)&&(i7.u76.p661==1))||((i6.u72.p635==1)&&(i6.u91.p840==1))))"
Detected timeout of ITS tools.
Treatment of property ASLink-PT-04a-LTLFireability-11 finished in 123558 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)))'
Spot run failed in 82 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/senseclsl.py", line 2, in
import spot, sys
ModuleNotFoundError: No module named 'spot'
Warning : SL/CL computation failed.
[2026-05-22 18:25:24] [INFO ] Flatten gal took : 59 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin4392124651043328285
[2026-05-22 18:25:24] [INFO ] Computing symmetric may disable matrix : 1462 transitions.
[2026-05-22 18:25:24] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:25:24] [INFO ] Computing symmetric may enable matrix : 1462 transitions.
[2026-05-22 18:25:24] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:25:24] [INFO ] Applying decomposition
[2026-05-22 18:25:25] [INFO ] Flatten gal took : 66 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph4897297247216540960.txt' '-o' '/tmp/graph4897297247216540960.bin' '-w' '/tmp/graph4897297247216540960.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph4897297247216540960.bin' '-l' '-1' '-v' '-w' '/tmp/graph4897297247216540960.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:25:25] [INFO ] Decomposing Gal with order
[2026-05-22 18:25:25] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:25:25] [INFO ] Computing Do-Not-Accords matrix : 1462 transitions.
[2026-05-22 18:25:25] [INFO ] Computation of Completed DNA matrix. took 25 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 18:25:25] [INFO ] Built C files in 395ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4392124651043328285
Running compilation step : cd /tmp/ltsmin4392124651043328285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2026-05-22 18:25:25] [INFO ] Removed a total of 2167 redundant transitions.
[2026-05-22 18:25:25] [INFO ] Flatten gal took : 89 ms
[2026-05-22 18:25:25] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 25 ms.
[2026-05-22 18:25:25] [INFO ] Time to serialize gal into /tmp/LTLFireability15099623624255403577.gal : 12 ms
[2026-05-22 18:25:25] [INFO ] Time to serialize properties into /tmp/LTLFireability15584511635195842580.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15099623624255403577.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15584511635195842580.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i14.i1.u252.p853==0)||(i14.i2.u262.p954==0))||(((i8.u126.p442==1)&&(i8.u182.p661==1))||((i11.i0.u178.p635==1)&&(i11.i0.u237...172
Formula 0 simplified : FG!"(((i14.i1.u252.p853==0)||(i14.i2.u262.p954==0))||(((i8.u126.p442==1)&&(i8.u182.p661==1))||((i11.i0.u178.p635==1)&&(i11.i0.u237.p...166
Compilation finished in 5469 ms.
Running link step : cd /tmp/ltsmin4392124651043328285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 128 ms.
Running LTSmin : cd /tmp/ltsmin4392124651043328285;'/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' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2026-05-22 18:46:40] [INFO ] Applying decomposition
[2026-05-22 18:46:40] [INFO ] Flatten gal took : 28 ms
[2026-05-22 18:46:40] [INFO ] Decomposing Gal with order
[2026-05-22 18:46:40] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:46:40] [INFO ] Removed a total of 1773 redundant transitions.
[2026-05-22 18:46:40] [INFO ] Flatten gal took : 126 ms
[2026-05-22 18:46:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 579 labels/synchronizations in 37 ms.
[2026-05-22 18:46:41] [INFO ] Time to serialize gal into /tmp/LTLFireability8988087038280667795.gal : 12 ms
[2026-05-22 18:46:41] [INFO ] Time to serialize properties into /tmp/LTLFireability879197286715517437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability8988087038280667795.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability879197286715517437.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u145.p853==0)||(i38.u166.p954==0))||(((u74.p442==1)&&(u111.p661==1))||((u109.p635==1)&&(u144.p840==1))))"))))
Formula 0 simplified : FG!"(((u145.p853==0)||(i38.u166.p954==0))||(((u74.p442==1)&&(u111.p661==1))||((u109.p635==1)&&(u144.p840==1))))"
Reverse transition relation is NOT exact ! Due to transitions t798, t940, t1118, t1119, t1122, t1124, t1127, t1139, t1148, t1198, t1224, t1274, t1300, t135...736
Computing Next relation with stutter on 1.35858e+11 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
39614 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,396.25,2723132,1,0,6.7266e+06,20438,2390,7.47048e+06,655,87648,7718754
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA ASLink-PT-04a-LTLFireability-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1908664 ms.

BK_STOP 1779476008135

--------------------
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
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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="ASLink-PT-04a"
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 ASLink-PT-04a, 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 r002-oct2-177944366200332"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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