Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r553-tall-171734901400311.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-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-5568
Executing tool ltsminxred
Input is FireWire-PT-18, examination is ReachabilityFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901400311
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 560K
-rw-r--r-- 1 mcc users 8.3K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 95K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.0K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 42K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.3K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 23K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 10K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 106K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 4.1K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 168K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717357605199

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=ReachabilityFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-18
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:46:46] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, ReachabilityFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:46:46] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:46:46] [INFO ] Load time of PNML (sax parser for PT used): 90 ms
[2024-06-02 19:46:46] [INFO ] Transformed 437 places.
[2024-06-02 19:46:46] [INFO ] Transformed 707 transitions.
[2024-06-02 19:46:46] [INFO ] Found NUPN structural information;
[2024-06-02 19:46:46] [INFO ] Parsed PT model containing 437 places and 707 transitions and 2170 arcs in 187 ms.
Parsed 16 properties from file /home/mcc/execution/ReachabilityFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
RANDOM walk for 40000 steps (12 resets) in 1638 ms. (24 steps per ms) remains 13/16 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-15 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-10 TRUE TECHNIQUES TOPOLOGICAL RANDOM_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-03 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40000 steps (24 resets) in 352 ms. (113 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (12 resets) in 272 ms. (146 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (17 resets) in 315 ms. (126 steps per ms) remains 13/13 properties
BEST_FIRST walk for 40000 steps (28 resets) in 207 ms. (192 steps per ms) remains 11/13 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-11 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-06 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40000 steps (13 resets) in 211 ms. (188 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (15 resets) in 241 ms. (165 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (15 resets) in 445 ms. (89 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (12 resets) in 192 ms. (207 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (18 resets) in 151 ms. (263 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40003 steps (10 resets) in 48 ms. (816 steps per ms) remains 11/11 properties
BEST_FIRST walk for 40000 steps (32 resets) in 250 ms. (159 steps per ms) remains 11/11 properties
// Phase 1: matrix 707 rows 437 cols
[2024-06-02 19:46:48] [INFO ] Computed 9 invariants in 20 ms
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 2 (OVERLAPS) 355/437 variables, 9/91 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 355/446 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 0/446 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 5 (OVERLAPS) 707/1144 variables, 437/883 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 7 (OVERLAPS) 0/1144 variables, 0/883 constraints. Problems are: Problem set: 0 solved, 11 unsolved
No progress, stopping.
After SMT solving in domain Real declared 1144/1144 variables, and 883 constraints, problems are : Problem set: 0 solved, 11 unsolved in 1113 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 11/11 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 11 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/82 variables, 82/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/82 variables, 0/82 constraints. Problems are: Problem set: 0 solved, 11 unsolved
Problem FireWire-PT-18-ReachabilityFireability-2024-01 is UNSAT
FORMULA FireWire-PT-18-ReachabilityFireability-2024-01 TRUE TECHNIQUES SMT_REFINEMENT
At refinement iteration 2 (OVERLAPS) 355/437 variables, 9/91 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/437 variables, 355/446 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:46:49] [INFO ] Deduced a trap composed of 19 places in 119 ms of which 19 ms to minimize.
[2024-06-02 19:46:49] [INFO ] Deduced a trap composed of 19 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:46:50] [INFO ] Deduced a trap composed of 99 places in 176 ms of which 3 ms to minimize.
[2024-06-02 19:46:50] [INFO ] Deduced a trap composed of 116 places in 67 ms of which 1 ms to minimize.
[2024-06-02 19:46:50] [INFO ] Deduced a trap composed of 114 places in 64 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/437 variables, 5/451 constraints. Problems are: Problem set: 1 solved, 10 unsolved
[2024-06-02 19:46:50] [INFO ] Deduced a trap composed of 98 places in 165 ms of which 3 ms to minimize.
[2024-06-02 19:46:50] [INFO ] Deduced a trap composed of 118 places in 72 ms of which 2 ms to minimize.
[2024-06-02 19:46:50] [INFO ] Deduced a trap composed of 131 places in 69 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/437 variables, 3/454 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/437 variables, 0/454 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 7 (OVERLAPS) 707/1144 variables, 437/891 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/1144 variables, 10/901 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/1144 variables, 0/901 constraints. Problems are: Problem set: 1 solved, 10 unsolved
At refinement iteration 10 (OVERLAPS) 0/1144 variables, 0/901 constraints. Problems are: Problem set: 1 solved, 10 unsolved
No progress, stopping.
After SMT solving in domain Int declared 1144/1144 variables, and 901 constraints, problems are : Problem set: 1 solved, 10 unsolved in 4130 ms.
Refiners :[Domain max(s): 437/437 constraints, Positive P Invariants (semi-flows): 9/9 constraints, State Equation: 437/437 constraints, PredecessorRefiner: 10/11 constraints, Known Traps: 8/8 constraints]
After SMT, in 5405ms problems are : Problem set: 1 solved, 10 unsolved
FORMULA FireWire-PT-18-ReachabilityFireability-2024-08 FALSE TECHNIQUES PARIKH_WALK
FORMULA FireWire-PT-18-ReachabilityFireability-2024-07 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 2 properties in 31302 ms.
Support contains 29 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 707/707 transitions.
Graph (trivial) has 258 edges and 437 vertex of which 9 / 437 are part of one of the 3 SCC in 6 ms
Free SCC test removed 6 places
Drop transitions (Empty/Sink Transition effects.) removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (complete) has 1273 edges and 431 vertex of which 421 are kept as prefixes of interest. Removing 10 places using SCC suffix rule.4 ms
Discarding 10 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 66 transitions
Trivial Post-agglo rules discarded 66 transitions
Performed 66 trivial Post agglomeration. Transition count delta: 66
Iterating post reduction 0 with 68 rules applied. Total rules applied 70 place count 421 transition count 630
Reduce places removed 66 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 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 1 with 68 rules applied. Total rules applied 138 place count 355 transition count 628
Reduce places removed 1 places and 0 transitions.
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 5
Iterating post reduction 2 with 6 rules applied. Total rules applied 144 place count 354 transition count 623
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 3 with 5 rules applied. Total rules applied 149 place count 349 transition count 623
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 10 Pre rules applied. Total rules applied 149 place count 349 transition count 613
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 4 with 20 rules applied. Total rules applied 169 place count 339 transition count 613
Discarding 66 places :
Symmetric choice reduction at 4 with 66 rule applications. Total rules 235 place count 273 transition count 547
Iterating global reduction 4 with 66 rules applied. Total rules applied 301 place count 273 transition count 547
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 303 place count 273 transition count 545
Performed 5 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 5 Pre rules applied. Total rules applied 303 place count 273 transition count 540
Deduced a syphon composed of 5 places in 1 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 5 with 10 rules applied. Total rules applied 313 place count 268 transition count 540
Discarding 21 places :
Symmetric choice reduction at 5 with 21 rule applications. Total rules 334 place count 247 transition count 491
Iterating global reduction 5 with 21 rules applied. Total rules applied 355 place count 247 transition count 491
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 360 place count 242 transition count 482
Iterating global reduction 5 with 5 rules applied. Total rules applied 365 place count 242 transition count 482
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 5 with 2 rules applied. Total rules applied 367 place count 242 transition count 480
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 368 place count 241 transition count 480
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 370 place count 239 transition count 474
Iterating global reduction 7 with 2 rules applied. Total rules applied 372 place count 239 transition count 474
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 374 place count 237 transition count 470
Iterating global reduction 7 with 2 rules applied. Total rules applied 376 place count 237 transition count 470
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 378 place count 235 transition count 464
Iterating global reduction 7 with 2 rules applied. Total rules applied 380 place count 235 transition count 464
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 382 place count 233 transition count 460
Iterating global reduction 7 with 2 rules applied. Total rules applied 384 place count 233 transition count 460
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 386 place count 231 transition count 454
Iterating global reduction 7 with 2 rules applied. Total rules applied 388 place count 231 transition count 454
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 390 place count 229 transition count 450
Iterating global reduction 7 with 2 rules applied. Total rules applied 392 place count 229 transition count 450
Discarding 1 places :
Symmetric choice reduction at 7 with 1 rule applications. Total rules 393 place count 228 transition count 447
Iterating global reduction 7 with 1 rules applied. Total rules applied 394 place count 228 transition count 447
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 7 with 66 rules applied. Total rules applied 460 place count 195 transition count 414
Performed 25 Post agglomeration using F-continuation condition with reduction of 10 identical transitions.
Deduced a syphon composed of 25 places in 1 ms
Reduce places removed 25 places and 0 transitions.
Iterating global reduction 7 with 50 rules applied. Total rules applied 510 place count 170 transition count 517
Free-agglomeration rule applied 8 times.
Iterating global reduction 7 with 8 rules applied. Total rules applied 518 place count 170 transition count 509
Reduce places removed 8 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 7 with 11 rules applied. Total rules applied 529 place count 162 transition count 506
Discarding 1 places :
Symmetric choice reduction at 8 with 1 rule applications. Total rules 530 place count 161 transition count 505
Iterating global reduction 8 with 1 rules applied. Total rules applied 531 place count 161 transition count 505
Drop transitions (Redundant composition of simpler transitions.) removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 8 with 11 rules applied. Total rules applied 542 place count 161 transition count 494
Partial Free-agglomeration rule applied 4 times.
Drop transitions (Partial Free agglomeration) removed 4 transitions
Iterating global reduction 8 with 4 rules applied. Total rules applied 546 place count 161 transition count 494
Applied a total of 546 rules in 377 ms. Remains 161 /437 variables (removed 276) and now considering 494/707 (removed 213) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 389 ms. Remains : 161/437 places, 494/707 transitions.
RANDOM walk for 40000 steps (1488 resets) in 495 ms. (80 steps per ms) remains 7/8 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-13 FALSE TECHNIQUES TOPOLOGICAL RANDOM_WALK
BEST_FIRST walk for 40004 steps (391 resets) in 89 ms. (444 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (391 resets) in 96 ms. (412 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (368 resets) in 103 ms. (384 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (390 resets) in 112 ms. (354 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (381 resets) in 97 ms. (408 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (397 resets) in 78 ms. (506 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (388 resets) in 94 ms. (421 steps per ms) remains 7/7 properties
[2024-06-02 19:47:25] [INFO ] Flow matrix only has 486 transitions (discarded 8 similar events)
// Phase 1: matrix 486 rows 161 cols
[2024-06-02 19:47:25] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:47:25] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 127/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 0/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 3 (OVERLAPS) 7/153 variables, 2/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/153 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (OVERLAPS) 486/639 variables, 153/160 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/639 variables, 43/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/639 variables, 0/203 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (OVERLAPS) 8/647 variables, 8/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/647 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (OVERLAPS) 0/647 variables, 0/211 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Real declared 647/647 variables, and 211 constraints, problems are : Problem set: 0 solved, 7 unsolved in 509 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 7 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/19 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 1 (OVERLAPS) 127/146 variables, 5/5 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:47:26] [INFO ] Deduced a trap composed of 22 places in 97 ms of which 5 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/146 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:47:26] [INFO ] Deduced a trap composed of 50 places in 80 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/146 variables, 1/7 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:47:26] [INFO ] Deduced a trap composed of 51 places in 36 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/146 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/146 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 6 (OVERLAPS) 7/153 variables, 2/10 constraints. Problems are: Problem set: 0 solved, 7 unsolved
[2024-06-02 19:47:26] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/153 variables, 1/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/153 variables, 0/11 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 9 (OVERLAPS) 486/639 variables, 153/164 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/639 variables, 43/207 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/639 variables, 7/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/639 variables, 0/214 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 13 (OVERLAPS) 8/647 variables, 8/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/647 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
At refinement iteration 15 (OVERLAPS) 0/647 variables, 0/222 constraints. Problems are: Problem set: 0 solved, 7 unsolved
No progress, stopping.
After SMT solving in domain Int declared 647/647 variables, and 222 constraints, problems are : Problem set: 0 solved, 7 unsolved in 1234 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 161/161 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 7/7 constraints, Known Traps: 4/4 constraints]
After SMT, in 1780ms problems are : Problem set: 0 solved, 7 unsolved
Parikh walk visited 0 properties in 8297 ms.
Support contains 19 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 494/494 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 1 place count 161 transition count 493
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 160 transition count 493
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 160 transition count 492
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 159 transition count 492
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 8 place count 155 transition count 391
Iterating global reduction 2 with 4 rules applied. Total rules applied 12 place count 155 transition count 391
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 14 place count 155 transition count 389
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 15 place count 154 transition count 386
Iterating global reduction 3 with 1 rules applied. Total rules applied 16 place count 154 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 17 place count 153 transition count 384
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 153 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 19 place count 152 transition count 382
Iterating global reduction 3 with 1 rules applied. Total rules applied 20 place count 152 transition count 382
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 24 place count 150 transition count 380
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 26 place count 150 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 28 place count 149 transition count 381
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 29 place count 149 transition count 380
Free-agglomeration rule applied 5 times.
Iterating global reduction 4 with 5 rules applied. Total rules applied 34 place count 149 transition count 375
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 4 with 5 rules applied. Total rules applied 39 place count 144 transition count 375
Applied a total of 39 rules in 64 ms. Remains 144 /161 variables (removed 17) and now considering 375/494 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 64 ms. Remains : 144/161 places, 375/494 transitions.
RANDOM walk for 40000 steps (1843 resets) in 177 ms. (224 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (482 resets) in 77 ms. (512 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40003 steps (497 resets) in 79 ms. (500 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (256 resets) in 164 ms. (242 steps per ms) remains 6/7 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-05 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40002 steps (507 resets) in 120 ms. (330 steps per ms) remains 5/6 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-00 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40003 steps (468 resets) in 40 ms. (975 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (481 resets) in 55 ms. (714 steps per ms) remains 5/5 properties
[2024-06-02 19:47:36] [INFO ] Flow matrix only has 367 transitions (discarded 8 similar events)
// Phase 1: matrix 367 rows 144 cols
[2024-06-02 19:47:36] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:47:36] [INFO ] State equation strengthened by 43 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 108/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 0/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 11/136 variables, 3/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/136 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 367/503 variables, 136/143 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/503 variables, 43/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/503 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 8/511 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/511 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 0/511 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 511/511 variables, and 194 constraints, problems are : Problem set: 0 solved, 5 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/17 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 108/125 variables, 4/4 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:47:36] [INFO ] Deduced a trap composed of 46 places in 73 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/125 variables, 1/5 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:47:36] [INFO ] Deduced a trap composed of 52 places in 61 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/125 variables, 1/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/125 variables, 0/6 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 11/136 variables, 3/9 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:47:36] [INFO ] Deduced a trap composed of 41 places in 37 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/136 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/136 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 367/503 variables, 136/146 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/503 variables, 43/189 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/503 variables, 5/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/503 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 8/511 variables, 8/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/511 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (OVERLAPS) 0/511 variables, 0/202 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 511/511 variables, and 202 constraints, problems are : Problem set: 0 solved, 5 unsolved in 847 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 144/144 constraints, ReadFeed: 43/43 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 3/3 constraints]
After SMT, in 1125ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 4390 ms.
Support contains 17 out of 144 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 144/144 places, 375/375 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 1 place count 144 transition count 374
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 143 transition count 374
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 4 place count 142 transition count 373
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 6 place count 140 transition count 371
Iterating global reduction 2 with 2 rules applied. Total rules applied 8 place count 140 transition count 371
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 11 place count 140 transition count 368
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 12 place count 140 transition count 367
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 13 place count 139 transition count 367
Applied a total of 13 rules in 20 ms. Remains 139 /144 variables (removed 5) and now considering 367/375 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 139/144 places, 367/375 transitions.
RANDOM walk for 40000 steps (1845 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (505 resets) in 116 ms. (341 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (250 resets) in 65 ms. (606 steps per ms) remains 4/5 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-02 FALSE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
BEST_FIRST walk for 40004 steps (509 resets) in 70 ms. (563 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40001 steps (495 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (484 resets) in 61 ms. (645 steps per ms) remains 4/4 properties
[2024-06-02 19:47:42] [INFO ] Flow matrix only has 359 transitions (discarded 8 similar events)
// Phase 1: matrix 359 rows 139 cols
[2024-06-02 19:47:42] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:47:42] [INFO ] State equation strengthened by 42 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 103/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/131 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:47:42] [INFO ] Deduced a trap composed of 50 places in 38 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 359/490 variables, 131/139 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/490 variables, 42/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 0/181 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (OVERLAPS) 8/498 variables, 8/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/498 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 0/498 variables, 0/189 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 498/498 variables, and 189 constraints, problems are : Problem set: 0 solved, 4 unsolved in 262 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 1/1 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/13 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 103/116 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/116 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 15/131 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/131 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:47:42] [INFO ] Deduced a trap composed of 41 places in 36 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/131 variables, 1/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/131 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (OVERLAPS) 359/490 variables, 131/140 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/490 variables, 42/182 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/490 variables, 4/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/490 variables, 0/186 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 8/498 variables, 8/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/498 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 0/498 variables, 0/194 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 498/498 variables, and 194 constraints, problems are : Problem set: 0 solved, 4 unsolved in 553 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 139/139 constraints, ReadFeed: 42/42 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 834ms problems are : Problem set: 0 solved, 4 unsolved
FORMULA FireWire-PT-18-ReachabilityFireability-2024-12 TRUE TECHNIQUES PARIKH_WALK
Parikh walk visited 1 properties in 4061 ms.
Support contains 11 out of 139 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 139/139 places, 367/367 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 138 transition count 364
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 138 transition count 364
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 137 transition count 362
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 137 transition count 362
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 136 transition count 359
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 136 transition count 359
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 135 transition count 357
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 135 transition count 357
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 134 transition count 355
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 134 transition count 355
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 133 transition count 353
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 133 transition count 353
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 132 transition count 352
Free-agglomeration rule applied 6 times.
Iterating global reduction 0 with 6 rules applied. Total rules applied 20 place count 132 transition count 346
Reduce places removed 6 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 7 rules applied. Total rules applied 27 place count 126 transition count 345
Applied a total of 27 rules in 43 ms. Remains 126 /139 variables (removed 13) and now considering 345/367 (removed 22) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 43 ms. Remains : 126/139 places, 345/367 transitions.
RANDOM walk for 40000 steps (1865 resets) in 110 ms. (360 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40002 steps (244 resets) in 33 ms. (1176 steps per ms) remains 3/3 properties
BEST_FIRST walk for 40004 steps (527 resets) in 54 ms. (727 steps per ms) remains 2/3 properties
FORMULA FireWire-PT-18-ReachabilityFireability-2024-14 TRUE TECHNIQUES TOPOLOGICAL BESTFIRST_WALK
[2024-06-02 19:47:47] [INFO ] Flow matrix only has 337 transitions (discarded 8 similar events)
// Phase 1: matrix 337 rows 126 cols
[2024-06-02 19:47:47] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:47:47] [INFO ] State equation strengthened by 59 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/118 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 0/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (OVERLAPS) 337/455 variables, 118/125 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/455 variables, 59/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 0/184 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (OVERLAPS) 8/463 variables, 8/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/463 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 0/463 variables, 0/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 463/463 variables, and 192 constraints, problems are : Problem set: 0 solved, 2 unsolved in 136 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 2 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 1 (OVERLAPS) 100/104 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/104 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 14/118 variables, 4/7 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:47:47] [INFO ] Deduced a trap composed of 44 places in 66 ms of which 1 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/118 variables, 1/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/118 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 337/455 variables, 118/126 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/455 variables, 59/185 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/455 variables, 2/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/455 variables, 0/187 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 8/463 variables, 8/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/463 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (OVERLAPS) 0/463 variables, 0/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 463/463 variables, and 195 constraints, problems are : Problem set: 0 solved, 2 unsolved in 353 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 126/126 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 498ms problems are : Problem set: 0 solved, 2 unsolved
Parikh walk visited 0 properties in 388 ms.
Support contains 4 out of 126 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 126/126 places, 345/345 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 124 transition count 340
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 124 transition count 340
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 7 place count 124 transition count 337
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 9 place count 123 transition count 342
Drop transitions (Empty/Sink Transition effects.) removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 10 place count 123 transition count 341
Free-agglomeration rule applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 13 place count 123 transition count 338
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 16 place count 120 transition count 338
Applied a total of 16 rules in 20 ms. Remains 120 /126 variables (removed 6) and now considering 338/345 (removed 7) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 120/126 places, 338/345 transitions.
RANDOM walk for 40000 steps (1980 resets) in 98 ms. (404 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (229 resets) in 33 ms. (1176 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40002 steps (552 resets) in 38 ms. (1025 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 1588192 steps, run timeout after 3001 ms. (steps per millisecond=529 ) properties seen :1 out of 2
Probabilistic random walk after 1588192 steps, saw 423640 distinct states, run finished after 3004 ms. (steps per millisecond=528 ) properties seen :1
FORMULA FireWire-PT-18-ReachabilityFireability-2024-09 FALSE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
[2024-06-02 19:47:51] [INFO ] Flow matrix only has 328 transitions (discarded 10 similar events)
// Phase 1: matrix 328 rows 120 cols
[2024-06-02 19:47:51] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:47:51] [INFO ] State equation strengthened by 59 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/112 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:47:51] [INFO ] Deduced a trap composed of 42 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:47:51] [INFO ] Deduced a trap composed of 35 places in 27 ms of which 0 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 0/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (OVERLAPS) 328/440 variables, 112/121 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/440 variables, 59/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 0/180 constraints. Problems are: Problem set: 0 solved, 1 unsolved
All remaining problems are real, not stopping.
At refinement iteration 9 (OVERLAPS) 8/448 variables, 8/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/448 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 0/448 variables, 0/188 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Real declared 448/448 variables, and 188 constraints, problems are : Problem set: 0 solved, 1 unsolved in 190 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 2/2 constraints]
Escalating to Integer solving :Problem set: 0 solved, 1 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/2 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 1 (OVERLAPS) 56/58 variables, 2/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/58 variables, 0/2 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 3 (OVERLAPS) 54/112 variables, 5/7 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/112 variables, 2/9 constraints. Problems are: Problem set: 0 solved, 1 unsolved
[2024-06-02 19:47:51] [INFO ] Deduced a trap composed of 34 places in 35 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/112 variables, 1/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/112 variables, 0/10 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 7 (OVERLAPS) 328/440 variables, 112/122 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/440 variables, 59/181 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/440 variables, 1/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/440 variables, 0/182 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 11 (OVERLAPS) 8/448 variables, 8/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/448 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
At refinement iteration 13 (OVERLAPS) 0/448 variables, 0/190 constraints. Problems are: Problem set: 0 solved, 1 unsolved
No progress, stopping.
After SMT solving in domain Int declared 448/448 variables, and 190 constraints, problems are : Problem set: 0 solved, 1 unsolved in 187 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 120/120 constraints, ReadFeed: 59/59 constraints, PredecessorRefiner: 1/1 constraints, Known Traps: 3/3 constraints]
After SMT, in 387ms problems are : Problem set: 0 solved, 1 unsolved
Parikh walk visited 0 properties in 11 ms.
Support contains 2 out of 120 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 120/120 places, 338/338 transitions.
Graph (trivial) has 17 edges and 120 vertex of which 2 / 120 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Drop transitions (Empty/Sink Transition effects.) removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 118 transition count 336
Drop transitions (Redundant composition of simpler transitions.) removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 5 place count 118 transition count 334
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 118 transition count 333
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 7 place count 117 transition count 333
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 117 transition count 327
Applied a total of 13 rules in 15 ms. Remains 117 /120 variables (removed 3) and now considering 327/338 (removed 11) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 117/120 places, 327/338 transitions.
RANDOM walk for 40000 steps (1904 resets) in 170 ms. (233 steps per ms) remains 1/1 properties
BEST_FIRST walk for 40003 steps (194 resets) in 49 ms. (800 steps per ms) remains 1/1 properties
Finished probabilistic random walk after 1516265 steps, run visited all 1 properties in 2676 ms. (steps per millisecond=566 )
Probabilistic random walk after 1516265 steps, saw 407103 distinct states, run finished after 2679 ms. (steps per millisecond=565 ) properties seen :1
FORMULA FireWire-PT-18-ReachabilityFireability-2024-04 TRUE TECHNIQUES TOPOLOGICAL PROBABILISTIC_WALK
All properties solved without resorting to model-checking.
Total runtime 68025 ms.
ITS solved all properties within timeout

BK_STOP 1717357674348

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

+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination ReachabilityFireability -timeout 360 -rebuildPNML

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-18"
export BK_EXAMINATION="ReachabilityFireability"
export BK_TOOL="ltsminxred"
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-5568"
echo " Executing tool ltsminxred"
echo " Input is FireWire-PT-18, examination is ReachabilityFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r553-tall-171734901400311"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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