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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.3M
-rw-r--r-- 1 mcc users 7.0K Mar 4 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 69K Mar 4 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.3K Mar 4 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 43K Mar 4 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 15 07:03 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:03 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.8K Mar 15 07:03 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:03 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.0K Mar 4 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 74K Mar 4 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.3K Mar 4 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 58K Mar 4 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:03 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:03 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 927K 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-09-LTLCardinality-00
FORMULA_NAME Anderson-PT-09-LTLCardinality-01
FORMULA_NAME Anderson-PT-09-LTLCardinality-02
FORMULA_NAME Anderson-PT-09-LTLCardinality-03
FORMULA_NAME Anderson-PT-09-LTLCardinality-04
FORMULA_NAME Anderson-PT-09-LTLCardinality-05
FORMULA_NAME Anderson-PT-09-LTLCardinality-06
FORMULA_NAME Anderson-PT-09-LTLCardinality-07
FORMULA_NAME Anderson-PT-09-LTLCardinality-08
FORMULA_NAME Anderson-PT-09-LTLCardinality-09
FORMULA_NAME Anderson-PT-09-LTLCardinality-10
FORMULA_NAME Anderson-PT-09-LTLCardinality-11
FORMULA_NAME Anderson-PT-09-LTLCardinality-12
FORMULA_NAME Anderson-PT-09-LTLCardinality-13
FORMULA_NAME Anderson-PT-09-LTLCardinality-14
FORMULA_NAME Anderson-PT-09-LTLCardinality-15

=== Now, execution of the tool begins

