Execution Chart

We display below the execution chart for this examination (boot time has been removed).

Trace from the execution

Formatting '/data/fkordon/mcc2026-input.r338-smll-178021499300430.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2026-input.qcow2 backing_fmt=qcow2 cluster_size=65536 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 FileSystem-PT-N02I15B15, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r338-smll-178021499300430
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.1M
-rw-r--r-- 1 mcc users 6.5K May 27 10:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 54K May 27 10:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.7K May 27 10:19 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K May 27 10:19 CTLFireability.xml
-rw-r--r-- 1 mcc users 45K May 27 10:48 LTLCardinality.txt
-rw-r--r-- 1 mcc users 157K May 27 10:48 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.7K May 27 10:48 LTLFireability.txt
-rw-r--r-- 1 mcc users 20K May 27 10:48 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 May 26 18:17 NewModel
-rw-r--r-- 1 mcc users 4.5K May 27 10:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 25K May 27 10:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K May 27 10:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 42K May 27 10:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 17K May 27 10:48 UpperBounds.txt
-rw-r--r-- 1 mcc users 39K May 27 10:48 UpperBounds.xml
-rw-r--r-- 1 mcc users 5 May 26 18:17 equiv_col
-rw-r--r-- 1 mcc users 10 May 26 18:17 instance
-rw-r--r-- 1 mcc users 6 May 26 18:17 iscolored
-rw-r--r-- 1 mcc users 524K Jun 10 11:57 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 FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-00
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-01
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-02
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-03
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-04
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-05
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-06
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-07
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-08
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-09
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-10
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-11
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-12
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-13
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-14
FORMULA_NAME FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-15

=== Now, execution of the tool begins

