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-177944366000206.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/sdalzilio/mcc2026-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5973
Executing tool itstools
Input is Anderson-PT-11, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r002-oct2-177944366000206
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.1M
-rw-r--r-- 1 mcc users 8.6K Mar 4 18:00 CTLCardinality.txt
-rw-r--r-- 1 mcc users 92K Mar 4 18:00 CTLCardinality.xml
-rw-r--r-- 1 mcc users 7.8K Mar 4 18:00 CTLFireability.txt
-rw-r--r-- 1 mcc users 57K Mar 4 18:00 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.8K Mar 15 07:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Mar 15 07:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.0K Mar 15 07:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K Mar 15 07:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K Mar 4 18:00 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 88K Mar 4 18:00 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 4 18:00 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K Mar 4 18:00 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 15 07:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 3 18:30 model.pnml

--------------------
content from stdout:

=== Data for post analysis generated by BenchKit (invocation template)

The expected result is a vector of booleans
BOOL_VECTOR

echo here is the order used to build the result vector(from xml file)
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-00
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-01
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-02
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-03
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-04
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-05
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-06
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-07
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-08
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-09
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-10
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-11
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-12
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-13
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-14
FORMULA_NAME Anderson-PT-11-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1779465187299

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=Anderson-PT-11
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-05-22 15:53:08] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 15:53:08] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 15:53:09] [INFO ] Load time of PNML (sax parser for PT used): 225 ms
[2026-05-22 15:53:09] [INFO ] Transformed 749 places.
[2026-05-22 15:53:09] [INFO ] Transformed 3245 transitions.
[2026-05-22 15:53:09] [INFO ] Found NUPN structural information;
[2026-05-22 15:53:09] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 358 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 17 ms.
Working with output stream class java.io.PrintStream
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-14 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (8 resets) in 2279 ms. (17 steps per ms) remains 6/14 properties
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-13 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-10 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 982 ms. (40 steps per ms) remains 4/6 properties
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-01 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 308 ms. (129 steps per ms) remains 3/4 properties
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (8 resets) in 245 ms. (162 steps per ms) remains 3/3 properties
[2026-05-22 15:53:10] [INFO ] Flatten gal took : 675 ms
BEST_FIRST walk for 40003 steps (8 resets) in 901 ms. (44 steps per ms) remains 3/3 properties
[2026-05-22 15:53:10] [INFO ] Flatten gal took : 288 ms
BEST_FIRST walk for 40002 steps (8 resets) in 371 ms. (107 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-4219579154451056719.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1467999170837362286.kers'
[2026-05-22 15:53:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality35287169585746888.gal : 114 ms
[2026-05-22 15:53:10] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4219579154451056719.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1467999170837362286.kers]
[2026-05-22 15:53:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6389728077471743081.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality35287169585746888.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6389728077471743081.prop' '--nowitness' '--gen-order' 'FOLLOW'
Culled 0 columns in 1 ms.
// Phase 1: matrix 3245 rows 749 cols 12298 entries
Finished phase 1 with 451 SingleSign rule and 273 generalized
[2026-05-22 15:53:10] [INFO ] Computed 25 invariants in 15 ms
Computed 25 P flows in 17 ms.
Exported basis to /tmp/petrispot-output-1467999170837362286.kers
Total runtime 19 ms.

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...326
[2026-05-22 15:53:10] [INFO ] State equation strengthened by 110 read => feed constraints.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/50 variables, 50/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/50 variables, 0/50 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Loading property file /tmp/ReachabilityCardinality6389728077471743081.prop.
At refinement iteration 2 (OVERLAPS) 633/683 variables, 12/62 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/683 variables, 633/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/683 variables, 0/695 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem Anderson-PT-11-ReachabilityCardinality-2024-15 is UNSAT
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 5 (OVERLAPS) 66/749 variables, 13/708 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/749 variables, 66/774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/749 variables, 0/774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :3 after 9
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :9 after 11
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :11 after 12
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :12 after 19
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :19 after 50
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :50 after 67
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :67 after 105
At refinement iteration 8 (OVERLAPS) 3245/3994 variables, 749/1523 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/3994 variables, 110/1633 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 1024
SDD size :105 after 395
At refinement iteration 10 (INCLUDED_ONLY) 0/3994 variables, 0/1633 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 2048
SDD size :395 after 824
At refinement iteration 11 (OVERLAPS) 0/3994 variables, 0/1633 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 3994/3994 variables, and 1633 constraints, problems are : Problem set: 1 solved, 2 unsolved in 2031 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 749/749 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/26 variables, 26/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/26 variables, 0/26 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 588/614 variables, 11/37 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/614 variables, 588/625 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/614 variables, 0/625 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 64/678 variables, 1/626 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/678 variables, 64/690 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/678 variables, 0/690 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 71/749 variables, 13/703 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/749 variables, 71/774 constraints. Problems are: Problem set: 1 solved, 2 unsolved
SDD proceeding with computation,3 properties remain. new max is 4096
SDD size :824 after 5208
At refinement iteration 10 (INCLUDED_ONLY) 0/749 variables, 1/775 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/749 variables, 0/775 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 3245/3994 variables, 749/1524 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/3994 variables, 110/1634 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/3994 variables, 1/1635 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/3994 variables, 0/1635 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/3994 variables, 0/1635 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 3994/3994 variables, and 1635 constraints, problems are : Problem set: 1 solved, 2 unsolved in 5012 ms.
Refiners :[Domain max(s): 749/749 constraints, Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 13/13 constraints, State Equation: 749/749 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 2/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7265ms problems are : Problem set: 1 solved, 2 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 26 out of 749 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Performed 103 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 103 Pre rules applied. Total rules applied 0 place count 749 transition count 3142
Deduced a syphon composed of 103 places in 3 ms
Reduce places removed 103 places and 0 transitions.
Iterating global reduction 0 with 206 rules applied. Total rules applied 206 place count 646 transition count 3142
Discarding 207 places :
Symmetric choice reduction at 0 with 207 rule applications. Total rules 413 place count 439 transition count 855
Iterating global reduction 0 with 207 rules applied. Total rules applied 620 place count 439 transition count 855
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 2 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 0 with 14 rules applied. Total rules applied 634 place count 432 transition count 848
Applied a total of 634 rules in 179 ms. Remains 432 /749 variables (removed 317) and now considering 848/3245 (removed 2397) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 186 ms. Remains : 432/749 places, 848/3245 transitions.
RANDOM walk for 40000 steps (8 resets) in 465 ms. (85 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (8 resets) in 203 ms. (196 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (8 resets) in 240 ms. (165 steps per ms) remains 1/2 properties
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-11 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7275040604776345857.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13663909043121509188.kers'
[2026-05-22 15:53:18] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7275040604776345857.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13663909043121509188.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 848 rows 432 cols 3136 entries
Finished phase 1 with 134 SingleSign rule and 273 generalized
[2026-05-22 15:53:18] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-13663909043121509188.kers
Total runtime 6 ms.
[2026-05-22 15:53:18] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 370/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/420 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/432 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 848/1280 variables, 432/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1280 variables, 110/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1280 variables, 0/567 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1280/1280 variables, and 567 constraints, problems are : Problem set: 0 solved, 1 unsolved in 356 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 432/432 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 370/372 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/372 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 48/420 variables, 11/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/420 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/420 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 12/432 variables, 11/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/432 variables, 1/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/432 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 848/1280 variables, 432/458 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1280 variables, 110/568 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1280 variables, 1/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1280 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1280 variables, 0/569 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1280/1280 variables, and 569 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1227 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 432/432 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1612ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 18 ms.
Support contains 2 out of 432 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 432/432 places, 848/848 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 426 transition count 722
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 426 transition count 722
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 420 transition count 716
Applied a total of 24 rules in 80 ms. Remains 420 /432 variables (removed 12) and now considering 716/848 (removed 132) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 80 ms. Remains : 420/432 places, 716/848 transitions.
RANDOM walk for 40000 steps (8 resets) in 253 ms. (157 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (8 resets) in 104 ms. (380 steps per ms) remains 1/1 properties
SDD proceeding with computation,3 properties remain. new max is 8192
SDD size :5208 after 39331
Interrupted probabilistic random walk after 904680 steps, run timeout after 3001 ms. (steps per millisecond=301 ) properties seen :0 out of 1
Probabilistic random walk after 904680 steps, saw 681686 distinct states, run finished after 3012 ms. (steps per millisecond=300 ) 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-5276589190821356686.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13101890329253978199.kers'
[2026-05-22 15:53:23] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-5276589190821356686.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13101890329253978199.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 716 rows 420 cols 2620 entries
Finished phase 1 with 122 SingleSign rule and 273 generalized
[2026-05-22 15:53:23] [INFO ] Computed 25 invariants in 4 ms
Computed 25 P flows in 7 ms.
Exported basis to /tmp/petrispot-output-13101890329253978199.kers
Total runtime 9 ms.
[2026-05-22 15:53:23] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 364/401 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/420 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 716/1136 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1136 variables, 110/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/1136 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1136 variables, 0/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1136/1136 variables, and 555 constraints, problems are : Problem set: 0 solved, 1 unsolved in 525 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 420/420 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 35/37 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/37 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 364/401 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/401 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 19/420 variables, 10/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/420 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 716/1136 variables, 420/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1136 variables, 110/555 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1136 variables, 1/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1136 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1136 variables, 0/556 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1136/1136 variables, and 556 constraints, problems are : Problem set: 0 solved, 1 unsolved in 567 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 14/14 constraints, State Equation: 420/420 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1133ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 16 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 716/716 transitions.
Applied a total of 0 rules in 38 ms. Remains 420 /420 variables (removed 0) and now considering 716/716 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 420/420 places, 716/716 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 716/716 transitions.
Applied a total of 0 rules in 37 ms. Remains 420 /420 variables (removed 0) and now considering 716/716 (removed 0) transitions.
[2026-05-22 15:53:24] [INFO ] Invariant cache hit.
[2026-05-22 15:53:25] [INFO ] Implicit Places using invariants in 804 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 822 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 419/420 places, 716/716 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 121 transitions
Trivial Post-agglo rules discarded 121 transitions
Performed 121 trivial Post agglomeration. Transition count delta: 121
Iterating post reduction 0 with 121 rules applied. Total rules applied 121 place count 419 transition count 595
Reduce places removed 121 places and 0 transitions.
Iterating post reduction 1 with 121 rules applied. Total rules applied 242 place count 298 transition count 595
Applied a total of 242 rules in 30 ms. Remains 298 /419 variables (removed 121) and now considering 595/716 (removed 121) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14725512991440290044.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6423937736969007050.kers'
[2026-05-22 15:53:25] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14725512991440290044.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6423937736969007050.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 595 rows 298 cols 2136 entries
Finished phase 1 with 122 SingleSign rule and 152 generalized
[2026-05-22 15:53:25] [INFO ] Computed 24 invariants in 2 ms
Computed 24 P flows in 2 ms.
Exported basis to /tmp/petrispot-output-6423937736969007050.kers
Total runtime 3 ms.
[2026-05-22 15:53:25] [INFO ] Implicit Places using invariants in 365 ms returned []
[2026-05-22 15:53:25] [INFO ] Invariant cache hit.
[2026-05-22 15:53:25] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:53:26] [INFO ] Implicit Places using invariants and state equation in 1159 ms returned []
Implicit Place search using SMT with State Equation took 1531 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 298/420 places, 595/716 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2420 ms. Remains : 298/420 places, 595/716 transitions.
RANDOM walk for 40000 steps (8 resets) in 214 ms. (186 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (8 resets) in 73 ms. (540 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 1045138 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :0 out of 1
Probabilistic random walk after 1045138 steps, saw 762797 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
[2026-05-22 15:53:29] [INFO ] Invariant cache hit.
[2026-05-22 15:53:30] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 251/277 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/298 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 595/893 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/893 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (INCLUDED_ONLY) 0/893 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/893 variables, 0/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 893/893 variables, and 432 constraints, problems are : Problem set: 0 solved, 1 unsolved in 271 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 24/26 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/26 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 251/277 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/277 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (OVERLAPS) 21/298 variables, 11/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/298 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 595/893 variables, 298/322 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/893 variables, 110/432 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/893 variables, 1/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/893 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/893 variables, 0/433 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 893/893 variables, and 433 constraints, problems are : Problem set: 0 solved, 1 unsolved in 506 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 298/298 constraints, ReadFeed: 110/110 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 784ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 25 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 21 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 298/298 places, 595/595 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 595/595 transitions.
Applied a total of 0 rules in 20 ms. Remains 298 /298 variables (removed 0) and now considering 595/595 (removed 0) transitions.
[2026-05-22 15:53:30] [INFO ] Invariant cache hit.
[2026-05-22 15:53:31] [INFO ] Implicit Places using invariants in 435 ms returned []
[2026-05-22 15:53:31] [INFO ] Invariant cache hit.
[2026-05-22 15:53:31] [INFO ] State equation strengthened by 110 read => feed constraints.
[2026-05-22 15:53:32] [INFO ] Implicit Places using invariants and state equation in 1144 ms returned []
Implicit Place search using SMT with State Equation took 1581 ms to find 0 implicit places.
[2026-05-22 15:53:32] [INFO ] Redundant transitions in 22 ms returned []
Running 584 sub problems to find dead transitions.
[2026-05-22 15:53:32] [INFO ] Invariant cache hit.
[2026-05-22 15:53:32] [INFO ] State equation strengthened by 110 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
SDD proceeding with computation,3 properties remain. new max is 16384
SDD size :39331 after 311069
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (OVERLAPS) 1/298 variables, 3/24 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/298 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 298/893 variables, and 27 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30036 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 584/584 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 584 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/297 variables, 12/12 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/297 variables, 9/21 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/297 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/297 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 4 (OVERLAPS) 1/298 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 584 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/298 variables, 2/27 constraints. Problems are: Problem set: 0 solved, 584 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 298/893 variables, and 27 constraints, problems are : Problem set: 0 solved, 584 unsolved in 30061 ms.
Refiners :[Positive P Invariants (semi-flows): 12/12 constraints, Generalized P Invariants (flows): 12/12 constraints, State Equation: 0/298 constraints, ReadFeed: 0/110 constraints, PredecessorRefiner: 0/584 constraints, Known Traps: 3/3 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60372ms problems are : Problem set: 0 solved, 584 unsolved
Search for dead transitions found 0 dead transitions in 60388ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 62042 ms. Remains : 298/298 places, 595/595 transitions.
Attempting over-approximation, by ignoring read arcs.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 474
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 474
Applied a total of 242 rules in 18 ms. Remains 177 /298 variables (removed 121) and now considering 474/595 (removed 121) 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-2915506796179679509.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-14158704205681931999.kers'
[2026-05-22 15:54:32] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-2915506796179679509.kers, --Pflows, --basisKERS=/tmp/petrispot-output-14158704205681931999.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 474 rows 177 cols 1894 entries
Finished phase 1 with 1 SingleSign rule and 152 generalized
[2026-05-22 15:54:32] [INFO ] Computed 24 invariants in 4 ms
Computed 24 P flows in 18 ms.
Exported basis to /tmp/petrispot-output-14158704205681931999.kers
Total runtime 18 ms.
[2026-05-22 15:54:33] [INFO ] [Real]Absence check using 14 positive place invariants in 6 ms returned sat
[2026-05-22 15:54:33] [INFO ] [Real]Absence check using 14 positive and 10 generalized place invariants in 6 ms returned sat
[2026-05-22 15:54:33] [INFO ] After 240ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 15:54:33] [INFO ] [Nat]Absence check using 14 positive place invariants in 10 ms returned sat
[2026-05-22 15:54:33] [INFO ] [Nat]Absence check using 14 positive and 10 generalized place invariants in 18 ms returned sat
[2026-05-22 15:54:33] [INFO ] After 131ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 15:54:33] [INFO ] After 206ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 15:54:33] [INFO ] After 320ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-22 15:54:33] [INFO ] Flatten gal took : 16 ms
[2026-05-22 15:54:33] [INFO ] Flatten gal took : 14 ms
[2026-05-22 15:54:33] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2723366362475142228.gal : 5 ms
[2026-05-22 15:54:33] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6435578781141263941.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2723366362475142228.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6435578781141263941.prop' '--nowitness' '--gen-order' 'FOLLOW'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality6435578781141263941.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 14
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :14 after 25
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :25 after 48
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :48 after 84
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :84 after 162
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :162 after 334
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :334 after 614
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :614 after 1223
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1223 after 3803
SDD proceeding with computation,3 properties remain. new max is 32768
SDD size :311069 after 2.79348e+06
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :3803 after 54243
Detected timeout of ITS tools.
[2026-05-22 15:54:48] [INFO ] Flatten gal took : 22 ms
[2026-05-22 15:54:48] [INFO ] Applying decomposition
[2026-05-22 15:54:48] [INFO ] Flatten gal took : 13 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph12857234627897258572.txt' '-o' '/tmp/graph12857234627897258572.bin' '-w' '/tmp/graph12857234627897258572.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph12857234627897258572.bin' '-l' '-1' '-v' '-w' '/tmp/graph12857234627897258572.weights' '-q' '0' '-e' '0.001'
[2026-05-22 15:54:49] [INFO ] Decomposing Gal with order
[2026-05-22 15:54:49] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 15:54:49] [INFO ] Removed a total of 919 redundant transitions.
[2026-05-22 15:54:49] [INFO ] Flatten gal took : 116 ms
[2026-05-22 15:54:49] [INFO ] Fuse similar labels procedure discarded/fused a total of 24 labels/synchronizations in 26 ms.
[2026-05-22 15:54:49] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality16668174234094084506.gal : 10 ms
[2026-05-22 15:54:49] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality13769261670713208917.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality16668174234094084506.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality13769261670713208917.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality13769261670713208917.prop.
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 31479 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 15:55:04] [INFO ] Flatten gal took : 89 ms
[2026-05-22 15:55:04] [INFO ] Applying decomposition
[2026-05-22 15:55:04] [INFO ] Flatten gal took : 89 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph18414511882587941238.txt' '-o' '/tmp/graph18414511882587941238.bin' '-w' '/tmp/graph18414511882587941238.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph18414511882587941238.bin' '-l' '-1' '-v' '-w' '/tmp/graph18414511882587941238.weights' '-q' '0' '-e' '0.001'
[2026-05-22 15:55:05] [INFO ] Decomposing Gal with order
[2026-05-22 15:55:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 15:55:05] [INFO ] Removed a total of 5527 redundant transitions.
[2026-05-22 15:55:05] [INFO ] Flatten gal took : 332 ms
[2026-05-22 15:55:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 623 labels/synchronizations in 131 ms.
[2026-05-22 15:55:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality1147878094430475361.gal : 24 ms
[2026-05-22 15:55:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5999122640575652714.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality1147878094430475361.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5999122640575652714.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...307
Loading property file /tmp/ReachabilityCardinality5999122640575652714.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 4
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :4 after 5
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :7 after 9
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :9 after 11
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :11 after 19
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :19 after 44
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :44 after 50
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :50 after 195
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :195 after 480
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :480 after 3031
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :3031 after 2.60887e+06
SDD proceeding with computation,1 properties remain. new max is 16384
SDD size :2.60887e+06 after 7.99588e+06
SDD proceeding with computation,1 properties remain. new max is 32768
SDD size :7.99588e+06 after 4.38138e+07
SDD proceeding with computation,1 properties remain. new max is 65536
SDD size :4.38138e+07 after 2.47346e+09
Detected timeout of ITS tools.
[2026-05-22 16:25:07] [INFO ] Flatten gal took : 91 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin3062871812438384375
[2026-05-22 16:25:07] [INFO ] Applying decomposition
[2026-05-22 16:25:07] [INFO ] Flatten gal took : 13 ms
[2026-05-22 16:25:07] [INFO ] Computing symmetric may disable matrix : 595 transitions.
[2026-05-22 16:25:07] [INFO ] Computation of Complete disable matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 16:25:07] [INFO ] Computing symmetric may enable matrix : 595 transitions.
[2026-05-22 16:25:07] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/convert-linux64' '-i' '/tmp/graph5123182588502355215.txt' '-o' '/tmp/graph5123182588502355215.bin' '-w' '/tmp/graph5123182588502355215.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5123182588502355215.bin' '-l' '-1' '-v' '-w' '/tmp/graph5123182588502355215.weights' '-q' '0' '-e' '0.001'
[2026-05-22 16:25:07] [INFO ] Computing Do-Not-Accords matrix : 595 transitions.
[2026-05-22 16:25:07] [INFO ] Decomposing Gal with order
[2026-05-22 16:25:08] [INFO ] Computation of Completed DNA matrix. took 17 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 16:25:08] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 16:25:08] [INFO ] Removed a total of 1076 redundant transitions.
[2026-05-22 16:25:08] [INFO ] Flatten gal took : 54 ms
[2026-05-22 16:25:08] [INFO ] Built C files in 385ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3062871812438384375
[2026-05-22 16:25:08] [INFO ] Fuse similar labels procedure discarded/fused a total of 64 labels/synchronizations in 26 ms.
[2026-05-22 16:25:08] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality6870326497531794470.gal : 7 ms
[2026-05-22 16:25:08] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality15570955110910474204.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality6870326497531794470.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality15570955110910474204.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Running compilation step : cd /tmp/ltsmin3062871812438384375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Loading property file /tmp/ReachabilityCardinality15570955110910474204.prop.
Compilation finished in 1762 ms.
Running link step : cd /tmp/ltsmin3062871812438384375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 90 ms.
Running LTSmin : cd /tmp/ltsmin3062871812438384375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/pins2lts-seq-linux64' './gal.so' '-p' '--pins-guards' '--when' '-i' 'AndersonPT11ReachabilityCardinality202408==true'
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,4.80745e+09,454.438,3365380,316997,238,6.21554e+06,1333,1331,3.86528e+06,122,5794,0
Total reachable state count : 4807446025

Verifying 1 reachability properties.
Reachability property Anderson-PT-11-ReachabilityCardinality-2024-08 is true.
FORMULA Anderson-PT-11-ReachabilityCardinality-2024-08 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
Anderson-PT-11-ReachabilityCardinality-2024-08,96,454.878,3365380,183,61,6.21554e+06,1333,1332,3.86528e+06,125,5794,51
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 2374883 ms.

BK_STOP 1779467563805

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is Anderson-PT-11, examination is ReachabilityCardinality"
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-177944366000206"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/Anderson-PT-11.tgz
mv Anderson-PT-11 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "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 [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "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 "ReachabilityCardinality.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 '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
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 ;