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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.2M
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 56K Mar 5 14:01 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Mar 3 18:30 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Mar 3 18:30 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 15 07:08 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Mar 15 07:08 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Mar 15 07:08 LTLFireability.xml
-rw-r--r-- 1 mcc users 16K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 177K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 13K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 113K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:08 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:08 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 669K Mar 3 18:30 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1779475141971

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ASLink-PT-04b
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 18:39:03] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-05-22 18:39:03] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 18:39:03] [INFO ] Load time of PNML (sax parser for PT used): 170 ms
[2026-05-22 18:39:03] [INFO ] Transformed 2034 places.
[2026-05-22 18:39:03] [INFO ] Transformed 2567 transitions.
[2026-05-22 18:39:03] [INFO ] Found NUPN structural information;
[2026-05-22 18:39:03] [INFO ] Parsed PT model containing 2034 places and 2567 transitions and 7875 arcs in 295 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 29 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (90 resets) in 2100 ms. (19 steps per ms) remains 9/16 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-07 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-03 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (13 resets) in 664 ms. (60 steps per ms) remains 9/9 properties
[2026-05-22 18:39:04] [INFO ] Flatten gal took : 425 ms
BEST_FIRST walk for 40003 steps (12 resets) in 391 ms. (102 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (14 resets) in 253 ms. (157 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (13 resets) in 260 ms. (153 steps per ms) remains 9/9 properties
[2026-05-22 18:39:04] [INFO ] Flatten gal took : 245 ms
[2026-05-22 18:39:05] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality7453807179008916685.gal : 104 ms
BEST_FIRST walk for 40004 steps (14 resets) in 649 ms. (61 steps per ms) remains 9/9 properties
[2026-05-22 18:39:05] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality10186202227828325554.prop : 2 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/ReachabilityCardinality7453807179008916685.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality10186202227828325554.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (11 resets) in 185 ms. (215 steps per ms) remains 9/9 properties

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 ...329
BEST_FIRST walk for 40002 steps (11 resets) in 249 ms. (160 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (14 resets) in 393 ms. (101 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (13 resets) in 113 ms. (350 steps per ms) remains 9/9 properties
Loading property file /tmp/ReachabilityCardinality10186202227828325554.prop.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-7773089741721452315.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-13670971255193812643.kers'
[2026-05-22 18:39:05] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7773089741721452315.kers, --Pflows, --basisKERS=/tmp/petrispot-output-13670971255193812643.kers]
Culled 0 columns in 1 ms.
// Phase 1: matrix 2567 rows 2034 cols 7875 entries
Finished phase 1 with 1365 SingleSign rule and 470 generalized
[2026-05-22 18:39:05] [INFO ] Computed 199 invariants in 15 ms
Computed 199 P flows in 16 ms.
Exported basis to /tmp/petrispot-output-13670971255193812643.kers
Total runtime 18 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/274 variables, 274/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/274 variables, 0/274 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 708/982 variables, 38/312 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/982 variables, 708/1020 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/982 variables, 0/1020 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 23/1005 variables, 4/1024 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1005 variables, 23/1047 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1005 variables, 0/1047 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 8 (OVERLAPS) 1007/2012 variables, 147/1194 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,9 properties remain. new max is 8
SDD size :5 after 10
SDD proceeding with computation,9 properties remain. new max is 16
SDD size :10 after 16
SDD proceeding with computation,9 properties remain. new max is 32
SDD size :16 after 49
SDD proceeding with computation,9 properties remain. new max is 64
SDD size :49 after 196
SDD proceeding with computation,9 properties remain. new max is 128
SDD size :196 after 416
SDD proceeding with computation,9 properties remain. new max is 256
SDD size :416 after 569
SDD proceeding with computation,9 properties remain. new max is 512
SDD size :569 after 15361
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :15361 after 618139
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :618139 after 5.45975e+08
SDD proceeding with computation,9 properties remain. new max is 4096
SDD size :5.45975e+08 after 3.89853e+11
At refinement iteration 9 (INCLUDED_ONLY) 0/2012 variables, 1007/2201 constraints. Problems are: Problem set: 1 solved, 8 unsolved
SDD proceeding with computation,9 properties remain. new max is 8192
SDD size :3.89853e+11 after 3.51941e+17
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2012/4601 variables, and 2201 constraints, problems are : Problem set: 1 solved, 8 unsolved in 5050 ms.
Refiners :[Domain max(s): 2012/2034 constraints, Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 147/157 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 9/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 8 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/210 variables, 210/210 constraints. Problems are: Problem set: 1 solved, 8 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/210 variables, 0/210 constraints. Problems are: Problem set: 1 solved, 8 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-04 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-04 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 724/934 variables, 35/245 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/934 variables, 724/969 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 16384
SDD size :3.51941e+17 after 5.54986e+23
At refinement iteration 4 (INCLUDED_ONLY) 0/934 variables, 5/974 constraints. Problems are: Problem set: 2 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 32768
SDD size :5.54986e+23 after 5.70061e+25
At refinement iteration 5 (INCLUDED_ONLY) 0/934 variables, 0/974 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 37/971 variables, 7/981 constraints. Problems are: Problem set: 2 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/971 variables, 37/1018 constraints. Problems are: Problem set: 2 solved, 7 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 971/4601 variables, and 1018 constraints, problems are : Problem set: 2 solved, 7 unsolved in 5023 ms.
Refiners :[Domain max(s): 971/2034 constraints, Positive P Invariants (semi-flows): 42/42 constraints, Generalized P Invariants (flows): 0/157 constraints, State Equation: 0/2034 constraints, PredecessorRefiner: 5/3 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 10272ms problems are : Problem set: 2 solved, 7 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 197 out of 2034 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2034/2034 places, 2567/2567 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 348 transitions
Trivial Post-agglo rules discarded 348 transitions
Performed 348 trivial Post agglomeration. Transition count delta: 348
Iterating post reduction 0 with 348 rules applied. Total rules applied 348 place count 2034 transition count 2219
Reduce places removed 348 places and 0 transitions.
Ensure Unique test removed 7 transitions
Reduce isomorphic transitions removed 7 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 357 rules applied. Total rules applied 705 place count 1686 transition count 2210
Reduce places removed 2 places and 0 transitions.
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Iterating post reduction 2 with 41 rules applied. Total rules applied 746 place count 1684 transition count 2171
Reduce places removed 39 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 3 with 46 rules applied. Total rules applied 792 place count 1645 transition count 2164
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 793 place count 1644 transition count 2164
Performed 410 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 410 Pre rules applied. Total rules applied 793 place count 1644 transition count 1754
Deduced a syphon composed of 410 places in 3 ms
Ensure Unique test removed 26 places
Reduce places removed 436 places and 0 transitions.
Iterating global reduction 5 with 846 rules applied. Total rules applied 1639 place count 1208 transition count 1754
Discarding 7 places :
Implicit places reduction removed 7 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 18 transitions
Trivial Post-agglo rules discarded 18 transitions
Performed 18 trivial Post agglomeration. Transition count delta: 18
Iterating post reduction 5 with 25 rules applied. Total rules applied 1664 place count 1201 transition count 1736
Reduce places removed 18 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 6 with 19 rules applied. Total rules applied 1683 place count 1183 transition count 1735
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 1684 place count 1182 transition count 1735
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 9 Pre rules applied. Total rules applied 1684 place count 1182 transition count 1726
Deduced a syphon composed of 9 places in 3 ms
Ensure Unique test removed 7 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 8 with 25 rules applied. Total rules applied 1709 place count 1166 transition count 1726
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 7 Pre rules applied. Total rules applied 1709 place count 1166 transition count 1719
Deduced a syphon composed of 7 places in 8 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 8 with 14 rules applied. Total rules applied 1723 place count 1159 transition count 1719
Discarding 57 places :
Symmetric choice reduction at 8 with 57 rule applications. Total rules 1780 place count 1102 transition count 1662
Iterating global reduction 8 with 57 rules applied. Total rules applied 1837 place count 1102 transition count 1662
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 1838 place count 1102 transition count 1661
Performed 15 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 15 Pre rules applied. Total rules applied 1838 place count 1102 transition count 1646
Deduced a syphon composed of 15 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 9 with 31 rules applied. Total rules applied 1869 place count 1086 transition count 1646
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1869 place count 1086 transition count 1645
Deduced a syphon composed of 1 places in 8 ms
Ensure Unique test removed 1 places
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 3 rules applied. Total rules applied 1872 place count 1084 transition count 1645
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 1873 place count 1083 transition count 1639
Iterating global reduction 9 with 1 rules applied. Total rules applied 1874 place count 1083 transition count 1639
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 1 Pre rules applied. Total rules applied 1874 place count 1083 transition count 1638
Deduced a syphon composed of 1 places in 27 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 1876 place count 1082 transition count 1638
Performed 106 Post agglomeration using F-continuation condition.Transition count delta: 106
Deduced a syphon composed of 106 places in 14 ms
Ensure Unique test removed 3 places
Reduce places removed 109 places and 0 transitions.
Iterating global reduction 9 with 215 rules applied. Total rules applied 2091 place count 973 transition count 1532
Discarding 1 places :
Symmetric choice reduction at 9 with 1 rule applications. Total rules 2092 place count 972 transition count 1531
Iterating global reduction 9 with 1 rules applied. Total rules applied 2093 place count 972 transition count 1531
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 1 places in 6 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2095 place count 971 transition count 1540
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 9 with 2 rules applied. Total rules applied 2097 place count 971 transition count 1538
Discarding 1 places :
Implicit places reduction removed 1 places
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 9 with 2 rules applied. Total rules applied 2099 place count 970 transition count 1537
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 10 with 1 rules applied. Total rules applied 2100 place count 969 transition count 1537
Free-agglomeration rule applied 6 times.
Iterating global reduction 11 with 6 rules applied. Total rules applied 2106 place count 969 transition count 1531
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 2112 place count 963 transition count 1531
Free-agglomeration rule (complex) applied 4 times.
Iterating global reduction 12 with 4 rules applied. Total rules applied 2116 place count 963 transition count 1527
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 12 with 4 rules applied. Total rules applied 2120 place count 959 transition count 1527
Partial Free-agglomeration rule applied 2 times.
Drop transitions (Partial Free agglomeration) removed 2 transitions
Iterating global reduction 13 with 2 rules applied. Total rules applied 2122 place count 959 transition count 1527
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 13 with 1 rules applied. Total rules applied 2123 place count 958 transition count 1526
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 13 with 1 rules applied. Total rules applied 2124 place count 957 transition count 1526
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 2 Pre rules applied. Total rules applied 2124 place count 957 transition count 1524
Deduced a syphon composed of 2 places in 6 ms
Ensure Unique test removed 1 places
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 14 with 5 rules applied. Total rules applied 2129 place count 954 transition count 1524
Discarding 2 places :
Implicit places reduction removed 2 places
Iterating post reduction 14 with 2 rules applied. Total rules applied 2131 place count 952 transition count 1524
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 2131 place count 952 transition count 1523
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 2133 place count 951 transition count 1523
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 4 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 15 with 6 rules applied. Total rules applied 2139 place count 948 transition count 1520
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2140 place count 947 transition count 1519
Iterating global reduction 15 with 1 rules applied. Total rules applied 2141 place count 947 transition count 1519
Discarding 1 places :
Symmetric choice reduction at 15 with 1 rule applications. Total rules 2142 place count 946 transition count 1518
Iterating global reduction 15 with 1 rules applied. Total rules applied 2143 place count 946 transition count 1518
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 15 with 1 rules applied. Total rules applied 2144 place count 946 transition count 1517
Applied a total of 2144 rules in 1181 ms. Remains 946 /2034 variables (removed 1088) and now considering 1517/2567 (removed 1050) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1191 ms. Remains : 946/2034 places, 1517/2567 transitions.
RANDOM walk for 40000 steps (234 resets) in 501 ms. (79 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (48 resets) in 332 ms. (120 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (43 resets) in 319 ms. (125 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (49 resets) in 231 ms. (172 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (48 resets) in 444 ms. (89 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (47 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (42 resets) in 212 ms. (187 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (43 resets) in 116 ms. (341 steps per ms) remains 7/7 properties
Interrupted probabilistic random walk after 149353 steps, run timeout after 3001 ms. (steps per millisecond=49 ) properties seen :0 out of 7
Probabilistic random walk after 149353 steps, saw 48421 distinct states, run finished after 3021 ms. (steps per millisecond=49 ) 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-3795359426733739451.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-1942851470592278969.kers'
[2026-05-22 18:39:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3795359426733739451.kers, --Pflows, --basisKERS=/tmp/petrispot-output-1942851470592278969.kers]
Culling duplicate invariants (modulo rational): removing 3 columns.
Culled 3 columns in 1 ms.
// Phase 1: matrix 1517 rows 943 cols 5664 entries
Finished phase 1 with 328 SingleSign rule and 469 generalized
[2026-05-22 18:39:20] [INFO ] Computed 149 invariants in 10 ms
Computed 149 P flows in 10 ms.
Exported basis to /tmp/petrispot-output-1942851470592278969.kers
Total runtime 12 ms.
[2026-05-22 18:39:20] [INFO ] State equation strengthened by 14 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 335/532 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 0/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 16/548 variables, 6/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/548 variables, 0/42 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 381/929 variables, 95/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/929 variables, 0/137 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 1/930 variables, 1/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/930 variables, 0/138 constraints. Problems are: Problem set: 0 solved, 7 unsolved
SDD proceeding with computation,9 properties remain. new max is 65536
SDD size :5.70061e+25 after 6.37066e+25
At refinement iteration 9 (OVERLAPS) 16/946 variables, 11/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/946 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 1517/2463 variables, 946/1095 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/2463 variables, 14/1109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/2463 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/2463 variables, 0/1109 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2463/2463 variables, and 1109 constraints, problems are : Problem set: 0 solved, 7 unsolved in 6281 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 946/946 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 7/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/197 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 335/532 variables, 36/36 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/532 variables, 1/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/532 variables, 0/37 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (OVERLAPS) 16/548 variables, 6/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/548 variables, 0/43 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-01 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 6 (OVERLAPS) 381/929 variables, 95/138 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/929 variables, 9/147 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/929 variables, 1/148 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/929 variables, 0/148 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 10 (OVERLAPS) 1/930 variables, 1/149 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/930 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 12 (OVERLAPS) 16/946 variables, 11/160 constraints. Problems are: Problem set: 1 solved, 6 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/946 variables, 0/160 constraints. Problems are: Problem set: 1 solved, 6 unsolved
Problem ASLink-PT-04b-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-00 TRUE TECHNIQUES SMT_REFINEMENT
SDD proceeding with computation,9 properties remain. new max is 131072
SDD size :6.37066e+25 after 7.19464e+25
Problem ASLink-PT-04b-ReachabilityFireability-2024-08 is UNSAT
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-08 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 14 (OVERLAPS) 1517/2463 variables, 946/1106 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2463 variables, 14/1120 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2463 variables, 2/1122 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2463 variables, 0/1122 constraints. Problems are: Problem set: 3 solved, 4 unsolved
At refinement iteration 18 (OVERLAPS) 0/2463 variables, 0/1122 constraints. Problems are: Problem set: 3 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2463/2463 variables, and 1122 constraints, problems are : Problem set: 3 solved, 4 unsolved in 14672 ms.
Refiners :[Positive P Invariants (semi-flows): 43/43 constraints, Generalized P Invariants (flows): 106/106 constraints, State Equation: 946/946 constraints, ReadFeed: 14/14 constraints, PredecessorRefiner: 6/3 constraints, Known Traps: 11/11 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 21002ms problems are : Problem set: 3 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 17898 ms.
Support contains 129 out of 946 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 946/946 places, 1517/1517 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 9 transitions
Trivial Post-agglo rules discarded 9 transitions
Performed 9 trivial Post agglomeration. Transition count delta: 9
Iterating post reduction 0 with 9 rules applied. Total rules applied 9 place count 946 transition count 1508
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Discarding 1 places :
Implicit places reduction removed 1 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 13 rules applied. Total rules applied 22 place count 936 transition count 1505
Reduce places removed 2 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 2 with 4 rules applied. Total rules applied 26 place count 934 transition count 1503
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 28 place count 932 transition count 1503
Performed 33 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 33 Pre rules applied. Total rules applied 28 place count 932 transition count 1470
Deduced a syphon composed of 33 places in 5 ms
Ensure Unique test removed 4 places
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 70 rules applied. Total rules applied 98 place count 895 transition count 1470
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 4 with 2 rules applied. Total rules applied 100 place count 895 transition count 1468
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 102 place count 893 transition count 1468
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: 14
Deduced a syphon composed of 14 places in 3 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 6 with 28 rules applied. Total rules applied 130 place count 879 transition count 1454
Free-agglomeration rule applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 131 place count 879 transition count 1453
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 132 place count 878 transition count 1453
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 134 place count 876 transition count 1451
Reduce places removed 3 places and 0 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 4 rules applied. Total rules applied 138 place count 873 transition count 1450
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 139 place count 872 transition count 1450
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 9 with 4 Pre rules applied. Total rules applied 139 place count 872 transition count 1446
Deduced a syphon composed of 4 places in 2 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 9 with 8 rules applied. Total rules applied 147 place count 868 transition count 1446
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 3 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 9 with 4 rules applied. Total rules applied 151 place count 866 transition count 1444
Applied a total of 151 rules in 192 ms. Remains 866 /946 variables (removed 80) and now considering 1444/1517 (removed 73) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 193 ms. Remains : 866/946 places, 1444/1517 transitions.
RANDOM walk for 40000 steps (283 resets) in 214 ms. (186 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (70 resets) in 101 ms. (392 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (68 resets) in 335 ms. (119 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (54 resets) in 166 ms. (239 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (72 resets) in 93 ms. (425 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 280840 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :0 out of 4
Probabilistic random walk after 280840 steps, saw 59645 distinct states, run finished after 3004 ms. (steps per millisecond=93 ) 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-15299476548970746131.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-209590106949978681.kers'
[2026-05-22 18:40:02] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15299476548970746131.kers, --Pflows, --basisKERS=/tmp/petrispot-output-209590106949978681.kers]
Culling duplicate invariants (modulo rational): removing 5 columns.
Culled 5 columns in 1 ms.
// Phase 1: matrix 1444 rows 861 cols 5485 entries
Finished phase 1 with 238 SingleSign rule and 487 generalized
[2026-05-22 18:40:02] [INFO ] Computed 141 invariants in 11 ms
Computed 141 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-209590106949978681.kers
Total runtime 12 ms.
[2026-05-22 18:40:03] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 294/423 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/460 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 381/841 variables, 87/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 0/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 4/845 variables, 4/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/845 variables, 0/126 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 1/846 variables, 1/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/846 variables, 0/127 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 20/866 variables, 14/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/866 variables, 0/141 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1444/2310 variables, 866/1007 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/2310 variables, 7/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/2310 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/2310 variables, 0/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 2310/2310 variables, and 1014 constraints, problems are : Problem set: 0 solved, 4 unsolved in 2671 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 866/866 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/129 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 294/423 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD proceeding with computation,9 properties remain. new max is 262144
At refinement iteration 2 (INCLUDED_ONLY) 0/423 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 37/460 variables, 8/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
SDD size :7.19464e+25 after 1.05181e+26
At refinement iteration 4 (INCLUDED_ONLY) 0/460 variables, 0/35 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (OVERLAPS) 381/841 variables, 87/122 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/841 variables, 6/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/841 variables, 0/128 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (OVERLAPS) 4/845 variables, 4/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/845 variables, 0/132 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 1/846 variables, 1/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/846 variables, 0/133 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 20/866 variables, 14/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/866 variables, 1/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/866 variables, 0/148 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1444/2310 variables, 866/1014 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/2310 variables, 7/1021 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/2310 variables, 2/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/2310 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/2310 variables, 0/1023 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 2310/2310 variables, and 1023 constraints, problems are : Problem set: 0 solved, 4 unsolved in 8605 ms.
Refiners :[Positive P Invariants (semi-flows): 40/40 constraints, Generalized P Invariants (flows): 101/101 constraints, State Equation: 866/866 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 4/2 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11333ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6219 ms.
Support contains 129 out of 866 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 866/866 places, 1444/1444 transitions.
Applied a total of 0 rules in 29 ms. Remains 866 /866 variables (removed 0) and now considering 1444/1444 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 866/866 places, 1444/1444 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 866/866 places, 1444/1444 transitions.
Applied a total of 0 rules in 26 ms. Remains 866 /866 variables (removed 0) and now considering 1444/1444 (removed 0) transitions.
[2026-05-22 18:40:20] [INFO ] Invariant cache hit.
[2026-05-22 18:40:21] [INFO ] Implicit Places using invariants in 752 ms returned [1, 20, 21, 22, 62, 80, 101, 147, 150, 176, 187, 188, 189, 213, 233, 284, 285, 326, 329, 330, 342, 364, 409, 513, 516, 543, 561, 629, 640, 647, 651, 652, 655, 669, 718, 741, 742, 743, 744, 761, 767, 773, 779, 785, 792, 798, 804, 816, 822]
[2026-05-22 18:40:21] [INFO ] Actually due to overlaps returned [62, 213, 543, 188, 364, 516, 741, 20, 189, 669, 718, 742, 1, 342, 651, 652, 187, 233, 409, 513, 561, 743, 792, 822, 21, 22, 80, 101, 147, 176, 284, 326, 330, 640, 647, 655, 744, 761, 767, 773, 779, 785, 798, 804, 816]
Discarding 45 places :
Implicit Place search using SMT only with invariants took 768 ms to find 45 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 821/866 places, 1444/1444 transitions.
Discarding 2 places :
Implicit places reduction removed 2 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 23 transitions
Trivial Post-agglo rules discarded 23 transitions
Performed 23 trivial Post agglomeration. Transition count delta: 23
Iterating post reduction 0 with 25 rules applied. Total rules applied 25 place count 819 transition count 1421
Reduce places removed 23 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 1 with 33 rules applied. Total rules applied 58 place count 796 transition count 1411
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 2 with 10 rules applied. Total rules applied 68 place count 786 transition count 1411
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 12 Pre rules applied. Total rules applied 68 place count 786 transition count 1399
Deduced a syphon composed of 12 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 3 with 25 rules applied. Total rules applied 93 place count 773 transition count 1399
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 106 place count 760 transition count 1386
Iterating global reduction 3 with 13 rules applied. Total rules applied 119 place count 760 transition count 1386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 119 place count 760 transition count 1385
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 121 place count 759 transition count 1385
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 131 place count 749 transition count 1375
Iterating global reduction 3 with 10 rules applied. Total rules applied 141 place count 749 transition count 1375
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 145 place count 745 transition count 1368
Iterating global reduction 3 with 4 rules applied. Total rules applied 149 place count 745 transition count 1368
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 150 place count 745 transition count 1367
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 151 place count 744 transition count 1366
Iterating global reduction 4 with 1 rules applied. Total rules applied 152 place count 744 transition count 1366
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 153 place count 743 transition count 1365
Iterating global reduction 4 with 1 rules applied. Total rules applied 154 place count 743 transition count 1365
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 155 place count 742 transition count 1363
Iterating global reduction 4 with 1 rules applied. Total rules applied 156 place count 742 transition count 1363
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 1 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 4 with 68 rules applied. Total rules applied 224 place count 708 transition count 1329
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 225 place count 707 transition count 1327
Iterating global reduction 4 with 1 rules applied. Total rules applied 226 place count 707 transition count 1327
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 228 place count 707 transition count 1325
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 230 place count 705 transition count 1325
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 5 with 11 rules applied. Total rules applied 241 place count 705 transition count 1314
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 5 with 11 rules applied. Total rules applied 252 place count 694 transition count 1314
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 253 place count 694 transition count 1313
Partial Free-agglomeration rule applied 6 times.
Drop transitions (Partial Free agglomeration) removed 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 259 place count 694 transition count 1313
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 260 place count 694 transition count 1313
Applied a total of 260 rules in 270 ms. Remains 694 /821 variables (removed 127) and now considering 1313/1444 (removed 131) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-17467150842046765762.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-11392322279659837393.kers'
[2026-05-22 18:40:21] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-17467150842046765762.kers, --Pflows, --basisKERS=/tmp/petrispot-output-11392322279659837393.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1313 rows 694 cols 5056 entries
Finished phase 1 with 260 SingleSign rule and 341 generalized
[2026-05-22 18:40:21] [INFO ] Computed 93 invariants in 12 ms
Computed 93 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-11392322279659837393.kers
Total runtime 14 ms.
[2026-05-22 18:40:22] [INFO ] Implicit Places using invariants in 479 ms returned [108, 122, 145, 146, 237, 270, 275, 412, 418, 428, 429, 497, 665, 669, 673, 690]
Discarding 16 places :
Implicit Place search using SMT only with invariants took 495 ms to find 16 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 678/866 places, 1313/1444 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 678 transition count 1312
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 677 transition count 1312
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 8 place count 671 transition count 1306
Iterating global reduction 2 with 6 rules applied. Total rules applied 14 place count 671 transition count 1306
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 668 transition count 1300
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 668 transition count 1300
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 22 place count 666 transition count 1298
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 666 transition count 1298
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 26 place count 666 transition count 1296
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 3 with 2 rules applied. Total rules applied 28 place count 665 transition count 1295
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 665 transition count 1294
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 30 place count 665 transition count 1293
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 31 place count 664 transition count 1293
Applied a total of 31 rules in 103 ms. Remains 664 /678 variables (removed 14) and now considering 1293/1313 (removed 20) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10756535526977041077.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2077956769047156903.kers'
[2026-05-22 18:40:22] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10756535526977041077.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2077956769047156903.kers]
Culled 0 columns in 0 ms.
// Phase 1: matrix 1293 rows 664 cols 4917 entries
Finished phase 1 with 261 SingleSign rule and 326 generalized
[2026-05-22 18:40:22] [INFO ] Computed 77 invariants in 8 ms
Computed 77 P flows in 11 ms.
Exported basis to /tmp/petrispot-output-2077956769047156903.kers
Total runtime 12 ms.
[2026-05-22 18:40:22] [INFO ] Implicit Places using invariants in 339 ms returned []
[2026-05-22 18:40:22] [INFO ] Invariant cache hit.
[2026-05-22 18:40:23] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 18:40:24] [INFO ] Implicit Places using invariants and state equation in 1834 ms returned []
Implicit Place search using SMT with State Equation took 2177 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 664/866 places, 1293/1444 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3840 ms. Remains : 664/866 places, 1293/1444 transitions.
RANDOM walk for 40000 steps (303 resets) in 262 ms. (152 steps per ms) remains 3/4 properties
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-02 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40003 steps (72 resets) in 254 ms. (156 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (60 resets) in 134 ms. (296 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (73 resets) in 92 ms. (430 steps per ms) remains 3/3 properties
[2026-05-22 18:40:24] [INFO ] Invariant cache hit.
[2026-05-22 18:40:24] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 268/396 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/407 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 257/664 variables, 52/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1293/1957 variables, 664/741 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1957 variables, 7/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1957 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1957 variables, 0/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1957/1957 variables, and 748 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1647 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 664/664 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 268/396 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/407 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/407 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 257/664 variables, 52/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/664 variables, 6/83 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/664 variables, 1/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/664 variables, 0/84 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1293/1957 variables, 664/748 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1957 variables, 7/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1957 variables, 1/756 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1957 variables, 1/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1957 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1957 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1957/1957 variables, and 757 constraints, problems are : Problem set: 0 solved, 3 unsolved in 6652 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 52/52 constraints, State Equation: 664/664 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 8/8 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8319ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 1017 ms.
Support contains 128 out of 664 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 664/664 places, 1293/1293 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 664 transition count 1292
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 663 transition count 1292
Applied a total of 2 rules in 23 ms. Remains 663 /664 variables (removed 1) and now considering 1292/1293 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 663/664 places, 1292/1293 transitions.
RANDOM walk for 40000 steps (325 resets) in 246 ms. (161 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (75 resets) in 359 ms. (111 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (63 resets) in 167 ms. (238 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (76 resets) in 72 ms. (547 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 211142 steps, run timeout after 3001 ms. (steps per millisecond=70 ) properties seen :0 out of 3
Probabilistic random walk after 211142 steps, saw 94858 distinct states, run finished after 3001 ms. (steps per millisecond=70 ) 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-424971696397488107.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-15490550158095337602.kers'
[2026-05-22 18:40:37] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-424971696397488107.kers, --Pflows, --basisKERS=/tmp/petrispot-output-15490550158095337602.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1292 rows 662 cols 4911 entries
Finished phase 1 with 262 SingleSign rule and 324 generalized
[2026-05-22 18:40:37] [INFO ] Computed 77 invariants in 9 ms
Computed 77 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-15490550158095337602.kers
Total runtime 10 ms.
[2026-05-22 18:40:37] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 268/396 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/408 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 255/663 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/663 variables, 0/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1292/1955 variables, 663/740 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1955 variables, 7/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1955 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1955 variables, 0/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1955/1955 variables, and 747 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1352 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 663/663 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 268/396 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/396 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 12/408 variables, 3/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/408 variables, 1/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/408 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 255/663 variables, 51/78 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/663 variables, 2/80 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/663 variables, 1/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/663 variables, 0/81 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 1292/1955 variables, 663/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1955 variables, 7/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1955 variables, 1/752 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1955 variables, 1/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1955 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/1955 variables, 0/753 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1955/1955 variables, and 753 constraints, problems are : Problem set: 0 solved, 3 unsolved in 5398 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 663/663 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 5/5 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 6783ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2377 ms.
Support contains 128 out of 663 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 1292/1292 transitions.
Applied a total of 0 rules in 17 ms. Remains 663 /663 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 663/663 places, 1292/1292 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 663/663 places, 1292/1292 transitions.
Applied a total of 0 rules in 15 ms. Remains 663 /663 variables (removed 0) and now considering 1292/1292 (removed 0) transitions.
[2026-05-22 18:40:46] [INFO ] Invariant cache hit.
[2026-05-22 18:40:47] [INFO ] Implicit Places using invariants in 583 ms returned [282]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 584 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 662/663 places, 1292/1292 transitions.
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 2 place count 661 transition count 1291
Applied a total of 2 rules in 23 ms. Remains 661 /662 variables (removed 1) and now considering 1291/1292 (removed 1) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-16039049861770056281.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7749510914407260073.kers'
[2026-05-22 18:40:47] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-16039049861770056281.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7749510914407260073.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1291 rows 660 cols 4905 entries
Finished phase 1 with 261 SingleSign rule and 324 generalized
[2026-05-22 18:40:47] [INFO ] Computed 76 invariants in 8 ms
Computed 76 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-7749510914407260073.kers
Total runtime 10 ms.
[2026-05-22 18:40:47] [INFO ] Implicit Places using invariants in 374 ms returned []
[2026-05-22 18:40:47] [INFO ] Invariant cache hit.
[2026-05-22 18:40:47] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 18:40:48] [INFO ] Implicit Places using invariants and state equation in 1379 ms returned []
Implicit Place search using SMT with State Equation took 1760 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 661/663 places, 1291/1292 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 2383 ms. Remains : 661/663 places, 1291/1292 transitions.
RANDOM walk for 40000 steps (320 resets) in 220 ms. (180 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (78 resets) in 256 ms. (155 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (65 resets) in 135 ms. (294 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40003 steps (75 resets) in 53 ms. (740 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 287322 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :0 out of 3
Probabilistic random walk after 287322 steps, saw 145590 distinct states, run finished after 3002 ms. (steps per millisecond=95 ) properties seen :0
[2026-05-22 18:40:52] [INFO ] Invariant cache hit.
[2026-05-22 18:40:52] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 267/395 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/406 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 255/661 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1291/1952 variables, 661/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1952 variables, 7/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1952 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1952 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1952/1952 variables, and 744 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1287 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 661/661 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 267/395 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/406 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 255/661 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 9/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1291/1952 variables, 661/747 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1952 variables, 7/754 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1952 variables, 1/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1952 variables, 2/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1952 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1952 variables, 0/757 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1952/1952 variables, and 757 constraints, problems are : Problem set: 0 solved, 3 unsolved in 7257 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 661/661 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 12/12 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 8575ms problems are : Problem set: 0 solved, 3 unsolved
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 2010 ms.
Support contains 128 out of 661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1291/1291 transitions.
Applied a total of 0 rules in 24 ms. Remains 661 /661 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 661/661 places, 1291/1291 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1291/1291 transitions.
Applied a total of 0 rules in 14 ms. Remains 661 /661 variables (removed 0) and now considering 1291/1291 (removed 0) transitions.
[2026-05-22 18:41:02] [INFO ] Invariant cache hit.
[2026-05-22 18:41:03] [INFO ] Implicit Places using invariants in 345 ms returned []
[2026-05-22 18:41:03] [INFO ] Invariant cache hit.
[2026-05-22 18:41:03] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 18:41:04] [INFO ] Implicit Places using invariants and state equation in 1697 ms returned []
Implicit Place search using SMT with State Equation took 2044 ms to find 0 implicit places.
[2026-05-22 18:41:04] [INFO ] Redundant transitions in 113 ms returned []
Running 1279 sub problems to find dead transitions.
[2026-05-22 18:41:04] [INFO ] Invariant cache hit.
[2026-05-22 18:41:04] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1952 variables, and 43 constraints, problems are : Problem set: 0 solved, 1279 unsolved in 30060 ms.
Refiners :[Positive P Invariants (semi-flows): 3/25 constraints, Generalized P Invariants (flows): 39/51 constraints, State Equation: 0/661 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1279/1279 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1279 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 39/42 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 1/43 constraints. Problems are: Problem set: 0 solved, 1279 unsolved
Problem TDEAD1193 is UNSAT
Problem TDEAD949 is UNSAT
Problem TDEAD950 is UNSAT
Problem TDEAD951 is UNSAT
At refinement iteration 3 (INCLUDED_ONLY) 0/653 variables, 1/44 constraints. Problems are: Problem set: 4 solved, 1275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/1952 variables, and 44 constraints, problems are : Problem set: 4 solved, 1275 unsolved in 30054 ms.
Refiners :[Positive P Invariants (semi-flows): 3/25 constraints, Generalized P Invariants (flows): 39/51 constraints, State Equation: 0/661 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1279 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60527ms problems are : Problem set: 4 solved, 1275 unsolved
Search for dead transitions found 4 dead transitions in 60533ms
Found 4 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 4 transitions
Dead transitions reduction (with SMT) removed 4 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 661/661 places, 1287/1291 transitions.
Applied a total of 0 rules in 18 ms. Remains 661 /661 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2026-05-22 18:42:05] [INFO ] Redundant transitions in 16 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 62777 ms. Remains : 661/661 places, 1287/1291 transitions.
RANDOM walk for 40000 steps (318 resets) in 234 ms. (170 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (77 resets) in 277 ms. (143 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (62 resets) in 155 ms. (256 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (79 resets) in 57 ms. (689 steps per ms) remains 3/3 properties
Interrupted probabilistic random walk after 235990 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :0 out of 3
Probabilistic random walk after 235990 steps, saw 111218 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) 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-4965487680145498992.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4163125337520452943.kers'
[2026-05-22 18:42:08] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-4965487680145498992.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4163125337520452943.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1287 rows 660 cols 4888 entries
Finished phase 1 with 260 SingleSign rule and 325 generalized
[2026-05-22 18:42:08] [INFO ] Computed 76 invariants in 8 ms
Computed 76 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-4163125337520452943.kers
Total runtime 10 ms.
[2026-05-22 18:42:08] [INFO ] State equation strengthened by 7 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 267/395 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 0/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 11/406 variables, 2/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/406 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (OVERLAPS) 255/661 variables, 51/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/661 variables, 0/76 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (OVERLAPS) 1287/1948 variables, 661/737 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1948 variables, 7/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1948 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 0/1948 variables, 0/744 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1948/1948 variables, and 744 constraints, problems are : Problem set: 0 solved, 3 unsolved in 1673 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 661/661 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 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/128 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 1 (OVERLAPS) 267/395 variables, 23/23 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/395 variables, 1/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/395 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (OVERLAPS) 11/406 variables, 2/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/406 variables, 0/26 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 255/661 variables, 51/77 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/661 variables, 5/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/661 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (OVERLAPS) 1287/1948 variables, 661/743 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1948 variables, 7/750 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1948 variables, 1/751 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1948 variables, 4/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1948 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (OVERLAPS) 0/1948 variables, 0/755 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1948/1948 variables, and 755 constraints, problems are : Problem set: 0 solved, 3 unsolved in 9401 ms.
Refiners :[Positive P Invariants (semi-flows): 25/25 constraints, Generalized P Invariants (flows): 51/51 constraints, State Equation: 661/661 constraints, ReadFeed: 7/7 constraints, PredecessorRefiner: 3/1 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 11126ms problems are : Problem set: 0 solved, 3 unsolved
Parikh walk visited 0 properties in 1966 ms.
Support contains 128 out of 661 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1287/1287 transitions.
Applied a total of 0 rules in 17 ms. Remains 661 /661 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 661/661 places, 1287/1287 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 661/661 places, 1287/1287 transitions.
Applied a total of 0 rules in 13 ms. Remains 661 /661 variables (removed 0) and now considering 1287/1287 (removed 0) transitions.
[2026-05-22 18:42:21] [INFO ] Invariant cache hit.
[2026-05-22 18:42:22] [INFO ] Implicit Places using invariants in 477 ms returned []
[2026-05-22 18:42:22] [INFO ] Invariant cache hit.
[2026-05-22 18:42:22] [INFO ] State equation strengthened by 7 read => feed constraints.
[2026-05-22 18:42:24] [INFO ] Implicit Places using invariants and state equation in 2037 ms returned []
Implicit Place search using SMT with State Equation took 2522 ms to find 0 implicit places.
[2026-05-22 18:42:24] [INFO ] Redundant transitions in 83 ms returned []
Running 1275 sub problems to find dead transitions.
[2026-05-22 18:42:24] [INFO ] Invariant cache hit.
[2026-05-22 18:42:24] [INFO ] State equation strengthened by 7 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 653/1948 variables, and 42 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30059 ms.
Refiners :[Positive P Invariants (semi-flows): 3/25 constraints, Generalized P Invariants (flows): 38/51 constraints, State Equation: 0/661 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 1275/1275 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1275 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/653 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/653 variables, 38/41 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/653 variables, 1/42 constraints. Problems are: Problem set: 0 solved, 1275 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 653/1948 variables, and 42 constraints, problems are : Problem set: 0 solved, 1275 unsolved in 30051 ms.
Refiners :[Positive P Invariants (semi-flows): 3/25 constraints, Generalized P Invariants (flows): 38/51 constraints, State Equation: 0/661 constraints, ReadFeed: 0/7 constraints, PredecessorRefiner: 0/1275 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60465ms problems are : Problem set: 0 solved, 1275 unsolved
Search for dead transitions found 0 dead transitions in 60469ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 63099 ms. Remains : 661/661 places, 1287/1287 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (complete) has 2959 edges and 661 vertex of which 660 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Discarding 1 places :
Also discarding 0 output transitions
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 7 Pre rules applied. Total rules applied 1 place count 660 transition count 1280
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 15 place count 653 transition count 1280
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 652 transition count 1279
Applied a total of 17 rules in 46 ms. Remains 652 /661 variables (removed 9) and now considering 1279/1287 (removed 8) transitions.
Running SMT prover for 3 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-3260023973562231147.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9779534584381898520.kers'
[2026-05-22 18:43:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3260023973562231147.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9779534584381898520.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 1279 rows 651 cols 4873 entries
Finished phase 1 with 251 SingleSign rule and 326 generalized
[2026-05-22 18:43:24] [INFO ] Computed 75 invariants in 8 ms
Computed 75 P flows in 8 ms.
Exported basis to /tmp/petrispot-output-9779534584381898520.kers
Total runtime 10 ms.
[2026-05-22 18:43:25] [INFO ] After 130ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2026-05-22 18:43:25] [INFO ] [Nat]Absence check using 25 positive place invariants in 9 ms returned sat
[2026-05-22 18:43:25] [INFO ] [Nat]Absence check using 25 positive and 50 generalized place invariants in 25 ms returned sat
[2026-05-22 18:43:27] [INFO ] After 2060ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
TRAPS : Iteration 0
[2026-05-22 18:43:29] [INFO ] After 3613ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
[2026-05-22 18:43:30] [INFO ] After 5032ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
[2026-05-22 18:43:30] [INFO ] Flatten gal took : 98 ms
[2026-05-22 18:43:30] [INFO ] Flatten gal took : 37 ms
[2026-05-22 18:43:30] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality14646978990843911830.gal : 14 ms
[2026-05-22 18:43:30] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality2812518906566896028.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/ReachabilityCardinality14646978990843911830.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality2812518906566896028.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 ...329
Loading property file /tmp/ReachabilityCardinality2812518906566896028.prop.
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 18
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :18 after 21
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :21 after 39
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :39 after 69
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :69 after 165
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :165 after 12771
SDD proceeding with computation,3 properties remain. new max is 512
SDD size :12771 after 1.58241e+08
Detected timeout of ITS tools.
[2026-05-22 18:43:45] [INFO ] Flatten gal took : 84 ms
[2026-05-22 18:43:45] [INFO ] Applying decomposition
[2026-05-22 18:43:45] [INFO ] Flatten gal took : 43 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/graph17540745294204640835.txt' '-o' '/tmp/graph17540745294204640835.bin' '-w' '/tmp/graph17540745294204640835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph17540745294204640835.bin' '-l' '-1' '-v' '-w' '/tmp/graph17540745294204640835.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:43:45] [INFO ] Decomposing Gal with order
[2026-05-22 18:43:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:43:46] [INFO ] Removed a total of 2060 redundant transitions.
[2026-05-22 18:43:46] [INFO ] Flatten gal took : 167 ms
[2026-05-22 18:43:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 43 ms.
[2026-05-22 18:43:46] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality9551199420096364033.gal : 14 ms
[2026-05-22 18:43:46] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14374527065974381232.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/ReachabilityCardinality9551199420096364033.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14374527065974381232.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
Loading property file /tmp/ReachabilityCardinality14374527065974381232.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 30
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :30 after 1188
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1188 after 523611
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :523611 after 7.91203e+08
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :7.91203e+08 after 6.18238e+09
Reachability property ASLink-PT-04b-ReachabilityFireability-2024-05 is true.
SDD proceeding with computation,2 properties remain. new max is 128
SDD size :6.18238e+09 after 4.03345e+10
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :4.03345e+10 after 1.83697e+11
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.83697e+11 after 9.27473e+11
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :9.27473e+11 after 1.93979e+12
SDD proceeding with computation,2 properties remain. new max is 2048
SDD size :4.26415e+12 after 5.77176e+13
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 36428 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 18:44:01] [INFO ] Flatten gal took : 98 ms
[2026-05-22 18:44:01] [INFO ] Applying decomposition
[2026-05-22 18:44:01] [INFO ] Flatten gal took : 55 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/graph3806275211683373119.txt' '-o' '/tmp/graph3806275211683373119.bin' '-w' '/tmp/graph3806275211683373119.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph3806275211683373119.bin' '-l' '-1' '-v' '-w' '/tmp/graph3806275211683373119.weights' '-q' '0' '-e' '0.001'
[2026-05-22 18:44:01] [INFO ] Decomposing Gal with order
[2026-05-22 18:44:01] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 18:44:02] [INFO ] Removed a total of 1933 redundant transitions.
[2026-05-22 18:44:02] [INFO ] Flatten gal took : 109 ms
[2026-05-22 18:44:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 32 labels/synchronizations in 41 ms.
[2026-05-22 18:44:02] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality18058498013908748542.gal : 20 ms
[2026-05-22 18:44:02] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9464910841429245223.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/ReachabilityCardinality18058498013908748542.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9464910841429245223.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
Loading property file /tmp/ReachabilityCardinality9464910841429245223.prop.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :1 after 1
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1 after 5.09328e+10
Detected timeout of ITS tools.
[2026-05-22 19:14:02] [INFO ] Flatten gal took : 60 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10497606248400240561
[2026-05-22 19:14:02] [INFO ] Computing symmetric may disable matrix : 1287 transitions.
[2026-05-22 19:14:02] [INFO ] Applying decomposition
[2026-05-22 19:14:02] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:14:02] [INFO ] Computing symmetric may enable matrix : 1287 transitions.
[2026-05-22 19:14:02] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2026-05-22 19:14:02] [INFO ] Flatten gal took : 37 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/graph6718310282167072598.txt' '-o' '/tmp/graph6718310282167072598.bin' '-w' '/tmp/graph6718310282167072598.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph6718310282167072598.bin' '-l' '-1' '-v' '-w' '/tmp/graph6718310282167072598.weights' '-q' '0' '-e' '0.001'
[2026-05-22 19:14:02] [INFO ] Decomposing Gal with order
[2026-05-22 19:14:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 19:14:02] [INFO ] Removed a total of 2095 redundant transitions.
[2026-05-22 19:14:02] [INFO ] Flatten gal took : 58 ms
[2026-05-22 19:14:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 74 labels/synchronizations in 46 ms.
[2026-05-22 19:14:03] [INFO ] Time to serialize gal into /tmp/ReachabilityFireability13394427187471367199.gal : 33 ms
[2026-05-22 19:14:03] [INFO ] Time to serialize properties into /tmp/ReachabilityFireability445905407215094992.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/ReachabilityFireability13394427187471367199.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityFireability445905407215094992.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/ReachabilityFireability445905407215094992.prop.
[2026-05-22 19:14:03] [INFO ] Computing Do-Not-Accords matrix : 1287 transitions.
SDD proceeding with computation,3 properties remain. new max is 4
SDD size :1 after 9
SDD proceeding with computation,3 properties remain. new max is 8
SDD size :9 after 144
SDD proceeding with computation,3 properties remain. new max is 16
SDD size :144 after 8151
[2026-05-22 19:14:03] [INFO ] Computation of Completed DNA matrix. took 49 ms. Total solver calls (SAT/UNSAT): 0(0/0)
SDD proceeding with computation,3 properties remain. new max is 32
SDD size :8151 after 85965
[2026-05-22 19:14:03] [INFO ] Built C files in 573ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10497606248400240561
Running compilation step : cd /tmp/ltsmin10497606248400240561;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202604301425/bin/limit_time.pl' '240' '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'
SDD proceeding with computation,3 properties remain. new max is 64
SDD size :85965 after 8.13961e+07
SDD proceeding with computation,3 properties remain. new max is 128
SDD size :8.13961e+07 after 1.03008e+10
SDD proceeding with computation,3 properties remain. new max is 256
SDD size :1.46728e+10 after 2.74476e+10
Reachability property ASLink-PT-04b-ReachabilityFireability-2024-05 is true.
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-05 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,2 properties remain. new max is 256
SDD size :2.74476e+10 after 1.26943e+12
SDD proceeding with computation,2 properties remain. new max is 512
SDD size :1.26943e+12 after 2.32263e+12
SDD proceeding with computation,2 properties remain. new max is 1024
SDD size :4.87275e+12 after 5.78582e+12
Compilation finished in 4827 ms.
Running link step : cd /tmp/ltsmin10497606248400240561;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 125 ms.
Running LTSmin : cd /tmp/ltsmin10497606248400240561;'/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' 'ASLinkPT04bReachabilityFireability202410==true'
Reachability property ASLink-PT-04b-ReachabilityFireability-2024-15 is true.
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.12023e+14 after 5.80877e+14
Invariant property ASLink-PT-04b-ReachabilityFireability-2024-10 does not hold.
FORMULA ASLink-PT-04b-ReachabilityFireability-2024-10 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 1025 fixpoint passes
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,2.09314e+15,233.396,1104956,20275,4345,1.28505e+06,217114,2205,5.31215e+06,405,1.3625e+06,0
Total reachable state count : 2093144501809592

Verifying 3 reachability properties.
WARNING : LTSmin timed out (>400 s) on command cd /tmp/ltsmin10497606248400240561;'/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' 'ASLinkPT04bReachabilityFireability202410==true'
ITS tools runner thread asked to quit. Dying gracefully.
Total runtime 2505016 ms.

BK_STOP 1779477648457

--------------------
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
+ [[ ReachabilityFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution ReachabilityFireability -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 ReachabilityFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

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

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