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-177944366100291.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-01b, examination is LTLCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366100291
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 692K
-rw-r--r-- 1 mcc users 6.9K Mar 5 14:02 CTLCardinality.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:02 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.3K Mar 5 14:02 CTLFireability.txt
-rw-r--r-- 1 mcc users 33K Mar 5 14:02 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.6K Mar 15 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Mar 15 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:02 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:02 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Mar 5 14:02 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 94K Mar 5 14:02 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 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 293K 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-01b-LTLCardinality-00
FORMULA_NAME ASLink-PT-01b-LTLCardinality-01
FORMULA_NAME ASLink-PT-01b-LTLCardinality-02
FORMULA_NAME ASLink-PT-01b-LTLCardinality-03
FORMULA_NAME ASLink-PT-01b-LTLCardinality-04
FORMULA_NAME ASLink-PT-01b-LTLCardinality-05
FORMULA_NAME ASLink-PT-01b-LTLCardinality-06
FORMULA_NAME ASLink-PT-01b-LTLCardinality-07
FORMULA_NAME ASLink-PT-01b-LTLCardinality-08
FORMULA_NAME ASLink-PT-01b-LTLCardinality-09
FORMULA_NAME ASLink-PT-01b-LTLCardinality-10
FORMULA_NAME ASLink-PT-01b-LTLCardinality-11
FORMULA_NAME ASLink-PT-01b-LTLCardinality-12
FORMULA_NAME ASLink-PT-01b-LTLCardinality-13
FORMULA_NAME ASLink-PT-01b-LTLCardinality-14
FORMULA_NAME ASLink-PT-01b-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779470467308

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-01b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 17:21:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 17:21:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:21:08] [INFO ] Load time of PNML (sax parser for PT used): 130 ms
[2026-05-22 17:21:08] [INFO ] Transformed 846 places.
[2026-05-22 17:21:08] [INFO ] Transformed 1148 transitions.
[2026-05-22 17:21:08] [INFO ] Found NUPN structural information;
[2026-05-22 17:21:08] [INFO ] Parsed PT model containing 846 places and 1148 transitions and 3624 arcs in 251 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Initial state reduction rules removed 2 formulas.
FORMULA ASLink-PT-01b-LTLCardinality-02 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-10 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-15 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-01b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 22 out of 846 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 846/846 places, 1148/1148 transitions.
Discarding 49 places :
Symmetric choice reduction at 0 with 49 rule applications. Total rules 49 place count 797 transition count 1099
Iterating global reduction 0 with 49 rules applied. Total rules applied 98 place count 797 transition count 1099
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 99 place count 797 transition count 1098
Discarding 18 places :
Symmetric choice reduction at 1 with 18 rule applications. Total rules 117 place count 779 transition count 1067
Iterating global reduction 1 with 18 rules applied. Total rules applied 135 place count 779 transition count 1067
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 141 place count 779 transition count 1061
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 144 place count 776 transition count 1058
Iterating global reduction 2 with 3 rules applied. Total rules applied 147 place count 776 transition count 1058
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 149 place count 774 transition count 1056
Iterating global reduction 2 with 2 rules applied. Total rules applied 151 place count 774 transition count 1056
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 152 place count 773 transition count 1055
Iterating global reduction 2 with 1 rules applied. Total rules applied 153 place count 773 transition count 1055
Applied a total of 153 rules in 329 ms. Remains 773 /846 variables (removed 73) and now considering 1055/1148 (removed 93) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3537246120792570400.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14256426753092472322.kers'
[2026-05-22 17:21:09] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3537246120792570400.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14256426753092472322.kers]
Culled 0 columns in 2 ms.
// Phase 1: matrix 1055 rows 773 cols 3406 entries
Finished phase 1 with 474 SingleSign rule and 217 generalized
[2026-05-22 17:21:09] [INFO ] Computed 82 invariants in 15 ms
Computed 82 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-14256426753092472322.kers
Total runtime 18 ms.
[2026-05-22 17:21:10] [INFO ] Implicit Places using invariants in 940 ms returned [607, 618, 629, 637, 645, 653, 661, 672, 680, 688, 699]
Discarding 11 places :
Implicit Place search using SMT only with invariants took 990 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 762/846 places, 1055/1148 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 752 transition count 1045
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 752 transition count 1045
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 28 place count 744 transition count 1037
Iterating global reduction 0 with 8 rules applied. Total rules applied 36 place count 744 transition count 1037
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 738 transition count 1031
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 738 transition count 1031
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 737 transition count 1030
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 737 transition count 1030
Applied a total of 50 rules in 248 ms. Remains 737 /762 variables (removed 25) and now considering 1030/1055 (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-3418311670661324143.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5538874696017993484.kers'
[2026-05-22 17:21:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3418311670661324143.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5538874696017993484.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 1030 rows 737 cols 3312 entries
Finished phase 1 with 480 SingleSign rule and 186 generalized
[2026-05-22 17:21:10] [INFO ] Computed 71 invariants in 15 ms
Computed 71 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-5538874696017993484.kers
Total runtime 17 ms.
[2026-05-22 17:21:11] [INFO ] Implicit Places using invariants in 614 ms returned []
[2026-05-22 17:21:11] [INFO ] Invariant cache hit.
[2026-05-22 17:21:13] [INFO ] Implicit Places using invariants and state equation in 2110 ms returned []
Implicit Place search using SMT with State Equation took 2730 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 737/846 places, 1030/1148 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 4316 ms. Remains : 737/846 places, 1030/1148 transitions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1030/1030 transitions.
Applied a total of 0 rules in 64 ms. Remains 737 /737 variables (removed 0) and now considering 1030/1030 (removed 0) transitions.
[2026-05-22 17:21:13] [INFO ] Invariant cache hit.
[2026-05-22 17:21:13] [INFO ] Implicit Places using invariants in 556 ms returned []
[2026-05-22 17:21:13] [INFO ] Invariant cache hit.
[2026-05-22 17:21:15] [INFO ] Implicit Places using invariants and state equation in 1936 ms returned []
Implicit Place search using SMT with State Equation took 2496 ms to find 0 implicit places.
Running 1029 sub problems to find dead transitions.
[2026-05-22 17:21:15] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/736 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 736/1767 variables, and 38 constraints, problems are : Problem set: 0 solved, 1029 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 38/57 constraints, State Equation: 0/737 constraints, PredecessorRefiner: 1029/1029 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1029 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/736 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 1029 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 736/1767 variables, and 38 constraints, problems are : Problem set: 0 solved, 1029 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 38/57 constraints, State Equation: 0/737 constraints, PredecessorRefiner: 0/1029 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60427ms problems are : Problem set: 0 solved, 1029 unsolved
Search for dead transitions found 0 dead transitions in 60454ms
Finished structural reductions in LTL mode , in 1 iterations and 63047 ms. Remains : 737/737 places, 1030/1030 transitions.
Support contains 22 out of 737 places after structural reductions.
[2026-05-22 17:22:16] [INFO ] Flatten gal took : 106 ms
[2026-05-22 17:22:16] [INFO ] Flatten gal took : 49 ms
[2026-05-22 17:22:16] [INFO ] Input system was already deterministic with 1030 transitions.
RANDOM walk for 40000 steps (255 resets) in 1274 ms. (31 steps per ms) remains 4/14 properties
BEST_FIRST walk for 40002 steps (70 resets) in 194 ms. (205 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (69 resets) in 113 ms. (350 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (66 resets) in 157 ms. (253 steps per ms) remains 3/4 properties
[2026-05-22 17:22:17] [INFO ] Invariant cache hit.
Problem AtomicPropp4 is UNSAT
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 25/29 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/29 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 211/240 variables, 13/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/240 variables, 0/14 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 422/662 variables, 40/54 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/662 variables, 5/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/662 variables, 0/59 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 75/737 variables, 17/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/737 variables, 0/76 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 1030/1767 variables, 737/813 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1767 variables, 0/813 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/1767 variables, 0/813 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1767/1767 variables, and 813 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2587 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 737/737 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/1 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 43/44 variables, 1/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/44 variables, 0/1 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 230/274 variables, 14/15 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/274 variables, 1/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/274 variables, 0/16 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 424/698 variables, 42/58 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/698 variables, 4/62 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/698 variables, 1/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/698 variables, 0/63 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 39/737 variables, 14/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/737 variables, 0/77 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 1030/1767 variables, 737/814 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1767 variables, 2/816 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1767 variables, 1/817 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1767 variables, 0/817 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1767 variables, 0/817 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1767/1767 variables, and 817 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2351 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 737/737 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 1/1 constraints]
After SMT, in 4959ms problems are : Problem set: 1 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Finished Parikh walk after 2443 steps, including 2 resets, run visited all 2 properties in 12 ms. (steps per millisecond=203 )
Parikh walk visited 2 properties in 16 ms.
Successfully simplified 1 atomic propositions for a total of 6 simplifications.
Computed a total of 28 stabilizing places and 28 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (p1&&X(p1)))||X(F(p2))||G(p0))))'
Support contains 6 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1030/1030 transitions.
Discarding 7 places :
Symmetric choice reduction at 0 with 7 rule applications. Total rules 7 place count 730 transition count 1023
Iterating global reduction 0 with 7 rules applied. Total rules applied 14 place count 730 transition count 1023
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 19 place count 725 transition count 1011
Iterating global reduction 0 with 5 rules applied. Total rules applied 24 place count 725 transition count 1011
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 27 place count 722 transition count 1008
Iterating global reduction 0 with 3 rules applied. Total rules applied 30 place count 722 transition count 1008
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 33 place count 719 transition count 998
Iterating global reduction 0 with 3 rules applied. Total rules applied 36 place count 719 transition count 998
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 39 place count 716 transition count 988
Iterating global reduction 0 with 3 rules applied. Total rules applied 42 place count 716 transition count 988
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 714 transition count 986
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 714 transition count 986
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 712 transition count 977
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 712 transition count 977
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 710 transition count 968
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 710 transition count 968
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 56 place count 708 transition count 966
Iterating global reduction 0 with 2 rules applied. Total rules applied 58 place count 708 transition count 966
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 60 place count 706 transition count 957
Iterating global reduction 0 with 2 rules applied. Total rules applied 62 place count 706 transition count 957
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 64 place count 704 transition count 948
Iterating global reduction 0 with 2 rules applied. Total rules applied 66 place count 704 transition count 948
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 68 place count 702 transition count 946
Iterating global reduction 0 with 2 rules applied. Total rules applied 70 place count 702 transition count 946
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 72 place count 700 transition count 937
Iterating global reduction 0 with 2 rules applied. Total rules applied 74 place count 700 transition count 937
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 699 transition count 929
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 699 transition count 929
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 698 transition count 928
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 698 transition count 928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 697 transition count 920
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 697 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 696 transition count 912
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 696 transition count 912
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 695 transition count 911
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 695 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 694 transition count 903
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 694 transition count 903
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 693 transition count 895
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 693 transition count 895
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 692 transition count 894
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 692 transition count 894
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 691 transition count 886
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 691 transition count 886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 690 transition count 878
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 690 transition count 878
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 689 transition count 877
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 689 transition count 877
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 688 transition count 869
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 688 transition count 869
Applied a total of 98 rules in 390 ms. Remains 688 /737 variables (removed 49) and now considering 869/1030 (removed 161) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4467166127497499989.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1446704934931663624.kers'
[2026-05-22 17:22:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4467166127497499989.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1446704934931663624.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 869 rows 688 cols 2723 entries
Finished phase 1 with 442 SingleSign rule and 175 generalized
[2026-05-22 17:22:23] [INFO ] Computed 71 invariants in 4 ms
Computed 71 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1446704934931663624.kers
Total runtime 5 ms.
[2026-05-22 17:22:23] [INFO ] Implicit Places using invariants in 486 ms returned []
[2026-05-22 17:22:23] [INFO ] Invariant cache hit.
[2026-05-22 17:22:25] [INFO ] Implicit Places using invariants and state equation in 1547 ms returned []
Implicit Place search using SMT with State Equation took 2054 ms to find 0 implicit places.
Running 868 sub problems to find dead transitions.
[2026-05-22 17:22:25] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/687 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 687/1557 variables, and 38 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 38/57 constraints, State Equation: 0/688 constraints, PredecessorRefiner: 868/868 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 868 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/687 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/687 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 2 (OVERLAPS) 1/688 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 868 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/688 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 868 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 688/1557 variables, and 77 constraints, problems are : Problem set: 0 solved, 868 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 0/688 constraints, PredecessorRefiner: 0/868 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60199ms problems are : Problem set: 0 solved, 868 unsolved
Search for dead transitions found 0 dead transitions in 60205ms
Starting structural reductions in LTL mode, iteration 1 : 688/737 places, 869/1030 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62655 ms. Remains : 688/737 places, 869/1030 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((F(p0) U (p1&&X(p1)))||X(F(p2))||G(p0))))'
Stuttering acceptance computed with spot in 419 ms :[(AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : ASLink-PT-01b-LTLCardinality-01
Product exploration explored 100000 steps with 33333 reset in 328 ms.
Product exploration explored 100000 steps with 33333 reset in 290 ms.
Computed a total of 26 stabilizing places and 26 stable transitions
Computed a total of 26 stabilizing places and 26 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 17 factoid took 17 ms. Proved property starting from automaton with 7 states, 20 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 31 ms.
FORMULA ASLink-PT-01b-LTLCardinality-01 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-01b-LTLCardinality-01 finished in 63837 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1030/1030 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 728 transition count 1021
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 728 transition count 1021
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 24 place count 722 transition count 1008
Iterating global reduction 0 with 6 rules applied. Total rules applied 30 place count 722 transition count 1008
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 34 place count 718 transition count 1004
Iterating global reduction 0 with 4 rules applied. Total rules applied 38 place count 718 transition count 1004
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 42 place count 714 transition count 993
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 714 transition count 993
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 49 place count 711 transition count 983
Iterating global reduction 0 with 3 rules applied. Total rules applied 52 place count 711 transition count 983
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 55 place count 708 transition count 980
Iterating global reduction 0 with 3 rules applied. Total rules applied 58 place count 708 transition count 980
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 61 place count 705 transition count 970
Iterating global reduction 0 with 3 rules applied. Total rules applied 64 place count 705 transition count 970
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 703 transition count 961
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 703 transition count 961
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 701 transition count 959
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 701 transition count 959
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 699 transition count 950
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 699 transition count 950
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 697 transition count 941
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 697 transition count 941
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 695 transition count 939
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 695 transition count 939
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 86 place count 693 transition count 930
Iterating global reduction 0 with 2 rules applied. Total rules applied 88 place count 693 transition count 930
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 692 transition count 922
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 692 transition count 922
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 691 transition count 921
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 691 transition count 921
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 690 transition count 913
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 690 transition count 913
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 689 transition count 905
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 689 transition count 905
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 688 transition count 904
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 688 transition count 904
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 687 transition count 896
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 687 transition count 896
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 686 transition count 888
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 686 transition count 888
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 685 transition count 887
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 685 transition count 887
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 684 transition count 879
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 684 transition count 879
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 683 transition count 871
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 683 transition count 871
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 109 place count 682 transition count 870
Iterating global reduction 0 with 1 rules applied. Total rules applied 110 place count 682 transition count 870
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 111 place count 681 transition count 862
Iterating global reduction 0 with 1 rules applied. Total rules applied 112 place count 681 transition count 862
Applied a total of 112 rules in 411 ms. Remains 681 /737 variables (removed 56) and now considering 862/1030 (removed 168) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11605829184412597327.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2777596146290216728.kers'
[2026-05-22 17:23:27] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11605829184412597327.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2777596146290216728.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 862 rows 681 cols 2704 entries
Finished phase 1 with 436 SingleSign rule and 174 generalized
[2026-05-22 17:23:27] [INFO ] Computed 71 invariants in 5 ms
Computed 71 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2777596146290216728.kers
Total runtime 10 ms.
[2026-05-22 17:23:27] [INFO ] Implicit Places using invariants in 415 ms returned []
[2026-05-22 17:23:27] [INFO ] Invariant cache hit.
[2026-05-22 17:23:28] [INFO ] Implicit Places using invariants and state equation in 1514 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
Running 861 sub problems to find dead transitions.
[2026-05-22 17:23:28] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 680/1543 variables, and 38 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 38/57 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 861/861 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 861 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/680 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/680 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 2 (OVERLAPS) 1/681 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 861 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/681 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 861 unsolved
Error getting values : (error "Error writing to Z3 solver: java.io.IOException: Broken pipe")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 681/1543 variables, and 73 constraints, problems are : Problem set: 0 solved, 861 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 0/681 constraints, PredecessorRefiner: 0/861 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 861 unsolved
Search for dead transitions found 0 dead transitions in 60223ms
Starting structural reductions in LTL mode, iteration 1 : 681/737 places, 862/1030 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62569 ms. Remains : 681/737 places, 862/1030 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Stuttering acceptance computed with spot in 115 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLCardinality-03
Stuttering criterion allowed to conclude after 112 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-01b-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLCardinality-03 finished in 62717 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1030/1030 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 729 transition count 1022
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 729 transition count 1022
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 724 transition count 1010
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 724 transition count 1010
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 30 place count 720 transition count 1006
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 720 transition count 1006
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 38 place count 716 transition count 995
Iterating global reduction 0 with 4 rules applied. Total rules applied 42 place count 716 transition count 995
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 45 place count 713 transition count 985
Iterating global reduction 0 with 3 rules applied. Total rules applied 48 place count 713 transition count 985
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 51 place count 710 transition count 982
Iterating global reduction 0 with 3 rules applied. Total rules applied 54 place count 710 transition count 982
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 57 place count 707 transition count 972
Iterating global reduction 0 with 3 rules applied. Total rules applied 60 place count 707 transition count 972
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 62 place count 705 transition count 963
Iterating global reduction 0 with 2 rules applied. Total rules applied 64 place count 705 transition count 963
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 66 place count 703 transition count 961
Iterating global reduction 0 with 2 rules applied. Total rules applied 68 place count 703 transition count 961
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 70 place count 701 transition count 952
Iterating global reduction 0 with 2 rules applied. Total rules applied 72 place count 701 transition count 952
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 74 place count 699 transition count 943
Iterating global reduction 0 with 2 rules applied. Total rules applied 76 place count 699 transition count 943
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 78 place count 697 transition count 941
Iterating global reduction 0 with 2 rules applied. Total rules applied 80 place count 697 transition count 941
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 82 place count 695 transition count 932
Iterating global reduction 0 with 2 rules applied. Total rules applied 84 place count 695 transition count 932
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 694 transition count 924
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 694 transition count 924
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 693 transition count 923
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 693 transition count 923
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 89 place count 692 transition count 915
Iterating global reduction 0 with 1 rules applied. Total rules applied 90 place count 692 transition count 915
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 691 transition count 907
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 691 transition count 907
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 690 transition count 906
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 690 transition count 906
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 689 transition count 898
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 689 transition count 898
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 688 transition count 890
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 688 transition count 890
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 687 transition count 889
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 687 transition count 889
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 101 place count 686 transition count 881
Iterating global reduction 0 with 1 rules applied. Total rules applied 102 place count 686 transition count 881
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 103 place count 685 transition count 873
Iterating global reduction 0 with 1 rules applied. Total rules applied 104 place count 685 transition count 873
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 105 place count 684 transition count 872
Iterating global reduction 0 with 1 rules applied. Total rules applied 106 place count 684 transition count 872
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 107 place count 683 transition count 864
Iterating global reduction 0 with 1 rules applied. Total rules applied 108 place count 683 transition count 864
Applied a total of 108 rules in 480 ms. Remains 683 /737 variables (removed 54) and now considering 864/1030 (removed 166) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2712938636526969608.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14886372608171016733.kers'
[2026-05-22 17:24:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2712938636526969608.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14886372608171016733.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 864 rows 683 cols 2708 entries
Finished phase 1 with 438 SingleSign rule and 174 generalized
[2026-05-22 17:24:29] [INFO ] Computed 71 invariants in 4 ms
Computed 71 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14886372608171016733.kers
Total runtime 7 ms.
[2026-05-22 17:24:30] [INFO ] Implicit Places using invariants in 664 ms returned []
[2026-05-22 17:24:30] [INFO ] Invariant cache hit.
[2026-05-22 17:24:32] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 2193 ms to find 0 implicit places.
Running 863 sub problems to find dead transitions.
[2026-05-22 17:24:32] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 682/1547 variables, and 38 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 38/57 constraints, State Equation: 0/683 constraints, PredecessorRefiner: 863/863 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 863 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/682 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/682 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 2 (OVERLAPS) 1/683 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 863 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/683 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 863 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 683/1547 variables, and 73 constraints, problems are : Problem set: 0 solved, 863 unsolved in 30028 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 0/683 constraints, PredecessorRefiner: 0/863 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60223ms problems are : Problem set: 0 solved, 863 unsolved
Search for dead transitions found 0 dead transitions in 60227ms
Starting structural reductions in LTL mode, iteration 1 : 683/737 places, 864/1030 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62905 ms. Remains : 683/737 places, 864/1030 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLCardinality-06
Entered a terminal (fully accepting) state of product in 2358 steps with 11 reset in 7 ms.
FORMULA ASLink-PT-01b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLCardinality-06 finished in 63116 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(X(X(F(p0)))))&&(p1||F(p2)))))'
Support contains 2 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1030/1030 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 729 transition count 1022
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 729 transition count 1022
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 21 place count 724 transition count 1010
Iterating global reduction 0 with 5 rules applied. Total rules applied 26 place count 724 transition count 1010
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 29 place count 721 transition count 1007
Iterating global reduction 0 with 3 rules applied. Total rules applied 32 place count 721 transition count 1007
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 35 place count 718 transition count 997
Iterating global reduction 0 with 3 rules applied. Total rules applied 38 place count 718 transition count 997
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 716 transition count 988
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 716 transition count 988
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 714 transition count 986
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 714 transition count 986
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 712 transition count 977
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 712 transition count 977
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 710 transition count 968
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 710 transition count 968
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 709 transition count 967
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 709 transition count 967
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 708 transition count 959
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 708 transition count 959
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 707 transition count 951
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 707 transition count 951
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 706 transition count 950
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 706 transition count 950
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 705 transition count 942
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 705 transition count 942
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 704 transition count 934
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 704 transition count 934
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 703 transition count 933
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 703 transition count 933
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 702 transition count 925
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 702 transition count 925
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 701 transition count 917
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 701 transition count 917
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 700 transition count 916
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 700 transition count 916
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 699 transition count 908
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 699 transition count 908
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 698 transition count 900
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 698 transition count 900
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 697 transition count 899
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 697 transition count 899
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 696 transition count 891
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 696 transition count 891
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 83 place count 695 transition count 883
Iterating global reduction 0 with 1 rules applied. Total rules applied 84 place count 695 transition count 883
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 85 place count 694 transition count 882
Iterating global reduction 0 with 1 rules applied. Total rules applied 86 place count 694 transition count 882
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 87 place count 693 transition count 874
Iterating global reduction 0 with 1 rules applied. Total rules applied 88 place count 693 transition count 874
Applied a total of 88 rules in 396 ms. Remains 693 /737 variables (removed 44) and now considering 874/1030 (removed 156) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16952808598856448355.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6482900890678196150.kers'
[2026-05-22 17:25:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16952808598856448355.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6482900890678196150.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 874 rows 693 cols 2736 entries
Finished phase 1 with 445 SingleSign rule and 177 generalized
[2026-05-22 17:25:32] [INFO ] Computed 71 invariants in 13 ms
Computed 71 P flows in 14 ms.
Exported basis to /tmp/petrispot-output-6482900890678196150.kers
Total runtime 16 ms.
[2026-05-22 17:25:33] [INFO ] Implicit Places using invariants in 448 ms returned []
[2026-05-22 17:25:33] [INFO ] Invariant cache hit.
[2026-05-22 17:25:35] [INFO ] Implicit Places using invariants and state equation in 1712 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Running 873 sub problems to find dead transitions.
[2026-05-22 17:25:35] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 692/1567 variables, and 38 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30045 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 38/57 constraints, State Equation: 0/693 constraints, PredecessorRefiner: 873/873 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 873 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/692 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/692 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 2 (OVERLAPS) 1/693 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 873 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/693 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 873 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 693/1567 variables, and 89 constraints, problems are : Problem set: 0 solved, 873 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 0/693 constraints, PredecessorRefiner: 0/873 constraints, Known Traps: 18/18 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60220ms problems are : Problem set: 0 solved, 873 unsolved
Search for dead transitions found 0 dead transitions in 60224ms
Starting structural reductions in LTL mode, iteration 1 : 693/737 places, 874/1030 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62802 ms. Remains : 693/737 places, 874/1030 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(X(X(F(p0)))))&&(p1||F(p2)))))'
Stuttering acceptance computed with spot in 281 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-01b-LTLCardinality-07
Stuttering criterion allowed to conclude after 261 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-01b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLCardinality-07 finished in 63140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X(F(p2)))))'
Support contains 6 out of 737 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 737/737 places, 1030/1030 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 731 transition count 1024
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 731 transition count 1024
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 17 place count 726 transition count 1012
Iterating global reduction 0 with 5 rules applied. Total rules applied 22 place count 726 transition count 1012
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 25 place count 723 transition count 1009
Iterating global reduction 0 with 3 rules applied. Total rules applied 28 place count 723 transition count 1009
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 31 place count 720 transition count 999
Iterating global reduction 0 with 3 rules applied. Total rules applied 34 place count 720 transition count 999
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 718 transition count 990
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 718 transition count 990
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 716 transition count 988
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 716 transition count 988
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 714 transition count 979
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 714 transition count 979
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 47 place count 713 transition count 971
Iterating global reduction 0 with 1 rules applied. Total rules applied 48 place count 713 transition count 971
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 49 place count 712 transition count 970
Iterating global reduction 0 with 1 rules applied. Total rules applied 50 place count 712 transition count 970
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 51 place count 711 transition count 962
Iterating global reduction 0 with 1 rules applied. Total rules applied 52 place count 711 transition count 962
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 53 place count 710 transition count 954
Iterating global reduction 0 with 1 rules applied. Total rules applied 54 place count 710 transition count 954
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 55 place count 709 transition count 953
Iterating global reduction 0 with 1 rules applied. Total rules applied 56 place count 709 transition count 953
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 708 transition count 945
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 708 transition count 945
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 707 transition count 937
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 707 transition count 937
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 706 transition count 936
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 706 transition count 936
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 705 transition count 928
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 705 transition count 928
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 65 place count 704 transition count 920
Iterating global reduction 0 with 1 rules applied. Total rules applied 66 place count 704 transition count 920
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 67 place count 703 transition count 919
Iterating global reduction 0 with 1 rules applied. Total rules applied 68 place count 703 transition count 919
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 69 place count 702 transition count 911
Iterating global reduction 0 with 1 rules applied. Total rules applied 70 place count 702 transition count 911
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 71 place count 701 transition count 903
Iterating global reduction 0 with 1 rules applied. Total rules applied 72 place count 701 transition count 903
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 73 place count 700 transition count 902
Iterating global reduction 0 with 1 rules applied. Total rules applied 74 place count 700 transition count 902
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 75 place count 699 transition count 894
Iterating global reduction 0 with 1 rules applied. Total rules applied 76 place count 699 transition count 894
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 77 place count 698 transition count 886
Iterating global reduction 0 with 1 rules applied. Total rules applied 78 place count 698 transition count 886
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 79 place count 697 transition count 885
Iterating global reduction 0 with 1 rules applied. Total rules applied 80 place count 697 transition count 885
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 81 place count 696 transition count 877
Iterating global reduction 0 with 1 rules applied. Total rules applied 82 place count 696 transition count 877
Applied a total of 82 rules in 431 ms. Remains 696 /737 variables (removed 41) and now considering 877/1030 (removed 153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1748912790678607245.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-473230209176649631.kers'
[2026-05-22 17:26:36] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1748912790678607245.kers, --Pflows, --basisKERS=/tmp/petrispot-output-473230209176649631.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 877 rows 696 cols 2743 entries
Finished phase 1 with 448 SingleSign rule and 177 generalized
[2026-05-22 17:26:36] [INFO ] Computed 71 invariants in 4 ms
Computed 71 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-473230209176649631.kers
Total runtime 6 ms.
[2026-05-22 17:26:36] [INFO ] Implicit Places using invariants in 404 ms returned []
[2026-05-22 17:26:36] [INFO ] Invariant cache hit.
[2026-05-22 17:26:37] [INFO ] Implicit Places using invariants and state equation in 1440 ms returned []
Implicit Place search using SMT with State Equation took 1859 ms to find 0 implicit places.
Running 876 sub problems to find dead transitions.
[2026-05-22 17:26:37] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/695 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 695/1573 variables, and 38 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 0/14 constraints, Generalized P Invariants (flows): 38/57 constraints, State Equation: 0/696 constraints, PredecessorRefiner: 876/876 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 876 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/695 variables, 38/38 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/695 variables, 0/38 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 2 (OVERLAPS) 1/696 variables, 14/52 constraints. Problems are: Problem set: 0 solved, 876 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/696 variables, 19/71 constraints. Problems are: Problem set: 0 solved, 876 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 696/1573 variables, and 79 constraints, problems are : Problem set: 0 solved, 876 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 57/57 constraints, State Equation: 0/696 constraints, PredecessorRefiner: 0/876 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60198ms problems are : Problem set: 0 solved, 876 unsolved
Search for dead transitions found 0 dead transitions in 60200ms
Starting structural reductions in LTL mode, iteration 1 : 696/737 places, 877/1030 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 62492 ms. Remains : 696/737 places, 877/1030 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((p0 U p1)&&X(F(p2)))))'
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p1) (NOT p2)), (NOT p1), (NOT p2)]
Running random walk in product with property : ASLink-PT-01b-LTLCardinality-11
Stuttering criterion allowed to conclude after 143 steps with 0 reset in 1 ms.
FORMULA ASLink-PT-01b-LTLCardinality-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-01b-LTLCardinality-11 finished in 62689 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)||X(X(F(p1))))))'
Support contains 3 out of 737 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 737/737 places, 1030/1030 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 126 transitions
Trivial Post-agglo rules discarded 126 transitions
Performed 126 trivial Post agglomeration. Transition count delta: 126
Iterating post reduction 0 with 126 rules applied. Total rules applied 126 place count 736 transition count 903
Reduce places removed 126 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 129 rules applied. Total rules applied 255 place count 610 transition count 900
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 257 place count 608 transition count 900
Performed 194 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 194 Pre rules applied. Total rules applied 257 place count 608 transition count 706
Deduced a syphon composed of 194 places in 1 ms
Ensure Unique test removed 14 places
Reduce places removed 208 places and 0 transitions.
Iterating global reduction 3 with 402 rules applied. Total rules applied 659 place count 400 transition count 706
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 3 with 11 rules applied. Total rules applied 670 place count 399 transition count 696
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 4 with 10 rules applied. Total rules applied 680 place count 389 transition count 696
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 680 place count 389 transition count 691
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 5 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 5 with 15 rules applied. Total rules applied 695 place count 379 transition count 691
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 4 Pre rules applied. Total rules applied 695 place count 379 transition count 687
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 5 with 8 rules applied. Total rules applied 703 place count 375 transition count 687
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 707 place count 371 transition count 683
Iterating global reduction 5 with 4 rules applied. Total rules applied 711 place count 371 transition count 683
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 715 place count 367 transition count 679
Iterating global reduction 5 with 4 rules applied. Total rules applied 719 place count 367 transition count 679
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 722 place count 364 transition count 676
Iterating global reduction 5 with 3 rules applied. Total rules applied 725 place count 364 transition count 676
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 726 place count 363 transition count 675
Iterating global reduction 5 with 1 rules applied. Total rules applied 727 place count 363 transition count 675
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 728 place count 362 transition count 674
Iterating global reduction 5 with 1 rules applied. Total rules applied 729 place count 362 transition count 674
Performed 59 Post agglomeration using F-continuation condition.Transition count delta: 59
Deduced a syphon composed of 59 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 61 places and 0 transitions.
Iterating global reduction 5 with 120 rules applied. Total rules applied 849 place count 301 transition count 615
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 852 place count 298 transition count 612
Ensure Unique test removed 1 places
Iterating global reduction 5 with 4 rules applied. Total rules applied 856 place count 297 transition count 612
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 1 rules applied. Total rules applied 857 place count 297 transition count 611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 858 place count 296 transition count 611
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 858 place count 296 transition count 610
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 860 place count 295 transition count 610
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 861 place count 294 transition count 609
Iterating global reduction 7 with 1 rules applied. Total rules applied 862 place count 294 transition count 609
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 864 place count 294 transition count 607
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 865 place count 293 transition count 607
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 867 place count 292 transition count 612
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 869 place count 290 transition count 610
Reduce places removed 2 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 9 with 3 rules applied. Total rules applied 872 place count 288 transition count 609
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 873 place count 287 transition count 609
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 3 Pre rules applied. Total rules applied 873 place count 287 transition count 606
Deduced a syphon composed of 3 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 11 with 7 rules applied. Total rules applied 880 place count 283 transition count 606
Discarding 3 places :
Implicit places reduction removed 3 places
Iterating post reduction 11 with 3 rules applied. Total rules applied 883 place count 280 transition count 606
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 883 place count 280 transition count 605
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 885 place count 279 transition count 605
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 12 with 8 rules applied. Total rules applied 893 place count 275 transition count 601
Discarding 2 places :
Symmetric choice reduction at 12 with 2 rule applications. Total rules 895 place count 273 transition count 599
Iterating global reduction 12 with 2 rules applied. Total rules applied 897 place count 273 transition count 599
Discarding 1 places :
Symmetric choice reduction at 12 with 1 rule applications. Total rules 898 place count 272 transition count 598
Iterating global reduction 12 with 1 rules applied. Total rules applied 899 place count 272 transition count 598
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 12 with 1 rules applied. Total rules applied 900 place count 272 transition count 597
Applied a total of 900 rules in 254 ms. Remains 272 /737 variables (removed 465) and now considering 597/1030 (removed 433) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17586775789794178043.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4096896451293277462.kers'
[2026-05-22 17:27:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17586775789794178043.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4096896451293277462.kers]
Culling duplicate invariants (modulo rational): removing 6 columns.
Culled 6 columns in 1 ms.
// Phase 1: matrix 597 rows 266 cols 2337 entries
Finished phase 1 with 67 SingleSign rule and 163 generalized
[2026-05-22 17:27:38] [INFO ] Computed 42 invariants in 8 ms
Computed 42 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4096896451293277462.kers
Total runtime 10 ms.
[2026-05-22 17:27:38] [INFO ] Implicit Places using invariants in 358 ms returned [1, 18, 19, 31, 49, 67, 87, 138, 139, 150, 151, 152, 187, 208, 209, 210, 211]
Discarding 17 places :
Implicit Place search using SMT only with invariants took 366 ms to find 17 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 255/737 places, 597/1030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 28 transitions
Trivial Post-agglo rules discarded 28 transitions
Performed 28 trivial Post agglomeration. Transition count delta: 28
Iterating post reduction 0 with 28 rules applied. Total rules applied 28 place count 255 transition count 569
Reduce places removed 28 places and 0 transitions.
Iterating post reduction 1 with 28 rules applied. Total rules applied 56 place count 227 transition count 569
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 56 place count 227 transition count 558
Deduced a syphon composed of 11 places in 1 ms
Ensure Unique test removed 1 places
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 23 rules applied. Total rules applied 79 place count 215 transition count 558
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 91 place count 211 transition count 550
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 99 place count 203 transition count 550
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 102 place count 200 transition count 547
Iterating global reduction 4 with 3 rules applied. Total rules applied 105 place count 200 transition count 547
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 108 place count 200 transition count 544
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 1 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 5 with 26 rules applied. Total rules applied 134 place count 187 transition count 531
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 138 place count 185 transition count 532
Applied a total of 138 rules in 35 ms. Remains 185 /255 variables (removed 70) and now considering 532/597 (removed 65) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12341820359288975613.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7708715260343382268.kers'
[2026-05-22 17:27:38] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12341820359288975613.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7708715260343382268.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 532 rows 185 cols 2132 entries
Finished phase 1 with 41 SingleSign rule and 124 generalized
[2026-05-22 17:27:38] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-7708715260343382268.kers
Total runtime 3 ms.
[2026-05-22 17:27:39] [INFO ] Implicit Places using invariants in 135 ms returned [89, 95, 100, 182]
Discarding 4 places :
Implicit Place search using SMT only with invariants took 137 ms to find 4 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 181/737 places, 532/1030 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 181 transition count 531
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 180 transition count 531
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 4 place count 178 transition count 529
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 178 transition count 529
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 8 place count 176 transition count 527
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 176 transition count 527
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 175 transition count 526
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 175 transition count 526
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 14 place count 174 transition count 525
Applied a total of 14 rules in 21 ms. Remains 174 /181 variables (removed 7) and now considering 525/532 (removed 7) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-111004661918354199.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-943109234285707117.kers'
[2026-05-22 17:27:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-111004661918354199.kers, --Pflows, --basisKERS=/tmp/petrispot-output-943109234285707117.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 525 rows 174 cols 2105 entries
Finished phase 1 with 39 SingleSign rule and 119 generalized
[2026-05-22 17:27:39] [INFO ] Computed 16 invariants in 2 ms
Computed 16 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-943109234285707117.kers
Total runtime 16 ms.
[2026-05-22 17:27:39] [INFO ] Implicit Places using invariants in 137 ms returned []
[2026-05-22 17:27:39] [INFO ] Invariant cache hit.
[2026-05-22 17:27:39] [INFO ] Implicit Places using invariants and state equation in 347 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 174/737 places, 525/1030 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 1310 ms. Remains : 174/737 places, 525/1030 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)||X(X(F(p1))))))'
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-01b-LTLCardinality-13
Product exploration explored 100000 steps with 25405 reset in 160 ms.
Product exploration explored 100000 steps with 25416 reset in 187 ms.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 330 steps (4 resets) in 9 ms. (33 steps per ms) remains 0/3 properties
Knowledge based reduction with 5 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 255 ms.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 174 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 174/174 places, 525/525 transitions.
Applied a total of 0 rules in 7 ms. Remains 174 /174 variables (removed 0) and now considering 525/525 (removed 0) transitions.
[2026-05-22 17:27:40] [INFO ] Invariant cache hit.
[2026-05-22 17:27:40] [INFO ] Implicit Places using invariants in 147 ms returned []
[2026-05-22 17:27:40] [INFO ] Invariant cache hit.
[2026-05-22 17:27:40] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 502 ms to find 0 implicit places.
[2026-05-22 17:27:40] [INFO ] Redundant transitions in 27 ms returned []
Running 518 sub problems to find dead transitions.
[2026-05-22 17:27:40] [INFO ] Invariant cache hit.
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (OVERLAPS) 1/173 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/173 variables, 3/17 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (OVERLAPS) 1/174 variables, 2/19 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/174 variables, 3/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 174/699 variables, and 22 constraints, problems are : Problem set: 0 solved, 518 unsolved in 30030 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 0/174 constraints, PredecessorRefiner: 518/518 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 518 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/172 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/172 variables, 9/12 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/172 variables, 2/14 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/172 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 4 (OVERLAPS) 1/173 variables, 2/16 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/173 variables, 2/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/173 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 7 (OVERLAPS) 1/174 variables, 2/20 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/174 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/174 variables, 2/24 constraints. Problems are: Problem set: 0 solved, 518 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/174 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 518 unsolved
Problem TDEAD3 is UNSAT
Problem TDEAD4 is UNSAT
Problem TDEAD5 is UNSAT
Problem TDEAD6 is UNSAT
Problem TDEAD7 is UNSAT
Problem TDEAD8 is UNSAT
Problem TDEAD9 is UNSAT
Problem TDEAD10 is UNSAT
Problem TDEAD11 is UNSAT
Problem TDEAD12 is UNSAT
Problem TDEAD13 is UNSAT
Problem TDEAD14 is UNSAT
Problem TDEAD15 is UNSAT
Problem TDEAD17 is UNSAT
Problem TDEAD18 is UNSAT
Problem TDEAD19 is UNSAT
Problem TDEAD20 is UNSAT
Problem TDEAD21 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD27 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD95 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD125 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD189 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD219 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD249 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD283 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD315 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD346 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD375 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD408 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD412 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD479 is UNSAT
Problem TDEAD480 is UNSAT
Problem TDEAD481 is UNSAT
Problem TDEAD483 is UNSAT
Problem TDEAD484 is UNSAT
Problem TDEAD485 is UNSAT
Problem TDEAD486 is UNSAT
At refinement iteration 11 (OVERLAPS) 525/699 variables, 174/198 constraints. Problems are: Problem set: 336 solved, 182 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/699 variables, 182/380 constraints. Problems are: Problem set: 336 solved, 182 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 699/699 variables, and 380 constraints, problems are : Problem set: 336 solved, 182 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 5/5 constraints, Generalized P Invariants (flows): 11/11 constraints, State Equation: 174/174 constraints, PredecessorRefiner: 182/518 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60153ms problems are : Problem set: 336 solved, 182 unsolved
Search for dead transitions found 336 dead transitions in 60155ms
Found 336 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 336 transitions
Dead transitions reduction (with SMT) removed 336 transitions
Starting structural reductions in SI_LTL mode, iteration 1 : 174/174 places, 189/525 transitions.
Ensure Unique test removed 15 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 159 transition count 174
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 30 place count 144 transition count 174
Applied a total of 30 rules in 5 ms. Remains 144 /174 variables (removed 30) and now considering 174/189 (removed 15) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14577965595747196213.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10880765511193629642.kers'
[2026-05-22 17:28:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14577965595747196213.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10880765511193629642.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 174 rows 143 cols 689 entries
Finished phase 1 with 44 SingleSign rule and 71 generalized
[2026-05-22 17:28:41] [INFO ] Computed 29 invariants in 0 ms
Computed 29 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-10880765511193629642.kers
Total runtime 1 ms.
[2026-05-22 17:28:41] [INFO ] Implicit Places using invariants in 187 ms returned [8, 9, 10, 11, 12, 13, 16, 17, 18, 19, 20, 21, 22, 23]
Discarding 14 places :
Implicit Place search using SMT only with invariants took 200 ms to find 14 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 130/174 places, 174/525 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 25 transitions
Trivial Post-agglo rules discarded 25 transitions
Performed 25 trivial Post agglomeration. Transition count delta: 25
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 130 transition count 149
Reduce places removed 25 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 27 rules applied. Total rules applied 52 place count 105 transition count 147
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 54 place count 103 transition count 147
Applied a total of 54 rules in 3 ms. Remains 103 /130 variables (removed 27) and now considering 147/174 (removed 27) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7794343512426439173.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12855397488390542995.kers'
[2026-05-22 17:28:41] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7794343512426439173.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12855397488390542995.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 147 rows 102 cols 579 entries
Finished phase 1 with 45 SingleSign rule and 43 generalized
[2026-05-22 17:28:41] [INFO ] Computed 15 invariants in 0 ms
Computed 15 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12855397488390542995.kers
Total runtime 1 ms.
[2026-05-22 17:28:41] [INFO ] Implicit Places using invariants in 107 ms returned []
[2026-05-22 17:28:41] [INFO ] Invariant cache hit.
[2026-05-22 17:28:41] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 269 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 103/174 places, 147/525 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 61185 ms. Remains : 103/174 places, 147/525 transitions.
Computed a total of 2 stabilizing places and 2 stable transitions
Computed a total of 2 stabilizing places and 2 stable transitions
Knowledge based reduction with 7 factoid took 43 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
RANDOM walk for 759 steps (30 resets) in 7 ms. (94 steps per ms) remains 0/3 properties
Knowledge based reduction with 7 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 207 ms.
Stuttering acceptance computed with spot in 119 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 89 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5829 reset in 139 ms.
Product exploration explored 100000 steps with 5923 reset in 226 ms.
Built C files in :
/tmp/ltsmin17352135573587259344
[2026-05-22 17:28:42] [INFO ] Computing symmetric may disable matrix : 147 transitions.
[2026-05-22 17:28:42] [INFO ] Computation of Complete disable matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:28:42] [INFO ] Computing symmetric may enable matrix : 147 transitions.
[2026-05-22 17:28:42] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:28:42] [INFO ] Computing Do-Not-Accords matrix : 147 transitions.
[2026-05-22 17:28:42] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 17:28:42] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17352135573587259344
Running compilation step : cd /tmp/ltsmin17352135573587259344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 570 ms.
Running link step : cd /tmp/ltsmin17352135573587259344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin17352135573587259344;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13539491358969030385.hoa' '--buchi-type=spotba'
LTSmin run took 3712 ms.
FORMULA ASLink-PT-01b-LTLCardinality-13 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property ASLink-PT-01b-LTLCardinality-13 finished in 68575 ms.
All properties solved by simple procedures.
Total runtime 458289 ms.

BK_STOP 1779470926907

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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

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