BK_START 1779462822970

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-09
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202604301425
[2026-05-22 15:13:44] [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:13:44] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 15:13:44] [INFO ] Load time of PNML (sax parser for PT used): 144 ms
[2026-05-22 15:13:44] [INFO ] Transformed 505 places.
[2026-05-22 15:13:44] [INFO ] Transformed 1845 transitions.
[2026-05-22 15:13:44] [INFO ] Found NUPN structural information;
[2026-05-22 15:13:44] [INFO ] Parsed PT model containing 505 places and 1845 transitions and 7092 arcs in 244 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 5 formulas.
FORMULA Anderson-PT-09-LTLCardinality-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-13 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-09-LTLCardinality-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 505 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 505/505 places, 1845/1845 transitions.
Discarding 129 places :
Symmetric choice reduction at 0 with 129 rule applications. Total rules 129 place count 376 transition count 692
Iterating global reduction 0 with 129 rules applied. Total rules applied 258 place count 376 transition count 692
Applied a total of 258 rules in 76 ms. Remains 376 /505 variables (removed 129) and now considering 692/1845 (removed 1153) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13761029543376975505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10513999929344342046.kers'
[2026-05-22 15:13:45] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13761029543376975505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10513999929344342046.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 692 rows 376 cols 2448 entries
Finished phase 1 with 168 SingleSign rule and 187 generalized
[2026-05-22 15:13:45] [INFO ] Computed 21 invariants in 3 ms
Computed 21 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10513999929344342046.kers
Total runtime 4 ms.
[2026-05-22 15:13:45] [INFO ] Implicit Places using invariants in 789 ms returned []
[2026-05-22 15:13:45] [INFO ] Invariant cache hit.
[2026-05-22 15:13:46] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:13:48] [INFO ] Implicit Places using invariants and state equation in 2952 ms returned []
Implicit Place search using SMT with State Equation took 3790 ms to find 0 implicit places.
Running 683 sub problems to find dead transitions.
[2026-05-22 15:13:48] [INFO ] Invariant cache hit.
[2026-05-22 15:13:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 20/41 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 376/1068 variables, and 46 constraints, problems are : Problem set: 0 solved, 683 unsolved in 30041 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/376 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 683/683 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 683 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/376 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/376 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 683 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/376 variables, 25/46 constraints. Problems are: Problem set: 0 solved, 683 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 376/1068 variables, and 46 constraints, problems are : Problem set: 0 solved, 683 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/376 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/683 constraints, Known Traps: 25/25 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60669ms problems are : Problem set: 0 solved, 683 unsolved
Search for dead transitions found 0 dead transitions in 60689ms
Starting structural reductions in LTL mode, iteration 1 : 376/505 places, 692/1845 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 64609 ms. Remains : 376/505 places, 692/1845 transitions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Applied a total of 0 rules in 8 ms. Remains 376 /376 variables (removed 0) and now considering 692/692 (removed 0) transitions.
[2026-05-22 15:14:49] [INFO ] Invariant cache hit.
[2026-05-22 15:14:49] [INFO ] Implicit Places using invariants in 366 ms returned []
[2026-05-22 15:14:50] [INFO ] Invariant cache hit.
[2026-05-22 15:14:50] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:14:52] [INFO ] Implicit Places using invariants and state equation in 2245 ms returned []
Implicit Place search using SMT with State Equation took 2614 ms to find 0 implicit places.
Skipped dead transition search.
Finished structural reductions in LTL mode , in 1 iterations and 2624 ms. Remains : 376/376 places, 692/692 transitions.
Support contains 35 out of 376 places after structural reductions.
[2026-05-22 15:14:52] [INFO ] Flatten gal took : 99 ms
[2026-05-22 15:14:52] [INFO ] Flatten gal took : 39 ms
[2026-05-22 15:14:52] [INFO ] Input system was already deterministic with 692 transitions.
Reduction of identical properties reduced properties to check from 21 to 20
RANDOM walk for 40000 steps (8 resets) in 2067 ms. (19 steps per ms) remains 3/20 properties
BEST_FIRST walk for 40001 steps (8 resets) in 154 ms. (258 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 145 ms. (273 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (8 resets) in 136 ms. (292 steps per ms) remains 3/3 properties
[2026-05-22 15:14:53] [INFO ] Invariant cache hit.
[2026-05-22 15:14:53] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 344/352 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/365 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/376 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 692/1068 variables, 376/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 72/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1068 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1068 variables, 0/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1068/1068 variables, and 469 constraints, problems are : Problem set: 0 solved, 3 unsolved in 345 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 376/376 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 344/352 variables, 6/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/352 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 13/365 variables, 5/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/365 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 11/376 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/376 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 692/1068 variables, 376/397 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1068 variables, 72/469 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1068 variables, 3/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1068 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/1068 variables, 0/472 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1068/1068 variables, and 472 constraints, problems are : Problem set: 0 solved, 3 unsolved in 2529 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 376/376 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2895ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 122 ms.
Support contains 8 out of 376 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 376/376 places, 692/692 transitions.
Performed 68 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 68 Pre rules applied. Total rules applied 0 place count 376 transition count 624
Deduced a syphon composed of 68 places in 0 ms
Reduce places removed 68 places and 0 transitions.
Iterating global reduction 0 with 136 rules applied. Total rules applied 136 place count 308 transition count 624
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 148 place count 296 transition count 484
Iterating global reduction 0 with 12 rules applied. Total rules applied 160 place count 296 transition count 484
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 166 place count 293 transition count 481
Applied a total of 166 rules in 94 ms. Remains 293 /376 variables (removed 83) and now considering 481/692 (removed 211) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 293/376 places, 481/692 transitions.
RANDOM walk for 40000 steps (8 resets) in 450 ms. (88 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 217 ms. (183 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 205 ms. (194 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 58 ms. (678 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 875959 steps, run timeout after 3001 ms. (steps per millisecond=291 ) properties seen :2 out of 3
Probabilistic random walk after 875959 steps, saw 612749 distinct states, run finished after 3005 ms. (steps per millisecond=291 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-12342374896760258027.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8812463140789518808.kers'
[2026-05-22 15:14:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-12342374896760258027.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8812463140789518808.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 481 rows 293 cols 1754 entries
Finished phase 1 with 85 SingleSign rule and 187 generalized
[2026-05-22 15:14:59] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8812463140789518808.kers
Total runtime 3 ms.
[2026-05-22 15:14:59] [INFO ] State equation strengthened by 72 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 259/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 19/282 variables, 7/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 11/293 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/293 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 481/774 variables, 293/314 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/774 variables, 72/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/774 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/774 variables, 0/386 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 774/774 variables, and 386 constraints, problems are : Problem set: 0 solved, 1 unsolved in 403 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 293/293 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 259/263 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/263 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 19/282 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 11/293 variables, 10/22 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/293 variables, 1/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/293 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 481/774 variables, 293/316 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/774 variables, 72/388 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/774 variables, 1/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/774 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/774 variables, 0/389 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 774/774 variables, and 389 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1100 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 293/293 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1517ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 293 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 293/293 places, 481/481 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 290 transition count 478
Applied a total of 6 rules in 21 ms. Remains 290 /293 variables (removed 3) and now considering 478/481 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 290/293 places, 478/481 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 102 ms. (388 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1131125 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :0 out of 1
Probabilistic random walk after 1131125 steps, saw 780000 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4413259287890306129.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14807574278518200816.kers'
[2026-05-22 15:15:04] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4413259287890306129.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14807574278518200816.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 478 rows 290 cols 1748 entries
Finished phase 1 with 82 SingleSign rule and 187 generalized
[2026-05-22 15:15:04] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-14807574278518200816.kers
Total runtime 3 ms.
[2026-05-22 15:15:04] [INFO ] State equation strengthened by 72 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/277 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/290 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 478/768 variables, 290/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/768 variables, 0/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 768/768 variables, and 383 constraints, problems are : Problem set: 0 solved, 1 unsolved in 186 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 290/290 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 57/61 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/61 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 216/277 variables, 12/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/290 variables, 7/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/290 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 478/768 variables, 290/311 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/768 variables, 72/383 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/768 variables, 1/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/768 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/768 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 768/768 variables, and 384 constraints, problems are : Problem set: 0 solved, 1 unsolved in 442 ms.
Refiners :[Positive P Invariants (semi-flows): 9/9 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 290/290 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 675ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 38 ms.
Support contains 4 out of 290 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 478/478 transitions.
Applied a total of 0 rules in 23 ms. Remains 290 /290 variables (removed 0) and now considering 478/478 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 290/290 places, 478/478 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 290/290 places, 478/478 transitions.
Applied a total of 0 rules in 17 ms. Remains 290 /290 variables (removed 0) and now considering 478/478 (removed 0) transitions.
[2026-05-22 15:15:05] [INFO ] Invariant cache hit.
[2026-05-22 15:15:05] [INFO ] Implicit Places using invariants in 489 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 491 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 289/290 places, 478/478 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 289 transition count 399
Reduce places removed 79 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 81 rules applied. Total rules applied 160 place count 210 transition count 397
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 162 place count 208 transition count 397
Applied a total of 162 rules in 17 ms. Remains 208 /289 variables (removed 81) and now considering 397/478 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4164904148249954477.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6931548020466181328.kers'
[2026-05-22 15:15:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4164904148249954477.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6931548020466181328.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 397 rows 208 cols 1424 entries
Finished phase 1 with 82 SingleSign rule and 106 generalized
[2026-05-22 15:15:05] [INFO ] Computed 20 invariants in 5 ms
Computed 20 P flows in 6 ms.
Exported basis to /tmp/petrispot-output-6931548020466181328.kers
Total runtime 7 ms.
[2026-05-22 15:15:06] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-22 15:15:06] [INFO ] Invariant cache hit.
[2026-05-22 15:15:06] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:15:07] [INFO ] Implicit Places using invariants and state equation in 1183 ms returned []
Implicit Place search using SMT with State Equation took 1499 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 208/290 places, 397/478 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2024 ms. Remains : 208/290 places, 397/478 transitions.
RANDOM walk for 40000 steps (8 resets) in 84 ms. (470 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 30 ms. (1290 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1299113 steps, run timeout after 3001 ms. (steps per millisecond=432 ) properties seen :0 out of 1
Probabilistic random walk after 1299113 steps, saw 855840 distinct states, run finished after 3001 ms. (steps per millisecond=432 ) properties seen :0
[2026-05-22 15:15:10] [INFO ] Invariant cache hit.
[2026-05-22 15:15:10] [INFO ] State equation strengthened by 72 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, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/195 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/208 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 397/605 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 72/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/605 variables, 0/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 605/605 variables, and 300 constraints, problems are : Problem set: 0 solved, 1 unsolved in 323 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 58/62 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/62 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 133/195 variables, 10/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/195 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 13/208 variables, 7/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 397/605 variables, 208/228 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 72/300 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 1/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/605 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/605 variables, 0/301 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 605/605 variables, and 301 constraints, problems are : Problem set: 0 solved, 1 unsolved in 564 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 892ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 22 ms.
Support contains 4 out of 208 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 397/397 transitions.
Applied a total of 0 rules in 9 ms. Remains 208 /208 variables (removed 0) and now considering 397/397 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 208/208 places, 397/397 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 208/208 places, 397/397 transitions.
Applied a total of 0 rules in 8 ms. Remains 208 /208 variables (removed 0) and now considering 397/397 (removed 0) transitions.
[2026-05-22 15:15:11] [INFO ] Invariant cache hit.
[2026-05-22 15:15:11] [INFO ] Implicit Places using invariants in 248 ms returned []
[2026-05-22 15:15:11] [INFO ] Invariant cache hit.
[2026-05-22 15:15:11] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:15:12] [INFO ] Implicit Places using invariants and state equation in 980 ms returned []
Implicit Place search using SMT with State Equation took 1245 ms to find 0 implicit places.
[2026-05-22 15:15:12] [INFO ] Redundant transitions in 33 ms returned []
Running 388 sub problems to find dead transitions.
[2026-05-22 15:15:12] [INFO ] Invariant cache hit.
[2026-05-22 15:15:12] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (OVERLAPS) 1/208 variables, 3/20 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/208 variables, 1/21 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 7 (OVERLAPS) 397/605 variables, 208/230 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/605 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 9 (INCLUDED_ONLY) 0/605 variables, 2/304 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 605/605 variables, and 304 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30024 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 208/208 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 388/388 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 388 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/207 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/207 variables, 7/17 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/207 variables, 1/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/207 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 4 (OVERLAPS) 1/208 variables, 3/21 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/208 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 388 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/208 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 388 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 208/605 variables, and 28 constraints, problems are : Problem set: 0 solved, 388 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 10/10 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/208 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/388 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60190ms problems are : Problem set: 0 solved, 388 unsolved
Search for dead transitions found 0 dead transitions in 60198ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61496 ms. Remains : 208/208 places, 397/397 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 78 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 78 Pre rules applied. Total rules applied 0 place count 208 transition count 319
Deduced a syphon composed of 78 places in 0 ms
Reduce places removed 78 places and 0 transitions.
Iterating global reduction 0 with 156 rules applied. Total rules applied 156 place count 130 transition count 319
Applied a total of 156 rules in 8 ms. Remains 130 /208 variables (removed 78) and now considering 319/397 (removed 78) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9626368949387930240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16752994551221561812.kers'
[2026-05-22 15:16:12] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9626368949387930240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16752994551221561812.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 319 rows 130 cols 1268 entries
Finished phase 1 with 4 SingleSign rule and 106 generalized
[2026-05-22 15:16:12] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-16752994551221561812.kers
Total runtime 2 ms.
[2026-05-22 15:16:12] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 15:16:12] [INFO ] [Nat]Absence check using 12 positive place invariants in 8 ms returned sat
[2026-05-22 15:16:12] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 36 ms returned sat
[2026-05-22 15:16:13] [INFO ] After 490ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 15:16:13] [INFO ] After 552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 15:16:13] [INFO ] After 717ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 808 ms.
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' '!(F(G(p0)))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Performed 72 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 72 Pre rules applied. Total rules applied 0 place count 376 transition count 620
Deduced a syphon composed of 72 places in 0 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 0 with 144 rules applied. Total rules applied 144 place count 304 transition count 620
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 158 place count 290 transition count 494
Iterating global reduction 0 with 14 rules applied. Total rules applied 172 place count 290 transition count 494
Applied a total of 172 rules in 27 ms. Remains 290 /376 variables (removed 86) and now considering 494/692 (removed 198) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6574862354003467464.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10389687158415677155.kers'
[2026-05-22 15:16:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6574862354003467464.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10389687158415677155.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 494 rows 290 cols 1814 entries
Finished phase 1 with 82 SingleSign rule and 187 generalized
[2026-05-22 15:16:14] [INFO ] Computed 21 invariants in 3 ms
Computed 21 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10389687158415677155.kers
Total runtime 8 ms.
[2026-05-22 15:16:14] [INFO ] Implicit Places using invariants in 655 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 657 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/376 places, 494/692 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 80 transitions
Trivial Post-agglo rules discarded 80 transitions
Performed 80 trivial Post agglomeration. Transition count delta: 80
Iterating post reduction 0 with 80 rules applied. Total rules applied 80 place count 289 transition count 414
Reduce places removed 80 places and 0 transitions.
Iterating post reduction 1 with 80 rules applied. Total rules applied 160 place count 209 transition count 414
Applied a total of 160 rules in 11 ms. Remains 209 /289 variables (removed 80) and now considering 414/494 (removed 80) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-9020171836964040367.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10566259068173100008.kers'
[2026-05-22 15:16:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-9020171836964040367.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10566259068173100008.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 414 rows 209 cols 1492 entries
Finished phase 1 with 83 SingleSign rule and 106 generalized
[2026-05-22 15:16:14] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-10566259068173100008.kers
Total runtime 3 ms.
[2026-05-22 15:16:14] [INFO ] Implicit Places using invariants in 218 ms returned []
[2026-05-22 15:16:15] [INFO ] Invariant cache hit.
[2026-05-22 15:16:15] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:16:15] [INFO ] Implicit Places using invariants and state equation in 964 ms returned []
Implicit Place search using SMT with State Equation took 1207 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/376 places, 414/692 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1904 ms. Remains : 209/376 places, 414/692 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Stuttering acceptance computed with spot in 255 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-00
Product exploration explored 100000 steps with 0 reset in 251 ms.
Stack based approach found an accepted trace after 60 steps with 0 reset with depth 61 and stack size 61 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-00 finished in 2574 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Performed 70 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 70 Pre rules applied. Total rules applied 0 place count 376 transition count 622
Deduced a syphon composed of 70 places in 0 ms
Reduce places removed 70 places and 0 transitions.
Iterating global reduction 0 with 140 rules applied. Total rules applied 140 place count 306 transition count 622
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 154 place count 292 transition count 480
Iterating global reduction 0 with 14 rules applied. Total rules applied 168 place count 292 transition count 480
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 170 place count 291 transition count 479
Applied a total of 170 rules in 54 ms. Remains 291 /376 variables (removed 85) and now considering 479/692 (removed 213) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-2349581420789335195.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11579212242116757429.kers'
[2026-05-22 15:16:16] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2349581420789335195.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11579212242116757429.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 479 rows 291 cols 1750 entries
Finished phase 1 with 83 SingleSign rule and 187 generalized
[2026-05-22 15:16:16] [INFO ] Computed 21 invariants in 4 ms
Computed 21 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-11579212242116757429.kers
Total runtime 6 ms.
[2026-05-22 15:16:17] [INFO ] Implicit Places using invariants in 503 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 505 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 290/376 places, 479/692 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 290 transition count 398
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 209 transition count 398
Applied a total of 162 rules in 11 ms. Remains 209 /290 variables (removed 81) and now considering 398/479 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13314594946911134671.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3187384267101400506.kers'
[2026-05-22 15:16:17] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13314594946911134671.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3187384267101400506.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 398 rows 209 cols 1426 entries
Finished phase 1 with 83 SingleSign rule and 106 generalized
[2026-05-22 15:16:17] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3187384267101400506.kers
Total runtime 4 ms.
[2026-05-22 15:16:17] [INFO ] Implicit Places using invariants in 235 ms returned []
[2026-05-22 15:16:17] [INFO ] Invariant cache hit.
[2026-05-22 15:16:17] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:16:17] [INFO ] Implicit Places using invariants and state equation in 591 ms returned []
Implicit Place search using SMT with State Equation took 833 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 209/376 places, 398/692 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1404 ms. Remains : 209/376 places, 398/692 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Stuttering acceptance computed with spot in 102 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-02
Product exploration explored 100000 steps with 90 reset in 194 ms.
Stack based approach found an accepted trace after 42 steps with 0 reset with depth 43 and stack size 43 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-02 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-02 finished in 1750 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' '!(((!p0||X(G(p1))) U (p2 U X(p2))))'
Support contains 5 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 362 transition count 550
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 362 transition count 550
Applied a total of 28 rules in 10 ms. Remains 362 /376 variables (removed 14) and now considering 550/692 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14554113154701534915.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-17811952697618325984.kers'
[2026-05-22 15:16:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14554113154701534915.kers, --Pflows, --basisKERS=/tmp/petrispot-output-17811952697618325984.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 550 rows 362 cols 1892 entries
Finished phase 1 with 154 SingleSign rule and 187 generalized
[2026-05-22 15:16:18] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-17811952697618325984.kers
Total runtime 3 ms.
[2026-05-22 15:16:18] [INFO ] Implicit Places using invariants in 412 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 413 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/376 places, 550/692 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 427 ms. Remains : 361/376 places, 550/692 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' '!(((!p0||X(G(p1))) U (p2 U X(p2))))'
Stuttering acceptance computed with spot in 331 ms :[(NOT p2), (NOT p2), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-03
Product exploration explored 100000 steps with 50000 reset in 280 ms.
Product exploration explored 100000 steps with 50000 reset in 223 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 14 factoid took 14 ms. Proved property starting from automaton with 7 states, 13 edges and 3 AP (stutter sensitive
Knowledge-based reduction took 19 ms.
FORMULA Anderson-PT-09-LTLCardinality-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-03 finished in 1336 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))||F(p1))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 365 transition count 585
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 365 transition count 585
Applied a total of 22 rules in 8 ms. Remains 365 /376 variables (removed 11) and now considering 585/692 (removed 107) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14270326406277162240.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2415580545455864010.kers'
[2026-05-22 15:16:19] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14270326406277162240.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2415580545455864010.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 585 rows 365 cols 2030 entries
Finished phase 1 with 157 SingleSign rule and 187 generalized
[2026-05-22 15:16:19] [INFO ] Computed 21 invariants in 8 ms
Computed 21 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-2415580545455864010.kers
Total runtime 9 ms.
[2026-05-22 15:16:20] [INFO ] Implicit Places using invariants in 491 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 493 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 364/376 places, 585/692 transitions.
Applied a total of 0 rules in 3 ms. Remains 364 /364 variables (removed 0) and now considering 585/585 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 364/376 places, 585/692 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))||F(p1))))'
Stuttering acceptance computed with spot in 167 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-04
Product exploration explored 100000 steps with 0 reset in 155 ms.
Stack based approach found an accepted trace after 102 steps with 0 reset with depth 103 and stack size 103 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-04 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-04 finished in 858 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(F((G((G(p1)||p0))&&F(p1)))))))'
Support contains 3 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 363 transition count 567
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 363 transition count 567
Applied a total of 26 rules in 10 ms. Remains 363 /376 variables (removed 13) and now considering 567/692 (removed 125) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-100207572570839349.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14893336546041337922.kers'
[2026-05-22 15:16:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-100207572570839349.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14893336546041337922.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 567 rows 363 cols 1960 entries
Finished phase 1 with 155 SingleSign rule and 187 generalized
[2026-05-22 15:16:20] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-14893336546041337922.kers
Total runtime 4 ms.
[2026-05-22 15:16:20] [INFO ] Implicit Places using invariants in 421 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 436 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/376 places, 567/692 transitions.
Applied a total of 0 rules in 3 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 449 ms. Remains : 362/376 places, 567/692 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(F((G((G(p1)||p0))&&F(p1)))))))'
Stuttering acceptance computed with spot in 295 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-05
Product exploration explored 100000 steps with 0 reset in 150 ms.
Product exploration explored 100000 steps with 0 reset in 181 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 1 factoid took 73 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 640 ms. (62 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 172 ms. (231 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 86 ms. (459 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17256290769068958894.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8639249621019457785.kers'
[2026-05-22 15:16:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17256290769068958894.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8639249621019457785.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 567 rows 362 cols 1798 entries
Finished phase 1 with 236 SingleSign rule and 106 generalized
[2026-05-22 15:16:21] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8639249621019457785.kers
Total runtime 2 ms.
[2026-05-22 15:16:21] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 325/328 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/354 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 567/929 variables, 362/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 72/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/929 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 929/929 variables, and 454 constraints, problems are : Problem set: 0 solved, 3 unsolved in 300 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 325/328 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/354 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 567/929 variables, 362/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 72/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/929 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 929/929 variables, and 457 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1388ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 185 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 362 transition count 488
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 283 transition count 488
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 158 place count 283 transition count 417
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 300 place count 212 transition count 417
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 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 20 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 210/362 places, 415/567 transitions.
RANDOM walk for 40000 steps (8 resets) in 143 ms. (277 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 87 ms. (454 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 127 ms. (312 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40000 steps (8 resets) in 151 ms. (263 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 999225 steps, run timeout after 3001 ms. (steps per millisecond=332 ) properties seen :2 out of 3
Probabilistic random walk after 999225 steps, saw 674403 distinct states, run finished after 3001 ms. (steps per millisecond=332 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16060093316778429547.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4675476810365017370.kers'
[2026-05-22 15:16:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16060093316778429547.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4675476810365017370.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 415 rows 210 cols 1494 entries
Finished phase 1 with 84 SingleSign rule and 106 generalized
[2026-05-22 15:16:26] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-4675476810365017370.kers
Total runtime 3 ms.
[2026-05-22 15:16:26] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 233 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 322 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 576ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 415/415 transitions.
Applied a total of 0 rules in 21 ms. Remains 210 /210 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 210/210 places, 415/415 transitions.
RANDOM walk for 40000 steps (8 resets) in 149 ms. (266 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 39 ms. (1000 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1208008 steps, run timeout after 3001 ms. (steps per millisecond=402 ) properties seen :0 out of 1
Probabilistic random walk after 1208008 steps, saw 807978 distinct states, run finished after 3001 ms. (steps per millisecond=402 ) properties seen :0
[2026-05-22 15:16:30] [INFO ] Invariant cache hit.
[2026-05-22 15:16:30] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 258 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 504 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 768ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 415/415 transitions.
Applied a total of 0 rules in 10 ms. Remains 210 /210 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 210/210 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 415/415 transitions.
Applied a total of 0 rules in 19 ms. Remains 210 /210 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2026-05-22 15:16:31] [INFO ] Invariant cache hit.
[2026-05-22 15:16:31] [INFO ] Implicit Places using invariants in 423 ms returned []
[2026-05-22 15:16:31] [INFO ] Invariant cache hit.
[2026-05-22 15:16:31] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:16:32] [INFO ] Implicit Places using invariants and state equation in 831 ms returned []
Implicit Place search using SMT with State Equation took 1272 ms to find 0 implicit places.
[2026-05-22 15:16:32] [INFO ] Redundant transitions in 7 ms returned []
Running 406 sub problems to find dead transitions.
[2026-05-22 15:16:32] [INFO ] Invariant cache hit.
[2026-05-22 15:16:32] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (OVERLAPS) 415/625 variables, 210/235 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 72/307 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/625 variables, and 311 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/625 variables, and 29 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/406 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60185ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60186ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61495 ms. Remains : 210/210 places, 415/415 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 210 transition count 334
Deduced a syphon composed of 81 places in 0 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 129 transition count 334
Applied a total of 162 rules in 7 ms. Remains 129 /210 variables (removed 81) and now considering 334/415 (removed 81) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1054007941963985117.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8692581173206308710.kers'
[2026-05-22 15:17:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1054007941963985117.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8692581173206308710.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 129 cols 1332 entries
Finished phase 1 with 3 SingleSign rule and 106 generalized
[2026-05-22 15:17:32] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-8692581173206308710.kers
Total runtime 2 ms.
[2026-05-22 15:17:32] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 15:17:32] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-22 15:17:32] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 5 ms returned sat
[2026-05-22 15:17:32] [INFO ] After 111ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 15:17:32] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 15:17:32] [INFO ] After 206ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 276 ms.
Knowledge based reduction with 1 factoid took 210 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 494 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 72131 ms.
Stuttering acceptance computed with spot in 449 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 8 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (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-8536845660206845636.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6630651275417772403.kers'
[2026-05-22 15:17:34] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8536845660206845636.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6630651275417772403.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 567 rows 362 cols 1798 entries
Finished phase 1 with 236 SingleSign rule and 106 generalized
[2026-05-22 15:17:34] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6630651275417772403.kers
Total runtime 3 ms.
[2026-05-22 15:17:34] [INFO ] Implicit Places using invariants in 415 ms returned []
[2026-05-22 15:17:34] [INFO ] Invariant cache hit.
[2026-05-22 15:17:34] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:17:36] [INFO ] Implicit Places using invariants and state equation in 2209 ms returned []
Implicit Place search using SMT with State Equation took 2627 ms to find 0 implicit places.
Running 558 sub problems to find dead transitions.
[2026-05-22 15:17:36] [INFO ] Invariant cache hit.
[2026-05-22 15:17:36] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/929 variables, and 30 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30026 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/929 variables, and 30 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30032 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/558 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60174ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 60185ms
Finished structural reductions in LTL mode , in 1 iterations and 62828 ms. Remains : 362/362 places, 567/567 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 1 factoid took 68 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Reduction of identical properties reduced properties to check from 7 to 6
RANDOM walk for 40000 steps (8 resets) in 169 ms. (235 steps per ms) remains 3/6 properties
BEST_FIRST walk for 40002 steps (8 resets) in 70 ms. (563 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 63 ms. (625 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 78 ms. (506 steps per ms) remains 3/3 properties
[2026-05-22 15:18:37] [INFO ] Invariant cache hit.
[2026-05-22 15:18:37] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 325/328 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/354 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 567/929 variables, 362/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 72/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/929 variables, 0/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 929/929 variables, and 454 constraints, problems are : Problem set: 0 solved, 3 unsolved in 575 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 325/328 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/328 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 26/354 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/354 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 8/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/362 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 567/929 variables, 362/382 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 72/454 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 3/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/929 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (OVERLAPS) 0/929 variables, 0/457 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 929/929 variables, and 457 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1105 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 362/362 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1704ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 220 ms.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 362/362 places, 567/567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 79 transitions
Trivial Post-agglo rules discarded 79 transitions
Performed 79 trivial Post agglomeration. Transition count delta: 79
Iterating post reduction 0 with 79 rules applied. Total rules applied 79 place count 362 transition count 488
Reduce places removed 79 places and 0 transitions.
Iterating post reduction 1 with 79 rules applied. Total rules applied 158 place count 283 transition count 488
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 71 Pre rules applied. Total rules applied 158 place count 283 transition count 417
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 2 with 142 rules applied. Total rules applied 300 place count 212 transition count 417
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 302 place count 211 transition count 416
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 303 place count 211 transition count 415
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 304 place count 210 transition count 415
Applied a total of 304 rules in 17 ms. Remains 210 /362 variables (removed 152) and now considering 415/567 (removed 152) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 210/362 places, 415/567 transitions.
RANDOM walk for 40000 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (8 resets) in 69 ms. (571 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40001 steps (8 resets) in 94 ms. (421 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (8 resets) in 99 ms. (400 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 1058932 steps, run timeout after 3001 ms. (steps per millisecond=352 ) properties seen :2 out of 3
Probabilistic random walk after 1058932 steps, saw 712846 distinct states, run finished after 3001 ms. (steps per millisecond=352 ) properties seen :2
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-1369076684588174505.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2615728578385576932.kers'
[2026-05-22 15:18:42] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-1369076684588174505.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2615728578385576932.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 415 rows 210 cols 1494 entries
Finished phase 1 with 84 SingleSign rule and 106 generalized
[2026-05-22 15:18:42] [INFO ] Computed 20 invariants in 5 ms
Computed 20 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-2615728578385576932.kers
Total runtime 8 ms.
[2026-05-22 15:18:42] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 267 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 469 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 756ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 13 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 415/415 transitions.
Applied a total of 0 rules in 12 ms. Remains 210 /210 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 13 ms. Remains : 210/210 places, 415/415 transitions.
RANDOM walk for 40000 steps (8 resets) in 115 ms. (344 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (8 resets) in 45 ms. (869 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1227678 steps, run timeout after 3001 ms. (steps per millisecond=409 ) properties seen :0 out of 1
Probabilistic random walk after 1227678 steps, saw 820444 distinct states, run finished after 3001 ms. (steps per millisecond=409 ) properties seen :0
[2026-05-22 15:18:46] [INFO ] Invariant cache hit.
[2026-05-22 15:18:46] [INFO ] State equation strengthened by 72 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/625 variables, 0/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 625/625 variables, and 302 constraints, problems are : Problem set: 0 solved, 1 unsolved in 249 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/3 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 173/176 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/176 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 26/202 variables, 7/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/202 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 8/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/210 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 415/625 variables, 210/230 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 72/302 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/625 variables, 1/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/625 variables, 0/303 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 625/625 variables, and 303 constraints, problems are : Problem set: 0 solved, 1 unsolved in 411 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 665ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 12 ms.
Support contains 3 out of 210 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 415/415 transitions.
Applied a total of 0 rules in 9 ms. Remains 210 /210 variables (removed 0) and now considering 415/415 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 210/210 places, 415/415 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 210/210 places, 415/415 transitions.
Applied a total of 0 rules in 8 ms. Remains 210 /210 variables (removed 0) and now considering 415/415 (removed 0) transitions.
[2026-05-22 15:18:46] [INFO ] Invariant cache hit.
[2026-05-22 15:18:47] [INFO ] Implicit Places using invariants in 289 ms returned []
[2026-05-22 15:18:47] [INFO ] Invariant cache hit.
[2026-05-22 15:18:47] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:18:48] [INFO ] Implicit Places using invariants and state equation in 973 ms returned []
Implicit Place search using SMT with State Equation took 1266 ms to find 0 implicit places.
[2026-05-22 15:18:48] [INFO ] Redundant transitions in 15 ms returned []
Running 406 sub problems to find dead transitions.
[2026-05-22 15:18:48] [INFO ] Invariant cache hit.
[2026-05-22 15:18:48] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 3/23 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/210 variables, 1/25 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/210 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 6 (OVERLAPS) 415/625 variables, 210/235 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/625 variables, 72/307 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/625 variables, 4/311 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 625/625 variables, and 311 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30021 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 210/210 constraints, ReadFeed: 72/72 constraints, PredecessorRefiner: 406/406 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 406 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 406 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/210 variables, 9/29 constraints. Problems are: Problem set: 0 solved, 406 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 210/625 variables, and 29 constraints, problems are : Problem set: 0 solved, 406 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/210 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/406 constraints, Known Traps: 9/9 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60149ms problems are : Problem set: 0 solved, 406 unsolved
Search for dead transitions found 0 dead transitions in 60152ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61468 ms. Remains : 210/210 places, 415/415 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 81 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 81 Pre rules applied. Total rules applied 0 place count 210 transition count 334
Deduced a syphon composed of 81 places in 1 ms
Reduce places removed 81 places and 0 transitions.
Iterating global reduction 0 with 162 rules applied. Total rules applied 162 place count 129 transition count 334
Applied a total of 162 rules in 15 ms. Remains 129 /210 variables (removed 81) and now considering 334/415 (removed 81) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-773023326800935901.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12239507394734144350.kers'
[2026-05-22 15:19:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-773023326800935901.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12239507394734144350.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 334 rows 129 cols 1332 entries
Finished phase 1 with 3 SingleSign rule and 106 generalized
[2026-05-22 15:19:48] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 1 ms.
Exported basis to /tmp/petrispot-output-12239507394734144350.kers
Total runtime 2 ms.
[2026-05-22 15:19:48] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 15:19:48] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2026-05-22 15:19:48] [INFO ] [Nat]Absence check using 12 positive and 8 generalized place invariants in 9 ms returned sat
[2026-05-22 15:19:48] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 15:19:48] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 15:19:48] [INFO ] After 248ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Over-approximation ignoring read arcs solved 0 properties in 393 ms.
Knowledge based reduction with 1 factoid took 160 ms. Reduced automaton from 8 states, 20 edges and 2 AP (stutter sensitive) to 8 states, 20 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 397 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Knowledge-based reduction took 72261 ms.
Stuttering acceptance computed with spot in 239 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 265 ms :[(NOT p1), (NOT p1), (NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 129 ms.
Product exploration explored 100000 steps with 0 reset in 187 ms.
Spot run failed in 109 ms. Status :1
Traceback (most recent call last):
File "/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/autstates.py", line 2, in
import spot
ModuleNotFoundError: No module named 'spot'
java.io.IOException
at fr.lip6.move.gal.application.runner.spot.SpotRunner.computeForwardClosedSI(SpotRunner.java:551)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.treatPartialPOR(LTLPropertySolver.java:419)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:280)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:217)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:66)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:849)
at fr.lip6.move.gal.application.Application.start(Application.java:195)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:44)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:219)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:149)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:115)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:467)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:298)
at java.base/jdk.internal.reflect.DirectMethodHandleAccessor.invoke(DirectMethodHandleAccessor.java:103)
at java.base/java.lang.reflect.Method.invoke(Method.java:580)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:615)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:563)
at org.eclipse.equinox.launcher.Main.run(Main.java:1415)
at org.eclipse.equinox.launcher.Main.main(Main.java:1387)
Built C files in :
/tmp/ltsmin15495228100721109416
[2026-05-22 15:19:50] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15495228100721109416
Running compilation step : cd /tmp/ltsmin15495228100721109416;'/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 1080 ms.
Running link step : cd /tmp/ltsmin15495228100721109416;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 68 ms.
Running LTSmin : cd /tmp/ltsmin15495228100721109416;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased8111854522405489123.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 362 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 362/362 places, 567/567 transitions.
Applied a total of 0 rules in 5 ms. Remains 362 /362 variables (removed 0) and now considering 567/567 (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-6916262382758923210.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10277535767888505044.kers'
[2026-05-22 15:20:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6916262382758923210.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10277535767888505044.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 567 rows 362 cols 1798 entries
Finished phase 1 with 236 SingleSign rule and 106 generalized
[2026-05-22 15:20:05] [INFO ] Computed 20 invariants in 2 ms
Computed 20 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-10277535767888505044.kers
Total runtime 5 ms.
[2026-05-22 15:20:05] [INFO ] Implicit Places using invariants in 301 ms returned []
[2026-05-22 15:20:05] [INFO ] Invariant cache hit.
[2026-05-22 15:20:05] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:20:07] [INFO ] Implicit Places using invariants and state equation in 2160 ms returned []
Implicit Place search using SMT with State Equation took 2476 ms to find 0 implicit places.
Running 558 sub problems to find dead transitions.
[2026-05-22 15:20:07] [INFO ] Invariant cache hit.
[2026-05-22 15:20:07] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 5/25 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/362 variables, 5/30 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 362/929 variables, and 30 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30031 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 558/558 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 558 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/362 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/362 variables, 8/20 constraints. Problems are: Problem set: 0 solved, 558 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/362 variables, 10/30 constraints. Problems are: Problem set: 0 solved, 558 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 362/929 variables, and 30 constraints, problems are : Problem set: 0 solved, 558 unsolved in 30056 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 8/8 constraints, State Equation: 0/362 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/558 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60205ms problems are : Problem set: 0 solved, 558 unsolved
Search for dead transitions found 0 dead transitions in 60208ms
Finished structural reductions in LTL mode , in 1 iterations and 62697 ms. Remains : 362/362 places, 567/567 transitions.
Built C files in :
/tmp/ltsmin5140345620042609722
[2026-05-22 15:21:08] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5140345620042609722
Running compilation step : cd /tmp/ltsmin5140345620042609722;'/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 845 ms.
Running link step : cd /tmp/ltsmin5140345620042609722;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin5140345620042609722;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '--when' '--hoa' '/tmp/stateBased16383096773675850530.hoa' '--buchi-type=spotba'
LTSmin run took 13729 ms.
FORMULA Anderson-PT-09-LTLCardinality-05 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property Anderson-PT-09-LTLCardinality-05 finished in 302199 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 376 transition count 621
Deduced a syphon composed of 71 places in 0 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 305 transition count 621
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 156 place count 291 transition count 479
Iterating global reduction 0 with 14 rules applied. Total rules applied 170 place count 291 transition count 479
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 172 place count 290 transition count 478
Applied a total of 172 rules in 65 ms. Remains 290 /376 variables (removed 86) and now considering 478/692 (removed 214) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17703874232662422529.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14082448018096129786.kers'
[2026-05-22 15:21:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17703874232662422529.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14082448018096129786.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 478 rows 290 cols 1748 entries
Finished phase 1 with 82 SingleSign rule and 187 generalized
[2026-05-22 15:21:22] [INFO ] Computed 21 invariants in 5 ms
Computed 21 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-14082448018096129786.kers
Total runtime 6 ms.
[2026-05-22 15:21:23] [INFO ] Implicit Places using invariants in 497 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 510 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 289/376 places, 478/692 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 81 transitions
Trivial Post-agglo rules discarded 81 transitions
Performed 81 trivial Post agglomeration. Transition count delta: 81
Iterating post reduction 0 with 81 rules applied. Total rules applied 81 place count 289 transition count 397
Reduce places removed 81 places and 0 transitions.
Iterating post reduction 1 with 81 rules applied. Total rules applied 162 place count 208 transition count 397
Applied a total of 162 rules in 33 ms. Remains 208 /289 variables (removed 81) and now considering 397/478 (removed 81) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-4396151033195080054.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3973291105441947439.kers'
[2026-05-22 15:21:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4396151033195080054.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3973291105441947439.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 397 rows 208 cols 1424 entries
Finished phase 1 with 82 SingleSign rule and 106 generalized
[2026-05-22 15:21:23] [INFO ] Computed 20 invariants in 1 ms
Computed 20 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-3973291105441947439.kers
Total runtime 2 ms.
[2026-05-22 15:21:23] [INFO ] Implicit Places using invariants in 223 ms returned []
[2026-05-22 15:21:23] [INFO ] Invariant cache hit.
[2026-05-22 15:21:23] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:21:24] [INFO ] Implicit Places using invariants and state equation in 771 ms returned []
Implicit Place search using SMT with State Equation took 1010 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 208/376 places, 397/692 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1633 ms. Remains : 208/376 places, 397/692 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-08
Product exploration explored 100000 steps with 105 reset in 152 ms.
Stack based approach found an accepted trace after 44 steps with 0 reset with depth 45 and stack size 45 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-08 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-08 finished in 1886 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' '!((p0 U X(G(p1))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 361 transition count 549
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 361 transition count 549
Applied a total of 30 rules in 10 ms. Remains 361 /376 variables (removed 15) and now considering 549/692 (removed 143) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10508871066515996471.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5577404668006724394.kers'
[2026-05-22 15:21:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10508871066515996471.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5577404668006724394.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 549 rows 361 cols 1890 entries
Finished phase 1 with 153 SingleSign rule and 187 generalized
[2026-05-22 15:21:24] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-5577404668006724394.kers
Total runtime 3 ms.
[2026-05-22 15:21:25] [INFO ] Implicit Places using invariants in 446 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 448 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 360/376 places, 549/692 transitions.
Applied a total of 0 rules in 3 ms. Remains 360 /360 variables (removed 0) and now considering 549/549 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 461 ms. Remains : 360/376 places, 549/692 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' '!((p0 U X(G(p1))))'
Stuttering acceptance computed with spot in 102 ms :[(NOT p1), (NOT p1), true]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-09
Entered a terminal (fully accepting) state of product in 13009 steps with 0 reset in 35 ms.
FORMULA Anderson-PT-09-LTLCardinality-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-09-LTLCardinality-09 finished in 636 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Support contains 2 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 362 transition count 550
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 362 transition count 550
Applied a total of 28 rules in 14 ms. Remains 362 /376 variables (removed 14) and now considering 550/692 (removed 142) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-8519215596659881650.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11697138406270492820.kers'
[2026-05-22 15:21:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-8519215596659881650.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11697138406270492820.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 550 rows 362 cols 1892 entries
Finished phase 1 with 154 SingleSign rule and 187 generalized
[2026-05-22 15:21:25] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-11697138406270492820.kers
Total runtime 3 ms.
[2026-05-22 15:21:25] [INFO ] Implicit Places using invariants in 472 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 473 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 361/376 places, 550/692 transitions.
Applied a total of 0 rules in 4 ms. Remains 361 /361 variables (removed 0) and now considering 550/550 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 491 ms. Remains : 361/376 places, 550/692 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(p0))'
Stuttering acceptance computed with spot in 103 ms :[(NOT p0), (NOT p0), true]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-10
Product exploration explored 100000 steps with 50000 reset in 188 ms.
Product exploration explored 100000 steps with 50000 reset in 213 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 2 factoid took 12 ms. Proved property starting from automaton with 3 states, 3 edges and 1 AP (stutter sensitive
Knowledge-based reduction took 15 ms.
FORMULA Anderson-PT-09-LTLCardinality-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-09-LTLCardinality-10 finished in 1053 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F((G(F(!p0))||(!p1&&F(!p0)))) U !p2) U (p0&&G(p3)))))'
Support contains 8 out of 376 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Performed 71 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 71 Pre rules applied. Total rules applied 0 place count 376 transition count 621
Deduced a syphon composed of 71 places in 1 ms
Reduce places removed 71 places and 0 transitions.
Iterating global reduction 0 with 142 rules applied. Total rules applied 142 place count 305 transition count 621
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 155 place count 292 transition count 512
Iterating global reduction 0 with 13 rules applied. Total rules applied 168 place count 292 transition count 512
Applied a total of 168 rules in 27 ms. Remains 292 /376 variables (removed 84) and now considering 512/692 (removed 180) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6464224208438837353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1555717195273666689.kers'
[2026-05-22 15:21:26] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6464224208438837353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1555717195273666689.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 512 rows 292 cols 1884 entries
Finished phase 1 with 84 SingleSign rule and 187 generalized
[2026-05-22 15:21:26] [INFO ] Computed 21 invariants in 2 ms
Computed 21 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-1555717195273666689.kers
Total runtime 3 ms.
[2026-05-22 15:21:26] [INFO ] Implicit Places using invariants in 400 ms returned []
[2026-05-22 15:21:26] [INFO ] Invariant cache hit.
[2026-05-22 15:21:27] [INFO ] State equation strengthened by 72 read => feed constraints.
[2026-05-22 15:21:28] [INFO ] Implicit Places using invariants and state equation in 1940 ms returned []
Implicit Place search using SMT with State Equation took 2342 ms to find 0 implicit places.
[2026-05-22 15:21:28] [INFO ] Redundant transitions in 9 ms returned []
Running 503 sub problems to find dead transitions.
[2026-05-22 15:21:28] [INFO ] Invariant cache hit.
[2026-05-22 15:21:28] [INFO ] State equation strengthened by 72 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 9/30 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/292 variables, 5/35 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/292 variables, 2/37 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 292/804 variables, and 37 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30043 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/292 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 503/503 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 503 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/292 variables, 11/11 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/292 variables, 10/21 constraints. Problems are: Problem set: 0 solved, 503 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/292 variables, 16/37 constraints. Problems are: Problem set: 0 solved, 503 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 292/804 variables, and 37 constraints, problems are : Problem set: 0 solved, 503 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 10/10 constraints, State Equation: 0/292 constraints, ReadFeed: 0/72 constraints, PredecessorRefiner: 0/503 constraints, Known Traps: 16/16 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60251ms problems are : Problem set: 0 solved, 503 unsolved
Search for dead transitions found 0 dead transitions in 60254ms
Starting structural reductions in SI_LTL mode, iteration 1 : 292/376 places, 512/692 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 62643 ms. Remains : 292/376 places, 512/692 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(((F((G(F(!p0))||(!p1&&F(!p0)))) U !p2) U (G(p3)&&p0))))'
Stuttering acceptance computed with spot in 368 ms :[(OR (NOT p0) (NOT p3)), p0, p2, (OR (NOT p0) (NOT p3)), p0, (NOT p3), (AND p0 (NOT p3)), (AND p0 (NOT p3))]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-12
Product exploration explored 100000 steps with 14 reset in 195 ms.
Stack based approach found an accepted trace after 1537 steps with 0 reset with depth 1538 and stack size 952 in 4 ms.
FORMULA Anderson-PT-09-LTLCardinality-12 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-12 finished in 63263 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F((X((!p2 U (!p3||G(!p2))))&&p1)))))'
Support contains 4 out of 376 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 376/376 places, 692/692 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 363 transition count 583
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 363 transition count 583
Applied a total of 26 rules in 11 ms. Remains 363 /376 variables (removed 13) and now considering 583/692 (removed 109) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-6220846388822923592.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12723216433448979267.kers'
[2026-05-22 15:22:29] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6220846388822923592.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12723216433448979267.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 583 rows 363 cols 2026 entries
Finished phase 1 with 155 SingleSign rule and 187 generalized
[2026-05-22 15:22:29] [INFO ] Computed 21 invariants in 8 ms
Computed 21 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-12723216433448979267.kers
Total runtime 11 ms.
[2026-05-22 15:22:30] [INFO ] Implicit Places using invariants in 711 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 714 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 362/376 places, 583/692 transitions.
Applied a total of 0 rules in 9 ms. Remains 362 /362 variables (removed 0) and now considering 583/583 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 734 ms. Remains : 362/376 places, 583/692 transitions.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202604301425/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(F((X((!p2 U (!p3||G(!p2))))&&p1)))))'
Stuttering acceptance computed with spot in 254 ms :[(OR (AND (NOT p0) p2 p3) (AND (NOT p0) (NOT p1))), (OR (NOT p1) (AND p2 p3)), (OR (NOT p1) (AND p2 p3)), (AND p2 p3)]
Running random walk in product with property : Anderson-PT-09-LTLCardinality-15
Product exploration explored 100000 steps with 0 reset in 139 ms.
Stack based approach found an accepted trace after 70 steps with 0 reset with depth 71 and stack size 71 in 0 ms.
FORMULA Anderson-PT-09-LTLCardinality-15 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-09-LTLCardinality-15 finished in 1194 ms.
All properties solved by simple procedures.
Total runtime 526127 ms.

BK_STOP 1779463350794

--------------------
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-09"
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-09, 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-177944366000187"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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