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-171734901300276.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-14, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r553-tall-171734901300276
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K 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 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K 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 153K 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-14-LTLFireability-00
FORMULA_NAME FireWire-PT-14-LTLFireability-01
FORMULA_NAME FireWire-PT-14-LTLFireability-02
FORMULA_NAME FireWire-PT-14-LTLFireability-03
FORMULA_NAME FireWire-PT-14-LTLFireability-04
FORMULA_NAME FireWire-PT-14-LTLFireability-05
FORMULA_NAME FireWire-PT-14-LTLFireability-06
FORMULA_NAME FireWire-PT-14-LTLFireability-07
FORMULA_NAME FireWire-PT-14-LTLFireability-08
FORMULA_NAME FireWire-PT-14-LTLFireability-09
FORMULA_NAME FireWire-PT-14-LTLFireability-10
FORMULA_NAME FireWire-PT-14-LTLFireability-11
FORMULA_NAME FireWire-PT-14-LTLFireability-12
FORMULA_NAME FireWire-PT-14-LTLFireability-13
FORMULA_NAME FireWire-PT-14-LTLFireability-14
FORMULA_NAME FireWire-PT-14-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717356308196

Invoking MCC driver with
BK_TOOL=ltsminxred
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-14
BK_MEMORY_CONFINEMENT=16384
Applying reductions before tool ltsmin
Invoking reducer
Running Version 202405141337
[2024-06-02 19:25:09] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -timeout, 360, -rebuildPNML]
[2024-06-02 19:25:09] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 19:25:09] [INFO ] Load time of PNML (sax parser for PT used): 93 ms
[2024-06-02 19:25:09] [INFO ] Transformed 205 places.
[2024-06-02 19:25:09] [INFO ] Transformed 610 transitions.
[2024-06-02 19:25:09] [INFO ] Found NUPN structural information;
[2024-06-02 19:25:09] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 197 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 10 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 4 formulas.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
FORMULA FireWire-PT-14-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 199 transition count 527
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 199 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 199 transition count 524
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 198 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 198 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 197 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 197 transition count 519
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 196 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 196 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 195 transition count 514
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 195 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 194 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 194 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 193 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 193 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 192 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 192 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 191 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 191 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 190 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 190 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 189 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 189 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 188 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 188 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 187 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 187 transition count 495
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 45 place count 187 transition count 489
Applied a total of 45 rules in 115 ms. Remains 187 /205 variables (removed 18) and now considering 489/539 (removed 50) transitions.
[2024-06-02 19:25:09] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
// Phase 1: matrix 457 rows 187 cols
[2024-06-02 19:25:09] [INFO ] Computed 10 invariants in 22 ms
[2024-06-02 19:25:10] [INFO ] Implicit Places using invariants in 264 ms returned []
[2024-06-02 19:25:10] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
[2024-06-02 19:25:10] [INFO ] Invariant cache hit.
[2024-06-02 19:25:10] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 19:25:10] [INFO ] Implicit Places using invariants and state equation in 343 ms returned [71, 133]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 636 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/205 places, 489/539 transitions.
Applied a total of 0 rules in 3 ms. Remains 185 /185 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 770 ms. Remains : 185/205 places, 489/539 transitions.
Support contains 36 out of 185 places after structural reductions.
[2024-06-02 19:25:10] [INFO ] Flatten gal took : 82 ms
[2024-06-02 19:25:10] [INFO ] Flatten gal took : 55 ms
[2024-06-02 19:25:10] [INFO ] Input system was already deterministic with 489 transitions.
RANDOM walk for 40000 steps (1167 resets) in 1870 ms. (21 steps per ms) remains 7/27 properties
BEST_FIRST walk for 40003 steps (16 resets) in 141 ms. (281 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40002 steps (253 resets) in 118 ms. (336 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (244 resets) in 57 ms. (689 steps per ms) remains 7/7 properties
BEST_FIRST walk for 40004 steps (271 resets) in 112 ms. (354 steps per ms) remains 6/7 properties
BEST_FIRST walk for 40003 steps (43 resets) in 123 ms. (322 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40001 steps (251 resets) in 85 ms. (465 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (239 resets) in 101 ms. (392 steps per ms) remains 5/5 properties
[2024-06-02 19:25:11] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
// Phase 1: matrix 457 rows 185 cols
[2024-06-02 19:25:11] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 19:25:11] [INFO ] State equation strengthened by 68 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 55/175 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 0/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (OVERLAPS) 451/626 variables, 175/183 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/626 variables, 66/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 0/249 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (OVERLAPS) 15/641 variables, 10/259 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/641 variables, 1/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/641 variables, 0/260 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (OVERLAPS) 1/642 variables, 1/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/642 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 0/642 variables, 0/261 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 642/642 variables, and 261 constraints, problems are : Problem set: 0 solved, 5 unsolved in 481 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 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/9 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 111/120 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/120 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 55/175 variables, 5/8 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 35 places in 47 ms of which 6 ms to minimize.
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 35 places in 112 ms of which 2 ms to minimize.
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 26 places in 101 ms of which 3 ms to minimize.
[2024-06-02 19:25:12] [INFO ] Deduced a trap composed of 24 places in 92 ms of which 2 ms to minimize.
At refinement iteration 4 (INCLUDED_ONLY) 0/175 variables, 4/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/175 variables, 0/12 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 451/626 variables, 175/187 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/626 variables, 66/253 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/626 variables, 4/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/626 variables, 0/257 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 15/641 variables, 10/267 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/641 variables, 1/268 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/641 variables, 1/269 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:25:13] [INFO ] Deduced a trap composed of 43 places in 38 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/641 variables, 1/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/641 variables, 0/270 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/642 variables, 1/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/642 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/642 variables, 0/271 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 642/642 variables, and 271 constraints, problems are : Problem set: 0 solved, 5 unsolved in 1515 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 185/185 constraints, ReadFeed: 68/68 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 5/5 constraints]
After SMT, in 2046ms problems are : Problem set: 0 solved, 5 unsolved
Parikh walk visited 0 properties in 2208 ms.
Support contains 9 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 489/489 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 185 transition count 486
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 185 transition count 483
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 182 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 181 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 180 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 180 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 179 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 178 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 177 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 177 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 176 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 176 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 175 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 175 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 174 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 174 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 173 transition count 460
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 173 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 172 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 172 transition count 458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 171 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 171 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 170 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 170 transition count 454
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 168 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 165 transition count 458
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 165 transition count 452
Drop transitions (Redundant composition of simpler transitions.) removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 165 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 165 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 64 place count 162 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 162 transition count 443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 161 transition count 442
Applied a total of 71 rules in 135 ms. Remains 161 /185 variables (removed 24) and now considering 442/489 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 135 ms. Remains : 161/185 places, 442/489 transitions.
RANDOM walk for 40000 steps (1273 resets) in 1033 ms. (38 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (279 resets) in 61 ms. (645 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (275 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (46 resets) in 153 ms. (259 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (296 resets) in 124 ms. (320 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (272 resets) in 74 ms. (533 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 561517 steps, run timeout after 3001 ms. (steps per millisecond=187 ) properties seen :1 out of 5
Probabilistic random walk after 561517 steps, saw 166711 distinct states, run finished after 3018 ms. (steps per millisecond=186 ) properties seen :1
[2024-06-02 19:25:19] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 161 cols
[2024-06-02 19:25:19] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:25:19] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/565 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/566 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 298 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/565 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 632 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 952ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1021 ms.
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 161/161 places, 442/442 transitions.
RANDOM walk for 40000 steps (1271 resets) in 180 ms. (220 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (273 resets) in 75 ms. (526 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (272 resets) in 37 ms. (1052 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (49 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (265 resets) in 38 ms. (1025 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 554024 steps, run timeout after 3001 ms. (steps per millisecond=184 ) properties seen :0 out of 4
Probabilistic random walk after 554024 steps, saw 164466 distinct states, run finished after 3001 ms. (steps per millisecond=184 ) properties seen :0
[2024-06-02 19:25:25] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:25:25] [INFO ] Invariant cache hit.
[2024-06-02 19:25:25] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 10/565 variables, 7/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/565 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/566 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/566 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 566/566 variables, and 230 constraints, problems are : Problem set: 0 solved, 4 unsolved in 305 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 10/565 variables, 7/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/565 variables, 2/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/565 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/566 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/566 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 566/566 variables, and 234 constraints, problems are : Problem set: 0 solved, 4 unsolved in 642 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 161/161 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 962ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 619 ms.
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 161/161 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 19:25:26] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:25:26] [INFO ] Invariant cache hit.
[2024-06-02 19:25:26] [INFO ] Implicit Places using invariants in 89 ms returned []
[2024-06-02 19:25:26] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:25:26] [INFO ] Invariant cache hit.
[2024-06-02 19:25:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:25:27] [INFO ] Implicit Places using invariants and state equation in 353 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 454 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 442/442 transitions.
Applied a total of 0 rules in 18 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 480 ms. Remains : 160/161 places, 442/442 transitions.
RANDOM walk for 40000 steps (1262 resets) in 285 ms. (139 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40002 steps (274 resets) in 36 ms. (1081 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (271 resets) in 41 ms. (952 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (50 resets) in 60 ms. (655 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (273 resets) in 45 ms. (869 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 632715 steps, run timeout after 3001 ms. (steps per millisecond=210 ) properties seen :0 out of 4
Probabilistic random walk after 632715 steps, saw 187393 distinct states, run finished after 3001 ms. (steps per millisecond=210 ) properties seen :0
[2024-06-02 19:25:30] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 19:25:30] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:25:30] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/564 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 228 constraints, problems are : Problem set: 0 solved, 4 unsolved in 285 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/8 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 95/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (OVERLAPS) 9/564 variables, 6/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (OVERLAPS) 1/565 variables, 1/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/565 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 0/565 variables, 0/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 232 constraints, problems are : Problem set: 0 solved, 4 unsolved in 606 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
After SMT, in 912ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 1333 ms.
Support contains 8 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 17 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 19:25:32] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:25:32] [INFO ] Invariant cache hit.
[2024-06-02 19:25:32] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:25:32] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:25:32] [INFO ] Invariant cache hit.
[2024-06-02 19:25:32] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:25:32] [INFO ] Implicit Places using invariants and state equation in 249 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-06-02 19:25:32] [INFO ] Redundant transitions in 25 ms returned []
Running 436 sub problems to find dead transitions.
[2024-06-02 19:25:33] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:25:33] [INFO ] Invariant cache hit.
[2024-06-02 19:25:33] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:25:34] [INFO ] Deduced a trap composed of 59 places in 86 ms of which 2 ms to minimize.
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 17 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 23 places in 80 ms of which 2 ms to minimize.
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 0 ms to minimize.
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 32 places in 56 ms of which 0 ms to minimize.
[2024-06-02 19:25:35] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:25:36] [INFO ] Deduced a trap composed of 27 places in 84 ms of which 5 ms to minimize.
[2024-06-02 19:25:36] [INFO ] Deduced a trap composed of 32 places in 34 ms of which 0 ms to minimize.
[2024-06-02 19:25:37] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:25:37] [INFO ] Deduced a trap composed of 103 places in 84 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:25:42] [INFO ] Deduced a trap composed of 55 places in 85 ms of which 2 ms to minimize.
[2024-06-02 19:25:45] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:25:45] [INFO ] Deduced a trap composed of 50 places in 42 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:25:48] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 1 ms to minimize.
[2024-06-02 19:25:49] [INFO ] Deduced a trap composed of 50 places in 78 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:25:55] [INFO ] Deduced a trap composed of 57 places in 89 ms of which 2 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Real declared 565/565 variables, and 245 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 436/681 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:26:10] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30016 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 18/18 constraints]
After SMT, in 60522ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60532ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60912 ms. Remains : 160/160 places, 442/442 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 135 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 134 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 288
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 133 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 286
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 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 32 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 19:26:33] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 19:26:33] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:26:33] [INFO ] [Real]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 19:26:33] [INFO ] After 45ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 19:26:33] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:26:33] [INFO ] After 99ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 19:26:33] [INFO ] Deduced a trap composed of 21 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:26:33] [INFO ] Deduced a trap composed of 21 places in 21 ms of which 1 ms to minimize.
[2024-06-02 19:26:33] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 93 ms
TRAPS : Iteration 1
[2024-06-02 19:26:34] [INFO ] After 344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 19:26:34] [INFO ] After 446ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 541 ms.
Computed a total of 44 stabilizing places and 101 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||X(p2)||G(p3)||p0)))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 173 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 173 transition count 460
Applied a total of 24 rules in 15 ms. Remains 173 /185 variables (removed 12) and now considering 460/489 (removed 29) transitions.
[2024-06-02 19:26:34] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
// Phase 1: matrix 428 rows 173 cols
[2024-06-02 19:26:34] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:26:34] [INFO ] Implicit Places using invariants in 121 ms returned []
[2024-06-02 19:26:34] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2024-06-02 19:26:34] [INFO ] Invariant cache hit.
[2024-06-02 19:26:34] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 19:26:35] [INFO ] Implicit Places using invariants and state equation in 525 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 649 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/185 places, 460/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 172 /172 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 666 ms. Remains : 172/185 places, 460/489 transitions.
Stuttering acceptance computed with spot in 297 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-00
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-00 finished in 1025 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 185 transition count 486
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 182 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 180 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 180 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 178 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 178 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 176 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 176 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 174 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 174 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 172 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 172 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 170 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 170 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 168 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 168 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 166 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 166 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 164 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 164 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 162 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 162 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 160 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 160 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 158 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 158 transition count 428
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 0 with 6 rules applied. Total rules applied 60 place count 155 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 152 transition count 431
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 152 transition count 425
Applied a total of 72 rules in 91 ms. Remains 152 /185 variables (removed 33) and now considering 425/489 (removed 64) transitions.
[2024-06-02 19:26:35] [INFO ] Flow matrix only has 386 transitions (discarded 39 similar events)
// Phase 1: matrix 386 rows 152 cols
[2024-06-02 19:26:35] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:26:35] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 19:26:35] [INFO ] Flow matrix only has 386 transitions (discarded 39 similar events)
[2024-06-02 19:26:35] [INFO ] Invariant cache hit.
[2024-06-02 19:26:35] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 19:26:35] [INFO ] Implicit Places using invariants and state equation in 308 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 400 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/185 places, 425/489 transitions.
Applied a total of 0 rules in 8 ms. Remains 151 /151 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 499 ms. Remains : 151/185 places, 425/489 transitions.
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-01
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-01 finished in 548 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((G(p1) U X(p2))&&p0)))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 16 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 19:26:35] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 19:26:35] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 19:26:36] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 19:26:36] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 19:26:36] [INFO ] Invariant cache hit.
[2024-06-02 19:26:36] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:26:36] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 322 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 339 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 224 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-02
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-02 finished in 585 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(G(!p0))) U (!p1&&X(!p2))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 173 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 173 transition count 460
Applied a total of 24 rules in 17 ms. Remains 173 /185 variables (removed 12) and now considering 460/489 (removed 29) transitions.
[2024-06-02 19:26:36] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
// Phase 1: matrix 428 rows 173 cols
[2024-06-02 19:26:36] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:26:36] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 19:26:36] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2024-06-02 19:26:36] [INFO ] Invariant cache hit.
[2024-06-02 19:26:36] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 19:26:36] [INFO ] Implicit Places using invariants and state equation in 280 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 375 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/185 places, 460/489 transitions.
Applied a total of 0 rules in 1 ms. Remains 172 /172 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 394 ms. Remains : 172/185 places, 460/489 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR p1 p2), p0, p2, p0, true]
Running random walk in product with property : FireWire-PT-14-LTLFireability-03
Product exploration explored 100000 steps with 50000 reset in 354 ms.
Product exploration explored 100000 steps with 50000 reset in 210 ms.
Computed a total of 31 stabilizing places and 72 stable transitions
Computed a total of 31 stabilizing places and 72 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 p2))), (X (NOT p2)), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT (AND p1 p2)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 132 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-03 finished in 1329 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G(p1))))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 176 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 176 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 175 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 175 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 168 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 168 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 167 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 167 transition count 451
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 0 with 6 rules applied. Total rules applied 40 place count 164 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 161 transition count 454
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 161 transition count 448
Applied a total of 52 rules in 71 ms. Remains 161 /185 variables (removed 24) and now considering 448/489 (removed 41) transitions.
[2024-06-02 19:26:37] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
// Phase 1: matrix 409 rows 161 cols
[2024-06-02 19:26:37] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:26:38] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 19:26:38] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
[2024-06-02 19:26:38] [INFO ] Invariant cache hit.
[2024-06-02 19:26:38] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 19:26:38] [INFO ] Implicit Places using invariants and state equation in 261 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 364 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/185 places, 448/489 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 441 ms. Remains : 160/185 places, 448/489 transitions.
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-04
Product exploration explored 100000 steps with 3 reset in 147 ms.
Product exploration explored 100000 steps with 0 reset in 83 ms.
Computed a total of 22 stabilizing places and 60 stable transitions
Computed a total of 22 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 86 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
RANDOM walk for 40000 steps (1272 resets) in 182 ms. (218 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (394 resets) in 199 ms. (200 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (389 resets) in 260 ms. (153 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (384 resets) in 124 ms. (320 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (277 resets) in 46 ms. (851 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 775088 steps, run timeout after 3001 ms. (steps per millisecond=258 ) properties seen :1 out of 4
Probabilistic random walk after 775088 steps, saw 194404 distinct states, run finished after 3001 ms. (steps per millisecond=258 ) properties seen :1
[2024-06-02 19:26:42] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
// Phase 1: matrix 409 rows 160 cols
[2024-06-02 19:26:42] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:26:42] [INFO ] State equation strengthened by 60 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, 3 unsolved
At refinement iteration 1 (OVERLAPS) 98/102 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 3 (OVERLAPS) 357/459 variables, 102/105 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/145 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 6 (OVERLAPS) 98/557 variables, 50/195 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 3/198 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 20/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 0/218 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 10 (OVERLAPS) 10/567 variables, 7/225 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 13 (OVERLAPS) 1/568 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/568 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
At refinement iteration 15 (OVERLAPS) 0/568 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 3 unsolved
No progress, stopping.
After SMT solving in domain Real declared 568/569 variables, and 227 constraints, problems are : Problem set: 0 solved, 3 unsolved in 225 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 3/3 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 3 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/4 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 3 unsolved
Problem apf0 is UNSAT
At refinement iteration 1 (OVERLAPS) 98/102 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/102 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 357/459 variables, 102/105 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/459 variables, 40/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/459 variables, 0/145 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 98/557 variables, 50/195 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/557 variables, 3/198 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/557 variables, 20/218 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/557 variables, 2/220 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/557 variables, 0/220 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/567 variables, 7/227 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/567 variables, 1/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/567 variables, 0/228 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 14 (OVERLAPS) 1/568 variables, 1/229 constraints. Problems are: Problem set: 1 solved, 2 unsolved
[2024-06-02 19:26:42] [INFO ] Deduced a trap composed of 33 places in 41 ms of which 1 ms to minimize.
At refinement iteration 15 (INCLUDED_ONLY) 0/568 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/568 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/568 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 568/569 variables, and 230 constraints, problems are : Problem set: 1 solved, 2 unsolved in 480 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/3 constraints, Known Traps: 1/1 constraints]
After SMT, in 728ms problems are : Problem set: 1 solved, 2 unsolved
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 448/448 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 160 transition count 442
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 160 transition count 448
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 157 transition count 442
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 157 transition count 436
Applied a total of 24 rules in 14 ms. Remains 157 /160 variables (removed 3) and now considering 436/448 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 157/160 places, 436/448 transitions.
RANDOM walk for 40000 steps (1268 resets) in 125 ms. (317 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40003 steps (393 resets) in 59 ms. (666 steps per ms) remains 2/2 properties
BEST_FIRST walk for 40004 steps (380 resets) in 36 ms. (1081 steps per ms) remains 2/2 properties
Interrupted probabilistic random walk after 707905 steps, run timeout after 3001 ms. (steps per millisecond=235 ) properties seen :0 out of 2
Probabilistic random walk after 707905 steps, saw 208943 distinct states, run finished after 3001 ms. (steps per millisecond=235 ) properties seen :0
[2024-06-02 19:26:46] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
// Phase 1: matrix 399 rows 157 cols
[2024-06-02 19:26:46] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:26:46] [INFO ] State equation strengthened by 60 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) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 350/450 variables, 100/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/545 variables, 49/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 0/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (OVERLAPS) 10/555 variables, 7/222 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 1/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 13 (OVERLAPS) 1/556 variables, 1/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/556 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 0/556 variables, 0/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 224 constraints, problems are : Problem set: 0 solved, 2 unsolved in 179 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 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) 96/100 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/100 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 3 (OVERLAPS) 350/450 variables, 100/103 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/450 variables, 40/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/450 variables, 0/143 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 6 (OVERLAPS) 95/545 variables, 49/192 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/545 variables, 3/195 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/545 variables, 20/215 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/545 variables, 2/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 10 (INCLUDED_ONLY) 0/545 variables, 0/217 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 11 (OVERLAPS) 10/555 variables, 7/224 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 2 unsolved
[2024-06-02 19:26:46] [INFO ] Deduced a trap composed of 32 places in 40 ms of which 1 ms to minimize.
At refinement iteration 13 (INCLUDED_ONLY) 0/555 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 15 (OVERLAPS) 1/556 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/556 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
At refinement iteration 17 (OVERLAPS) 0/556 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 2 unsolved
No progress, stopping.
After SMT solving in domain Int declared 556/556 variables, and 227 constraints, problems are : Problem set: 0 solved, 2 unsolved in 527 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 2/2 constraints, Known Traps: 1/1 constraints]
After SMT, in 723ms problems are : Problem set: 0 solved, 2 unsolved
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 157 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 436/436 transitions.
Applied a total of 0 rules in 7 ms. Remains 157 /157 variables (removed 0) and now considering 436/436 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 157/157 places, 436/436 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 157/157 places, 436/436 transitions.
Applied a total of 0 rules in 5 ms. Remains 157 /157 variables (removed 0) and now considering 436/436 (removed 0) transitions.
[2024-06-02 19:26:46] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 19:26:46] [INFO ] Invariant cache hit.
[2024-06-02 19:26:46] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:26:46] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 19:26:46] [INFO ] Invariant cache hit.
[2024-06-02 19:26:46] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 19:26:47] [INFO ] Implicit Places using invariants and state equation in 277 ms returned []
Implicit Place search using SMT with State Equation took 371 ms to find 0 implicit places.
[2024-06-02 19:26:47] [INFO ] Redundant transitions in 11 ms returned []
Running 430 sub problems to find dead transitions.
[2024-06-02 19:26:47] [INFO ] Flow matrix only has 399 transitions (discarded 37 similar events)
[2024-06-02 19:26:47] [INFO ] Invariant cache hit.
[2024-06-02 19:26:47] [INFO ] State equation strengthened by 60 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 19:26:48] [INFO ] Deduced a trap composed of 58 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:26:49] [INFO ] Deduced a trap composed of 17 places in 79 ms of which 2 ms to minimize.
[2024-06-02 19:26:49] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:26:49] [INFO ] Deduced a trap composed of 32 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:26:49] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:26:49] [INFO ] Deduced a trap composed of 29 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:26:49] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 2 ms to minimize.
[2024-06-02 19:26:50] [INFO ] Deduced a trap composed of 29 places in 80 ms of which 4 ms to minimize.
[2024-06-02 19:26:50] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:26:50] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:26:51] [INFO ] Deduced a trap composed of 51 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/175 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/235 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 19:26:58] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 19:27:02] [INFO ] Deduced a trap composed of 48 places in 45 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 19:27:07] [INFO ] Deduced a trap composed of 56 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:27:07] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/556 variables, 2/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/556 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 9 (OVERLAPS) 0/556 variables, 0/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
No progress, stopping.
After SMT solving in domain Real declared 556/556 variables, and 239 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 15/15 constraints]
Escalating to Integer solving :Problem set: 0 solved, 430 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/157 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/157 variables, 15/22 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/157 variables, 0/22 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 3 (OVERLAPS) 399/556 variables, 157/179 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/556 variables, 60/239 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/556 variables, 430/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/556 variables, 0/669 constraints. Problems are: Problem set: 0 solved, 430 unsolved
[2024-06-02 19:27:31] [INFO ] Deduced a trap composed of 38 places in 40 ms of which 1 ms to minimize.
At refinement iteration 7 (OVERLAPS) 0/556 variables, 1/670 constraints. Problems are: Problem set: 0 solved, 430 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 556/556 variables, and 670 constraints, problems are : Problem set: 0 solved, 430 unsolved in 30019 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 157/157 constraints, ReadFeed: 60/60 constraints, PredecessorRefiner: 430/430 constraints, Known Traps: 16/16 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 430 unsolved
Search for dead transitions found 0 dead transitions in 60425ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60826 ms. Remains : 157/157 places, 436/436 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 135 edges and 157 vertex of which 29 / 157 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 131 transition count 291
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 131 transition count 282
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 21 place count 131 transition count 267
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 33 place count 122 transition count 264
Partial Free-agglomeration rule applied 7 times.
Drop transitions (Partial Free agglomeration) removed 7 transitions
Iterating global reduction 1 with 7 rules applied. Total rules applied 40 place count 122 transition count 264
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 41 place count 122 transition count 263
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 42 place count 121 transition count 262
Iterating global reduction 1 with 1 rules applied. Total rules applied 43 place count 121 transition count 262
Applied a total of 43 rules in 22 ms. Remains 121 /157 variables (removed 36) and now considering 262/436 (removed 174) transitions.
Running SMT prover for 2 properties.
[2024-06-02 19:27:47] [INFO ] Flow matrix only has 260 transitions (discarded 2 similar events)
// Phase 1: matrix 260 rows 121 cols
[2024-06-02 19:27:47] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:27:47] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 19:27:47] [INFO ] [Nat]Absence check using 7 positive place invariants in 3 ms returned sat
[2024-06-02 19:27:47] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
TRAPS : Iteration 0
[2024-06-02 19:27:47] [INFO ] After 158ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
[2024-06-02 19:27:47] [INFO ] After 245ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Over-approximation ignoring read arcs solved 0 properties in 319 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), (X p1), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0)), (X (X p1)), (G (OR p0 p1))]
False Knowledge obtained : [(F (NOT p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 10 factoid took 18 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-04 finished in 70064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(!p0)) U (p0 U p1)))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 175 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 175 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 168 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 167 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 166 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 166 transition count 448
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 0 with 6 rules applied. Total rules applied 42 place count 163 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 161 transition count 449
Drop transitions (Redundant composition of simpler transitions.) removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 161 transition count 445
Applied a total of 50 rules in 45 ms. Remains 161 /185 variables (removed 24) and now considering 445/489 (removed 44) transitions.
[2024-06-02 19:27:47] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
// Phase 1: matrix 409 rows 161 cols
[2024-06-02 19:27:47] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:27:48] [INFO ] Implicit Places using invariants in 91 ms returned []
[2024-06-02 19:27:48] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2024-06-02 19:27:48] [INFO ] Invariant cache hit.
[2024-06-02 19:27:48] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 19:27:48] [INFO ] Implicit Places using invariants and state equation in 263 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 368 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/185 places, 445/489 transitions.
Applied a total of 0 rules in 15 ms. Remains 160 /160 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 428 ms. Remains : 160/185 places, 445/489 transitions.
Stuttering acceptance computed with spot in 59 ms :[(NOT p1), p0]
Running random walk in product with property : FireWire-PT-14-LTLFireability-05
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-05 finished in 506 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(G(p0))||!(p1 U (X((p1 U p2))||p1))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 18 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 19:27:48] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 19:27:48] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:27:48] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 19:27:48] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 19:27:48] [INFO ] Invariant cache hit.
[2024-06-02 19:27:48] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:27:48] [INFO ] Implicit Places using invariants and state equation in 227 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 305 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 325 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 154 ms :[true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p2), p2]
Running random walk in product with property : FireWire-PT-14-LTLFireability-07
Product exploration explored 100000 steps with 50000 reset in 146 ms.
Product exploration explored 100000 steps with 50000 reset in 137 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X p0), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X (NOT p1)), (X (X (NOT p2))), (X (X (NOT (AND p2 (NOT p0))))), (X (X p0)), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 16 factoid took 187 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-07 finished in 968 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((p0||X(X(p1)))))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 172 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 172 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 171 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 171 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 170 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 170 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 169 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 168 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 168 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 167 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 167 transition count 445
Applied a total of 36 rules in 19 ms. Remains 167 /185 variables (removed 18) and now considering 445/489 (removed 44) transitions.
[2024-06-02 19:27:49] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
// Phase 1: matrix 413 rows 167 cols
[2024-06-02 19:27:49] [INFO ] Computed 8 invariants in 4 ms
[2024-06-02 19:27:49] [INFO ] Implicit Places using invariants in 93 ms returned []
[2024-06-02 19:27:49] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
[2024-06-02 19:27:49] [INFO ] Invariant cache hit.
[2024-06-02 19:27:49] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 19:27:49] [INFO ] Implicit Places using invariants and state equation in 260 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 355 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/185 places, 445/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 166 /166 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 376 ms. Remains : 166/185 places, 445/489 transitions.
Stuttering acceptance computed with spot in 174 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-10
Product exploration explored 100000 steps with 33333 reset in 203 ms.
Product exploration explored 100000 steps with 33333 reset in 151 ms.
Computed a total of 25 stabilizing places and 57 stable transitions
Computed a total of 25 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 15 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-10 finished in 938 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(F(p1))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Applied a total of 22 rules in 13 ms. Remains 174 /185 variables (removed 11) and now considering 462/489 (removed 27) transitions.
[2024-06-02 19:27:50] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
// Phase 1: matrix 430 rows 174 cols
[2024-06-02 19:27:50] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 19:27:50] [INFO ] Implicit Places using invariants in 88 ms returned []
[2024-06-02 19:27:50] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 19:27:50] [INFO ] Invariant cache hit.
[2024-06-02 19:27:50] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 19:27:50] [INFO ] Implicit Places using invariants and state equation in 354 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
Running 461 sub problems to find dead transitions.
[2024-06-02 19:27:50] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 19:27:50] [INFO ] Invariant cache hit.
[2024-06-02 19:27:50] [INFO ] State equation strengthened by 63 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 19:27:54] [INFO ] Deduced a trap composed of 101 places in 84 ms of which 1 ms to minimize.
[2024-06-02 19:27:54] [INFO ] Deduced a trap composed of 35 places in 30 ms of which 1 ms to minimize.
[2024-06-02 19:27:54] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:27:54] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:27:54] [INFO ] Deduced a trap composed of 25 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:27:55] [INFO ] Deduced a trap composed of 35 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:27:55] [INFO ] Deduced a trap composed of 24 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:27:56] [INFO ] Deduced a trap composed of 30 places in 76 ms of which 2 ms to minimize.
[2024-06-02 19:27:56] [INFO ] Deduced a trap composed of 35 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:27:56] [INFO ] Deduced a trap composed of 42 places in 40 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/603 variables, 174/192 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 62/254 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 0/254 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 7 (OVERLAPS) 1/604 variables, 1/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/604 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 9 (OVERLAPS) 0/604 variables, 0/255 constraints. Problems are: Problem set: 0 solved, 461 unsolved
No progress, stopping.
After SMT solving in domain Real declared 604/604 variables, and 255 constraints, problems are : Problem set: 0 solved, 461 unsolved in 27415 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, ReadFeed: 63/63 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 10/10 constraints]
Escalating to Integer solving :Problem set: 0 solved, 461 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/173 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 1 (OVERLAPS) 1/174 variables, 8/8 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/174 variables, 10/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 3 (INCLUDED_ONLY) 0/174 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 4 (OVERLAPS) 429/603 variables, 174/192 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/603 variables, 62/254 constraints. Problems are: Problem set: 0 solved, 461 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/603 variables, 461/715 constraints. Problems are: Problem set: 0 solved, 461 unsolved
[2024-06-02 19:28:27] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 0 ms to minimize.
[2024-06-02 19:28:27] [INFO ] Deduced a trap composed of 43 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:28:36] [INFO ] Deduced a trap composed of 54 places in 33 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/603 variables, 3/718 constraints. Problems are: Problem set: 0 solved, 461 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 603/604 variables, and 718 constraints, problems are : Problem set: 0 solved, 461 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 8/8 constraints, State Equation: 174/174 constraints, ReadFeed: 62/63 constraints, PredecessorRefiner: 461/461 constraints, Known Traps: 13/13 constraints]
After SMT, in 57832ms problems are : Problem set: 0 solved, 461 unsolved
Search for dead transitions found 0 dead transitions in 57836ms
Starting structural reductions in LTL mode, iteration 1 : 174/185 places, 462/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 58305 ms. Remains : 174/185 places, 462/489 transitions.
Stuttering acceptance computed with spot in 96 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-12
Product exploration explored 100000 steps with 50000 reset in 129 ms.
Product exploration explored 100000 steps with 50000 reset in 142 ms.
Computed a total of 33 stabilizing places and 74 stable transitions
Computed a total of 33 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 9 factoid took 15 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-12 finished in 58704 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||F(p2))))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 180 transition count 482
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 180 transition count 482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 179 transition count 480
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 179 transition count 480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 178 transition count 477
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 178 transition count 477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 177 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 176 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 176 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 175 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 175 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 456
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 0 with 4 rules applied. Total rules applied 34 place count 167 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 164 transition count 460
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 164 transition count 454
Applied a total of 46 rules in 50 ms. Remains 164 /185 variables (removed 21) and now considering 454/489 (removed 35) transitions.
[2024-06-02 19:28:49] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 164 cols
[2024-06-02 19:28:49] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:28:49] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-06-02 19:28:49] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 19:28:49] [INFO ] Invariant cache hit.
[2024-06-02 19:28:49] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:28:49] [INFO ] Implicit Places using invariants and state equation in 284 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 387 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/185 places, 454/489 transitions.
Applied a total of 0 rules in 7 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 444 ms. Remains : 163/185 places, 454/489 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-13
Product exploration explored 100000 steps with 4 reset in 65 ms.
Product exploration explored 100000 steps with 8 reset in 64 ms.
Computed a total of 25 stabilizing places and 66 stable transitions
Computed a total of 25 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 15 factoid took 103 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p1) (NOT p0))]
RANDOM walk for 40000 steps (1265 resets) in 212 ms. (187 steps per ms) remains 6/8 properties
BEST_FIRST walk for 40003 steps (260 resets) in 55 ms. (714 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (271 resets) in 73 ms. (540 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (255 resets) in 61 ms. (645 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (263 resets) in 71 ms. (555 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40004 steps (252 resets) in 72 ms. (548 steps per ms) remains 6/6 properties
BEST_FIRST walk for 40003 steps (274 resets) in 72 ms. (547 steps per ms) remains 6/6 properties
[2024-06-02 19:28:50] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 19:28:50] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:28:50] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 6 unsolved
Problem apf7 is UNSAT
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 0/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 9/576 variables, 6/229 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 1/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/577 variables, 1/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/577 variables, 0/231 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 231 constraints, problems are : Problem set: 1 solved, 5 unsolved in 339 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 6/6 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 1 solved, 5 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 5/228 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 19:28:50] [INFO ] Deduced a trap composed of 23 places in 81 ms of which 2 ms to minimize.
[2024-06-02 19:28:50] [INFO ] Deduced a trap composed of 33 places in 33 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/230 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 9/576 variables, 6/236 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 1/237 constraints. Problems are: Problem set: 1 solved, 5 unsolved
[2024-06-02 19:28:51] [INFO ] Deduced a trap composed of 54 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:28:51] [INFO ] Deduced a trap composed of 51 places in 39 ms of which 1 ms to minimize.
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 2/239 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/576 variables, 0/239 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 16 (OVERLAPS) 1/577 variables, 1/240 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 17 (INCLUDED_ONLY) 0/577 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 5 unsolved
At refinement iteration 18 (OVERLAPS) 0/577 variables, 0/240 constraints. Problems are: Problem set: 1 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/578 variables, and 240 constraints, problems are : Problem set: 1 solved, 5 unsolved in 1316 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/6 constraints, Known Traps: 4/4 constraints]
After SMT, in 1670ms problems are : Problem set: 1 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 586 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 454/454 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 454
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 160 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 160 transition count 442
Applied a total of 24 rules in 14 ms. Remains 160 /163 variables (removed 3) and now considering 442/454 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 160/163 places, 442/454 transitions.
RANDOM walk for 40000 steps (1274 resets) in 423 ms. (94 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (263 resets) in 126 ms. (314 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (248 resets) in 70 ms. (563 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (261 resets) in 77 ms. (512 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (268 resets) in 76 ms. (519 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40002 steps (248 resets) in 67 ms. (588 steps per ms) remains 5/5 properties
Interrupted probabilistic random walk after 392387 steps, run timeout after 3001 ms. (steps per millisecond=130 ) properties seen :0 out of 5
Probabilistic random walk after 392387 steps, saw 116522 distinct states, run finished after 3001 ms. (steps per millisecond=130 ) properties seen :0
[2024-06-02 19:28:55] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 19:28:55] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:28:55] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 10 (OVERLAPS) 9/564 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 228 constraints, problems are : Problem set: 0 solved, 5 unsolved in 340 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 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/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 5/225 constraints. Problems are: Problem set: 0 solved, 5 unsolved
[2024-06-02 19:28:56] [INFO ] Deduced a trap composed of 43 places in 42 ms of which 0 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 12 (OVERLAPS) 9/564 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/564 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 15 (OVERLAPS) 1/565 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/565 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
At refinement iteration 17 (OVERLAPS) 0/565 variables, 0/234 constraints. Problems are: Problem set: 0 solved, 5 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 234 constraints, problems are : Problem set: 0 solved, 5 unsolved in 916 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 5/5 constraints, Known Traps: 1/1 constraints]
After SMT, in 1271ms problems are : Problem set: 0 solved, 5 unsolved
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 936 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 6 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 19:28:58] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:28:58] [INFO ] Invariant cache hit.
[2024-06-02 19:28:58] [INFO ] Implicit Places using invariants in 78 ms returned []
[2024-06-02 19:28:58] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:28:58] [INFO ] Invariant cache hit.
[2024-06-02 19:28:58] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:28:58] [INFO ] Implicit Places using invariants and state equation in 259 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-06-02 19:28:58] [INFO ] Redundant transitions in 5 ms returned []
Running 436 sub problems to find dead transitions.
[2024-06-02 19:28:58] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:28:58] [INFO ] Invariant cache hit.
[2024-06-02 19:28:58] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:29:00] [INFO ] Deduced a trap composed of 59 places in 78 ms of which 1 ms to minimize.
[2024-06-02 19:29:00] [INFO ] Deduced a trap composed of 17 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:29:00] [INFO ] Deduced a trap composed of 23 places in 74 ms of which 2 ms to minimize.
[2024-06-02 19:29:00] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:29:00] [INFO ] Deduced a trap composed of 25 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:29:00] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:29:01] [INFO ] Deduced a trap composed of 17 places in 68 ms of which 1 ms to minimize.
[2024-06-02 19:29:01] [INFO ] Deduced a trap composed of 27 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:29:01] [INFO ] Deduced a trap composed of 32 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:29:02] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:29:02] [INFO ] Deduced a trap composed of 103 places in 88 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:29:07] [INFO ] Deduced a trap composed of 55 places in 83 ms of which 1 ms to minimize.
[2024-06-02 19:29:10] [INFO ] Deduced a trap composed of 38 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:29:10] [INFO ] Deduced a trap composed of 50 places in 40 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:29:13] [INFO ] Deduced a trap composed of 39 places in 33 ms of which 0 ms to minimize.
[2024-06-02 19:29:14] [INFO ] Deduced a trap composed of 50 places in 85 ms of which 2 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:29:20] [INFO ] Deduced a trap composed of 57 places in 68 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 245 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30015 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 436/681 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:29:35] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 18/18 constraints]
After SMT, in 60420ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60424ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60779 ms. Remains : 160/160 places, 442/442 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 134 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 288
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 133 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 286
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 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 17 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 5 properties.
[2024-06-02 19:29:58] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 19:29:58] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 19:29:58] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 19:29:59] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:29:59] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
TRAPS : Iteration 0
[2024-06-02 19:29:59] [INFO ] Deduced a trap composed of 21 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:29:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 19:29:59] [INFO ] Deduced a trap composed of 21 places in 28 ms of which 1 ms to minimize.
[2024-06-02 19:29:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 52 ms
TRAPS : Iteration 1
[2024-06-02 19:29:59] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
[2024-06-02 19:29:59] [INFO ] After 570ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Over-approximation ignoring read arcs solved 0 properties in 642 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X p2), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X p0), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT p1)), (X (X p2)), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X p0)), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT p1))), (G (OR p2 p0 (NOT p1)))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 16 factoid took 173 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p2) (NOT p1) (NOT p0)), (AND (NOT p2) (NOT p0))]
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 454/454 transitions.
Applied a total of 0 rules in 8 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-06-02 19:29:59] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 19:29:59] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:29:59] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 19:29:59] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 19:29:59] [INFO ] Invariant cache hit.
[2024-06-02 19:30:00] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:30:00] [INFO ] Implicit Places using invariants and state equation in 217 ms returned []
Implicit Place search using SMT with State Equation took 306 ms to find 0 implicit places.
[2024-06-02 19:30:00] [INFO ] Redundant transitions in 2 ms returned []
Running 447 sub problems to find dead transitions.
[2024-06-02 19:30:00] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 19:30:00] [INFO ] Invariant cache hit.
[2024-06-02 19:30:00] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:30:02] [INFO ] Deduced a trap composed of 62 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:30:02] [INFO ] Deduced a trap composed of 60 places in 77 ms of which 1 ms to minimize.
[2024-06-02 19:30:02] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:30:02] [INFO ] Deduced a trap composed of 23 places in 84 ms of which 2 ms to minimize.
[2024-06-02 19:30:02] [INFO ] Deduced a trap composed of 33 places in 29 ms of which 1 ms to minimize.
[2024-06-02 19:30:02] [INFO ] Deduced a trap composed of 17 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:30:03] [INFO ] Deduced a trap composed of 25 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:30:03] [INFO ] Deduced a trap composed of 33 places in 27 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:30:09] [INFO ] Deduced a trap composed of 61 places in 77 ms of which 2 ms to minimize.
[2024-06-02 19:30:09] [INFO ] Deduced a trap composed of 59 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:30:09] [INFO ] Deduced a trap composed of 58 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:30:12] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 1 ms to minimize.
[2024-06-02 19:30:12] [INFO ] Deduced a trap composed of 51 places in 38 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:30:15] [INFO ] Deduced a trap composed of 17 places in 77 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 8 (OVERLAPS) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 245 constraints, problems are : Problem set: 0 solved, 447 unsolved in 26175 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 447/692 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:30:32] [INFO ] Deduced a trap composed of 40 places in 40 ms of which 1 ms to minimize.
[2024-06-02 19:30:32] [INFO ] Deduced a trap composed of 40 places in 38 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 694 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30020 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 16/16 constraints]
After SMT, in 56577ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 56581ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 56901 ms. Remains : 163/163 places, 454/454 transitions.
Computed a total of 25 stabilizing places and 66 stable transitions
Computed a total of 25 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 97 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
RANDOM walk for 40000 steps (1292 resets) in 243 ms. (163 steps per ms) remains 5/6 properties
BEST_FIRST walk for 40003 steps (275 resets) in 52 ms. (754 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40004 steps (282 resets) in 79 ms. (500 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40001 steps (285 resets) in 75 ms. (526 steps per ms) remains 5/5 properties
BEST_FIRST walk for 40003 steps (266 resets) in 74 ms. (533 steps per ms) remains 4/5 properties
BEST_FIRST walk for 40004 steps (273 resets) in 88 ms. (449 steps per ms) remains 4/4 properties
[2024-06-02 19:30:57] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 19:30:57] [INFO ] Invariant cache hit.
[2024-06-02 19:30:57] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 0/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/576 variables, 6/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/576 variables, 1/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/576 variables, 0/230 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/577 variables, 1/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/577 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/577 variables, 0/231 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 231 constraints, problems are : Problem set: 0 solved, 4 unsolved in 256 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 99/105 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/105 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 365/470 variables, 105/108 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/470 variables, 41/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/470 variables, 0/149 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 97/567 variables, 51/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/567 variables, 3/203 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/567 variables, 20/223 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/567 variables, 4/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:30:57] [INFO ] Deduced a trap composed of 33 places in 43 ms of which 1 ms to minimize.
[2024-06-02 19:30:57] [INFO ] Deduced a trap composed of 33 places in 32 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/567 variables, 2/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/567 variables, 0/229 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (OVERLAPS) 9/576 variables, 6/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (INCLUDED_ONLY) 0/576 variables, 1/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/576 variables, 0/236 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 1/577 variables, 1/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (INCLUDED_ONLY) 0/577 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 17 (OVERLAPS) 0/577 variables, 0/237 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 577/578 variables, and 237 constraints, problems are : Problem set: 0 solved, 4 unsolved in 748 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 2/2 constraints]
After SMT, in 1014ms problems are : Problem set: 0 solved, 4 unsolved
Parikh walk visited 0 properties in 639 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 454/454 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 454
Reduce places removed 3 places and 0 transitions.
Drop transitions (Empty/Sink Transition effects.) removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 160 transition count 448
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 160 transition count 442
Applied a total of 24 rules in 14 ms. Remains 160 /163 variables (removed 3) and now considering 442/454 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 160/163 places, 442/454 transitions.
RANDOM walk for 40000 steps (1336 resets) in 247 ms. (161 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (273 resets) in 53 ms. (740 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (264 resets) in 65 ms. (606 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40004 steps (277 resets) in 49 ms. (800 steps per ms) remains 4/4 properties
BEST_FIRST walk for 40003 steps (267 resets) in 64 ms. (615 steps per ms) remains 4/4 properties
Interrupted probabilistic random walk after 407595 steps, run timeout after 3001 ms. (steps per millisecond=135 ) properties seen :0 out of 4
Probabilistic random walk after 407595 steps, saw 121428 distinct states, run finished after 3001 ms. (steps per millisecond=135 ) properties seen :0
[2024-06-02 19:31:02] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 19:31:02] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 19:31:02] [INFO ] State equation strengthened by 61 read => feed constraints.
All remaining problems are real, not stopping.
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 0/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 10 (OVERLAPS) 9/564 variables, 6/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 11 (INCLUDED_ONLY) 0/564 variables, 1/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/564 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 1/565 variables, 1/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (OVERLAPS) 0/565 variables, 0/228 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 228 constraints, problems are : Problem set: 0 solved, 4 unsolved in 251 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 0/0 constraints]
Escalating to Integer solving :Problem set: 0 solved, 4 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/6 variables, 0/0 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 1 (OVERLAPS) 97/103 variables, 3/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/103 variables, 0/3 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 3 (OVERLAPS) 358/461 variables, 103/106 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/461 variables, 41/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/461 variables, 0/147 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 6 (OVERLAPS) 94/555 variables, 50/197 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/555 variables, 3/200 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/555 variables, 20/220 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 9 (INCLUDED_ONLY) 0/555 variables, 4/224 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:31:02] [INFO ] Deduced a trap composed of 23 places in 79 ms of which 1 ms to minimize.
At refinement iteration 10 (INCLUDED_ONLY) 0/555 variables, 1/225 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:31:02] [INFO ] Deduced a trap composed of 43 places in 44 ms of which 0 ms to minimize.
At refinement iteration 11 (INCLUDED_ONLY) 0/555 variables, 1/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 12 (INCLUDED_ONLY) 0/555 variables, 0/226 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 13 (OVERLAPS) 9/564 variables, 6/232 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 14 (INCLUDED_ONLY) 0/564 variables, 1/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 15 (INCLUDED_ONLY) 0/564 variables, 0/233 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 16 (OVERLAPS) 1/565 variables, 1/234 constraints. Problems are: Problem set: 0 solved, 4 unsolved
[2024-06-02 19:31:03] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
At refinement iteration 17 (INCLUDED_ONLY) 0/565 variables, 1/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 18 (INCLUDED_ONLY) 0/565 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
At refinement iteration 19 (OVERLAPS) 0/565 variables, 0/235 constraints. Problems are: Problem set: 0 solved, 4 unsolved
No progress, stopping.
After SMT solving in domain Int declared 565/565 variables, and 235 constraints, problems are : Problem set: 0 solved, 4 unsolved in 903 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 4/4 constraints, Known Traps: 3/3 constraints]
After SMT, in 1169ms problems are : Problem set: 0 solved, 4 unsolved
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 690 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 19:31:04] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:31:04] [INFO ] Invariant cache hit.
[2024-06-02 19:31:04] [INFO ] Implicit Places using invariants in 95 ms returned []
[2024-06-02 19:31:04] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:31:04] [INFO ] Invariant cache hit.
[2024-06-02 19:31:04] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:31:04] [INFO ] Implicit Places using invariants and state equation in 250 ms returned []
Implicit Place search using SMT with State Equation took 347 ms to find 0 implicit places.
[2024-06-02 19:31:04] [INFO ] Redundant transitions in 4 ms returned []
Running 436 sub problems to find dead transitions.
[2024-06-02 19:31:04] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 19:31:04] [INFO ] Invariant cache hit.
[2024-06-02 19:31:04] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:31:06] [INFO ] Deduced a trap composed of 59 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:31:06] [INFO ] Deduced a trap composed of 17 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:31:06] [INFO ] Deduced a trap composed of 23 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:31:06] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 1 ms to minimize.
[2024-06-02 19:31:06] [INFO ] Deduced a trap composed of 25 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:31:06] [INFO ] Deduced a trap composed of 32 places in 38 ms of which 0 ms to minimize.
[2024-06-02 19:31:07] [INFO ] Deduced a trap composed of 17 places in 80 ms of which 1 ms to minimize.
[2024-06-02 19:31:07] [INFO ] Deduced a trap composed of 27 places in 72 ms of which 1 ms to minimize.
[2024-06-02 19:31:07] [INFO ] Deduced a trap composed of 32 places in 31 ms of which 0 ms to minimize.
[2024-06-02 19:31:08] [INFO ] Deduced a trap composed of 17 places in 69 ms of which 1 ms to minimize.
[2024-06-02 19:31:08] [INFO ] Deduced a trap composed of 103 places in 72 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 11/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/18 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/178 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:31:13] [INFO ] Deduced a trap composed of 55 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:31:16] [INFO ] Deduced a trap composed of 38 places in 37 ms of which 1 ms to minimize.
[2024-06-02 19:31:16] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 1 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 3/242 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:31:19] [INFO ] Deduced a trap composed of 39 places in 42 ms of which 1 ms to minimize.
[2024-06-02 19:31:20] [INFO ] Deduced a trap composed of 50 places in 88 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 2/244 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:31:26] [INFO ] Deduced a trap composed of 57 places in 79 ms of which 1 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 9 (OVERLAPS) 0/565 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
No progress, stopping.
After SMT solving in domain Real declared 565/565 variables, and 245 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30023 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 17/17 constraints]
Escalating to Integer solving :Problem set: 0 solved, 436 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/160 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/160 variables, 17/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/160 variables, 0/24 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 3 (OVERLAPS) 405/565 variables, 160/184 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/565 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/565 variables, 436/681 constraints. Problems are: Problem set: 0 solved, 436 unsolved
[2024-06-02 19:31:41] [INFO ] Deduced a trap composed of 39 places in 45 ms of which 0 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/565 variables, 1/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/565 variables, 0/682 constraints. Problems are: Problem set: 0 solved, 436 unsolved
Error getting values : (error "ParserException while parsing response: (timeout
org.smtlib.IParser$ParserException: Unbalanced parentheses at end of input")
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 565/565 variables, and 682 constraints, problems are : Problem set: 0 solved, 436 unsolved in 30013 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 160/160 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 436/436 constraints, Known Traps: 18/18 constraints]
After SMT, in 60387ms problems are : Problem set: 0 solved, 436 unsolved
Search for dead transitions found 0 dead transitions in 60392ms
Finished structural reductions in REACHABILITY mode , in 1 iterations and 60753 ms. Remains : 160/160 places, 442/442 transitions.
Attempting over-approximation, by ignoring read arcs.
Graph (trivial) has 137 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions (Empty/Sink Transition effects.) removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
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 3 place count 134 transition count 297
Drop transitions (Redundant composition of simpler transitions.) removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 288
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 133 transition count 287
Drop transitions (Redundant composition of simpler transitions.) removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 286
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 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions (Partial Free agglomeration) removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 19 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 19:32:04] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 19:32:04] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 19:32:04] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 19:32:04] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 19:32:05] [INFO ] After 88ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
TRAPS : Iteration 0
[2024-06-02 19:32:05] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
[2024-06-02 19:32:05] [INFO ] After 250ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Over-approximation ignoring read arcs solved 0 properties in 319 ms.
Knowledge obtained : [(AND p2 (NOT p1) p0), (X p2), (X (NOT (AND (NOT p2) (NOT p0)))), (X p0), (X (NOT (AND (NOT p2) p0))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p0))))), (X (X p0)), (X (X (NOT (AND (NOT p2) p0))))]
False Knowledge obtained : [(F p1), (F (NOT p0))]
Knowledge based reduction with 9 factoid took 178 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p2) (NOT p0))]
Product exploration explored 100000 steps with 2 reset in 65 ms.
Product exploration explored 100000 steps with 23 reset in 70 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 454/454 transitions.
Applied a total of 0 rules in 5 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-06-02 19:32:05] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 19:32:05] [INFO ] Computed 7 invariants in 5 ms
[2024-06-02 19:32:05] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-06-02 19:32:05] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 19:32:05] [INFO ] Invariant cache hit.
[2024-06-02 19:32:05] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 19:32:05] [INFO ] Implicit Places using invariants and state equation in 219 ms returned []
Implicit Place search using SMT with State Equation took 307 ms to find 0 implicit places.
[2024-06-02 19:32:05] [INFO ] Redundant transitions in 3 ms returned []
Running 447 sub problems to find dead transitions.
[2024-06-02 19:32:06] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 19:32:06] [INFO ] Invariant cache hit.
[2024-06-02 19:32:06] [INFO ] State equation strengthened by 61 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:32:07] [INFO ] Deduced a trap composed of 62 places in 81 ms of which 1 ms to minimize.
[2024-06-02 19:32:08] [INFO ] Deduced a trap composed of 60 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:32:08] [INFO ] Deduced a trap composed of 33 places in 28 ms of which 0 ms to minimize.
[2024-06-02 19:32:08] [INFO ] Deduced a trap composed of 23 places in 73 ms of which 2 ms to minimize.
[2024-06-02 19:32:08] [INFO ] Deduced a trap composed of 33 places in 36 ms of which 1 ms to minimize.
[2024-06-02 19:32:08] [INFO ] Deduced a trap composed of 17 places in 74 ms of which 1 ms to minimize.
[2024-06-02 19:32:08] [INFO ] Deduced a trap composed of 25 places in 73 ms of which 1 ms to minimize.
[2024-06-02 19:32:08] [INFO ] Deduced a trap composed of 33 places in 46 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/15 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/178 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/239 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:32:15] [INFO ] Deduced a trap composed of 61 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:32:15] [INFO ] Deduced a trap composed of 59 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:32:15] [INFO ] Deduced a trap composed of 58 places in 82 ms of which 1 ms to minimize.
[2024-06-02 19:32:18] [INFO ] Deduced a trap composed of 39 places in 41 ms of which 1 ms to minimize.
[2024-06-02 19:32:18] [INFO ] Deduced a trap composed of 51 places in 37 ms of which 0 ms to minimize.
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 5/244 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:32:21] [INFO ] Deduced a trap composed of 17 places in 72 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 1/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 8 (OVERLAPS) 0/577 variables, 0/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
No progress, stopping.
After SMT solving in domain Real declared 577/578 variables, and 245 constraints, problems are : Problem set: 0 solved, 447 unsolved in 26478 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 447 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/163 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/163 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/163 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 3 (OVERLAPS) 414/577 variables, 163/184 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/577 variables, 61/245 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/577 variables, 447/692 constraints. Problems are: Problem set: 0 solved, 447 unsolved
[2024-06-02 19:32:38] [INFO ] Deduced a trap composed of 40 places in 33 ms of which 1 ms to minimize.
[2024-06-02 19:32:39] [INFO ] Deduced a trap composed of 40 places in 34 ms of which 1 ms to minimize.
At refinement iteration 6 (INCLUDED_ONLY) 0/577 variables, 2/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
At refinement iteration 7 (INCLUDED_ONLY) 0/577 variables, 0/694 constraints. Problems are: Problem set: 0 solved, 447 unsolved
Solver is answering 'unknown', stopping.
After SMT solving in domain Int declared 577/578 variables, and 694 constraints, problems are : Problem set: 0 solved, 447 unsolved in 30018 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 163/163 constraints, ReadFeed: 61/61 constraints, PredecessorRefiner: 447/447 constraints, Known Traps: 16/16 constraints]
After SMT, in 56882ms problems are : Problem set: 0 solved, 447 unsolved
Search for dead transitions found 0 dead transitions in 56891ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 57212 ms. Remains : 163/163 places, 454/454 transitions.
Treatment of property FireWire-PT-14-LTLFireability-13 finished in 253927 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 20 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 19:33:02] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 19:33:03] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 19:33:03] [INFO ] Implicit Places using invariants in 115 ms returned []
[2024-06-02 19:33:03] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 19:33:03] [INFO ] Invariant cache hit.
[2024-06-02 19:33:03] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 19:33:03] [INFO ] Implicit Places using invariants and state equation in 266 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 386 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 3 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 409 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 88 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-14
Product exploration explored 100000 steps with 8 reset in 54 ms.
Product exploration explored 100000 steps with 0 reset in 61 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[true, (NOT p0)]
RANDOM walk for 998 steps (32 resets) in 7 ms. (124 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-14 finished in 849 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 175 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 175 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 173 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 171 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 171 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 169 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 169 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 167 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 167 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 165 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 165 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 163 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 163 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 161 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 161 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 159 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 159 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 157 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 157 transition count 427
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 0 with 6 rules applied. Total rules applied 60 place count 154 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 151 transition count 430
Drop transitions (Redundant composition of simpler transitions.) removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 151 transition count 424
Applied a total of 72 rules in 41 ms. Remains 151 /185 variables (removed 34) and now considering 424/489 (removed 65) transitions.
[2024-06-02 19:33:03] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 151 cols
[2024-06-02 19:33:03] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 19:33:03] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-06-02 19:33:03] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 19:33:03] [INFO ] Invariant cache hit.
[2024-06-02 19:33:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:33:04] [INFO ] Implicit Places using invariants and state equation in 242 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 325 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/185 places, 424/489 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 372 ms. Remains : 150/185 places, 424/489 transitions.
Stuttering acceptance computed with spot in 66 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-15
Product exploration explored 100000 steps with 12 reset in 50 ms.
Product exploration explored 100000 steps with 1 reset in 49 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 85 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 55 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 12871 steps (392 resets) in 52 ms. (242 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 54 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 424/424 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 19:33:04] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 150 cols
[2024-06-02 19:33:04] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 19:33:04] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 19:33:04] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 19:33:04] [INFO ] Invariant cache hit.
[2024-06-02 19:33:04] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:33:05] [INFO ] Implicit Places using invariants and state equation in 223 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-06-02 19:33:05] [INFO ] Redundant transitions in 2 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 19:33:05] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 19:33:05] [INFO ] Invariant cache hit.
[2024-06-02 19:33:05] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 59 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 28 places in 70 ms of which 1 ms to minimize.
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 17 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:33:06] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:33:07] [INFO ] Deduced a trap composed of 33 places in 100 ms of which 1 ms to minimize.
[2024-06-02 19:33:07] [INFO ] Deduced a trap composed of 33 places in 35 ms of which 0 ms to minimize.
[2024-06-02 19:33:07] [INFO ] Deduced a trap composed of 27 places in 60 ms of which 2 ms to minimize.
[2024-06-02 19:33:08] [INFO ] Deduced a trap composed of 33 places in 76 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:33:09] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:33:09] [INFO ] Deduced a trap composed of 23 places in 64 ms of which 1 ms to minimize.
[2024-06-02 19:33:10] [INFO ] Deduced a trap composed of 16 places in 65 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:33:10] [INFO ] Deduced a trap composed of 58 places in 65 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 384/534 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:33:19] [INFO ] Deduced a trap composed of 39 places in 32 ms of which 0 ms to minimize.
[2024-06-02 19:33:19] [INFO ] Deduced a trap composed of 39 places in 36 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/535 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 23782 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/534 variables, 150/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/535 variables, and 644 constraints, problems are : Problem set: 0 solved, 417 unsolved in 24383 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
After SMT, in 48477ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 48481ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 48805 ms. Remains : 150/150 places, 424/424 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 96 ms :[(NOT p0), (NOT p0)]
RANDOM walk for 3003 steps (85 resets) in 15 ms. (187 steps per ms) remains 0/1 properties
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 1 reset in 69 ms.
Product exploration explored 100000 steps with 0 reset in 49 ms.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 19:33:54] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 19:33:54] [INFO ] Invariant cache hit.
[2024-06-02 19:33:54] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 19:33:54] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 19:33:54] [INFO ] Invariant cache hit.
[2024-06-02 19:33:54] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 19:33:54] [INFO ] Implicit Places using invariants and state equation in 236 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 19:33:54] [INFO ] Redundant transitions in 3 ms returned []
Running 417 sub problems to find dead transitions.
[2024-06-02 19:33:54] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 19:33:54] [INFO ] Invariant cache hit.
[2024-06-02 19:33:54] [INFO ] State equation strengthened by 56 read => feed constraints.
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 59 places in 79 ms of which 1 ms to minimize.
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 28 places in 75 ms of which 1 ms to minimize.
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 17 places in 65 ms of which 1 ms to minimize.
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 17 places in 63 ms of which 1 ms to minimize.
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 33 places in 71 ms of which 1 ms to minimize.
[2024-06-02 19:33:56] [INFO ] Deduced a trap composed of 33 places in 25 ms of which 1 ms to minimize.
[2024-06-02 19:33:57] [INFO ] Deduced a trap composed of 27 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:33:57] [INFO ] Deduced a trap composed of 33 places in 69 ms of which 1 ms to minimize.
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 8/15 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:33:59] [INFO ] Deduced a trap composed of 58 places in 76 ms of which 1 ms to minimize.
[2024-06-02 19:33:59] [INFO ] Deduced a trap composed of 23 places in 66 ms of which 1 ms to minimize.
[2024-06-02 19:33:59] [INFO ] Deduced a trap composed of 16 places in 68 ms of which 1 ms to minimize.
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 3/18 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:34:00] [INFO ] Deduced a trap composed of 58 places in 74 ms of which 1 ms to minimize.
At refinement iteration 3 (INCLUDED_ONLY) 0/150 variables, 1/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/150 variables, 0/19 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (OVERLAPS) 384/534 variables, 150/169 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 56/225 constraints. Problems are: Problem set: 0 solved, 417 unsolved
[2024-06-02 19:34:09] [INFO ] Deduced a trap composed of 39 places in 35 ms of which 1 ms to minimize.
[2024-06-02 19:34:09] [INFO ] Deduced a trap composed of 39 places in 34 ms of which 0 ms to minimize.
At refinement iteration 7 (INCLUDED_ONLY) 0/534 variables, 2/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 8 (INCLUDED_ONLY) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 9 (OVERLAPS) 0/534 variables, 0/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Real declared 534/535 variables, and 227 constraints, problems are : Problem set: 0 solved, 417 unsolved in 24416 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
Escalating to Integer solving :Problem set: 0 solved, 417 unsolved
At refinement iteration 0 (INCLUDED_ONLY) 0/150 variables, 7/7 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 1 (INCLUDED_ONLY) 0/150 variables, 14/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 2 (INCLUDED_ONLY) 0/150 variables, 0/21 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 3 (OVERLAPS) 384/534 variables, 150/171 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 4 (INCLUDED_ONLY) 0/534 variables, 56/227 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 5 (INCLUDED_ONLY) 0/534 variables, 417/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 6 (INCLUDED_ONLY) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
At refinement iteration 7 (OVERLAPS) 0/534 variables, 0/644 constraints. Problems are: Problem set: 0 solved, 417 unsolved
No progress, stopping.
After SMT solving in domain Int declared 534/535 variables, and 644 constraints, problems are : Problem set: 0 solved, 417 unsolved in 24623 ms.
Refiners :[Positive P Invariants (semi-flows): 7/7 constraints, State Equation: 150/150 constraints, ReadFeed: 56/56 constraints, PredecessorRefiner: 417/417 constraints, Known Traps: 14/14 constraints]
After SMT, in 49334ms problems are : Problem set: 0 solved, 417 unsolved
Search for dead transitions found 0 dead transitions in 49339ms
Finished structural reductions in SI_LTL mode , in 1 iterations and 49671 ms. Remains : 150/150 places, 424/424 transitions.
Treatment of property FireWire-PT-14-LTLFireability-15 finished in 100118 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G((p1||F(p2))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202405141337/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2024-06-02 19:34:44] [INFO ] Flatten gal took : 30 ms
[2024-06-02 19:34:44] [INFO ] Export to MCC of 2 properties in file /home/mcc/execution/LTLFireability.sr.xml took 1 ms.
[2024-06-02 19:34:44] [INFO ] Export to PNML in file /home/mcc/execution/model.sr.pnml of net with 185 places, 489 transitions and 1829 arcs took 6 ms.
Total runtime 574921 ms.
There are residual formulas that ITS could not solve within timeout
FORMULA FireWire-PT-14-LTLFireability-13 FALSE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN
FORMULA FireWire-PT-14-LTLFireability-15 TRUE TECHNIQUES EXPLICIT PARALLEL_PROCESSING USE_NUPN