BK_START 1781104593148

Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FileSystem-PT-N02I15B15
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202604301425
[2026-06-10 15:16:35] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2026-06-10 15:16:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2026-06-10 15:16:36] [INFO ] Load time of PNML (sax parser for PT used): 322 ms
[2026-06-10 15:16:36] [INFO ] Transformed 1216 places.
[2026-06-10 15:16:36] [INFO ] Transformed 1155 transitions.
[2026-06-10 15:16:36] [INFO ] Parsed PT model containing 1216 places and 1155 transitions and 4125 arcs in 569 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 21 ms.
Working with output stream class java.io.PrintStream
Reduce places removed 15 places and 0 transitions.
RANDOM walk for 40000 steps (524 resets) in 2913 ms. (13 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 79 ms. (50 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (10 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 45 ms. (87 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 49 ms. (80 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 69 ms. (57 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 94 ms. (42 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 59 ms. (66 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (10 resets) in 56 ms. (70 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 76 ms. (52 steps per ms) remains 16/16 properties
[2026-06-10 15:16:37] [INFO ] Flatten gal took : 464 ms
BEST_FIRST walk for 4003 steps (11 resets) in 41 ms. (95 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4002 steps (9 resets) in 44 ms. (88 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 28 ms. (138 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4004 steps (12 resets) in 33 ms. (117 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (12 resets) in 32 ms. (121 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (11 resets) in 31 ms. (125 steps per ms) remains 16/16 properties
BEST_FIRST walk for 4003 steps (9 resets) in 26 ms. (148 steps per ms) remains 16/16 properties
[2026-06-10 15:16:37] [INFO ] Flatten gal took : 147 ms
[2026-06-10 15:16:37] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality17229027272604918683.gal : 79 ms
[2026-06-10 15:16:37] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality6704547322311349613.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/ReachabilityCardinality17229027272604918683.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality6704547322311349613.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/ReachabilityCardinality6704547322311349613.prop.
SDD proceeding with computation,16 properties remain. new max is 4
SDD size :1 after 11
SDD proceeding with computation,16 properties remain. new max is 8
SDD size :11 after 14
SDD proceeding with computation,16 properties remain. new max is 16
SDD size :14 after 16
SDD proceeding with computation,16 properties remain. new max is 32
SDD size :16 after 18
SDD proceeding with computation,16 properties remain. new max is 64
SDD size :18 after 21
SDD proceeding with computation,16 properties remain. new max is 128
SDD size :21 after 24
SDD proceeding with computation,16 properties remain. new max is 256
SDD size :24 after 29
SDD proceeding with computation,16 properties remain. new max is 512
SDD size :29 after 335
SDD proceeding with computation,16 properties remain. new max is 1024
SDD size :335 after 404
SDD proceeding with computation,16 properties remain. new max is 2048
SDD size :404 after 451
Interrupted probabilistic random walk after 141555 steps, run timeout after 3001 ms. (steps per millisecond=47 ) properties seen :0 out of 16
Probabilistic random walk after 141555 steps, saw 43630 distinct states, run finished after 3011 ms. (steps per millisecond=47 ) 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-11900862000481925353.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-504493790658556458.kers'
[2026-06-10 15:16:40] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-11900862000481925353.kers, --Pflows, --basisKERS=/tmp/petrispot-output-504493790658556458.kers]
Culling duplicate invariants (modulo rational): removing 15 columns.
Culled 15 columns in 1 ms.
// Phase 1: matrix 1155 rows 1186 cols 3450 entries
Finished phase 1 with 930 SingleSign rule and 210 generalized
[2026-06-10 15:16:40] [INFO ] Computed 61 invariants in 22 ms
Computed 61 P flows in 23 ms.
Exported basis to /tmp/petrispot-output-504493790658556458.kers
Total runtime 26 ms.
[2026-06-10 15:16:40] [INFO ] State equation strengthened by 225 read => feed constraints.
SDD proceeding with computation,16 properties remain. new max is 4096
SDD size :451 after 2595
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/61 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 16 unsolved
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-04 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-04 FALSE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-06 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-06 TRUE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-07 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-07 FALSE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-10 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-10 TRUE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-11 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-11 FALSE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-13 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-13 TRUE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-14 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-14 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 1 (OVERLAPS) 1097/1158 variables, 30/30 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/1158 variables, 0/30 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 30/1188 variables, 16/46 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/1188 variables, 2/48 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/1188 variables, 0/48 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 13/1201 variables, 13/61 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/1201 variables, 0/61 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 8 (OVERLAPS) 1155/2356 variables, 1201/1262 constraints. Problems are: Problem set: 7 solved, 9 unsolved
SDD proceeding with computation,16 properties remain. new max is 8192
SDD size :2595 after 7462
At refinement iteration 9 (INCLUDED_ONLY) 0/2356 variables, 225/1487 constraints. Problems are: Problem set: 7 solved, 9 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 2356/2356 variables, and 1487 constraints, problems are : Problem set: 7 solved, 9 unsolved in 5052 ms.
Refiners :[Positive P Invariants (semi-flows): 46/46 constraints, Generalized P Invariants (flows): 15/15 constraints, State Equation: 1201/1201 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 16/16 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 7 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 7 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 1075/1107 variables, 22/22 constraints. Problems are: Problem set: 7 solved, 9 unsolved
SDD proceeding with computation,16 properties remain. new max is 16384
SDD size :7462 after 17396
SMT process timed out in 10505ms, After SMT, problems are : Problem set: 7 solved, 9 unsolved
Fused 9 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 32 out of 1201 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1201/1201 places, 1155/1155 transitions.
Graph (complete) has 2760 edges and 1201 vertex of which 983 are kept as prefixes of interest. Removing 218 places using SCC suffix rule.8 ms
Discarding 218 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 983 transition count 1140
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 968 transition count 1140
Discarding 195 places :
Symmetric choice reduction at 2 with 195 rule applications. Total rules 226 place count 773 transition count 945
Iterating global reduction 2 with 195 rules applied. Total rules applied 421 place count 773 transition count 945
Performed 228 Post agglomeration using F-continuation condition.Transition count delta: 228
Deduced a syphon composed of 228 places in 1 ms
Reduce places removed 228 places and 0 transitions.
Iterating global reduction 2 with 456 rules applied. Total rules applied 877 place count 545 transition count 717
Free-agglomeration rule (complex) applied 218 times.
Iterating global reduction 2 with 218 rules applied. Total rules applied 1095 place count 545 transition count 499
Reduce places removed 222 places and 0 transitions.
Iterating post reduction 2 with 222 rules applied. Total rules applied 1317 place count 323 transition count 499
Applied a total of 1317 rules in 424 ms. Remains 323 /1201 variables (removed 878) and now considering 499/1155 (removed 656) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 438 ms. Remains : 323/1201 places, 499/1155 transitions.
RANDOM walk for 40000 steps (1212 resets) in 819 ms. (48 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (192 resets) in 309 ms. (129 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (192 resets) in 215 ms. (185 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (193 resets) in 156 ms. (254 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (193 resets) in 125 ms. (317 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (192 resets) in 175 ms. (227 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (192 resets) in 173 ms. (229 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (192 resets) in 153 ms. (259 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40003 steps (192 resets) in 167 ms. (238 steps per ms) remains 9/9 properties
BEST_FIRST walk for 40004 steps (192 resets) in 151 ms. (263 steps per ms) remains 9/9 properties
Interrupted probabilistic random walk after 344909 steps, run timeout after 3001 ms. (steps per millisecond=114 ) properties seen :0 out of 9
Probabilistic random walk after 344909 steps, saw 85736 distinct states, run finished after 3001 ms. (steps per millisecond=114 ) 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-15091709649742015412.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-10528912938409302141.kers'
[2026-06-10 15:16:55] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-15091709649742015412.kers, --Pflows, --basisKERS=/tmp/petrispot-output-10528912938409302141.kers]
Culling duplicate invariants (modulo rational): removing 16 columns.
Culled 16 columns in 0 ms.
// Phase 1: matrix 499 rows 307 cols 1314 entries
Finished phase 1 with 294 SingleSign rule and 1 generalized
[2026-06-10 15:16:55] [INFO ] Computed 28 invariants in 4 ms
Computed 28 P flows in 4 ms.
Exported basis to /tmp/petrispot-output-10528912938409302141.kers
Total runtime 5 ms.
[2026-06-10 15:16:55] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 22/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 253/307 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 16/323 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/323 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 499/822 variables, 323/351 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/822 variables, 225/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/822 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 10 (OVERLAPS) 0/822 variables, 0/576 constraints. Problems are: Problem set: 0 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 822/822 variables, and 576 constraints, problems are : Problem set: 0 solved, 9 unsolved in 1659 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 9/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 9 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/32 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 1 (OVERLAPS) 22/54 variables, 10/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/54 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 3 (OVERLAPS) 253/307 variables, 2/12 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/307 variables, 16/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/307 variables, 0/28 constraints. Problems are: Problem set: 0 solved, 9 unsolved
At refinement iteration 6 (OVERLAPS) 16/323 variables, 16/44 constraints. Problems are: Problem set: 0 solved, 9 unsolved
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-01 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-05 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-05 TRUE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-09 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-09 TRUE TECHNIQUES SMT_REFINEMENT
Problem FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-15 is UNSAT
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-15 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 7 (INCLUDED_ONLY) 0/323 variables, 18/62 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/323 variables, 13/75 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/323 variables, 3/78 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/323 variables, 2/80 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/323 variables, 0/80 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 499/822 variables, 323/403 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/822 variables, 225/628 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/822 variables, 5/633 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/822 variables, 0/633 constraints. Problems are: Problem set: 4 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 0/822 variables, 0/633 constraints. Problems are: Problem set: 4 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 822/822 variables, and 633 constraints, problems are : Problem set: 4 solved, 5 unsolved in 12713 ms.
Refiners :[Positive P Invariants (semi-flows): 26/26 constraints, Generalized P Invariants (flows): 2/2 constraints, State Equation: 323/323 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 52/52 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 14407ms problems are : Problem set: 4 solved, 5 unsolved
Parikh walk visited 0 properties in 1047 ms.
Support contains 6 out of 323 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 323/323 places, 499/499 transitions.
Graph (complete) has 1260 edges and 323 vertex of which 318 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 0 output transitions
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 3 place count 316 transition count 497
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 316 transition count 497
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 1 ms
Reduce places removed 22 places and 0 transitions.
Iterating global reduction 0 with 41 rules applied. Total rules applied 46 place count 294 transition count 478
Free-agglomeration rule (complex) applied 7 times.
Iterating global reduction 0 with 7 rules applied. Total rules applied 53 place count 294 transition count 471
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 63 place count 284 transition count 471
Applied a total of 63 rules in 89 ms. Remains 284 /323 variables (removed 39) and now considering 471/499 (removed 28) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 89 ms. Remains : 284/323 places, 471/499 transitions.
RANDOM walk for 40000 steps (1248 resets) in 260 ms. (153 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (195 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (196 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (196 resets) in 97 ms. (408 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (196 resets) in 71 ms. (555 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (196 resets) in 80 ms. (493 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 462508 steps, run timeout after 3001 ms. (steps per millisecond=154 ) properties seen :0 out of 5
Probabilistic random walk after 462508 steps, saw 109379 distinct states, run finished after 3001 ms. (steps per millisecond=154 ) 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-14704368207766224914.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9949626079893516020.kers'
[2026-06-10 15:17:14] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-14704368207766224914.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9949626079893516020.kers]
Culling duplicate invariants (modulo rational): removing 19 columns.
Culled 19 columns in 0 ms.
// Phase 1: matrix 471 rows 265 cols 1188 entries
Finished phase 1 with 262 SingleSign rule and 0 generalized
[2026-06-10 15:17:14] [INFO ] Computed 22 invariants in 3 ms
Computed 22 P flows in 3 ms.
Exported basis to /tmp/petrispot-output-9949626079893516020.kers
Total runtime 4 ms.
[2026-06-10 15:17:14] [INFO ] State equation strengthened by 225 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 232/238 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/269 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 20/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/27 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/284 variables, 15/42 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 7/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 0/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (OVERLAPS) 471/755 variables, 284/333 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/755 variables, 225/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/755 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 0/755 variables, 0/558 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 558 constraints, problems are : Problem set: 0 solved, 5 unsolved in 5456 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 284/284 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 27/27 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 232/238 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/238 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 31/269 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/269 variables, 24/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/269 variables, 0/31 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 15/284 variables, 15/46 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/284 variables, 3/49 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/284 variables, 20/69 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/284 variables, 20/89 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/284 variables, 20/109 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/284 variables, 1/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/284 variables, 0/110 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 471/755 variables, 284/394 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/755 variables, 225/619 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/755 variables, 5/624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/755 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/755 variables, 0/624 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 624 constraints, problems are : Problem set: 0 solved, 5 unsolved in 13261 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 284/284 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 88/88 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 18740ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 634 ms.
Support contains 6 out of 284 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 471/471 transitions.
Applied a total of 0 rules in 23 ms. Remains 284 /284 variables (removed 0) and now considering 471/471 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 284/284 places, 471/471 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 284/284 places, 471/471 transitions.
Applied a total of 0 rules in 15 ms. Remains 284 /284 variables (removed 0) and now considering 471/471 (removed 0) transitions.
[2026-06-10 15:17:33] [INFO ] Invariant cache hit.
[2026-06-10 15:17:34] [INFO ] Implicit Places using invariants in 689 ms returned []
[2026-06-10 15:17:34] [INFO ] Invariant cache hit.
[2026-06-10 15:17:34] [INFO ] State equation strengthened by 225 read => feed constraints.
[2026-06-10 15:17:36] [INFO ] Implicit Places using invariants and state equation in 2375 ms returned []
Implicit Place search using SMT with State Equation took 3077 ms to find 0 implicit places.
[2026-06-10 15:17:36] [INFO ] Redundant transitions in 32 ms returned []
Running 456 sub problems to find dead transitions.
[2026-06-10 15:17:36] [INFO ] Invariant cache hit.
[2026-06-10 15:17:36] [INFO ] State equation strengthened by 225 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/266 variables, 20/20 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/266 variables, 0/20 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 2 (OVERLAPS) 16/282 variables, 2/22 constraints. Problems are: Problem set: 0 solved, 456 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 20/42 constraints. Problems are: Problem set: 0 solved, 456 unsolved
Problem TDEAD21 is UNSAT
Problem TDEAD22 is UNSAT
Problem TDEAD23 is UNSAT
Problem TDEAD24 is UNSAT
Problem TDEAD25 is UNSAT
Problem TDEAD26 is UNSAT
Problem TDEAD28 is UNSAT
Problem TDEAD29 is UNSAT
Problem TDEAD30 is UNSAT
Problem TDEAD31 is UNSAT
Problem TDEAD32 is UNSAT
Problem TDEAD33 is UNSAT
Problem TDEAD34 is UNSAT
Problem TDEAD35 is UNSAT
Problem TDEAD36 is UNSAT
Problem TDEAD37 is UNSAT
Problem TDEAD38 is UNSAT
Problem TDEAD39 is UNSAT
Problem TDEAD40 is UNSAT
Problem TDEAD41 is UNSAT
Problem TDEAD42 is UNSAT
Problem TDEAD43 is UNSAT
Problem TDEAD44 is UNSAT
Problem TDEAD45 is UNSAT
Problem TDEAD46 is UNSAT
Problem TDEAD47 is UNSAT
Problem TDEAD48 is UNSAT
Problem TDEAD49 is UNSAT
Problem TDEAD50 is UNSAT
Problem TDEAD51 is UNSAT
Problem TDEAD52 is UNSAT
Problem TDEAD53 is UNSAT
Problem TDEAD54 is UNSAT
Problem TDEAD55 is UNSAT
Problem TDEAD56 is UNSAT
Problem TDEAD57 is UNSAT
Problem TDEAD58 is UNSAT
Problem TDEAD59 is UNSAT
Problem TDEAD60 is UNSAT
Problem TDEAD62 is UNSAT
Problem TDEAD63 is UNSAT
Problem TDEAD64 is UNSAT
Problem TDEAD65 is UNSAT
Problem TDEAD66 is UNSAT
Problem TDEAD67 is UNSAT
Problem TDEAD68 is UNSAT
Problem TDEAD69 is UNSAT
Problem TDEAD70 is UNSAT
Problem TDEAD71 is UNSAT
Problem TDEAD72 is UNSAT
Problem TDEAD73 is UNSAT
Problem TDEAD74 is UNSAT
Problem TDEAD75 is UNSAT
Problem TDEAD76 is UNSAT
Problem TDEAD77 is UNSAT
Problem TDEAD78 is UNSAT
Problem TDEAD79 is UNSAT
Problem TDEAD80 is UNSAT
Problem TDEAD81 is UNSAT
Problem TDEAD82 is UNSAT
Problem TDEAD83 is UNSAT
Problem TDEAD84 is UNSAT
Problem TDEAD85 is UNSAT
Problem TDEAD86 is UNSAT
Problem TDEAD87 is UNSAT
Problem TDEAD88 is UNSAT
Problem TDEAD89 is UNSAT
Problem TDEAD90 is UNSAT
Problem TDEAD91 is UNSAT
Problem TDEAD92 is UNSAT
Problem TDEAD93 is UNSAT
Problem TDEAD94 is UNSAT
Problem TDEAD96 is UNSAT
Problem TDEAD97 is UNSAT
Problem TDEAD98 is UNSAT
Problem TDEAD99 is UNSAT
Problem TDEAD100 is UNSAT
Problem TDEAD101 is UNSAT
Problem TDEAD102 is UNSAT
Problem TDEAD103 is UNSAT
Problem TDEAD104 is UNSAT
Problem TDEAD105 is UNSAT
Problem TDEAD106 is UNSAT
Problem TDEAD107 is UNSAT
Problem TDEAD108 is UNSAT
Problem TDEAD109 is UNSAT
Problem TDEAD110 is UNSAT
Problem TDEAD111 is UNSAT
Problem TDEAD112 is UNSAT
Problem TDEAD113 is UNSAT
Problem TDEAD114 is UNSAT
Problem TDEAD115 is UNSAT
Problem TDEAD116 is UNSAT
Problem TDEAD117 is UNSAT
Problem TDEAD118 is UNSAT
Problem TDEAD119 is UNSAT
Problem TDEAD120 is UNSAT
Problem TDEAD121 is UNSAT
Problem TDEAD122 is UNSAT
Problem TDEAD123 is UNSAT
Problem TDEAD124 is UNSAT
Problem TDEAD126 is UNSAT
Problem TDEAD127 is UNSAT
Problem TDEAD128 is UNSAT
Problem TDEAD129 is UNSAT
Problem TDEAD130 is UNSAT
Problem TDEAD131 is UNSAT
Problem TDEAD132 is UNSAT
Problem TDEAD133 is UNSAT
Problem TDEAD134 is UNSAT
Problem TDEAD135 is UNSAT
Problem TDEAD136 is UNSAT
Problem TDEAD137 is UNSAT
Problem TDEAD138 is UNSAT
Problem TDEAD139 is UNSAT
Problem TDEAD140 is UNSAT
Problem TDEAD141 is UNSAT
Problem TDEAD142 is UNSAT
Problem TDEAD143 is UNSAT
Problem TDEAD144 is UNSAT
Problem TDEAD145 is UNSAT
Problem TDEAD146 is UNSAT
Problem TDEAD147 is UNSAT
Problem TDEAD148 is UNSAT
Problem TDEAD149 is UNSAT
Problem TDEAD150 is UNSAT
Problem TDEAD151 is UNSAT
Problem TDEAD152 is UNSAT
Problem TDEAD153 is UNSAT
Problem TDEAD154 is UNSAT
Problem TDEAD155 is UNSAT
Problem TDEAD156 is UNSAT
Problem TDEAD157 is UNSAT
Problem TDEAD158 is UNSAT
Problem TDEAD159 is UNSAT
Problem TDEAD160 is UNSAT
Problem TDEAD161 is UNSAT
Problem TDEAD162 is UNSAT
Problem TDEAD163 is UNSAT
Problem TDEAD164 is UNSAT
Problem TDEAD165 is UNSAT
Problem TDEAD166 is UNSAT
Problem TDEAD167 is UNSAT
Problem TDEAD168 is UNSAT
Problem TDEAD169 is UNSAT
Problem TDEAD170 is UNSAT
Problem TDEAD171 is UNSAT
Problem TDEAD172 is UNSAT
Problem TDEAD173 is UNSAT
Problem TDEAD174 is UNSAT
Problem TDEAD175 is UNSAT
Problem TDEAD176 is UNSAT
Problem TDEAD177 is UNSAT
Problem TDEAD178 is UNSAT
Problem TDEAD179 is UNSAT
Problem TDEAD180 is UNSAT
Problem TDEAD181 is UNSAT
Problem TDEAD182 is UNSAT
Problem TDEAD183 is UNSAT
Problem TDEAD184 is UNSAT
Problem TDEAD186 is UNSAT
Problem TDEAD187 is UNSAT
Problem TDEAD188 is UNSAT
Problem TDEAD190 is UNSAT
Problem TDEAD191 is UNSAT
Problem TDEAD192 is UNSAT
Problem TDEAD193 is UNSAT
Problem TDEAD194 is UNSAT
Problem TDEAD195 is UNSAT
Problem TDEAD196 is UNSAT
Problem TDEAD197 is UNSAT
Problem TDEAD198 is UNSAT
Problem TDEAD199 is UNSAT
Problem TDEAD200 is UNSAT
Problem TDEAD201 is UNSAT
Problem TDEAD202 is UNSAT
Problem TDEAD203 is UNSAT
Problem TDEAD204 is UNSAT
Problem TDEAD205 is UNSAT
Problem TDEAD206 is UNSAT
Problem TDEAD207 is UNSAT
Problem TDEAD208 is UNSAT
Problem TDEAD209 is UNSAT
Problem TDEAD210 is UNSAT
Problem TDEAD211 is UNSAT
Problem TDEAD212 is UNSAT
Problem TDEAD213 is UNSAT
Problem TDEAD214 is UNSAT
Problem TDEAD215 is UNSAT
Problem TDEAD216 is UNSAT
Problem TDEAD217 is UNSAT
Problem TDEAD218 is UNSAT
Problem TDEAD220 is UNSAT
Problem TDEAD221 is UNSAT
Problem TDEAD222 is UNSAT
Problem TDEAD223 is UNSAT
Problem TDEAD224 is UNSAT
Problem TDEAD225 is UNSAT
Problem TDEAD226 is UNSAT
Problem TDEAD227 is UNSAT
Problem TDEAD228 is UNSAT
Problem TDEAD229 is UNSAT
Problem TDEAD230 is UNSAT
Problem TDEAD231 is UNSAT
Problem TDEAD232 is UNSAT
Problem TDEAD233 is UNSAT
Problem TDEAD234 is UNSAT
Problem TDEAD235 is UNSAT
Problem TDEAD236 is UNSAT
Problem TDEAD237 is UNSAT
Problem TDEAD238 is UNSAT
Problem TDEAD239 is UNSAT
Problem TDEAD240 is UNSAT
Problem TDEAD241 is UNSAT
Problem TDEAD242 is UNSAT
Problem TDEAD243 is UNSAT
Problem TDEAD244 is UNSAT
Problem TDEAD245 is UNSAT
Problem TDEAD246 is UNSAT
Problem TDEAD247 is UNSAT
Problem TDEAD248 is UNSAT
Problem TDEAD250 is UNSAT
Problem TDEAD251 is UNSAT
Problem TDEAD252 is UNSAT
Problem TDEAD253 is UNSAT
Problem TDEAD254 is UNSAT
Problem TDEAD255 is UNSAT
Problem TDEAD256 is UNSAT
Problem TDEAD257 is UNSAT
Problem TDEAD258 is UNSAT
Problem TDEAD259 is UNSAT
Problem TDEAD260 is UNSAT
Problem TDEAD261 is UNSAT
Problem TDEAD262 is UNSAT
Problem TDEAD263 is UNSAT
Problem TDEAD264 is UNSAT
Problem TDEAD265 is UNSAT
Problem TDEAD266 is UNSAT
Problem TDEAD267 is UNSAT
Problem TDEAD268 is UNSAT
Problem TDEAD269 is UNSAT
Problem TDEAD270 is UNSAT
Problem TDEAD271 is UNSAT
Problem TDEAD272 is UNSAT
Problem TDEAD273 is UNSAT
Problem TDEAD274 is UNSAT
Problem TDEAD275 is UNSAT
Problem TDEAD276 is UNSAT
Problem TDEAD277 is UNSAT
Problem TDEAD278 is UNSAT
Problem TDEAD279 is UNSAT
Problem TDEAD280 is UNSAT
Problem TDEAD281 is UNSAT
Problem TDEAD282 is UNSAT
Problem TDEAD284 is UNSAT
Problem TDEAD285 is UNSAT
Problem TDEAD286 is UNSAT
Problem TDEAD287 is UNSAT
Problem TDEAD288 is UNSAT
Problem TDEAD289 is UNSAT
Problem TDEAD290 is UNSAT
Problem TDEAD291 is UNSAT
Problem TDEAD292 is UNSAT
Problem TDEAD293 is UNSAT
Problem TDEAD294 is UNSAT
Problem TDEAD295 is UNSAT
Problem TDEAD296 is UNSAT
Problem TDEAD297 is UNSAT
Problem TDEAD298 is UNSAT
Problem TDEAD299 is UNSAT
Problem TDEAD300 is UNSAT
Problem TDEAD301 is UNSAT
Problem TDEAD302 is UNSAT
Problem TDEAD303 is UNSAT
Problem TDEAD304 is UNSAT
Problem TDEAD305 is UNSAT
Problem TDEAD306 is UNSAT
Problem TDEAD307 is UNSAT
Problem TDEAD308 is UNSAT
Problem TDEAD309 is UNSAT
Problem TDEAD310 is UNSAT
Problem TDEAD311 is UNSAT
Problem TDEAD312 is UNSAT
Problem TDEAD313 is UNSAT
Problem TDEAD314 is UNSAT
Problem TDEAD316 is UNSAT
Problem TDEAD317 is UNSAT
Problem TDEAD318 is UNSAT
Problem TDEAD319 is UNSAT
Problem TDEAD320 is UNSAT
Problem TDEAD321 is UNSAT
Problem TDEAD322 is UNSAT
Problem TDEAD323 is UNSAT
Problem TDEAD324 is UNSAT
Problem TDEAD325 is UNSAT
Problem TDEAD326 is UNSAT
Problem TDEAD327 is UNSAT
Problem TDEAD328 is UNSAT
Problem TDEAD329 is UNSAT
Problem TDEAD330 is UNSAT
Problem TDEAD331 is UNSAT
Problem TDEAD332 is UNSAT
Problem TDEAD333 is UNSAT
Problem TDEAD334 is UNSAT
Problem TDEAD335 is UNSAT
Problem TDEAD336 is UNSAT
Problem TDEAD337 is UNSAT
Problem TDEAD338 is UNSAT
Problem TDEAD339 is UNSAT
Problem TDEAD340 is UNSAT
Problem TDEAD341 is UNSAT
Problem TDEAD342 is UNSAT
Problem TDEAD343 is UNSAT
Problem TDEAD344 is UNSAT
Problem TDEAD345 is UNSAT
Problem TDEAD347 is UNSAT
Problem TDEAD348 is UNSAT
Problem TDEAD349 is UNSAT
Problem TDEAD350 is UNSAT
Problem TDEAD351 is UNSAT
Problem TDEAD352 is UNSAT
Problem TDEAD353 is UNSAT
Problem TDEAD354 is UNSAT
Problem TDEAD355 is UNSAT
Problem TDEAD356 is UNSAT
Problem TDEAD357 is UNSAT
Problem TDEAD358 is UNSAT
Problem TDEAD359 is UNSAT
Problem TDEAD360 is UNSAT
Problem TDEAD361 is UNSAT
Problem TDEAD362 is UNSAT
Problem TDEAD363 is UNSAT
Problem TDEAD364 is UNSAT
Problem TDEAD365 is UNSAT
Problem TDEAD366 is UNSAT
Problem TDEAD367 is UNSAT
Problem TDEAD368 is UNSAT
Problem TDEAD369 is UNSAT
Problem TDEAD370 is UNSAT
Problem TDEAD371 is UNSAT
Problem TDEAD372 is UNSAT
Problem TDEAD373 is UNSAT
Problem TDEAD374 is UNSAT
Problem TDEAD376 is UNSAT
Problem TDEAD377 is UNSAT
Problem TDEAD378 is UNSAT
Problem TDEAD379 is UNSAT
Problem TDEAD380 is UNSAT
Problem TDEAD381 is UNSAT
Problem TDEAD382 is UNSAT
Problem TDEAD383 is UNSAT
Problem TDEAD384 is UNSAT
Problem TDEAD385 is UNSAT
Problem TDEAD386 is UNSAT
Problem TDEAD387 is UNSAT
Problem TDEAD388 is UNSAT
Problem TDEAD389 is UNSAT
Problem TDEAD390 is UNSAT
Problem TDEAD391 is UNSAT
Problem TDEAD392 is UNSAT
Problem TDEAD393 is UNSAT
Problem TDEAD394 is UNSAT
Problem TDEAD395 is UNSAT
Problem TDEAD396 is UNSAT
Problem TDEAD397 is UNSAT
Problem TDEAD398 is UNSAT
Problem TDEAD399 is UNSAT
Problem TDEAD400 is UNSAT
Problem TDEAD401 is UNSAT
Problem TDEAD402 is UNSAT
Problem TDEAD403 is UNSAT
Problem TDEAD404 is UNSAT
Problem TDEAD405 is UNSAT
Problem TDEAD406 is UNSAT
Problem TDEAD407 is UNSAT
Problem TDEAD409 is UNSAT
Problem TDEAD410 is UNSAT
Problem TDEAD411 is UNSAT
Problem TDEAD413 is UNSAT
Problem TDEAD414 is UNSAT
Problem TDEAD415 is UNSAT
Problem TDEAD416 is UNSAT
Problem TDEAD417 is UNSAT
Problem TDEAD418 is UNSAT
Problem TDEAD419 is UNSAT
Problem TDEAD420 is UNSAT
Problem TDEAD421 is UNSAT
Problem TDEAD422 is UNSAT
Problem TDEAD423 is UNSAT
Problem TDEAD424 is UNSAT
Problem TDEAD425 is UNSAT
Problem TDEAD426 is UNSAT
Problem TDEAD427 is UNSAT
Problem TDEAD428 is UNSAT
Problem TDEAD429 is UNSAT
Problem TDEAD430 is UNSAT
Problem TDEAD431 is UNSAT
Problem TDEAD432 is UNSAT
Problem TDEAD433 is UNSAT
Problem TDEAD434 is UNSAT
Problem TDEAD435 is UNSAT
Problem TDEAD436 is UNSAT
Problem TDEAD437 is UNSAT
Problem TDEAD438 is UNSAT
Problem TDEAD440 is UNSAT
Problem TDEAD441 is UNSAT
Problem TDEAD442 is UNSAT
Problem TDEAD443 is UNSAT
Problem TDEAD444 is UNSAT
Problem TDEAD445 is UNSAT
Problem TDEAD446 is UNSAT
Problem TDEAD447 is UNSAT
Problem TDEAD448 is UNSAT
Problem TDEAD449 is UNSAT
Problem TDEAD450 is UNSAT
Problem TDEAD451 is UNSAT
Problem TDEAD452 is UNSAT
Problem TDEAD453 is UNSAT
Problem TDEAD454 is UNSAT
Problem TDEAD455 is UNSAT
Problem TDEAD456 is UNSAT
Problem TDEAD457 is UNSAT
Problem TDEAD458 is UNSAT
Problem TDEAD459 is UNSAT
Problem TDEAD460 is UNSAT
Problem TDEAD461 is UNSAT
Problem TDEAD462 is UNSAT
Problem TDEAD463 is UNSAT
Problem TDEAD464 is UNSAT
Problem TDEAD465 is UNSAT
Problem TDEAD466 is UNSAT
Problem TDEAD467 is UNSAT
Problem TDEAD468 is UNSAT
Problem TDEAD469 is UNSAT
Problem TDEAD470 is UNSAT
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 3/45 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 12/57 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 4/61 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/282 variables, 0/61 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 8 (OVERLAPS) 471/753 variables, 282/343 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 225/568 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 0/568 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 2/755 variables, 2/570 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/755 variables, 0/570 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 13 (OVERLAPS) 0/755 variables, 0/570 constraints. Problems are: Problem set: 435 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Real declared 755/755 variables, and 570 constraints, problems are : Problem set: 435 solved, 21 unsolved in 29313 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 284/284 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 456/456 constraints, Known Traps: 39/39 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 435 solved, 21 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/41 variables, 5/5 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/41 variables, 0/5 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 2 (OVERLAPS) 241/282 variables, 17/22 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/282 variables, 39/61 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/282 variables, 20/81 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/282 variables, 20/101 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/282 variables, 0/101 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 7 (OVERLAPS) 471/753 variables, 282/383 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/753 variables, 225/608 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/753 variables, 17/625 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/753 variables, 0/625 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 11 (OVERLAPS) 2/755 variables, 2/627 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/755 variables, 4/631 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/755 variables, 0/631 constraints. Problems are: Problem set: 435 solved, 21 unsolved
At refinement iteration 14 (OVERLAPS) 0/755 variables, 0/631 constraints. Problems are: Problem set: 435 solved, 21 unsolved
No progress, stopping.
After SMT solving in domain Int declared 755/755 variables, and 631 constraints, problems are : Problem set: 435 solved, 21 unsolved in 18491 ms.
Refiners :[Positive P Invariants (semi-flows): 22/22 constraints, State Equation: 284/284 constraints, ReadFeed: 225/225 constraints, PredecessorRefiner: 21/456 constraints, Known Traps: 79/79 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 48044ms problems are : Problem set: 435 solved, 21 unsolved
Search for dead transitions found 435 dead transitions in 48052ms
Found 435 dead transitions using SMT.
Drop transitions (Dead Transitions using SMT only with invariants) removed 435 transitions
Dead transitions reduction (with SMT) removed 435 transitions
Starting structural reductions in REACHABILITY mode, iteration 1 : 284/284 places, 36/471 transitions.
Graph (complete) has 114 edges and 284 vertex of which 59 are kept as prefixes of interest. Removing 225 places using SCC suffix rule.0 ms
Discarding 225 places :
Also discarding 0 output transitions
Reduce places removed 1 places and 5 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 58 transition count 31
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 6 place count 54 transition count 31
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 6 place count 54 transition count 30
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 3 rules applied. Total rules applied 9 place count 52 transition count 30
Deduced a syphon composed of 5 places in 0 ms
Free-agglomeration rule (complex) applied 15 times.
Iterating global reduction 2 with 15 rules applied. Total rules applied 24 place count 52 transition count 15
Ensure Unique test removed 15 places
Reduce places removed 31 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 14 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1 edges and 21 vertex of which 7 are kept as prefixes of interest. Removing 14 places using SCC suffix rule.1 ms
Discarding 14 places :
Also discarding 0 output transitions
Iterating post reduction 2 with 46 rules applied. Total rules applied 70 place count 7 transition count 1
Deduced a syphon composed of 5 places in 0 ms
Applied a total of 70 rules in 23 ms. Remains 7 /284 variables (removed 277) and now considering 1/36 (removed 35) transitions.
Running PetriSpot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.petrispot.binaries_1.0.0.202604301425/bin/petri64' '--loadKERS=/tmp/petrispot-input-13570684413566049249.kers' '--Pflows' '--basisKERS=/tmp/petrispot-output-9568467096007302712.kers'
[2026-06-10 15:18:24] [INFO ] Running PetriSpot with arguments : [--loadKERS=/tmp/petrispot-input-13570684413566049249.kers, --Pflows, --basisKERS=/tmp/petrispot-output-9568467096007302712.kers]
Culling trivial invariants: removing 5 columns.
Culling duplicate invariants (modulo rational): removing 1 columns.
Culled 6 columns in 0 ms.
// Phase 1: matrix 1 rows 1 cols 1 entries
Finished phase 1 with 1 SingleSign rule and 0 generalized
[2026-06-10 15:18:24] [INFO ] Computed 6 invariants in 0 ms
Computed 6 P flows in 0 ms.
Exported basis to /tmp/petrispot-output-9568467096007302712.kers
Total runtime 0 ms.
[2026-06-10 15:18:24] [INFO ] Implicit Places using invariants in 22 ms returned []
[2026-06-10 15:18:24] [INFO ] Invariant cache hit.
[2026-06-10 15:18:24] [INFO ] Implicit Places using invariants and state equation in 21 ms returned []
Implicit Place search using SMT with State Equation took 46 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 7/284 places, 1/471 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 51283 ms. Remains : 7/284 places, 1/471 transitions.
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-00 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FileSystem-PT-N02I15B15-ReachabilityCardinality-2024-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 109454 ms.

BK_STOP 1781104705093

--------------------
content from stderr:

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5973"
echo " Executing tool itstools"
echo " Input is FileSystem-PT-N02I15B15, examination is ReachabilityCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r338-smll-178021499300430"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FileSystem-PT-N02I15B15.tgz
mv FileSystem-PT-N02I15B15 execution
cd execution
if [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "UpperBounds" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] || [ "ReachabilityCardinality" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "ReachabilityCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "ReachabilityCardinality" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "ReachabilityCardinality.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' ReachabilityCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "ReachabilityCardinality" = "ReachabilityDeadlock" ] || [ "ReachabilityCardinality" = "QuasiLiveness" ] || [ "ReachabilityCardinality" = "StableMarking" ] || [ "ReachabilityCardinality" = "Liveness" ] || [ "ReachabilityCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME ReachabilityCardinality"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;