About the Execution of ITS-Tools for FireWire-PT-17
Execution Summary | |||||
Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
0.000 | 102480.00 | 0.00 | 0.00 | TFFTTTFFFFFTTTFF | normal |
Execution Chart
Sorry, for this execution, no execution chart could be reported.
Trace from the execution
Formatting '/data/fkordon/mcc2025-input.r086-smll-174860102400374.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2025-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-5832
Executing tool itstools
Input is FireWire-PT-17, examination is ReachabilityCardinality
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r086-smll-174860102400374
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 508K
-rw-r--r-- 1 mcc users 7.0K May 29 14:47 CTLCardinality.txt
-rw-r--r-- 1 mcc users 76K May 29 14:47 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.1K May 29 14:47 CTLFireability.txt
-rw-r--r-- 1 mcc users 34K May 29 14:47 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.7K May 29 14:47 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 29 14:47 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K May 29 14:47 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K May 29 14:47 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.1K May 29 14:47 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 80K May 29 14:47 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.3K May 29 14:47 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 50K May 29 14:47 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 29 14:47 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K May 29 14:47 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 29 14:32 equiv_col
-rw-r--r-- 1 mcc users 3 May 29 14:32 instance
-rw-r--r-- 1 mcc users 6 May 29 14:32 iscolored
-rw-r--r-- 1 mcc users 153K May 29 14:32 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 FireWire-PT-17-ReachabilityCardinality-2025-00
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-01
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-02
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-03
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-04
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-05
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-06
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-07
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-08
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-09
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-10
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-11
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-12
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-13
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-14
FORMULA_NAME FireWire-PT-17-ReachabilityCardinality-2025-15
=== Now, execution of the tool begins
BK_START 1748893120941
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=ReachabilityCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-17
BK_MEMORY_CONFINEMENT=16384
Not applying reductions.
Model is PT
ReachabilityCardinality PT
Running Version 202505121319
[2025-06-02 19:38:43] [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]
[2025-06-02 19:38:43] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2025-06-02 19:38:44] [INFO ] Load time of PNML (sax parser for PT used): 226 ms
[2025-06-02 19:38:44] [INFO ] Transformed 428 places.
[2025-06-02 19:38:44] [INFO ] Transformed 656 transitions.
[2025-06-02 19:38:44] [INFO ] Found NUPN structural information;
[2025-06-02 19:38:44] [INFO ] Parsed PT model containing 428 places and 656 transitions and 1904 arcs in 508 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityCardinality.xml in 40 ms.
Working with output stream class java.io.PrintStream
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-13 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
RANDOM walk for 40000 steps (16 resets) in 3101 ms. (12 steps per ms) remains 11/14 properties
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-14 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-09 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-04 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
[2025-06-02 19:38:45] [INFO ] Flatten gal took : 313 ms
BEST_FIRST walk for 40000 steps (8 resets) in 862 ms. (46 steps per ms) remains 11/11 properties
[2025-06-02 19:38:45] [INFO ] Flatten gal took : 219 ms
BEST_FIRST walk for 40003 steps (12 resets) in 332 ms. (120 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (12 resets) in 553 ms. (72 steps per ms) remains 11/11 properties
[2025-06-02 19:38:45] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality5131910012201164284.gal : 157 ms
BEST_FIRST walk for 40000 steps (8 resets) in 533 ms. (74 steps per ms) remains 11/11 properties
[2025-06-02 19:38:45] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality5284093577352601434.prop : 9 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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality5131910012201164284.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality5284093577352601434.prop' '--nowitness' '--gen-order' 'FOLLOW'
BEST_FIRST walk for 40003 steps (10 resets) in 342 ms. (116 steps per ms) remains 11/11 properties
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...328
Loading property file /tmp/ReachabilityCardinality5284093577352601434.prop.
BEST_FIRST walk for 40000 steps (10 resets) in 575 ms. (69 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (10 resets) in 450 ms. (88 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,11 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,11 properties remain. new max is 16
SDD size :7 after 13
SDD proceeding with computation,11 properties remain. new max is 32
SDD size :13 after 19
SDD proceeding with computation,11 properties remain. new max is 64
SDD size :19 after 80
SDD proceeding with computation,11 properties remain. new max is 128
SDD size :80 after 97
SDD proceeding with computation,11 properties remain. new max is 256
SDD size :97 after 141
SDD proceeding with computation,11 properties remain. new max is 512
SDD size :141 after 313
BEST_FIRST walk for 40000 steps (11 resets) in 279 ms. (142 steps per ms) remains 11/11 properties
SDD proceeding with computation,11 properties remain. new max is 1024
SDD size :313 after 601
Invariant property FireWire-PT-17-ReachabilityCardinality-2025-08 does not hold.
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-08 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
BEST_FIRST walk for 40000 steps (17 resets) in 345 ms. (115 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (11 resets) in 233 ms. (170 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40004 steps (15 resets) in 187 ms. (212 steps per ms) remains 11/11 properties
// Phase 1: matrix 656 rows 428 cols
[2025-06-02 19:38:46] [INFO ] Computed 9 invariants in 31 ms
Excessive predecessor constraint size, skipping predecessor.
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
SDD proceeding with computation,10 properties remain. new max is 1024
SDD size :601 after 178142
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/117 variables, 117/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/117 variables, 0/117 constraints. Problems are: Problem set: 0 solved, 10 unsolved
Problem FireWire-PT-17-ReachabilityCardinality-2025-10 is UNSAT
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-10 FALSE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 311/428 variables, 9/126 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 311/437 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 0/437 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 5 (OVERLAPS) 656/1084 variables, 428/865 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 7 (OVERLAPS) 0/1084 variables, 0/865 constraints. Problems are: Problem set: 1 solved, 9 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1084/1084 variables, and 865 constraints, problems are : Problem set: 1 solved, 9 unsolved in 2194 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 10/9 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 5.0 s and query timeout 500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/113 variables, 113/113 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/113 variables, 0/113 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 2 (OVERLAPS) 315/428 variables, 9/122 constraints. Problems are: Problem set: 1 solved, 9 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/428 variables, 315/437 constraints. Problems are: Problem set: 1 solved, 9 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:38:50] [INFO ] Deduced a trap composed of 17 places in 436 ms of which 39 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property FireWire-PT-17-ReachabilityCardinality-2025-06 does not hold.
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-06 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,9 properties remain. new max is 1024
SDD size :178142 after 187251
SDD proceeding with computation,9 properties remain. new max is 2048
SDD size :187251 after 195094
Reachability property FireWire-PT-17-ReachabilityCardinality-2025-03 is true.
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,8 properties remain. new max is 2048
SDD size :195094 after 204373
[2025-06-02 19:38:50] [INFO ] Deduced a trap composed of 17 places in 351 ms of which 26 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,8 properties remain. new max is 4096
SDD size :204373 after 228227
[2025-06-02 19:38:50] [INFO ] Deduced a trap composed of 102 places in 563 ms of which 140 ms to minimize.
Problem FireWire-PT-17-ReachabilityCardinality-2025-02 is UNSAT
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-02 FALSE TECHNIQUES SMT_REFINEMENT
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
Invariant property FireWire-PT-17-ReachabilityCardinality-2025-15 does not hold.
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-15 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
[2025-06-02 19:38:51] [INFO ] Deduced a trap composed of 195 places in 610 ms of which 161 ms to minimize.
Invariant property FireWire-PT-17-ReachabilityCardinality-2025-01 does not hold.
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-01 FALSE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,6 properties remain. new max is 4096
SDD size :228227 after 840508
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
SDD proceeding with computation,6 properties remain. new max is 8192
SDD size :840508 after 872393
[2025-06-02 19:38:52] [INFO ] Deduced a trap composed of 93 places in 333 ms of which 73 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:38:52] [INFO ] Deduced a trap composed of 103 places in 167 ms of which 6 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/428 variables, 6/443 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:38:53] [INFO ] Deduced a trap composed of 95 places in 400 ms of which 65 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/428 variables, 1/444 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/428 variables, 0/444 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 656/1084 variables, 428/872 constraints. Problems are: Problem set: 6 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1084 variables, 4/876 constraints. Problems are: Problem set: 6 solved, 4 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 1084/1084 variables, and 876 constraints, problems are : Problem set: 6 solved, 4 unsolved in 5015 ms.
Refiners :[Domain max(s): 428/428 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 428/428 constraints, PredecessorRefiner: 5/9 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 7383ms problems are : Problem set: 6 solved, 4 unsolved
Skipping Parikh replay, no witness traces provided.
Support contains 30 out of 428 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 428/428 places, 656/656 transitions.
Graph (trivial) has 308 edges and 428 vertex of which 6 / 428 are part of one of the 1 SCC in 6 ms
Free SCC test removed 5 places
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (complete) has 1097 edges and 423 vertex of which 417 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Discarding 6 places :
Also discarding 0 output transitions
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 99 transitions
Trivial Post-agglo rules discarded 99 transitions
Performed 99 trivial Post agglomeration. Transition count delta: 99
Iterating post reduction 0 with 101 rules applied. Total rules applied 103 place count 417 transition count 549
Reduce places removed 99 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 102 rules applied. Total rules applied 205 place count 318 transition count 546
Reduce places removed 2 places and 0 transitions.
Performed 10 Post agglomeration using F-continuation condition.Transition count delta: 10
Iterating post reduction 2 with 12 rules applied. Total rules applied 217 place count 316 transition count 536
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 227 place count 306 transition count 536
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 7 Pre rules applied. Total rules applied 227 place count 306 transition count 529
Deduced a syphon composed of 7 places in 3 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 4 with 14 rules applied. Total rules applied 241 place count 299 transition count 529
Discarding 41 places :
Symmetric choice reduction at 4 with 41 rule applications. Total rules 282 place count 258 transition count 486
Iterating global reduction 4 with 41 rules applied. Total rules applied 323 place count 258 transition count 486
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 8 Pre rules applied. Total rules applied 323 place count 258 transition count 478
Deduced a syphon composed of 8 places in 3 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 4 with 16 rules applied. Total rules applied 339 place count 250 transition count 478
Discarding 8 places :
Symmetric choice reduction at 4 with 8 rule applications. Total rules 347 place count 242 transition count 428
Iterating global reduction 4 with 8 rules applied. Total rules applied 355 place count 242 transition count 428
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 4 with 3 rules applied. Total rules applied 358 place count 242 transition count 425
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 359 place count 241 transition count 425
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 2 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 6 with 72 rules applied. Total rules applied 431 place count 205 transition count 389
Performed 26 Post agglomeration using F-continuation condition.Transition count delta: -68
Deduced a syphon composed of 26 places in 1 ms
Reduce places removed 26 places and 0 transitions.
Iterating global reduction 6 with 52 rules applied. Total rules applied 483 place count 179 transition count 457
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 6 with 6 rules applied. Total rules applied 489 place count 179 transition count 451
Free-agglomeration rule applied 22 times.
Iterating global reduction 6 with 22 rules applied. Total rules applied 511 place count 179 transition count 429
Reduce places removed 22 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 6 with 28 rules applied. Total rules applied 539 place count 157 transition count 423
Drop transitions (Redundant composition of simpler transitions.) removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 7 with 10 rules applied. Total rules applied 549 place count 157 transition count 413
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 7 with 1 rules applied. Total rules applied 550 place count 157 transition count 412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 551 place count 156 transition count 412
Partial Free-agglomeration rule applied 3 times.
Drop transitions (Partial Free agglomeration) removed 3 transitions
Iterating global reduction 8 with 3 rules applied. Total rules applied 554 place count 156 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 8 with 2 rules applied. Total rules applied 556 place count 156 transition count 410
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 8 with 1 rules applied. Total rules applied 557 place count 155 transition count 409
Applied a total of 557 rules in 448 ms. Remains 155 /428 variables (removed 273) and now considering 409/656 (removed 247) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 462 ms. Remains : 155/428 places, 409/656 transitions.
RANDOM walk for 40000 steps (20 resets) in 768 ms. (52 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (14 resets) in 684 ms. (58 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (26 resets) in 301 ms. (132 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40000 steps (10 resets) in 120 ms. (330 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (10 resets) in 150 ms. (264 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 586223 steps, run timeout after 3001 ms. (steps per millisecond=195 ) properties seen :2 out of 4
Probabilistic random walk after 586223 steps, saw 147605 distinct states, run finished after 3009 ms. (steps per millisecond=194 ) properties seen :2
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-07 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-05 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2025-06-02 19:38:58] [INFO ] Flow matrix only has 399 transitions (discarded 10 similar events)
// Phase 1: matrix 399 rows 155 cols
[2025-06-02 19:38:58] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 19:38:58] [INFO ] State equation strengthened by 56 read => feed constraints.
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/144 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/144 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 398/542 variables, 144/151 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/542 variables, 56/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/542 variables, 0/207 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 12/554 variables, 11/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/554 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/554 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 554/554 variables, and 218 constraints, problems are : Problem set: 0 solved, 2 unsolved in 477 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 45.0 s and query timeout 4500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 110/137 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:38:59] [INFO ] Deduced a trap composed of 38 places in 97 ms of which 6 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/137 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/137 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (OVERLAPS) 7/144 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:38:59] [INFO ] Deduced a trap composed of 31 places in 216 ms of which 32 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/144 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/144 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (OVERLAPS) 398/542 variables, 144/153 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/542 variables, 56/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/542 variables, 0/209 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 12/554 variables, 11/220 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/554 variables, 2/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/554 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 0/554 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 554/554 variables, and 222 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1572 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 155/155 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 2/2 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 2077ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 225 ms.
Support contains 27 out of 155 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 155/155 places, 409/409 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 155 transition count 408
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 154 transition count 408
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 2 place count 154 transition count 407
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 4 place count 153 transition count 407
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 8 place count 151 transition count 412
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 10 place count 151 transition count 410
Partial Free-agglomeration rule applied 1 times.
Drop transitions (Partial Free agglomeration) removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 11 place count 151 transition count 410
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 12 place count 150 transition count 408
Iterating global reduction 2 with 1 rules applied. Total rules applied 13 place count 150 transition count 408
Applied a total of 13 rules in 72 ms. Remains 150 /155 variables (removed 5) and now considering 408/409 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 150/155 places, 408/409 transitions.
RANDOM walk for 40000 steps (19 resets) in 159 ms. (250 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40000 steps (11 resets) in 206 ms. (193 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (9 resets) in 169 ms. (235 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 497530 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :0 out of 2
Probabilistic random walk after 497530 steps, saw 162542 distinct states, run finished after 3001 ms. (steps per millisecond=165 ) properties seen :0
[2025-06-02 19:39:03] [INFO ] Flow matrix only has 398 transitions (discarded 10 similar events)
// Phase 1: matrix 398 rows 150 cols
[2025-06-02 19:39:03] [INFO ] Computed 7 invariants in 3 ms
[2025-06-02 19:39:03] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 7/141 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/141 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 398/539 variables, 141/148 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/539 variables, 58/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/539 variables, 0/206 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 9/548 variables, 9/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/548 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 548/548 variables, and 215 constraints, problems are : Problem set: 0 solved, 2 unsolved in 402 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 75.0 s and query timeout 7500.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/27 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 107/134 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:04] [INFO ] Deduced a trap composed of 29 places in 184 ms of which 27 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/134 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:04] [INFO ] Deduced a trap composed of 38 places in 82 ms of which 6 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:04] [INFO ] Deduced a trap composed of 46 places in 80 ms of which 4 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/134 variables, 2/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/134 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 7/141 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 2 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:05] [INFO ] Deduced a trap composed of 31 places in 196 ms of which 26 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/141 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/141 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 398/539 variables, 141/152 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/539 variables, 58/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/539 variables, 0/210 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 9/548 variables, 9/219 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/548 variables, 2/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/548 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 0/548 variables, 0/221 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 548/548 variables, and 221 constraints, problems are : Problem set: 0 solved, 2 unsolved in 1373 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 4/4 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 1793ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 213 ms.
Support contains 27 out of 150 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 408/408 transitions.
Applied a total of 0 rules in 15 ms. Remains 150 /150 variables (removed 0) and now considering 408/408 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 150/150 places, 408/408 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 150/150 places, 408/408 transitions.
Applied a total of 0 rules in 18 ms. Remains 150 /150 variables (removed 0) and now considering 408/408 (removed 0) transitions.
[2025-06-02 19:39:05] [INFO ] Flow matrix only has 398 transitions (discarded 10 similar events)
[2025-06-02 19:39:05] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:39:06] [INFO ] Implicit Places using invariants in 207 ms returned []
[2025-06-02 19:39:06] [INFO ] Flow matrix only has 398 transitions (discarded 10 similar events)
[2025-06-02 19:39:06] [INFO ] Invariant cache hit.
Starting Z3 with timeout 160.0 s and query timeout 16000.0 ms
[2025-06-02 19:39:06] [INFO ] State equation strengthened by 58 read => feed constraints.
[2025-06-02 19:39:06] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 740 ms to find 0 implicit places.
Starting Z3 with timeout 200.0 s and query timeout 20000.0 ms
[2025-06-02 19:39:06] [INFO ] Redundant transitions in 30 ms returned []
Running 405 sub problems to find dead transitions.
[2025-06-02 19:39:06] [INFO ] Flow matrix only has 398 transitions (discarded 10 similar events)
[2025-06-02 19:39:06] [INFO ] Invariant cache hit.
[2025-06-02 19:39:06] [INFO ] State equation strengthened by 58 read => feed constraints.
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 0/1 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (OVERLAPS) 2/150 variables, 6/7 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:12] [INFO ] Deduced a trap composed of 46 places in 64 ms of which 3 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:13] [INFO ] Deduced a trap composed of 41 places in 62 ms of which 5 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:13] [INFO ] Deduced a trap composed of 29 places in 165 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:13] [INFO ] Deduced a trap composed of 24 places in 164 ms of which 16 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:14] [INFO ] Deduced a trap composed of 43 places in 150 ms of which 8 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:14] [INFO ] Deduced a trap composed of 51 places in 167 ms of which 16 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 6/13 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:18] [INFO ] Deduced a trap composed of 22 places in 189 ms of which 16 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 1/14 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Reachability property FireWire-PT-17-ReachabilityCardinality-2025-00 is true.
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING
SDD proceeding with computation,5 properties remain. new max is 8192
SDD size :872393 after 5.56807e+07
At refinement iteration 6 (OVERLAPS) 398/548 variables, 150/164 constraints. Problems are: Problem set: 0 solved, 405 unsolved
SDD proceeding with computation,5 properties remain. new max is 16384
SDD size :5.56807e+07 after 6.36705e+07
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 58/222 constraints. Problems are: Problem set: 0 solved, 405 unsolved
SDD proceeding with computation,5 properties remain. new max is 32768
SDD size :6.36705e+07 after 6.41339e+07
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 405 unsolved
SDD proceeding with computation,5 properties remain. new max is 65536
SDD size :6.41339e+07 after 7.33406e+07
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 548/548 variables, and 222 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30049 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 7/7 constraints, Known Traps Along Path: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 30.0 s and query timeout 3000.0 ms
At refinement iteration 0 (INCLUDED_ONLY) 0/148 variables, 1/1 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/148 variables, 4/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/148 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 3 (OVERLAPS) 2/150 variables, 6/11 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 3/14 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/150 variables, 0/14 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 6 (OVERLAPS) 398/548 variables, 150/164 constraints. Problems are: Problem set: 0 solved, 405 unsolved
SDD proceeding with computation,5 properties remain. new max is 131072
SDD size :7.33406e+07 after 2.3466e+08
At refinement iteration 7 (INCLUDED_ONLY) 0/548 variables, 58/222 constraints. Problems are: Problem set: 0 solved, 405 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/548 variables, 405/627 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:39:52] [INFO ] Deduced a trap composed of 25 places in 165 ms of which 12 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:00] [INFO ] Deduced a trap composed of 7 places in 58 ms of which 4 ms to minimize.
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:00] [INFO ] Deduced a trap composed of 38 places in 67 ms of which 5 ms to minimize.
At refinement iteration 9 (INCLUDED_ONLY) 0/548 variables, 3/630 constraints. Problems are: Problem set: 0 solved, 405 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 548/548 variables, and 630 constraints, problems are : Problem set: 0 solved, 405 unsolved in 30027 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 58/58 constraints, PredecessorRefiner: 405/405 constraints, Known Traps: 10/10 constraints, Known Traps Along Path: 0/0 constraints]
After SMT, in 60341ms problems are : Problem set: 0 solved, 405 unsolved
Search for dead transitions found 0 dead transitions in 60348ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61152 ms. Remains : 150/150 places, 408/408 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 80 edges and 150 vertex of which 18 / 150 are part of one of the 2 SCC in 0 ms
Free SCC test removed 16 places
Drop transitions (Empty/Sink Transition effects.) removed 26 transitions
Ensure Unique test removed 96 transitions
Reduce isomorphic transitions removed 122 transitions.
Graph (complete) has 493 edges and 134 vertex of which 133 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions (Trivial Post-Agglo cleanup.) removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 3 place count 133 transition count 285
Reduce places removed 1 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 4 rules applied. Total rules applied 7 place count 132 transition count 282
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 10 place count 129 transition count 282
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 10 place count 129 transition count 281
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 12 place count 128 transition count 281
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 16 place count 124 transition count 264
Iterating global reduction 3 with 4 rules applied. Total rules applied 20 place count 124 transition count 264
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 25 place count 124 transition count 259
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 31 place count 121 transition count 256
Drop transitions (Redundant composition of simpler transitions.) removed 12 transitions
Redundant transition composition rules discarded 12 transitions
Iterating global reduction 4 with 12 rules applied. Total rules applied 43 place count 121 transition count 244
Free-agglomeration rule applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 45 place count 121 transition count 242
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 47 place count 119 transition count 242
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 5 with 5 rules applied. Total rules applied 52 place count 119 transition count 242
Applied a total of 52 rules in 60 ms. Remains 119 /150 variables (removed 31) and now considering 242/408 (removed 166) transitions.
Running SMT prover for 1 properties.
[2025-06-02 19:40:07] [INFO ] Flow matrix only has 239 transitions (discarded 3 similar events)
// Phase 1: matrix 239 rows 119 cols
[2025-06-02 19:40:07] [INFO ] Computed 7 invariants in 6 ms
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 19:40:07] [INFO ] After 51ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
Starting Z3 with timeout 450.0 s and query timeout 45000.0 ms
[2025-06-02 19:40:07] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2025-06-02 19:40:07] [INFO ] After 130ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2025-06-02 19:40:07] [INFO ] State equation strengthened by 9 read => feed constraints.
[2025-06-02 19:40:07] [INFO ] After 33ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :1
TRAPS : Iteration 0
Starting Z3 with timeout 120.0 s and query timeout 12000.0 ms
[2025-06-02 19:40:07] [INFO ] Deduced a trap composed of 26 places in 106 ms of which 13 ms to minimize.
[2025-06-02 19:40:07] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 129 ms
TRAPS : Iteration 1
[2025-06-02 19:40:07] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
[2025-06-02 19:40:07] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
[2025-06-02 19:40:07] [INFO ] Flatten gal took : 39 ms
[2025-06-02 19:40:07] [INFO ] Flatten gal took : 28 ms
[2025-06-02 19:40:07] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality8603757877759222045.gal : 10 ms
[2025-06-02 19:40:07] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality14067569579207687443.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality8603757877759222045.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality14067569579207687443.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.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...329
Loading property file /tmp/ReachabilityCardinality14067569579207687443.prop.
SDD proceeding with computation,1 properties remain. new max is 4
SDD size :1 after 5
SDD proceeding with computation,1 properties remain. new max is 8
SDD size :5 after 7
SDD proceeding with computation,1 properties remain. new max is 16
SDD size :7 after 14
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :14 after 33
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :33 after 45
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :45 after 54
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :54 after 77
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :77 after 170
SDD proceeding with computation,1 properties remain. new max is 1024
SDD size :170 after 10401
SDD proceeding with computation,1 properties remain. new max is 2048
SDD size :10401 after 59869
SDD proceeding with computation,1 properties remain. new max is 4096
SDD size :59869 after 65854
SDD proceeding with computation,1 properties remain. new max is 8192
SDD size :65854 after 422691
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,3.18332e+07,1.43874,41708,2,5220,17,97234,7,0,747,131608,0
Total reachable state count : 31833240
Verifying 1 reachability properties.
Reachability property FireWire-PT-17-ReachabilityCardinality-2025-11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-17-ReachabilityCardinality-2025-11,540,1.44478,41708,2,191,17,97234,7,0,765,131608,0
Over-approximation ignoring read arcs solved 0 properties in 2173 ms.
ITS runner timed out or was interrupted.
ITS tools runner thread asked to quit. Dying gracefully.
[2025-06-02 19:40:09] [INFO ] Flatten gal took : 49 ms
[2025-06-02 19:40:09] [INFO ] Applying decomposition
[2025-06-02 19:40:09] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/convert-linux64' '-i' '/tmp/graph2983454318800467037.txt' '-o' '/tmp/graph2983454318800467037.bin' '-w' '/tmp/graph2983454318800467037.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202505121319/bin/louvain-linux64' '/tmp/graph2983454318800467037.bin' '-l' '-1' '-v' '-w' '/tmp/graph2983454318800467037.weights' '-q' '0' '-e' '0.001'
[2025-06-02 19:40:09] [INFO ] Decomposing Gal with order
[2025-06-02 19:40:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2025-06-02 19:40:09] [INFO ] Removed a total of 540 redundant transitions.
[2025-06-02 19:40:09] [INFO ] Flatten gal took : 142 ms
[2025-06-02 19:40:09] [INFO ] Fuse similar labels procedure discarded/fused a total of 25 labels/synchronizations in 25 ms.
[2025-06-02 19:40:10] [INFO ] Time to serialize gal into /tmp/ReachabilityCardinality2166050538357495761.gal : 16 ms
[2025-06-02 19:40:10] [INFO ] Time to serialize properties into /tmp/ReachabilityCardinality12964624929913421588.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.202505121319/bin/its-reach-linux64' '--gc-threshold' '2000000' '--quiet' '-i' '/tmp/ReachabilityCardinality2166050538357495761.gal' '-t' 'CGAL' '-reachable-file' '/tmp/ReachabilityCardinality12964624929913421588.prop' '--nowitness'
its-reach command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202505121319/bin/its-reach-linux64 --gc-threshold 2000000 --quiet ...308
Loading property file /tmp/ReachabilityCardinality12964624929913421588.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 1
SDD proceeding with computation,1 properties remain. new max is 32
SDD size :1 after 1
SDD proceeding with computation,1 properties remain. new max is 64
SDD size :1 after 9737
SDD proceeding with computation,1 properties remain. new max is 128
SDD size :9737 after 877211
SDD proceeding with computation,1 properties remain. new max is 256
SDD size :877211 after 2.09014e+06
SDD proceeding with computation,1 properties remain. new max is 512
SDD size :1.28378e+08 after 8.97853e+08
Reachability property FireWire-PT-17-ReachabilityCardinality-2025-11 is true.
FORMULA FireWire-PT-17-ReachabilityCardinality-2025-11 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL COLLATERAL_PROCESSING USE_NUPN
Found states matching all0 target predicate
Will report total states built up to this point. Computation was interrupted after 513 fixpoint passes
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
petri\_inst\_inst\_mod\_flat,1.57757e+10,12.0447,267168,5178,320,329720,5252,1080,1.99902e+06,102,29510,0
Total reachable state count : 15775712172
Verifying 1 reachability properties.
Reachability property FireWire-PT-17-ReachabilityCardinality-2025-11 is true.
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
FireWire-PT-17-ReachabilityCardinality-2025-11,164,13.2904,267168,177,26,329720,5252,1168,1.99902e+06,115,29510,0
ITS tools runner thread asked to quit. Dying gracefully.
All properties solved without resorting to model-checking.
Total runtime 99810 ms.
BK_STOP 1748893223421
--------------------
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.202505121319.jar
+ VERSION=202505121319
+ echo 'Running Version 202505121319'
+ /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="FireWire-PT-17"
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-5832"
echo " Executing tool itstools"
echo " Input is FireWire-PT-17, 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 r086-smll-174860102400374"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-17.tgz
mv FireWire-PT-17 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 '
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 ;