BK_STOP 1717357189846

--------------------
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//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202405141337.jar
+ VERSION=202405141337
+ echo 'Running Version 202405141337'
+ /home/mcc/BenchKit/bin//../reducer/bin//../../itstools//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -timeout 360 -rebuildPNML
mcc2024
ltl formula name FireWire-PT-14-LTLFireability-13
ltl formula formula --ltl=/tmp/1792/ltl_0_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 185 places, 489 transitions and 1829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.040 real 0.020 user 0.000 sys
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1792/ltl_0_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1792/ltl_0_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1792/ltl_0_
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1792/ltl_0_
pnml2lts-mc( 0/ 4): buchi has 4 states
pnml2lts-mc( 0/ 4): There are 186 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 186, there are 730 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 3/ 4): ~154 levels ~10000 states ~28232 transitions
pnml2lts-mc( 1/ 4): ~190 levels ~20000 states ~59680 transitions
pnml2lts-mc( 1/ 4): ~190 levels ~40000 states ~109560 transitions
pnml2lts-mc( 1/ 4): ~190 levels ~80000 states ~218432 transitions
pnml2lts-mc( 1/ 4): ~230 levels ~160000 states ~433932 transitions
pnml2lts-mc( 3/ 4): ~450 levels ~320000 states ~1036300 transitions
pnml2lts-mc( 0/ 4): ~806 levels ~640000 states ~1860072 transitions
pnml2lts-mc( 3/ 4): ~673 levels ~1280000 states ~4026528 transitions
pnml2lts-mc( 1/ 4): ~1152 levels ~2560000 states ~7912776 transitions
pnml2lts-mc( 1/ 4): ~1152 levels ~5120000 states ~16036032 transitions
pnml2lts-mc( 3/ 4): ~940 levels ~10240000 states ~32771540 transitions
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Accepting cycle FOUND at depth ~185!
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 10351260
pnml2lts-mc( 0/ 4): unique states count: 18425589
pnml2lts-mc( 0/ 4): unique transitions count: 63840904
pnml2lts-mc( 0/ 4): - self-loop count: 6910718
pnml2lts-mc( 0/ 4): - claim dead count: 26291088
pnml2lts-mc( 0/ 4): - claim found count: 12278449
pnml2lts-mc( 0/ 4): - claim success count: 18445819
pnml2lts-mc( 0/ 4): - cum. max stack depth: 14332
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 18463436 states 63991654 transitions, fanout: 3.466
pnml2lts-mc( 0/ 4): Total exploration time 107.550 sec (107.550 sec minimum, 107.550 sec on average)
pnml2lts-mc( 0/ 4): States per second: 171673, Transitions per second: 594994
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 141.1MB, 8.0 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 54.0%/0.0%
pnml2lts-mc( 0/ 4): Stored 501 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 141.1MB (~256.0MB paged-in)
ltl formula name FireWire-PT-14-LTLFireability-15
ltl formula formula --ltl=/tmp/1792/ltl_1_
pnml2lts-mc( 0/ 4): Loading model from model.pnml
pnml2lts-mc( 0/ 4): Edge label is id
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
Warning: program compiled against libxml 210 using older 209
pnml2lts-mc( 0/ 4): Petri net has 185 places, 489 transitions and 1829 arcs
pnml2lts-mc( 0/ 4): Petri net Petri analyzed
pnml2lts-mc( 0/ 4): There are no safe places
pnml2lts-mc( 0/ 4): Loading Petri net took 0.060 real 0.030 user 0.000 sys
pnml2lts-mc( 2/ 4): LTL layer: formula: /tmp/1792/ltl_1_
pnml2lts-mc( 1/ 4): LTL layer: formula: /tmp/1792/ltl_1_
pnml2lts-mc( 0/ 4): LTL layer: formula: /tmp/1792/ltl_1_
pnml2lts-mc( 3/ 4): LTL layer: formula: /tmp/1792/ltl_1_
pnml2lts-mc( 0/ 4): buchi has 2 states
pnml2lts-mc( 0/ 4): Weak Buchi automaton detected, adding non-accepting as progress label.
pnml2lts-mc( 0/ 4): There are 187 state labels and 1 edge labels
pnml2lts-mc( 0/ 4): State length is 186, there are 492 groups
pnml2lts-mc( 0/ 4): Running ufscc using 4 cores
pnml2lts-mc( 0/ 4): Using a tree table with 2^25 elements
pnml2lts-mc( 0/ 4): Successor permutation: dynamic
pnml2lts-mc( 0/ 4): Global bits: 0, count bits: 0, local bits: 0
pnml2lts-mc( 2/ 4): ~165 levels ~10000 states ~27556 transitions
pnml2lts-mc( 2/ 4): ~186 levels ~20000 states ~62080 transitions
pnml2lts-mc( 0/ 4): ~200 levels ~40000 states ~103220 transitions
pnml2lts-mc( 2/ 4): ~186 levels ~80000 states ~253844 transitions
pnml2lts-mc( 2/ 4): ~194 levels ~160000 states ~507148 transitions
pnml2lts-mc( 2/ 4): ~260 levels ~320000 states ~972804 transitions
pnml2lts-mc( 1/ 4): ~708 levels ~640000 states ~1858096 transitions
pnml2lts-mc( 2/ 4): ~974 levels ~1280000 states ~4041184 transitions
pnml2lts-mc( 1/ 4): ~1376 levels ~2560000 states ~8007640 transitions
pnml2lts-mc( 0/ 4): ~1235 levels ~5120000 states ~16829032 transitions
pnml2lts-mc( 1/ 4): ~1376 levels ~10240000 states ~37964436 transitions
pnml2lts-mc( 0/ 4): ~1450 levels ~20480000 states ~72354600 transitions
pnml2lts-mc( 3/ 4): Error: tree roots table full! Change -s/--ratio.
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): total scc count: 19824164
pnml2lts-mc( 0/ 4): unique states count: 33552853
pnml2lts-mc( 0/ 4): unique transitions count: 127518549
pnml2lts-mc( 0/ 4): - self-loop count: 12182884
pnml2lts-mc( 0/ 4): - claim dead count: 62315409
pnml2lts-mc( 0/ 4): - claim found count: 19928760
pnml2lts-mc( 0/ 4): - claim success count: 33674726
pnml2lts-mc( 0/ 4): - cum. max stack depth: 20280
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Explored 33759252 states 128545941 transitions, fanout: 3.808
pnml2lts-mc( 0/ 4): Total exploration time 196.770 sec (196.760 sec minimum, 196.765 sec on average)
pnml2lts-mc( 0/ 4): States per second: 171567, Transitions per second: 653280
pnml2lts-mc( 0/ 4):
pnml2lts-mc( 0/ 4): Queue width: 12B, total height: 0, memory: 0.00MB
pnml2lts-mc( 0/ 4): Tree memory: 257.0MB, 8.0 B/state, compr.: 1.1%
pnml2lts-mc( 0/ 4): Tree fill ratio (roots/leafs): 99.0%/1.0%
pnml2lts-mc( 0/ 4): Stored 501 string chucks using 0MB
pnml2lts-mc( 0/ 4): Total memory used for chunk indexing: 0MB
pnml2lts-mc( 0/ 4): Est. total memory use: 257.0MB (~256.0MB paged-in)

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-14"
export BK_EXAMINATION="LTLFireability"
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-14, examination is LTLFireability"
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-171734901300276"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/FireWire-PT-14.tgz
mv FireWire-PT-14 execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "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 [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "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 "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.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 '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
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 ;