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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 680K
-rw-r--r-- 1 mcc users 7.4K Mar 5 14:01 CTLCardinality.txt
-rw-r--r-- 1 mcc users 81K Mar 5 14:01 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K Mar 5 14:01 CTLFireability.txt
-rw-r--r-- 1 mcc users 49K 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.9K Mar 15 07:07 LTLCardinality.txt
-rw-r--r-- 1 mcc users 28K Mar 15 07:07 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Mar 15 07:07 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Mar 15 07:07 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.4K Mar 5 14:01 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 57K Mar 5 14:01 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.7K Mar 5 14:01 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 75K Mar 5 14:01 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 15 07:07 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Mar 15 07:07 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 3 18:30 instance
-rw-r--r-- 1 mcc users 6 Mar 3 18:30 iscolored
-rw-r--r-- 1 mcc users 279K 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-02a-ReachabilityFireability-2024-00
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-01
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-02
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-03
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-04
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-05
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-06
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-07
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-08
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-09
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-10
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-11
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-12
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-13
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-14
FORMULA_NAME ASLink-PT-02a-ReachabilityFireability-2024-15

=== Now, execution of the tool begins

BK_START 1779471049840

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-02a
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityFireability PT
Running Version 202604301425
[2026-05-22 17:30:51] [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 17:30:51] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-05-22 17:30:51] [INFO ] Load time of PNML (sax parser for PT used): 133 ms
[2026-05-22 17:30:51] [INFO ] Transformed 626 places.
[2026-05-22 17:30:51] [INFO ] Transformed 1008 transitions.
[2026-05-22 17:30:51] [INFO ] Found NUPN structural information;
[2026-05-22 17:30:51] [INFO ] Parsed PT model containing 626 places and 1008 transitions and 3820 arcs in 241 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 13 ms.
Working with output stream class java.io.PrintStream
Ensure Unique test removed 10 transitions
Reduce redundant transitions removed 10 transitions.
[2026-05-22 17:30:52] [INFO ] Flatten gal took : 203 ms
RANDOM walk for 40000 steps (491 resets) in 1855 ms. (21 steps per ms) remains 11/16 properties
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-08 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-07 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-05 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-01 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2026-05-22 17:30:52] [INFO ] Flatten gal took : 76 ms
BEST_FIRST walk for 40002 steps (131 resets) in 308 ms. (129 steps per ms) remains 11/11 properties
[2026-05-22 17:30:52] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality13100615231032591588.gal : 57 ms
[2026-05-22 17:30:52] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality9583445918274480668.prop : 3 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/ReachabilityCardinality13100615231032591588.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality9583445918274480668.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
BEST_FIRST walk for 40004 steps (131 resets) in 515 ms. (77 steps per ms) remains 11/11 properties
Loading property file /tmp/ReachabilityCardinality9583445918274480668.prop.
BEST_FIRST walk for 40002 steps (128 resets) in 690 ms. (57 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (117 resets) in 230 ms. (173 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (131 resets) in 158 ms. (251 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 6
BEST_FIRST walk for 40004 steps (137 resets) in 299 ms. (133 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :6 after 10
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :10 after 29
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :29 after 39
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :39 after 64
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :64 after 189
BEST_FIRST walk for 40002 steps (128 resets) in 146 ms. (272 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :189 after 3199
BEST_FIRST walk for 40003 steps (134 resets) in 224 ms. (177 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40001 steps (139 resets) in 189 ms. (210 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (136 resets) in 223 ms. (178 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (171 resets) in 180 ms. (221 steps per ms) remains 11/11 properties
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13056120088375296605.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-4689578379953057354.kers'
[2026-05-22 17:30:53] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13056120088375296605.kers, --Pflows, --basisKERS=/tmp/petrispot-output-4689578379953057354.kers]
Culling duplicate invariants (modulo rational): removing 8 columns.
Culled 8 columns in 0 ms.
// Phase 1: matrix 998 rows 618 cols 3784 entries
Finished phase 1 with 219 SingleSign rule and 289 generalized
[2026-05-22 17:30:53] [INFO ] Computed 118 invariants in 6 ms
Computed 118 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-4689578379953057354.kers
Total runtime 10 ms.
Excessive predecessor constraint size, skipping predecessor.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/236 variables, 236/236 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/236 variables, 2/238 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/236 variables, 0/238 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (OVERLAPS) 117/353 variables, 22/260 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/353 variables, 117/377 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/353 variables, 2/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/353 variables, 0/379 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 3/356 variables, 2/381 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/356 variables, 3/384 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/356 variables, 0/384 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2024-12 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-12 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 262/618 variables, 85/469 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/618 variables, 262/731 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/618 variables, 0/731 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 13 (OVERLAPS) 8/626 variables, 5/736 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/626 variables, 8/744 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 626/1624 variables, and 744 constraints, problems are : Problem set: 1 solved, 10 unsolved in 5053 ms.
Refiners :[Domain max(s): 626/626 constraints, Positive P Invariants (semi-flows): 24/24 constraints, Generalized P Invariants (flows): 94/94 constraints, State Equation: 0/626 constraints, PredecessorRefiner: 11/3 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 10 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/225 variables, 225/225 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/225 variables, 2/227 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/225 variables, 0/227 constraints. Problems are: Problem set: 1 solved, 10 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2024-09 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-13 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 3 (OVERLAPS) 121/346 variables, 22/249 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/346 variables, 121/370 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/346 variables, 2/372 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/346 variables, 0/372 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 7 (OVERLAPS) 3/349 variables, 2/374 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/349 variables, 3/377 constraints. Problems are: Problem set: 3 solved, 8 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/349 variables, 0/377 constraints. Problems are: Problem set: 3 solved, 8 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2024-14 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 10 (OVERLAPS) 266/615 variables, 82/459 constraints. Problems are: Problem set: 4 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/615 variables, 266/725 constraints. Problems are: Problem set: 4 solved, 7 unsolved
SMT process timed out in 10403ms, After SMT, problems are : Problem set: 4 solved, 7 unsolved
Fused 7 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 158 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 998/998 transitions.
Ensure Unique test removed 7 places
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions (Trivial Post-Agglo cleanup.) removed 29 transitions
Trivial Post-agglo rules discarded 29 transitions
Performed 29 trivial Post agglomeration. Transition count delta: 29
Iterating post reduction 0 with 40 rules applied. Total rules applied 40 place count 615 transition count 969
Reduce places removed 29 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 32 rules applied. Total rules applied 72 place count 586 transition count 966
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 75 place count 583 transition count 966
Performed 39 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 39 Pre rules applied. Total rules applied 75 place count 583 transition count 927
Deduced a syphon composed of 39 places in 1 ms
Ensure Unique test removed 11 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 3 with 89 rules applied. Total rules applied 164 place count 533 transition count 927
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 3 with 1 rules applied. Total rules applied 165 place count 533 transition count 926
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 166 place count 532 transition count 926
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 168 place count 530 transition count 919
Iterating global reduction 5 with 2 rules applied. Total rules applied 170 place count 530 transition count 919
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 5 with 4 rules applied. Total rules applied 174 place count 529 transition count 916
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 6 with 2 rules applied. Total rules applied 176 place count 527 transition count 916
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: 9
Deduced a syphon composed of 9 places in 3 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 7 with 18 rules applied. Total rules applied 194 place count 518 transition count 907
Free-agglomeration rule applied 2 times.
Iterating global reduction 7 with 2 rules applied. Total rules applied 196 place count 518 transition count 905
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 7 with 2 rules applied. Total rules applied 198 place count 516 transition count 905
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 8 with 2 rules applied. Total rules applied 200 place count 516 transition count 903
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 8 with 2 rules applied. Total rules applied 202 place count 514 transition count 903
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 9 with 3 rules applied. Total rules applied 205 place count 514 transition count 903
Applied a total of 205 rules in 236 ms. Remains 514 /626 variables (removed 112) and now considering 903/998 (removed 95) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 243 ms. Remains : 514/626 places, 903/998 transitions.
RANDOM walk for 40000 steps (537 resets) in 651 ms. (61 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (180 resets) in 136 ms. (291 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (194 resets) in 225 ms. (177 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (189 resets) in 416 ms. (95 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (175 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (179 resets) in 126 ms. (314 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40001 steps (181 resets) in 121 ms. (327 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (176 resets) in 154 ms. (258 steps per ms) remains 7/7 properties
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :3199 after 577401
Interrupted probabilistic random walk after 170985 steps, run timeout after 3001 ms. (steps per millisecond=56 ) properties seen :0 out of 7
Probabilistic random walk after 170985 steps, saw 65670 distinct states, run finished after 3038 ms. (steps per millisecond=56 ) 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-14870576660752934868.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5176269647822929471.kers'
[2026-05-22 17:31:07] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14870576660752934868.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5176269647822929471.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 0 ms.
// Phase 1: matrix 903 rows 512 cols 3544 entries
Finished phase 1 with 133 SingleSign rule and 286 generalized
[2026-05-22 17:31:07] [INFO ] Computed 95 invariants in 6 ms
Computed 95 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-5176269647822929471.kers
Total runtime 10 ms.
[2026-05-22 17:31:07] [INFO ] State equation strengthened by 8 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 105/263 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/268 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 234/502 variables, 61/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 0/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 12/514 variables, 9/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/514 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 903/1417 variables, 514/609 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1417 variables, 8/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1417 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (OVERLAPS) 0/1417 variables, 0/617 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1417/1417 variables, and 617 constraints, problems are : Problem set: 0 solved, 7 unsolved in 3072 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 72/72 constraints, State Equation: 514/514 constraints, ReadFeed: 8/8 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/158 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/158 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (OVERLAPS) 105/263 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/263 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/263 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 5/268 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/268 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (OVERLAPS) 234/502 variables, 61/86 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/502 variables, 3/89 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/502 variables, 1/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/502 variables, 0/90 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (OVERLAPS) 12/514 variables, 9/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/514 variables, 0/99 constraints. Problems are: Problem set: 0 solved, 7 unsolved
Problem ASLink-PT-02a-ReachabilityFireability-2024-00 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-00 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-02 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-02 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-06 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-10 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-10 FALSE TECHNIQUES SMT_REFINEMENT
Problem ASLink-PT-02a-ReachabilityFireability-2024-11 is UNSAT
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-11 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 13 (OVERLAPS) 903/1417 variables, 514/613 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1417 variables, 8/621 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/1417 variables, 0/621 constraints. Problems are: Problem set: 5 solved, 2 unsolved
At refinement iteration 16 (OVERLAPS) 0/1417 variables, 0/621 constraints. Problems are: Problem set: 5 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1417/1417 variables, and 621 constraints, problems are : Problem set: 5 solved, 2 unsolved in 6499 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 72/72 constraints, State Equation: 514/514 constraints, ReadFeed: 8/8 constraints, PredecessorRefiner: 4/3 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 9631ms problems are : Problem set: 5 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 466 ms.
Support contains 122 out of 514 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 514/514 places, 903/903 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 514 transition count 900
Reduce places removed 3 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 511 transition count 899
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 8 place count 510 transition count 899
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 5 Pre rules applied. Total rules applied 8 place count 510 transition count 894
Deduced a syphon composed of 5 places in 1 ms
Ensure Unique test removed 2 places
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 20 place count 503 transition count 894
Applied a total of 20 rules in 36 ms. Remains 503 /514 variables (removed 11) and now considering 894/903 (removed 9) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 36 ms. Remains : 503/514 places, 894/903 transitions.
RANDOM walk for 40000 steps (601 resets) in 208 ms. (191 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40001 steps (190 resets) in 368 ms. (108 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (180 resets) in 82 ms. (481 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 353289 steps, run timeout after 3001 ms. (steps per millisecond=117 ) properties seen :0 out of 2
Probabilistic random walk after 353289 steps, saw 132372 distinct states, run finished after 3001 ms. (steps per millisecond=117 ) 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-3594992325142973621.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-16046304295339271438.kers'
[2026-05-22 17:31:20] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3594992325142973621.kers, --Pflows, --basisKERS=/tmp/petrispot-output-16046304295339271438.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 5 ms.
// Phase 1: matrix 894 rows 501 cols 3520 entries
Finished phase 1 with 125 SingleSign rule and 285 generalized
[2026-05-22 17:31:20] [INFO ] Computed 93 invariants in 19 ms
Computed 93 P flows in 22 ms.
Exported basis to /tmp/petrispot-output-16046304295339271438.kers
Total runtime 23 ms.
[2026-05-22 17:31:20] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 120/242 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/247 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/492 variables, 58/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 0/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 11/503 variables, 10/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 0/93 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 894/1397 variables, 503/596 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1397 variables, 9/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1397 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/1397 variables, 0/605 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1397/1397 variables, and 605 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1302 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 503/503 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 120/242 variables, 20/21 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/242 variables, 1/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/242 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 5/247 variables, 3/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/247 variables, 0/25 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 245/492 variables, 58/83 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/492 variables, 2/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/492 variables, 0/85 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 11/503 variables, 10/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/95 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 894/1397 variables, 503/598 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1397 variables, 9/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/1397 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/1397 variables, 0/607 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1397/1397 variables, and 607 constraints, problems are : Problem set: 0 solved, 2 unsolved in 2700 ms.
Refiners :[Positive P Invariants (semi-flows): 23/23 constraints, Generalized P Invariants (flows): 70/70 constraints, State Equation: 503/503 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 4064ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2884 ms.
Support contains 122 out of 503 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 894/894 transitions.
Applied a total of 0 rules in 17 ms. Remains 503 /503 variables (removed 0) and now considering 894/894 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 503/503 places, 894/894 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 503/503 places, 894/894 transitions.
Applied a total of 0 rules in 15 ms. Remains 503 /503 variables (removed 0) and now considering 894/894 (removed 0) transitions.
[2026-05-22 17:31:27] [INFO ] Invariant cache hit.
[2026-05-22 17:31:28] [INFO ] Implicit Places using invariants in 313 ms returned [1, 20, 21, 24, 72, 150, 162, 177, 181, 182, 218, 282, 311, 316, 327, 331, 367, 369, 372, 390, 392, 405, 417, 423, 429, 435, 447, 453, 459, 465]
Discarding 30 places :
Implicit Place search using SMT only with invariants took 324 ms to find 30 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 473/503 places, 894/894 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 4 transitions
Trivial Post-agglo rules discarded 4 transitions
Performed 4 trivial Post agglomeration. Transition count delta: 4
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 473 transition count 890
Reduce places removed 4 places and 0 transitions.
Performed 8 Post agglomeration using F-continuation condition.Transition count delta: 8
Iterating post reduction 1 with 12 rules applied. Total rules applied 16 place count 469 transition count 882
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 2 with 8 rules applied. Total rules applied 24 place count 461 transition count 882
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 24 place count 461 transition count 879
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 30 place count 458 transition count 879
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 37 place count 451 transition count 872
Iterating global reduction 3 with 7 rules applied. Total rules applied 44 place count 451 transition count 872
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 44 place count 451 transition count 871
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 46 place count 450 transition count 871
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 50 place count 446 transition count 867
Iterating global reduction 3 with 4 rules applied. Total rules applied 54 place count 446 transition count 867
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 1 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 3 with 36 rules applied. Total rules applied 90 place count 428 transition count 849
Free-agglomeration rule (complex) applied 11 times.
Iterating global reduction 3 with 11 rules applied. Total rules applied 101 place count 428 transition count 838
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 3 with 11 rules applied. Total rules applied 112 place count 417 transition count 838
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 113 place count 417 transition count 838
Partial Post-agglomeration rule applied 2 times.
Drop transitions (Partial Post agglomeration) removed 2 transitions
Iterating global reduction 4 with 2 rules applied. Total rules applied 115 place count 417 transition count 838
Applied a total of 115 rules in 109 ms. Remains 417 /473 variables (removed 56) and now considering 838/894 (removed 56) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10632646512984087977.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10287298854285378141.kers'
[2026-05-22 17:31:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10632646512984087977.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10287298854285378141.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 4 ms.
// Phase 1: matrix 838 rows 416 cols 3300 entries
Finished phase 1 with 170 SingleSign rule and 184 generalized
[2026-05-22 17:31:28] [INFO ] Computed 63 invariants in 9 ms
Computed 63 P flows in 9 ms.
Exported basis to /tmp/petrispot-output-10287298854285378141.kers
Total runtime 10 ms.
[2026-05-22 17:31:28] [INFO ] Implicit Places using invariants in 210 ms returned [140, 156, 281]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 212 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 414/503 places, 838/894 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 413 transition count 837
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 413 transition count 837
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 4 place count 412 transition count 836
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 5 place count 412 transition count 835
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 6 place count 411 transition count 835
Applied a total of 6 rules in 45 ms. Remains 411 /414 variables (removed 3) and now considering 835/838 (removed 3) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13687867251306672941.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-3299525959490429911.kers'
[2026-05-22 17:31:28] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13687867251306672941.kers, --Pflows, --basisKERS=/tmp/petrispot-output-3299525959490429911.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 835 rows 410 cols 3278 entries
Finished phase 1 with 169 SingleSign rule and 182 generalized
[2026-05-22 17:31:28] [INFO ] Computed 60 invariants in 4 ms
Computed 60 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-3299525959490429911.kers
Total runtime 5 ms.
[2026-05-22 17:31:28] [INFO ] Implicit Places using invariants in 211 ms returned []
[2026-05-22 17:31:28] [INFO ] Invariant cache hit.
[2026-05-22 17:31:29] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 17:31:29] [INFO ] Implicit Places using invariants and state equation in 942 ms returned []
Implicit Place search using SMT with State Equation took 1156 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 411/503 places, 835/894 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1862 ms. Remains : 411/503 places, 835/894 transitions.
RANDOM walk for 40000 steps (595 resets) in 261 ms. (152 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (185 resets) in 379 ms. (105 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (195 resets) in 86 ms. (459 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 311048 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :0 out of 2
Probabilistic random walk after 311048 steps, saw 114908 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
[2026-05-22 17:31:32] [INFO ] Invariant cache hit.
[2026-05-22 17:31:32] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 114/236 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 175/411 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 835/1246 variables, 411/471 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1246 variables, 6/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1246 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (OVERLAPS) 0/1246 variables, 0/477 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1246/1246 variables, and 477 constraints, problems are : Problem set: 0 solved, 2 unsolved in 951 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 411/411 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/122 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/122 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (OVERLAPS) 114/236 variables, 15/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/236 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 175/411 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/411 variables, 1/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/411 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 835/1246 variables, 411/472 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1246 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1246 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/1246 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1246/1246 variables, and 478 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1398 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 411/411 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 2/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2366ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 270 ms.
Support contains 122 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 835/835 transitions.
Applied a total of 0 rules in 18 ms. Remains 411 /411 variables (removed 0) and now considering 835/835 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 411/411 places, 835/835 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 835/835 transitions.
Applied a total of 0 rules in 10 ms. Remains 411 /411 variables (removed 0) and now considering 835/835 (removed 0) transitions.
[2026-05-22 17:31:35] [INFO ] Invariant cache hit.
[2026-05-22 17:31:35] [INFO ] Implicit Places using invariants in 190 ms returned []
[2026-05-22 17:31:35] [INFO ] Invariant cache hit.
[2026-05-22 17:31:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2026-05-22 17:31:36] [INFO ] Implicit Places using invariants and state equation in 825 ms returned []
Implicit Place search using SMT with State Equation took 1023 ms to find 0 implicit places.
[2026-05-22 17:31:36] [INFO ] Redundant transitions in 46 ms returned []
Running 834 sub problems to find dead transitions.
[2026-05-22 17:31:36] [INFO ] Invariant cache hit.
[2026-05-22 17:31:36] [INFO ] State equation strengthened by 6 read => feed constraints.
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :577401 after 1.93815e+06
Reachability property ASLink-PT-02a-ReachabilityFireability-2024-04 is true.
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-04 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (OVERLAPS) 1/411 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Error getting values : (error "Timeout of Z3 solver reached")
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 411/1246 variables, and 60 constraints, problems are : Problem set: 0 solved, 834 unsolved in 30058 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/411 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 834/834 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 834 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/410 variables, 28/28 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/410 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 2 (OVERLAPS) 1/411 variables, 15/43 constraints. Problems are: Problem set: 0 solved, 834 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/411 variables, 17/60 constraints. Problems are: Problem set: 0 solved, 834 unsolved
Problem TDEAD585 is UNSAT
Problem TDEAD590 is UNSAT
Problem TDEAD595 is UNSAT
Problem TDEAD600 is UNSAT
Problem TDEAD604 is UNSAT
Problem TDEAD611 is UNSAT
Problem TDEAD614 is UNSAT
Problem TDEAD617 is UNSAT
Problem TDEAD620 is UNSAT
Problem TDEAD685 is UNSAT
Problem TDEAD688 is UNSAT
Problem TDEAD691 is UNSAT
Problem TDEAD694 is UNSAT
Problem TDEAD710 is UNSAT
Error getting values : (error "Timeout of Z3 solver reached")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 411/1246 variables, and 66 constraints, problems are : Problem set: 14 solved, 820 unsolved in 30035 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 0/411 constraints, ReadFeed: 0/6 constraints, PredecessorRefiner: 0/834 constraints, Known Traps: 6/6 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60366ms problems are : Problem set: 14 solved, 820 unsolved
Search for dead transitions found 14 dead transitions in 60370ms
Found 14 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 14 transitions
Dead transitions reduction (with SMT) removed 14 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 411/411 places, 821/835 transitions.
Applied a total of 0 rules in 9 ms. Remains 411 /411 variables (removed 0) and now considering 821/821 (removed 0) transitions.
[2026-05-22 17:32:37] [INFO ] Redundant transitions in 24 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61519 ms. Remains : 411/411 places, 821/835 transitions.
RANDOM walk for 40000 steps (603 resets) in 191 ms. (208 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (188 resets) in 297 ms. (134 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 613915 steps, run timeout after 3001 ms. (steps per millisecond=204 ) properties seen :0 out of 1
Probabilistic random walk after 613915 steps, saw 212615 distinct states, run finished after 3001 ms. (steps per millisecond=204 ) 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-6310469750403932319.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-6428073716222908746.kers'
[2026-05-22 17:32:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-6310469750403932319.kers, --Pflows, --basisKERS=/tmp/petrispot-output-6428073716222908746.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 821 rows 410 cols 3222 entries
Finished phase 1 with 166 SingleSign rule and 184 generalized
[2026-05-22 17:32:40] [INFO ] Computed 61 invariants in 4 ms
Computed 61 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-6428073716222908746.kers
Total runtime 5 ms.
[2026-05-22 17:32:40] [INFO ] State equation strengthened by 6 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/210 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/211 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 197/408 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 0/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 3/411 variables, 2/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/411 variables, 0/61 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 821/1232 variables, 411/472 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/1232 variables, 6/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1232 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/1232 variables, 0/478 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1232/1232 variables, and 478 constraints, problems are : Problem set: 0 solved, 1 unsolved in 631 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 411/411 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 100/210 variables, 12/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/210 variables, 0/13 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/211 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/211 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 197/408 variables, 45/59 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/408 variables, 1/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/408 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 3/411 variables, 2/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/411 variables, 0/62 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 821/1232 variables, 411/473 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/1232 variables, 6/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/1232 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 14 (OVERLAPS) 0/1232 variables, 0/479 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1232/1232 variables, and 479 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2140 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 48/48 constraints, State Equation: 411/411 constraints, ReadFeed: 6/6 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2790ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 111 ms.
Support contains 110 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 821/821 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 0 with 2 rules applied. Total rules applied 2 place count 411 transition count 819
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 409 transition count 819
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 409 transition count 818
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 408 transition count 818
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 7 place count 407 transition count 818
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 9 place count 406 transition count 817
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 10 place count 406 transition count 816
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 11 place count 405 transition count 816
Free-agglomeration rule (complex) applied 8 times.
Iterating global reduction 4 with 8 rules applied. Total rules applied 19 place count 405 transition count 808
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 27 place count 397 transition count 808
Partial Post-agglomeration rule applied 1 times.
Drop transitions (Partial Post agglomeration) removed 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 28 place count 397 transition count 808
Applied a total of 28 rules in 46 ms. Remains 397 /411 variables (removed 14) and now considering 808/821 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 397/411 places, 808/821 transitions.
RANDOM walk for 40000 steps (656 resets) in 255 ms. (156 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40004 steps (210 resets) in 283 ms. (140 steps per ms) remains 1/1 properties
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :1.93815e+06 after 1.9723e+06
Interrupted probabilistic random walk after 619376 steps, run timeout after 3001 ms. (steps per millisecond=206 ) properties seen :0 out of 1
Probabilistic random walk after 619376 steps, saw 217245 distinct states, run finished after 3001 ms. (steps per millisecond=206 ) 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-7250461175693173484.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-12116849157224165468.kers'
[2026-05-22 17:32:46] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-7250461175693173484.kers, --Pflows, --basisKERS=/tmp/petrispot-output-12116849157224165468.kers]
Culling duplicate invariants (modulo rational): removing 2 columns.
Culled 2 columns in 1 ms.
// Phase 1: matrix 808 rows 395 cols 3204 entries
Finished phase 1 with 159 SingleSign rule and 178 generalized
[2026-05-22 17:32:46] [INFO ] Computed 60 invariants in 12 ms
Computed 60 P flows in 13 ms.
Exported basis to /tmp/petrispot-output-12116849157224165468.kers
Total runtime 15 ms.
[2026-05-22 17:32:46] [INFO ] State equation strengthened by 9 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 118/228 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/229 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 168/397 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 808/1205 variables, 397/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 9/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1205 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1205 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1205/1205 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 780 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 397/397 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 118/228 variables, 14/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/228 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 1/229 variables, 1/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/229 variables, 0/16 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 168/397 variables, 44/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/397 variables, 0/60 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (OVERLAPS) 808/1205 variables, 397/457 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1205 variables, 9/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/1205 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/1205 variables, 0/466 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1205/1205 variables, and 466 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1038 ms.
Refiners :[Positive P Invariants (semi-flows): 15/15 constraints, Generalized P Invariants (flows): 45/45 constraints, State Equation: 397/397 constraints, ReadFeed: 9/9 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1867ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 146 ms.
Support contains 110 out of 397 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 808/808 transitions.
Applied a total of 0 rules in 11 ms. Remains 397 /397 variables (removed 0) and now considering 808/808 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 397/397 places, 808/808 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 397/397 places, 808/808 transitions.
Applied a total of 0 rules in 10 ms. Remains 397 /397 variables (removed 0) and now considering 808/808 (removed 0) transitions.
[2026-05-22 17:32:48] [INFO ] Invariant cache hit.
[2026-05-22 17:32:48] [INFO ] Implicit Places using invariants in 265 ms returned [143, 150, 151]
Discarding 3 places :
Implicit Place search using SMT only with invariants took 266 ms to find 3 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 394/397 places, 808/808 transitions.
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 2 Pre rules applied. Total rules applied 0 place count 394 transition count 806
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 392 transition count 806
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 391 transition count 805
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 391 transition count 805
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 391 transition count 804
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 390 transition count 803
Applied a total of 9 rules in 23 ms. Remains 390 /394 variables (removed 4) and now considering 803/808 (removed 5) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-248461781244376040.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-7024670311607944355.kers'
[2026-05-22 17:32:48] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-248461781244376040.kers, --Pflows, --basisKERS=/tmp/petrispot-output-7024670311607944355.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 803 rows 389 cols 3176 entries
Finished phase 1 with 155 SingleSign rule and 178 generalized
[2026-05-22 17:32:48] [INFO ] Computed 57 invariants in 4 ms
Computed 57 P flows in 15 ms.
Exported basis to /tmp/petrispot-output-7024670311607944355.kers
Total runtime 16 ms.
[2026-05-22 17:32:48] [INFO ] Implicit Places using invariants in 375 ms returned [81, 140]
Discarding 2 places :
Implicit Place search using SMT only with invariants took 377 ms to find 2 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 388/397 places, 803/808 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 387 transition count 802
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 387 transition count 802
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 386 transition count 801
Applied a total of 4 rules in 18 ms. Remains 386 /388 variables (removed 2) and now considering 801/803 (removed 2) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-14638653335434462170.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8823932803321010488.kers'
[2026-05-22 17:32:49] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14638653335434462170.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8823932803321010488.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 801 rows 385 cols 3167 entries
Finished phase 1 with 153 SingleSign rule and 178 generalized
[2026-05-22 17:32:49] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8823932803321010488.kers
Total runtime 4 ms.
[2026-05-22 17:32:49] [INFO ] Implicit Places using invariants in 297 ms returned []
[2026-05-22 17:32:49] [INFO ] Invariant cache hit.
[2026-05-22 17:32:49] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:32:50] [INFO ] Implicit Places using invariants and state equation in 744 ms returned []
Implicit Place search using SMT with State Equation took 1052 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 386/397 places, 801/808 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 1746 ms. Remains : 386/397 places, 801/808 transitions.
RANDOM walk for 40000 steps (695 resets) in 124 ms. (320 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40002 steps (203 resets) in 347 ms. (114 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 607853 steps, run timeout after 3001 ms. (steps per millisecond=202 ) properties seen :0 out of 1
Probabilistic random walk after 607853 steps, saw 213447 distinct states, run finished after 3001 ms. (steps per millisecond=202 ) properties seen :0
[2026-05-22 17:32:53] [INFO ] Invariant cache hit.
[2026-05-22 17:32:53] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 115/225 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 161/386 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 801/1187 variables, 386/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1187 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1187 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1187 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1187/1187 variables, and 445 constraints, problems are : Problem set: 0 solved, 1 unsolved in 614 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 386/386 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 115/225 variables, 13/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/225 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 161/386 variables, 41/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 801/1187 variables, 386/441 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1187 variables, 4/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1187 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1187 variables, 0/445 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1187/1187 variables, and 445 constraints, problems are : Problem set: 0 solved, 1 unsolved in 673 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 386/386 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1303ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 100 ms.
Support contains 110 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 801/801 transitions.
Applied a total of 0 rules in 15 ms. Remains 386 /386 variables (removed 0) and now considering 801/801 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 386/386 places, 801/801 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 801/801 transitions.
Applied a total of 0 rules in 10 ms. Remains 386 /386 variables (removed 0) and now considering 801/801 (removed 0) transitions.
[2026-05-22 17:32:54] [INFO ] Invariant cache hit.
[2026-05-22 17:32:54] [INFO ] Implicit Places using invariants in 221 ms returned []
[2026-05-22 17:32:54] [INFO ] Invariant cache hit.
[2026-05-22 17:32:55] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:32:55] [INFO ] Implicit Places using invariants and state equation in 702 ms returned []
Implicit Place search using SMT with State Equation took 934 ms to find 0 implicit places.
[2026-05-22 17:32:55] [INFO ] Redundant transitions in 14 ms returned []
Running 800 sub problems to find dead transitions.
[2026-05-22 17:32:55] [INFO ] Invariant cache hit.
[2026-05-22 17:32:55] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (OVERLAPS) 1/386 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 386/1187 variables, and 57 constraints, problems are : Problem set: 0 solved, 800 unsolved in 30044 ms.
Refiners :[Positive P Invariants (semi-flows): 13/13 constraints, Generalized P Invariants (flows): 42/42 constraints, State Equation: 0/386 constraints, ReadFeed: 0/4 constraints, PredecessorRefiner: 800/800 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 800 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/385 variables, 27/27 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/385 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 2 (OVERLAPS) 1/386 variables, 13/40 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/386 variables, 15/55 constraints. Problems are: Problem set: 0 solved, 800 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/386 variables, 2/57 constraints. Problems are: Problem set: 0 solved, 800 unsolved
Problem TDEAD780 is UNSAT
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 3/60 constraints. Problems are: Problem set: 1 solved, 799 unsolved
SMT process timed out in 60247ms, After SMT, problems are : Problem set: 1 solved, 799 unsolved
Search for dead transitions found 1 dead transitions in 60250ms
Found 1 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 1 transitions
Dead transitions reduction (with SMT) removed 1 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 386/386 places, 800/801 transitions.
Applied a total of 0 rules in 33 ms. Remains 386 /386 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2026-05-22 17:33:55] [INFO ] Redundant transitions in 5 ms returned []
Finished structural reductions in REACHABILITY mode , in 2 iterations and 61277 ms. Remains : 386/386 places, 800/801 transitions.
RANDOM walk for 40000 steps (688 resets) in 163 ms. (243 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40001 steps (192 resets) in 351 ms. (113 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 639374 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :0 out of 1
Probabilistic random walk after 639374 steps, saw 222930 distinct states, run finished after 3001 ms. (steps per millisecond=213 ) 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-3414461854574583013.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-5631894740856058812.kers'
[2026-05-22 17:33:59] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-3414461854574583013.kers, --Pflows, --basisKERS=/tmp/petrispot-output-5631894740856058812.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 800 rows 385 cols 3163 entries
Finished phase 1 with 153 SingleSign rule and 177 generalized
[2026-05-22 17:33:59] [INFO ] Computed 56 invariants in 3 ms
Computed 56 P flows in 5 ms.
Exported basis to /tmp/petrispot-output-5631894740856058812.kers
Total runtime 5 ms.
[2026-05-22 17:33:59] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 138/248 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/386 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 0/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 800/1186 variables, 386/442 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1186 variables, 4/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1186 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1186 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1186/1186 variables, and 446 constraints, problems are : Problem set: 0 solved, 1 unsolved in 1442 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 386/386 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 138/248 variables, 16/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/248 variables, 0/17 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 138/386 variables, 39/56 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/386 variables, 1/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/386 variables, 0/57 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 800/1186 variables, 386/443 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1186 variables, 4/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1186 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (OVERLAPS) 0/1186 variables, 0/447 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1186/1186 variables, and 447 constraints, problems are : Problem set: 0 solved, 1 unsolved in 2279 ms.
Refiners :[Positive P Invariants (semi-flows): 16/16 constraints, Generalized P Invariants (flows): 40/40 constraints, State Equation: 386/386 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 1/1 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 3753ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 92 ms.
Support contains 110 out of 386 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 800/800 transitions.
Applied a total of 0 rules in 8 ms. Remains 386 /386 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 386/386 places, 800/800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 386/386 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 386 /386 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2026-05-22 17:34:02] [INFO ] Invariant cache hit.
[2026-05-22 17:34:03] [INFO ] Implicit Places using invariants in 249 ms returned [26]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 253 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 385/386 places, 800/800 transitions.
Applied a total of 0 rules in 13 ms. Remains 385 /385 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 274 ms. Remains : 385/386 places, 800/800 transitions.
RANDOM walk for 40000 steps (685 resets) in 139 ms. (285 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (211 resets) in 227 ms. (175 steps per ms) remains 1/1 properties
Interrupted probabilistic random walk after 661199 steps, run timeout after 3001 ms. (steps per millisecond=220 ) properties seen :0 out of 1
Probabilistic random walk after 661199 steps, saw 230848 distinct states, run finished after 3001 ms. (steps per millisecond=220 ) 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-13681716338655578184.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-2433034175854778377.kers'
[2026-05-22 17:34:06] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13681716338655578184.kers, --Pflows, --basisKERS=/tmp/petrispot-output-2433034175854778377.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 1 ms.
// Phase 1: matrix 800 rows 384 cols 3160 entries
Finished phase 1 with 157 SingleSign rule and 173 generalized
[2026-05-22 17:34:06] [INFO ] Computed 55 invariants in 11 ms
Computed 55 P flows in 12 ms.
Exported basis to /tmp/petrispot-output-2433034175854778377.kers
Total runtime 14 ms.
[2026-05-22 17:34:06] [INFO ] State equation strengthened by 4 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 94/204 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 181/385 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 800/1185 variables, 385/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1185 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1185 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1185 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1185/1185 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 835 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 385/385 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/110 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/110 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (OVERLAPS) 94/204 variables, 11/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/204 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (OVERLAPS) 181/385 variables, 43/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/385 variables, 0/55 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 800/1185 variables, 385/440 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1185 variables, 4/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1185 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (OVERLAPS) 0/1185 variables, 0/444 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1185/1185 variables, and 444 constraints, problems are : Problem set: 0 solved, 1 unsolved in 884 ms.
Refiners :[Positive P Invariants (semi-flows): 11/11 constraints, Generalized P Invariants (flows): 44/44 constraints, State Equation: 385/385 constraints, ReadFeed: 4/4 constraints, PredecessorRefiner: 1/0 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1745ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 527 ms.
Support contains 110 out of 385 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 800/800 transitions.
Applied a total of 0 rules in 20 ms. Remains 385 /385 variables (removed 0) and now considering 800/800 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 385/385 places, 800/800 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 385/385 places, 800/800 transitions.
Applied a total of 0 rules in 7 ms. Remains 385 /385 variables (removed 0) and now considering 800/800 (removed 0) transitions.
[2026-05-22 17:34:08] [INFO ] Invariant cache hit.
[2026-05-22 17:34:08] [INFO ] Implicit Places using invariants in 245 ms returned []
[2026-05-22 17:34:08] [INFO ] Invariant cache hit.
[2026-05-22 17:34:09] [INFO ] State equation strengthened by 4 read => feed constraints.
[2026-05-22 17:34:09] [INFO ] Implicit Places using invariants and state equation in 662 ms returned []
Implicit Place search using SMT with State Equation took 908 ms to find 0 implicit places.
[2026-05-22 17:34:09] [INFO ] Redundant transitions in 5 ms returned []
Running 799 sub problems to find dead transitions.
[2026-05-22 17:34:09] [INFO ] Invariant cache hit.
[2026-05-22 17:34:09] [INFO ] State equation strengthened by 4 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/384 variables, 32/32 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/384 variables, 0/32 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 2 (OVERLAPS) 1/385 variables, 11/43 constraints. Problems are: Problem set: 0 solved, 799 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/385 variables, 12/55 constraints. Problems are: Problem set: 0 solved, 799 unsolved
SMT process timed out in 30355ms, After SMT, problems are : Problem set: 0 solved, 799 unsolved
Search for dead transitions found 0 dead transitions in 30356ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31284 ms. Remains : 385/385 places, 800/800 transitions.
Attempting over-approximation, by ignoring read arcs.
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 385 transition count 799
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 384 transition count 799
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 384 transition count 798
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 4 place count 383 transition count 798
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 5 place count 383 transition count 797
Applied a total of 5 rules in 58 ms. Remains 383 /385 variables (removed 2) and now considering 797/800 (removed 3) transitions.
Running SMT prover for 1 properties.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-10391106080223858475.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-8532338603059068584.kers'
[2026-05-22 17:34:39] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-10391106080223858475.kers, --Pflows, --basisKERS=/tmp/petrispot-output-8532338603059068584.kers]
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 1 columns in 0 ms.
// Phase 1: matrix 797 rows 382 cols 3153 entries
Finished phase 1 with 155 SingleSign rule and 173 generalized
[2026-05-22 17:34:39] [INFO ] Computed 55 invariants in 3 ms
Computed 55 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-8532338603059068584.kers
Total runtime 4 ms.
[2026-05-22 17:34:40] [INFO ] After 125ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2026-05-22 17:34:40] [INFO ] [Nat]Absence check using 11 positive place invariants in 27 ms returned sat
[2026-05-22 17:34:40] [INFO ] [Nat]Absence check using 11 positive and 44 generalized place invariants in 13 ms returned sat
[2026-05-22 17:34:41] [INFO ] After 852ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
[2026-05-22 17:34:41] [INFO ] After 1162ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2026-05-22 17:34:41] [INFO ] After 1520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2026-05-22 17:34:41] [INFO ] Flatten gal took : 69 ms
[2026-05-22 17:34:41] [INFO ] Flatten gal took : 41 ms
[2026-05-22 17:34:41] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17852375270379164329.gal : 8 ms
[2026-05-22 17:34:41] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5120153656734494044.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/ReachabilityCardinality17852375270379164329.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5120153656734494044.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/ReachabilityCardinality5120153656734494044.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 3
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :3 after 6
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :6 after 8
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :8 after 19
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :19 after 31
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :31 after 2341
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :2341 after 4666
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :4666 after 4720
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :4720 after 24844
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :24844 after 223718
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :223718 after 970110
Detected timeout of ITS tools.
[2026-05-22 17:34:56] [INFO ] Flatten gal took : 66 ms
[2026-05-22 17:34:56] [INFO ] Applying decomposition
[2026-05-22 17:34:56] [INFO ] Flatten gal took : 30 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/graph657316928340653242.txt' '-o' '/tmp/graph657316928340653242.bin' '-w' '/tmp/graph657316928340653242.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph657316928340653242.bin' '-l' '-1' '-v' '-w' '/tmp/graph657316928340653242.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:34:57] [INFO ] Decomposing Gal with order
[2026-05-22 17:34:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:34:57] [INFO ] Removed a total of 1477 redundant transitions.
[2026-05-22 17:34:57] [INFO ] Flatten gal took : 153 ms
[2026-05-22 17:34:57] [INFO ] Fuse similar labels procedure discarded/fused a total of 62 labels/synchronizations in 41 ms.
[2026-05-22 17:34:57] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality10436053489904220027.gal : 20 ms
[2026-05-22 17:34:57] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality473872458111680246.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/ReachabilityCardinality10436053489904220027.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality473872458111680246.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/ReachabilityCardinality473872458111680246.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :1 after 12
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :12 after 3541
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :3541 after 119899
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :119899 after 1.06074e+06
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :1.06074e+06 after 2.49493e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.01758e+07 after 2.16773e+07
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :1.66166e+08 after 1.79575e+08
Detected timeout of ITS tools.
Over-approximation ignoring read arcs solved 0 properties in 32706 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2026-05-22 17:35:12] [INFO ] Flatten gal took : 26 ms
[2026-05-22 17:35:12] [INFO ] Applying decomposition
[2026-05-22 17:35:12] [INFO ] Flatten gal took : 25 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/graph5162344460906399557.txt' '-o' '/tmp/graph5162344460906399557.bin' '-w' '/tmp/graph5162344460906399557.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202604301425/bin/louvain-linux64' '/tmp/graph5162344460906399557.bin' '-l' '-1' '-v' '-w' '/tmp/graph5162344460906399557.weights' '-q' '0' '-e' '0.001'
[2026-05-22 17:35:12] [INFO ] Decomposing Gal with order
[2026-05-22 17:35:12] [INFO ] Rewriting arrays to variables to allow decomposition.
[2026-05-22 17:35:12] [INFO ] Removed a total of 1513 redundant transitions.
[2026-05-22 17:35:12] [INFO ] Flatten gal took : 52 ms
[2026-05-22 17:35:12] [INFO ] Fuse similar labels procedure discarded/fused a total of 56 labels/synchronizations in 24 ms.
[2026-05-22 17:35:12] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17258416062228191455.gal : 9 ms
[2026-05-22 17:35:12] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality16773340547952386686.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/ReachabilityCardinality17258416062228191455.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality16773340547952386686.prop' '--nowitness'

its-reach command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202604301425/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...309
Loading property file /tmp/ReachabilityCardinality16773340547952386686.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :1 after 8
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :8 after 2.57264e+06
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :2.57264e+06 after 8.49863e+06
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :8.49863e+06 after 9.10802e+07
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9.10802e+07 after 3.0535e+08
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :3.0535e+08 after 7.54987e+08
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.29496e+09 after 5.90734e+09
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :2.95401e+10 after 1.23411e+11
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,8.8673e+12,101.479,1293076,5573,1778,1.9839e+06,44013,2243,5.84948e+06,419,311720,0
Total reachable state count : 8867298448856

Verifying 1 reachability properties.
Invariant property ASLink-PT-02a-ReachabilityFireability-2024-03 does not hold.
FORMULA ASLink-PT-02a-ReachabilityFireability-2024-03 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN

Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
ASLink-PT-02a-ReachabilityFireability-2024-03,5.29203e+08,101.908,1293076,1290,442,1.9839e+06,44013,2630,5.84948e+06,443,311720,32113
All properties solved without resorting to model-checking.
Total runtime 363877 ms.

BK_STOP 1779471415045

--------------------
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
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202604301425.jar
++ perl -pe 's/.*\.//g'
++ sed s/.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-02a"
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-02a, 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-177944366100303"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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