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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.6K Mar 4 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 4 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 4 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 4 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 4 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 4 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 4 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 4 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M 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 Anderson-PT-11-LTLCardinality-00
FORMULA_NAME Anderson-PT-11-LTLCardinality-01
FORMULA_NAME Anderson-PT-11-LTLCardinality-02
FORMULA_NAME Anderson-PT-11-LTLCardinality-03
FORMULA_NAME Anderson-PT-11-LTLCardinality-04
FORMULA_NAME Anderson-PT-11-LTLCardinality-05
FORMULA_NAME Anderson-PT-11-LTLCardinality-06
FORMULA_NAME Anderson-PT-11-LTLCardinality-07
FORMULA_NAME Anderson-PT-11-LTLCardinality-08
FORMULA_NAME Anderson-PT-11-LTLCardinality-09
FORMULA_NAME Anderson-PT-11-LTLCardinality-10
FORMULA_NAME Anderson-PT-11-LTLCardinality-11
FORMULA_NAME Anderson-PT-11-LTLCardinality-12
FORMULA_NAME Anderson-PT-11-LTLCardinality-13
FORMULA_NAME Anderson-PT-11-LTLCardinality-14
FORMULA_NAME Anderson-PT-11-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779464713285

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 15:45:14] [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 15:45:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 15:45:15] [INFO ] Load time of PNML (sax parser for PT used): 218 ms
[2026-05-22 15:45:15] [INFO ] Transformed 749 places.
[2026-05-22 15:45:15] [INFO ] Transformed 3245 transitions.
[2026-05-22 15:45:15] [INFO ] Found NUPN structural information;
[2026-05-22 15:45:15] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 337 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA Anderson-PT-11-LTLCardinality-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-05 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-00 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-LTLCardinality-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 23 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 210 places :
Symmetric choice reduction at 0 with 210 rule applications. Total rules 210 place count 539 transition count 935
Iterating global reduction 0 with 210 rules applied. Total rules applied 420 place count 539 transition count 935
Applied a total of 420 rules in 124 ms. Remains 539 /749 variables (removed 210) and now considering 935/3245 (removed 2310) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10533594713824470282.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10805801157343850397.kers'
[2026-05-22 15:45:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10533594713824470282.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10805801157343850397.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 935 rows 539 cols 3268 entries
Finished phase 1 with 241 SingleSign rule and 273 generalized
[2026-05-22 15:45:15] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-10805801157343850397.kers
Total runtime 6 ms.
[2026-05-22 15:45:16] [INFO ] Implicit Places using invariants in 1447 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 1491 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 538/749 places, 935/3245 transitions.
Applied a total of 0 rules in 12 ms. Remains 538 /538 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1653 ms. Remains : 538/749 places, 935/3245 transitions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Applied a total of 0 rules in 20 ms. Remains 538 /538 variables (removed 0) and now considering 935/935 (removed 0) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6928125024209111177.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16821605549871068950.kers'
[2026-05-22 15:45:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6928125024209111177.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16821605549871068950.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 935 rows 538 cols 3026 entries
Finished phase 1 with 362 SingleSign rule and 152 generalized
[2026-05-22 15:45:17] [INFO ] Computed 24 invariants in 3 ms
Computed 24 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-16821605549871068950.kers
Total runtime 11 ms.
[2026-05-22 15:45:17] [INFO ] Implicit Places using invariants in 973 ms returned []
[2026-05-22 15:45:17] [INFO ] Invariant cache hit.
[2026-05-22 15:45:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:45:22] [INFO ] Implicit Places using invariants and state equation in 4043 ms returned []
Implicit Place search using SMT with State Equation took 5038 ms to find 0 implicit places.
Running 924 sub problems to find dead transitions.
[2026-05-22 15:45:22] [INFO ] Invariant cache hit.
[2026-05-22 15:45:22] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 924 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 538/1473 variables, and 38 constraints, problems are : Problem set: 0 solved, 924 unsolved in 30074 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/538 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 924/924 constraints, Known Traps: 14/14 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 924 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/538 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/538 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 924 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/538 variables, 14/38 constraints. Problems are: Problem set: 0 solved, 924 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 538/1473 variables, and 51 constraints, problems are : Problem set: 0 solved, 924 unsolved in 30042 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/538 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/924 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60639ms problems are : Problem set: 0 solved, 924 unsolved
Search for dead transitions found 0 dead transitions in 60678ms
Finished structural reductions in LTL mode , in 1 iterations and 65784 ms. Remains : 538/538 places, 935/935 transitions.
Support contains 23 out of 538 places after structural reductions.
[2026-05-22 15:46:23] [INFO ] Flatten gal took : 90 ms
[2026-05-22 15:46:23] [INFO ] Flatten gal took : 45 ms
[2026-05-22 15:46:23] [INFO ] Input system was already deterministic with 935 transitions.
Support contains 22 out of 538 places (down from 23) after GAL structural reductions.
RANDOM walk for 40000 steps (8 resets) in 2444 ms. (16 steps per ms) remains 2/16 properties
BEST_FIRST walk for 40002 steps (8 resets) in 235 ms. (169 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 141 ms. (281 steps per ms) remains 2/2 properties
[2026-05-22 15:46:24] [INFO ] Invariant cache hit.
[2026-05-22 15:46:24] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 492/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/528 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/538 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 935/1473 variables, 538/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1473 variables, 110/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1473 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1473 variables, 0/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1473/1473 variables, and 672 constraints, problems are : Problem set: 0 solved, 2 unsolved in 492 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 538/538 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 492/496 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/496 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 32/528 variables, 9/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/528 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/538 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/538 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 935/1473 variables, 538/562 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1473 variables, 110/672 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1473 variables, 2/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1473 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/1473 variables, 0/674 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1473/1473 variables, and 674 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1668 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 538/538 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2169ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 106 ms.
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 538/538 places, 935/935 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 538 transition count 815
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 418 transition count 815
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 240 place count 418 transition count 708
Deduced a syphon composed of 107 places in 1 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 454 place count 311 transition count 708
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 460 place count 305 transition count 622
Iterating global reduction 2 with 6 rules applied. Total rules applied 466 place count 305 transition count 622
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 472 place count 302 transition count 619
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 473 place count 302 transition count 618
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 474 place count 301 transition count 618
Applied a total of 474 rules in 93 ms. Remains 301 /538 variables (removed 237) and now considering 618/935 (removed 317) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 301/538 places, 618/935 transitions.
RANDOM walk for 40000 steps (8 resets) in 329 ms. (121 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (8 resets) in 130 ms. (305 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 116 ms. (341 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 707799 steps, run visited all 2 properties in 2594 ms. (steps per millisecond=272 )
Probabilistic random walk after 707799 steps, saw 532605 distinct states, run finished after 2599 ms. (steps per millisecond=272 ) properties seen :2
FORMULA Anderson-PT-11-LTLCardinality-01 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 0 stabilizing places and 0 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(X((p0&&X(p1)))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 530 transition count 847
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 530 transition count 847
Applied a total of 16 rules in 75 ms. Remains 530 /538 variables (removed 8) and now considering 847/935 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-11206113798202249302.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17119556171322824381.kers'
[2026-05-22 15:46:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11206113798202249302.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17119556171322824381.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 847 rows 530 cols 2682 entries
Finished phase 1 with 354 SingleSign rule and 152 generalized
[2026-05-22 15:46:29] [INFO ] Computed 24 invariants in 3 ms
Computed 24 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-17119556171322824381.kers
Total runtime 4 ms.
[2026-05-22 15:46:30] [INFO ] Implicit Places using invariants in 953 ms returned []
[2026-05-22 15:46:30] [INFO ] Invariant cache hit.
[2026-05-22 15:46:31] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:46:34] [INFO ] Implicit Places using invariants and state equation in 3882 ms returned []
Implicit Place search using SMT with State Equation took 4844 ms to find 0 implicit places.
Running 836 sub problems to find dead transitions.
[2026-05-22 15:46:34] [INFO ] Invariant cache hit.
[2026-05-22 15:46:34] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1377 variables, and 29 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30029 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 5/29 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 8/37 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1377 variables, and 37 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/836 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60380ms problems are : Problem set: 0 solved, 836 unsolved
Search for dead transitions found 0 dead transitions in 60385ms
Starting structural reductions in LTL mode, iteration 1 : 530/538 places, 847/935 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 65311 ms. Remains : 530/538 places, 847/935 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((X(p0)&&p1))))'
Stuttering acceptance computed with spot in 553 ms :[(NOT p0), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-03
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-11-LTLCardinality-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLCardinality-03 finished in 66026 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(G(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 528 transition count 825
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 528 transition count 825
Applied a total of 20 rules in 50 ms. Remains 528 /538 variables (removed 10) and now considering 825/935 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14715230506991372086.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1210025477175546533.kers'
[2026-05-22 15:47:35] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14715230506991372086.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1210025477175546533.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 825 rows 528 cols 2596 entries
Finished phase 1 with 352 SingleSign rule and 152 generalized
[2026-05-22 15:47:35] [INFO ] Computed 24 invariants in 3 ms
Computed 24 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-1210025477175546533.kers
Total runtime 6 ms.
[2026-05-22 15:47:36] [INFO ] Implicit Places using invariants in 718 ms returned []
[2026-05-22 15:47:36] [INFO ] Invariant cache hit.
[2026-05-22 15:47:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:47:39] [INFO ] Implicit Places using invariants and state equation in 3449 ms returned []
Implicit Place search using SMT with State Equation took 4179 ms to find 0 implicit places.
Running 814 sub problems to find dead transitions.
[2026-05-22 15:47:39] [INFO ] Invariant cache hit.
[2026-05-22 15:47:40] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 814 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 1/528 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 814 unsolved
SMT process timed out in 30267ms, After SMT, problems are : Problem set: 0 solved, 814 unsolved
Search for dead transitions found 0 dead transitions in 30272ms
Starting structural reductions in LTL mode, iteration 1 : 528/538 places, 825/935 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34508 ms. Remains : 528/538 places, 825/935 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(G(p0)))'
Stuttering acceptance computed with spot in 131 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-04
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLCardinality-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLCardinality-04 finished in 34703 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 9 place count 529 transition count 846
Iterating global reduction 0 with 9 rules applied. Total rules applied 18 place count 529 transition count 846
Applied a total of 18 rules in 30 ms. Remains 529 /538 variables (removed 9) and now considering 846/935 (removed 89) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17998081332019222186.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13517349150881534578.kers'
[2026-05-22 15:48:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17998081332019222186.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13517349150881534578.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 846 rows 529 cols 2680 entries
Finished phase 1 with 353 SingleSign rule and 152 generalized
[2026-05-22 15:48:10] [INFO ] Computed 24 invariants in 3 ms
Computed 24 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-13517349150881534578.kers
Total runtime 4 ms.
[2026-05-22 15:48:11] [INFO ] Implicit Places using invariants in 665 ms returned []
[2026-05-22 15:48:11] [INFO ] Invariant cache hit.
[2026-05-22 15:48:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:48:14] [INFO ] Implicit Places using invariants and state equation in 3065 ms returned []
Implicit Place search using SMT with State Equation took 3749 ms to find 0 implicit places.
Running 835 sub problems to find dead transitions.
[2026-05-22 15:48:14] [INFO ] Invariant cache hit.
[2026-05-22 15:48:14] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 529/1375 variables, and 30 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/529 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 835/835 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 835 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/529 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/529 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/529 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 835 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/529 variables, 6/36 constraints. Problems are: Problem set: 0 solved, 835 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 529/1375 variables, and 36 constraints, problems are : Problem set: 0 solved, 835 unsolved in 30067 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/529 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/835 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60359ms problems are : Problem set: 0 solved, 835 unsolved
Search for dead transitions found 0 dead transitions in 60364ms
Starting structural reductions in LTL mode, iteration 1 : 529/538 places, 846/935 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64149 ms. Remains : 529/538 places, 846/935 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Stuttering acceptance computed with spot in 129 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-06
Product exploration explored 100000 steps with 12 reset in 257 ms.
Stack based approach found an accepted trace after 82 steps with 0 reset with depth 83 and stack size 83 in 1 ms.
FORMULA Anderson-PT-11-LTLCardinality-06 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-06 finished in 64589 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&X(G(!p1)))))))||(F(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&X(G(!p1))))))&&X(p2)))))'
Support contains 4 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Discarding 8 places :
Symmetric choice reduction at 0 with 8 rule applications. Total rules 8 place count 530 transition count 847
Iterating global reduction 0 with 8 rules applied. Total rules applied 16 place count 530 transition count 847
Applied a total of 16 rules in 31 ms. Remains 530 /538 variables (removed 8) and now considering 847/935 (removed 88) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6719733743474376955.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5814412958713414486.kers'
[2026-05-22 15:49:15] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6719733743474376955.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5814412958713414486.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 847 rows 530 cols 2682 entries
Finished phase 1 with 354 SingleSign rule and 152 generalized
[2026-05-22 15:49:15] [INFO ] Computed 24 invariants in 5 ms
Computed 24 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5814412958713414486.kers
Total runtime 6 ms.
[2026-05-22 15:49:15] [INFO ] Implicit Places using invariants in 775 ms returned []
[2026-05-22 15:49:15] [INFO ] Invariant cache hit.
[2026-05-22 15:49:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:49:18] [INFO ] Implicit Places using invariants and state equation in 3103 ms returned []
Implicit Place search using SMT with State Equation took 3892 ms to find 0 implicit places.
Running 836 sub problems to find dead transitions.
[2026-05-22 15:49:18] [INFO ] Invariant cache hit.
[2026-05-22 15:49:18] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 6/30 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 530/1377 variables, and 31 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 836/836 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 836 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/530 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/530 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/530 variables, 7/31 constraints. Problems are: Problem set: 0 solved, 836 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/530 variables, 5/36 constraints. Problems are: Problem set: 0 solved, 836 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 530/1377 variables, and 36 constraints, problems are : Problem set: 0 solved, 836 unsolved in 30040 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/530 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/836 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60332ms problems are : Problem set: 0 solved, 836 unsolved
Search for dead transitions found 0 dead transitions in 60336ms
Starting structural reductions in LTL mode, iteration 1 : 530/538 places, 847/935 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64264 ms. Remains : 530/538 places, 847/935 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&X(G(!p1)))))))||(F(((p0||X(p0)) U (G((p0||X(p0)))||((p0||X(p0))&&X(G(!p1))))))&&X(p2)))))'
Stuttering acceptance computed with spot in 257 ms :[(NOT p0), (AND p1 (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0) (NOT p2)), (AND p1 (NOT p0))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-09
Product exploration explored 100000 steps with 27 reset in 296 ms.
Stack based approach found an accepted trace after 6221 steps with 1 reset with depth 6220 and stack size 4713 in 17 ms.
FORMULA Anderson-PT-11-LTLCardinality-09 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-09 finished in 64902 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(p0&&X(F(p1))))))'
Support contains 3 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 528 transition count 825
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 528 transition count 825
Applied a total of 20 rules in 42 ms. Remains 528 /538 variables (removed 10) and now considering 825/935 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13248738134597726296.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6886679693674859863.kers'
[2026-05-22 15:50:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13248738134597726296.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6886679693674859863.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 825 rows 528 cols 2596 entries
Finished phase 1 with 352 SingleSign rule and 152 generalized
[2026-05-22 15:50:20] [INFO ] Computed 24 invariants in 4 ms
Computed 24 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-6886679693674859863.kers
Total runtime 6 ms.
[2026-05-22 15:50:20] [INFO ] Implicit Places using invariants in 587 ms returned []
[2026-05-22 15:50:20] [INFO ] Invariant cache hit.
[2026-05-22 15:50:21] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:50:23] [INFO ] Implicit Places using invariants and state equation in 3023 ms returned []
Implicit Place search using SMT with State Equation took 3641 ms to find 0 implicit places.
Running 814 sub problems to find dead transitions.
[2026-05-22 15:50:23] [INFO ] Invariant cache hit.
[2026-05-22 15:50:23] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 814 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (OVERLAPS) 1/528 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 814 unsolved
SMT process timed out in 30202ms, After SMT, problems are : Problem set: 0 solved, 814 unsolved
Search for dead transitions found 0 dead transitions in 30204ms
Starting structural reductions in LTL mode, iteration 1 : 528/538 places, 825/935 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 33900 ms. Remains : 528/538 places, 825/935 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)||(X(F(p1))&&p0))))'
Stuttering acceptance computed with spot in 277 ms :[(NOT p0), (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-10
Product exploration explored 100000 steps with 33333 reset in 307 ms.
Product exploration explored 100000 steps with 33333 reset in 292 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Property proved to be true by K+ with min(!phi)
Knowledge based reduction with 5 factoid took 28 ms. Proved property starting from automaton with 6 states, 7 edges and 2 AP (stutter sensitive
Knowledge-based reduction took 35 ms.
FORMULA Anderson-PT-11-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLCardinality-10 finished in 34861 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((X(F((p1&&F(p2))))||p0)))'
Support contains 6 out of 538 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 538 transition count 817
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 420 transition count 817
Performed 107 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 107 Pre rules applied. Total rules applied 236 place count 420 transition count 710
Deduced a syphon composed of 107 places in 0 ms
Reduce places removed 107 places and 0 transitions.
Iterating global reduction 2 with 214 rules applied. Total rules applied 450 place count 313 transition count 710
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 454 place count 309 transition count 666
Iterating global reduction 2 with 4 rules applied. Total rules applied 458 place count 309 transition count 666
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 464 place count 306 transition count 663
Applied a total of 464 rules in 37 ms. Remains 306 /538 variables (removed 232) and now considering 663/935 (removed 272) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1441980115798129799.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11161020861542114838.kers'
[2026-05-22 15:50:54] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1441980115798129799.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11161020861542114838.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 663 rows 306 cols 2398 entries
Finished phase 1 with 130 SingleSign rule and 152 generalized
[2026-05-22 15:50:54] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-11161020861542114838.kers
Total runtime 3 ms.
[2026-05-22 15:50:55] [INFO ] Implicit Places using invariants in 361 ms returned []
[2026-05-22 15:50:55] [INFO ] Invariant cache hit.
[2026-05-22 15:50:55] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:50:57] [INFO ] Implicit Places using invariants and state equation in 1845 ms returned []
Implicit Place search using SMT with State Equation took 2231 ms to find 0 implicit places.
[2026-05-22 15:50:57] [INFO ] Redundant transitions in 45 ms returned []
Running 652 sub problems to find dead transitions.
[2026-05-22 15:50:57] [INFO ] Invariant cache hit.
[2026-05-22 15:50:57] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 8/32 constraints. Problems are: Problem set: 0 solved, 652 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/306 variables, 5/37 constraints. Problems are: Problem set: 0 solved, 652 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 306/969 variables, and 37 constraints, problems are : Problem set: 0 solved, 652 unsolved in 30017 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/306 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 652/652 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 652 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/306 variables, 14/14 constraints. Problems are: Problem set: 0 solved, 652 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/306 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 652 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/306 variables, 13/37 constraints. Problems are: Problem set: 0 solved, 652 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 306/969 variables, and 37 constraints, problems are : Problem set: 0 solved, 652 unsolved in 30047 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/306 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/652 constraints, Known Traps: 13/13 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60218ms problems are : Problem set: 0 solved, 652 unsolved
Search for dead transitions found 0 dead transitions in 60219ms
Starting structural reductions in SI_LTL mode, iteration 1 : 306/538 places, 663/935 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62543 ms. Remains : 306/538 places, 663/935 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X(F((p1&&F(p2))))||p0)))'
Stuttering acceptance computed with spot in 154 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-14
Product exploration explored 100000 steps with 44 reset in 178 ms.
Product exploration explored 100000 steps with 58 reset in 177 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 142 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 286 ms. (139 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 185 ms. (215 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 231 ms. (172 steps per ms) remains 2/2 properties
[2026-05-22 15:51:58] [INFO ] Invariant cache hit.
[2026-05-22 15:51:58] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 257/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/296 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/306 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 663/969 variables, 306/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 110/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/969 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/969 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 969/969 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 346 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 306/306 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 257/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/296 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/306 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 663/969 variables, 306/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 110/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/969 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/969 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/969 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 969/969 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 877 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 306/306 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1252ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 291 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 663/663 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 306 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 305 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 304 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 304 transition count 641
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 303 transition count 640
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 303 transition count 638
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 301 transition count 638
Applied a total of 10 rules in 44 ms. Remains 301 /306 variables (removed 5) and now considering 638/663 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 301/306 places, 638/663 transitions.
RANDOM walk for 40000 steps (8 resets) in 237 ms. (168 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 65 ms. (606 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 90 ms. (439 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 265375 steps, run visited all 2 properties in 2835 ms. (steps per millisecond=93 )
Probabilistic random walk after 265375 steps, saw 203752 distinct states, run finished after 2839 ms. (steps per millisecond=93 ) properties seen :2
Knowledge based reduction with 5 factoid took 178 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 170 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 5316 ms.
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Support contains 6 out of 306 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 306/306 places, 663/663 transitions.
Applied a total of 0 rules in 23 ms. Remains 306 /306 variables (removed 0) and now considering 663/663 (removed 0) transitions.
[2026-05-22 15:52:03] [INFO ] Invariant cache hit.
[2026-05-22 15:52:03] [INFO ] Implicit Places using invariants in 483 ms returned []
[2026-05-22 15:52:03] [INFO ] Invariant cache hit.
[2026-05-22 15:52:04] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:52:05] [INFO ] Implicit Places using invariants and state equation in 2075 ms returned []
Implicit Place search using SMT with State Equation took 2573 ms to find 0 implicit places.
[2026-05-22 15:52:05] [INFO ] Redundant transitions in 6 ms returned []
Skipped dead transition search.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2608 ms. Remains : 306/306 places, 663/663 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
RANDOM walk for 40000 steps (8 resets) in 238 ms. (167 steps per ms) remains 2/4 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 51 ms. (769 steps per ms) remains 2/2 properties
[2026-05-22 15:52:06] [INFO ] Invariant cache hit.
[2026-05-22 15:52:06] [INFO ] State equation strengthened by 110 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 257/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/296 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/306 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 663/969 variables, 306/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 110/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/969 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/969 variables, 0/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 969/969 variables, and 440 constraints, problems are : Problem set: 0 solved, 2 unsolved in 330 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 306/306 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 257/261 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/261 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 35/296 variables, 10/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/296 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 10/306 variables, 10/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/306 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 663/969 variables, 306/330 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/969 variables, 110/440 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/969 variables, 2/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/969 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 0/969 variables, 0/442 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 969/969 variables, and 442 constraints, problems are : Problem set: 0 solved, 2 unsolved in 767 ms.
Refiners :[Positive P Invariants (semi-flows): 14/14 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 306/306 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1112ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 117 ms.
Support contains 4 out of 306 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 306/306 places, 663/663 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 306 transition count 662
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 305 transition count 662
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 304 transition count 641
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 304 transition count 641
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 6 place count 303 transition count 640
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 303 transition count 638
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 10 place count 301 transition count 638
Applied a total of 10 rules in 36 ms. Remains 301 /306 variables (removed 5) and now considering 638/663 (removed 25) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 301/306 places, 638/663 transitions.
RANDOM walk for 40000 steps (8 resets) in 126 ms. (314 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 71 ms. (555 steps per ms) remains 2/2 properties
Finished probabilistic random walk after 265375 steps, run visited all 2 properties in 2134 ms. (steps per millisecond=124 )
Probabilistic random walk after 265375 steps, saw 203752 distinct states, run finished after 2134 ms. (steps per millisecond=124 ) properties seen :2
Knowledge based reduction with 5 factoid took 159 ms. Reduced automaton from 3 states, 5 edges and 3 AP (stutter insensitive) to 3 states, 5 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 113 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Knowledge-based reduction took 3999 ms.
Stuttering acceptance computed with spot in 93 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 107 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p2))), (OR (NOT p1) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 40 reset in 198 ms.
Product exploration explored 100000 steps with 42 reset in 217 ms.
Built C files in :
/tmp/ltsmin7559282738414577684
[2026-05-22 15:52:10] [INFO ] Computing symmetric may disable matrix : 663 transitions.
[2026-05-22 15:52:10] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 15:52:10] [INFO ] Computing symmetric may enable matrix : 663 transitions.
[2026-05-22 15:52:10] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 15:52:10] [INFO ] Computing Do-Not-Accords matrix : 663 transitions.
[2026-05-22 15:52:10] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 15:52:10] [INFO ] Built C files in 151ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7559282738414577684
Running compilation step : cd /tmp/ltsmin7559282738414577684;'/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 1923 ms.
Running link step : cd /tmp/ltsmin7559282738414577684;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 105 ms.
Running LTSmin : cd /tmp/ltsmin7559282738414577684;'/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/stateBased13462504966868742607.hoa' '--buchi-type=spotba'
LTSmin run took 1798 ms.
FORMULA Anderson-PT-11-LTLCardinality-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-11-LTLCardinality-14 finished in 79838 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X((p1||F(G(p2))))))))'
Support contains 2 out of 538 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 538/538 places, 935/935 transitions.
Discarding 10 places :
Symmetric choice reduction at 0 with 10 rule applications. Total rules 10 place count 528 transition count 825
Iterating global reduction 0 with 10 rules applied. Total rules applied 20 place count 528 transition count 825
Applied a total of 20 rules in 39 ms. Remains 528 /538 variables (removed 10) and now considering 825/935 (removed 110) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12590213667317019788.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-529881034851797942.kers'
[2026-05-22 15:52:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12590213667317019788.kers, --Pflows, --basisKERS=/tmp/petrispot-output-529881034851797942.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 825 rows 528 cols 2596 entries
Finished phase 1 with 352 SingleSign rule and 152 generalized
[2026-05-22 15:52:14] [INFO ] Computed 24 invariants in 3 ms
Computed 24 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-529881034851797942.kers
Total runtime 4 ms.
[2026-05-22 15:52:15] [INFO ] Implicit Places using invariants in 672 ms returned []
[2026-05-22 15:52:15] [INFO ] Invariant cache hit.
[2026-05-22 15:52:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:52:18] [INFO ] Implicit Places using invariants and state equation in 3261 ms returned []
Implicit Place search using SMT with State Equation took 3951 ms to find 0 implicit places.
Running 814 sub problems to find dead transitions.
[2026-05-22 15:52:18] [INFO ] Invariant cache hit.
[2026-05-22 15:52:18] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/527 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/527 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/527 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 814 unsolved
At refinement iteration 3 (OVERLAPS) 1/528 variables, 2/23 constraints. Problems are: Problem set: 0 solved, 814 unsolved
SMT process timed out in 30289ms, After SMT, problems are : Problem set: 0 solved, 814 unsolved
Search for dead transitions found 0 dead transitions in 30293ms
Starting structural reductions in LTL mode, iteration 1 : 528/538 places, 825/935 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 34301 ms. Remains : 528/538 places, 825/935 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X((p1||F(G(p2))))))))'
Stuttering acceptance computed with spot in 256 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : Anderson-PT-11-LTLCardinality-15
Product exploration explored 100000 steps with 3580 reset in 228 ms.
Stack based approach found an accepted trace after 13643 steps with 499 reset with depth 77 and stack size 77 in 36 ms.
FORMULA Anderson-PT-11-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLCardinality-15 finished in 34886 ms.
All properties solved by simple procedures.
Total runtime 454766 ms.

BK_STOP 1779465169596

--------------------
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="Anderson-PT-11"
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 Anderson-PT-11, 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-177944366000203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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