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.r571-tall-171734910500203.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 gold2023
Input is FireWire-PT-20, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r571-tall-171734910500203
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 592K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 58K 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 56K 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.1K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 6.5K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 60K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.2K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K 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 247K 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-20-LTLFireability-00
FORMULA_NAME FireWire-PT-20-LTLFireability-01
FORMULA_NAME FireWire-PT-20-LTLFireability-02
FORMULA_NAME FireWire-PT-20-LTLFireability-03
FORMULA_NAME FireWire-PT-20-LTLFireability-04
FORMULA_NAME FireWire-PT-20-LTLFireability-05
FORMULA_NAME FireWire-PT-20-LTLFireability-06
FORMULA_NAME FireWire-PT-20-LTLFireability-07
FORMULA_NAME FireWire-PT-20-LTLFireability-08
FORMULA_NAME FireWire-PT-20-LTLFireability-09
FORMULA_NAME FireWire-PT-20-LTLFireability-10
FORMULA_NAME FireWire-PT-20-LTLFireability-11
FORMULA_NAME FireWire-PT-20-LTLFireability-12
FORMULA_NAME FireWire-PT-20-LTLFireability-13
FORMULA_NAME FireWire-PT-20-LTLFireability-14
FORMULA_NAME FireWire-PT-20-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1717371816818

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FireWire-PT-20
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:43:38] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-06-02 23:43:38] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:43:38] [INFO ] Load time of PNML (sax parser for PT used): 79 ms
[2024-06-02 23:43:38] [INFO ] Transformed 626 places.
[2024-06-02 23:43:38] [INFO ] Transformed 1031 transitions.
[2024-06-02 23:43:38] [INFO ] Found NUPN structural information;
[2024-06-02 23:43:38] [INFO ] Parsed PT model containing 626 places and 1031 transitions and 3196 arcs in 147 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA FireWire-PT-20-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1031/1031 transitions.
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 0 with 15 rules applied. Total rules applied 15 place count 611 transition count 1031
Discarding 133 places :
Symmetric choice reduction at 1 with 133 rule applications. Total rules 148 place count 478 transition count 898
Iterating global reduction 1 with 133 rules applied. Total rules applied 281 place count 478 transition count 898
Discarding 34 places :
Symmetric choice reduction at 1 with 34 rule applications. Total rules 315 place count 444 transition count 764
Iterating global reduction 1 with 34 rules applied. Total rules applied 349 place count 444 transition count 764
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 350 place count 444 transition count 763
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 360 place count 434 transition count 747
Iterating global reduction 2 with 10 rules applied. Total rules applied 370 place count 434 transition count 747
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 373 place count 434 transition count 744
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 376 place count 431 transition count 735
Iterating global reduction 3 with 3 rules applied. Total rules applied 379 place count 431 transition count 735
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 382 place count 428 transition count 729
Iterating global reduction 3 with 3 rules applied. Total rules applied 385 place count 428 transition count 729
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 388 place count 425 transition count 720
Iterating global reduction 3 with 3 rules applied. Total rules applied 391 place count 425 transition count 720
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 393 place count 423 transition count 716
Iterating global reduction 3 with 2 rules applied. Total rules applied 395 place count 423 transition count 716
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 397 place count 421 transition count 710
Iterating global reduction 3 with 2 rules applied. Total rules applied 399 place count 421 transition count 710
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 401 place count 419 transition count 706
Iterating global reduction 3 with 2 rules applied. Total rules applied 403 place count 419 transition count 706
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 405 place count 417 transition count 700
Iterating global reduction 3 with 2 rules applied. Total rules applied 407 place count 417 transition count 700
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 408 place count 416 transition count 698
Iterating global reduction 3 with 1 rules applied. Total rules applied 409 place count 416 transition count 698
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 410 place count 415 transition count 695
Iterating global reduction 3 with 1 rules applied. Total rules applied 411 place count 415 transition count 695
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 412 place count 414 transition count 693
Iterating global reduction 3 with 1 rules applied. Total rules applied 413 place count 414 transition count 693
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 414 place count 413 transition count 691
Iterating global reduction 3 with 1 rules applied. Total rules applied 415 place count 413 transition count 691
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 416 place count 412 transition count 689
Iterating global reduction 3 with 1 rules applied. Total rules applied 417 place count 412 transition count 689
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 418 place count 411 transition count 688
Iterating global reduction 3 with 1 rules applied. Total rules applied 419 place count 411 transition count 688
Applied a total of 419 rules in 206 ms. Remains 411 /626 variables (removed 215) and now considering 688/1031 (removed 343) transitions.
// Phase 1: matrix 688 rows 411 cols
[2024-06-02 23:43:39] [INFO ] Computed 10 invariants in 27 ms
[2024-06-02 23:43:39] [INFO ] Implicit Places using invariants in 390 ms returned []
[2024-06-02 23:43:39] [INFO ] Invariant cache hit.
[2024-06-02 23:43:39] [INFO ] Implicit Places using invariants and state equation in 481 ms returned []
Implicit Place search using SMT with State Equation took 1032 ms to find 0 implicit places.
[2024-06-02 23:43:39] [INFO ] Invariant cache hit.
[2024-06-02 23:43:40] [INFO ] Dead Transitions using invariants and state equation in 250 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 411/626 places, 688/1031 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1490 ms. Remains : 411/626 places, 688/1031 transitions.
Support contains 36 out of 411 places after structural reductions.
[2024-06-02 23:43:40] [INFO ] Flatten gal took : 69 ms
[2024-06-02 23:43:40] [INFO ] Flatten gal took : 38 ms
[2024-06-02 23:43:40] [INFO ] Input system was already deterministic with 688 transitions.
Support contains 35 out of 411 places (down from 36) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 420 ms. (steps per millisecond=23 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-06-02 23:43:41] [INFO ] Invariant cache hit.
[2024-06-02 23:43:41] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:43:41] [INFO ] After 559ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:19
[2024-06-02 23:43:41] [INFO ] [Nat]Absence check using 10 positive place invariants in 5 ms returned sat
[2024-06-02 23:43:42] [INFO ] After 700ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :18
[2024-06-02 23:43:43] [INFO ] After 1556ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :18
Attempting to minimize the solution found.
Minimization took 580 ms.
[2024-06-02 23:43:44] [INFO ] After 2463ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :18
Fused 19 Parikh solutions to 18 different solutions.
Parikh walk visited 3 properties in 198 ms.
Support contains 20 out of 411 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 284 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 11 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 58 transitions
Trivial Post-agglo rules discarded 58 transitions
Performed 58 trivial Post agglomeration. Transition count delta: 58
Iterating post reduction 0 with 58 rules applied. Total rules applied 59 place count 403 transition count 615
Reduce places removed 58 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 62 rules applied. Total rules applied 121 place count 345 transition count 611
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 122 place count 344 transition count 611
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 122 place count 344 transition count 579
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 186 place count 312 transition count 579
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 190 place count 308 transition count 574
Iterating global reduction 3 with 4 rules applied. Total rules applied 194 place count 308 transition count 574
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 195 place count 308 transition count 573
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 195 place count 308 transition count 572
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 197 place count 307 transition count 572
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 198 place count 306 transition count 570
Iterating global reduction 4 with 1 rules applied. Total rules applied 199 place count 306 transition count 570
Performed 42 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 42 places in 3 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 4 with 84 rules applied. Total rules applied 283 place count 264 transition count 527
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 284 place count 263 transition count 525
Iterating global reduction 4 with 1 rules applied. Total rules applied 285 place count 263 transition count 525
Performed 41 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 41 places in 2 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 4 with 82 rules applied. Total rules applied 367 place count 222 transition count 621
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 370 place count 222 transition count 618
Free-agglomeration rule applied 18 times.
Iterating global reduction 4 with 18 rules applied. Total rules applied 388 place count 222 transition count 600
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 4 with 18 rules applied. Total rules applied 406 place count 204 transition count 600
Discarding 5 places :
Symmetric choice reduction at 5 with 5 rule applications. Total rules 411 place count 199 transition count 595
Iterating global reduction 5 with 5 rules applied. Total rules applied 416 place count 199 transition count 595
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 422 place count 199 transition count 589
Applied a total of 422 rules in 177 ms. Remains 199 /411 variables (removed 212) and now considering 589/688 (removed 99) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 177 ms. Remains : 199/411 places, 589/688 transitions.
Incomplete random walk after 10000 steps, including 329 resets, run finished after 352 ms. (steps per millisecond=28 ) properties (out of 15) seen :4
Incomplete Best-First random walk after 10001 steps, including 21 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 11) seen :3
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 8) seen :1
Incomplete Best-First random walk after 10001 steps, including 37 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 72 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 7) seen :0
Running SMT prover for 7 properties.
[2024-06-02 23:43:45] [INFO ] Flow matrix only has 565 transitions (discarded 24 similar events)
// Phase 1: matrix 565 rows 199 cols
[2024-06-02 23:43:45] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:43:45] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:43:45] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2024-06-02 23:43:45] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:45] [INFO ] After 221ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2024-06-02 23:43:45] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 23:43:46] [INFO ] After 205ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2024-06-02 23:43:46] [INFO ] Deduced a trap composed of 48 places in 47 ms of which 0 ms to minimize.
[2024-06-02 23:43:46] [INFO ] Deduced a trap composed of 49 places in 39 ms of which 1 ms to minimize.
[2024-06-02 23:43:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 137 ms
[2024-06-02 23:43:46] [INFO ] After 564ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 171 ms.
[2024-06-02 23:43:46] [INFO ] After 1031ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Parikh walk visited 0 properties in 38 ms.
Support contains 11 out of 199 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 199/199 places, 589/589 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 199 transition count 587
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 197 transition count 587
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 197 transition count 586
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 196 transition count 586
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 7 place count 195 transition count 584
Iterating global reduction 2 with 1 rules applied. Total rules applied 8 place count 195 transition count 584
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 9 place count 194 transition count 581
Iterating global reduction 2 with 1 rules applied. Total rules applied 10 place count 194 transition count 581
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 11 place count 193 transition count 579
Iterating global reduction 2 with 1 rules applied. Total rules applied 12 place count 193 transition count 579
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 192 transition count 577
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 192 transition count 577
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 191 transition count 575
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 191 transition count 575
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 18 place count 190 transition count 574
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 22 place count 188 transition count 576
Free-agglomeration rule applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 23 place count 188 transition count 575
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 24 place count 187 transition count 575
Applied a total of 24 rules in 75 ms. Remains 187 /199 variables (removed 12) and now considering 575/589 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 187/199 places, 575/589 transitions.
Incomplete random walk after 10000 steps, including 313 resets, run finished after 151 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 25 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 60 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 22 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 380381 steps, run timeout after 3001 ms. (steps per millisecond=126 ) properties seen :{0=1}
Probabilistic random walk after 380381 steps, saw 132851 distinct states, run finished after 3003 ms. (steps per millisecond=126 ) properties seen :1
Running SMT prover for 6 properties.
[2024-06-02 23:43:50] [INFO ] Flow matrix only has 551 transitions (discarded 24 similar events)
// Phase 1: matrix 551 rows 187 cols
[2024-06-02 23:43:50] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:43:50] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:50] [INFO ] After 278ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 23:43:50] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:50] [INFO ] After 226ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 23:43:50] [INFO ] State equation strengthened by 15 read => feed constraints.
[2024-06-02 23:43:50] [INFO ] After 139ms SMT Verify possible using 15 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:43:51] [INFO ] Deduced a trap composed of 47 places in 48 ms of which 2 ms to minimize.
[2024-06-02 23:43:51] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 91 ms
[2024-06-02 23:43:51] [INFO ] After 396ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 116 ms.
[2024-06-02 23:43:51] [INFO ] After 820ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 23 ms.
Support contains 9 out of 187 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 187/187 places, 575/575 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 187 transition count 574
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 186 transition count 574
Free-agglomeration rule applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 3 place count 186 transition count 573
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 13 place count 185 transition count 564
Drop transitions removed 18 transitions
Redundant transition composition rules discarded 18 transitions
Iterating global reduction 1 with 18 rules applied. Total rules applied 31 place count 185 transition count 546
Applied a total of 31 rules in 34 ms. Remains 185 /187 variables (removed 2) and now considering 546/575 (removed 29) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 185/187 places, 546/575 transitions.
Incomplete random walk after 10000 steps, including 340 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 32 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 448213 steps, run timeout after 3001 ms. (steps per millisecond=149 ) properties seen :{}
Probabilistic random walk after 448213 steps, saw 129997 distinct states, run finished after 3004 ms. (steps per millisecond=149 ) properties seen :0
Running SMT prover for 6 properties.
[2024-06-02 23:43:54] [INFO ] Flow matrix only has 527 transitions (discarded 19 similar events)
// Phase 1: matrix 527 rows 185 cols
[2024-06-02 23:43:54] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:43:54] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:55] [INFO ] After 266ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 23:43:55] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:43:55] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 23:43:55] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:43:55] [INFO ] After 163ms SMT Verify possible using 71 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:43:55] [INFO ] After 358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 111 ms.
[2024-06-02 23:43:55] [INFO ] After 738ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 27 ms.
Support contains 9 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 546/546 transitions.
Applied a total of 0 rules in 10 ms. Remains 185 /185 variables (removed 0) and now considering 546/546 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 185/185 places, 546/546 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 546/546 transitions.
Applied a total of 0 rules in 9 ms. Remains 185 /185 variables (removed 0) and now considering 546/546 (removed 0) transitions.
[2024-06-02 23:43:55] [INFO ] Flow matrix only has 527 transitions (discarded 19 similar events)
[2024-06-02 23:43:55] [INFO ] Invariant cache hit.
[2024-06-02 23:43:55] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:43:55] [INFO ] Flow matrix only has 527 transitions (discarded 19 similar events)
[2024-06-02 23:43:55] [INFO ] Invariant cache hit.
[2024-06-02 23:43:56] [INFO ] State equation strengthened by 71 read => feed constraints.
[2024-06-02 23:43:56] [INFO ] Implicit Places using invariants and state equation in 334 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-02 23:43:56] [INFO ] Redundant transitions in 30 ms returned []
[2024-06-02 23:43:56] [INFO ] Flow matrix only has 527 transitions (discarded 19 similar events)
[2024-06-02 23:43:56] [INFO ] Invariant cache hit.
[2024-06-02 23:43:56] [INFO ] Dead Transitions using invariants and state equation in 173 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 656 ms. Remains : 185/185 places, 546/546 transitions.
Graph (trivial) has 91 edges and 185 vertex of which 27 / 185 are part of one of the 4 SCC in 1 ms
Free SCC test removed 23 places
Drop transitions removed 91 transitions
Ensure Unique test removed 50 transitions
Reduce isomorphic transitions removed 141 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 4 place count 159 transition count 402
Iterating global reduction 0 with 3 rules applied. Total rules applied 7 place count 159 transition count 402
Ensure Unique test removed 24 transitions
Reduce isomorphic transitions removed 24 transitions.
Iterating post reduction 0 with 24 rules applied. Total rules applied 31 place count 159 transition count 378
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 33 place count 158 transition count 377
Drop transitions removed 42 transitions
Redundant transition composition rules discarded 42 transitions
Iterating global reduction 1 with 42 rules applied. Total rules applied 75 place count 158 transition count 335
Partial Free-agglomeration rule applied 10 times.
Drop transitions removed 10 transitions
Iterating global reduction 1 with 10 rules applied. Total rules applied 85 place count 158 transition count 335
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 1 with 1 rules applied. Total rules applied 86 place count 158 transition count 334
Applied a total of 86 rules in 32 ms. Remains 158 /185 variables (removed 27) and now considering 334/546 (removed 212) transitions.
Running SMT prover for 6 properties.
[2024-06-02 23:43:56] [INFO ] Flow matrix only has 330 transitions (discarded 4 similar events)
// Phase 1: matrix 330 rows 158 cols
[2024-06-02 23:43:56] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:43:56] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:43:56] [INFO ] After 198ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 23:43:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:43:56] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 23:43:56] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-06-02 23:43:56] [INFO ] After 90ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:43:57] [INFO ] After 198ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 71 ms.
[2024-06-02 23:43:57] [INFO ] After 461ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
FORMULA FireWire-PT-20-LTLFireability-03 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 13 simplifications.
Computed a total of 107 stabilizing places and 149 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X((F(p0) U p0)) U p1)) U p0)))'
Support contains 4 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 34 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 34 Pre rules applied. Total rules applied 128 place count 340 transition count 579
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 205 place count 297 transition count 566
Iterating global reduction 3 with 9 rules applied. Total rules applied 214 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 297 transition count 565
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 215 place count 297 transition count 561
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 223 place count 293 transition count 561
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 225 place count 291 transition count 556
Iterating global reduction 4 with 2 rules applied. Total rules applied 227 place count 291 transition count 556
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 228 place count 290 transition count 554
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 290 transition count 554
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 289 transition count 552
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 289 transition count 552
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 288 transition count 550
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 288 transition count 550
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 309 place count 250 transition count 511
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 310 place count 249 transition count 509
Iterating global reduction 4 with 1 rules applied. Total rules applied 311 place count 249 transition count 509
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 401 place count 204 transition count 608
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 404 place count 204 transition count 605
Applied a total of 404 rules in 88 ms. Remains 204 /411 variables (removed 207) and now considering 605/688 (removed 83) transitions.
[2024-06-02 23:43:57] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
// Phase 1: matrix 579 rows 204 cols
[2024-06-02 23:43:57] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:43:57] [INFO ] Implicit Places using invariants in 106 ms returned []
[2024-06-02 23:43:57] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
[2024-06-02 23:43:57] [INFO ] Invariant cache hit.
[2024-06-02 23:43:57] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:43:58] [INFO ] Implicit Places using invariants and state equation in 442 ms returned []
Implicit Place search using SMT with State Equation took 553 ms to find 0 implicit places.
[2024-06-02 23:43:58] [INFO ] Redundant transitions in 14 ms returned []
[2024-06-02 23:43:58] [INFO ] Flow matrix only has 579 transitions (discarded 26 similar events)
[2024-06-02 23:43:58] [INFO ] Invariant cache hit.
[2024-06-02 23:43:58] [INFO ] Dead Transitions using invariants and state equation in 197 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 204/411 places, 605/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 859 ms. Remains : 204/411 places, 605/688 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 291 ms :[(NOT p0), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s10 1) (EQ s75 1)), p1:(AND (EQ s8 1) (EQ s163 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-00 finished in 1205 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F((p0||G(F(p1))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 398 transition count 672
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 398 transition count 672
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 32 place count 392 transition count 660
Iterating global reduction 0 with 6 rules applied. Total rules applied 38 place count 392 transition count 660
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 41 place count 389 transition count 655
Iterating global reduction 0 with 3 rules applied. Total rules applied 44 place count 389 transition count 655
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 50 place count 385 transition count 646
Iterating global reduction 0 with 2 rules applied. Total rules applied 52 place count 385 transition count 646
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 54 place count 383 transition count 642
Iterating global reduction 0 with 2 rules applied. Total rules applied 56 place count 383 transition count 642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 57 place count 382 transition count 640
Iterating global reduction 0 with 1 rules applied. Total rules applied 58 place count 382 transition count 640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 59 place count 381 transition count 638
Iterating global reduction 0 with 1 rules applied. Total rules applied 60 place count 381 transition count 638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 61 place count 380 transition count 636
Iterating global reduction 0 with 1 rules applied. Total rules applied 62 place count 380 transition count 636
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 63 place count 379 transition count 635
Iterating global reduction 0 with 1 rules applied. Total rules applied 64 place count 379 transition count 635
Applied a total of 64 rules in 54 ms. Remains 379 /411 variables (removed 32) and now considering 635/688 (removed 53) transitions.
// Phase 1: matrix 635 rows 379 cols
[2024-06-02 23:43:58] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 23:43:58] [INFO ] Implicit Places using invariants in 132 ms returned []
[2024-06-02 23:43:58] [INFO ] Invariant cache hit.
[2024-06-02 23:43:59] [INFO ] Implicit Places using invariants and state equation in 356 ms returned []
Implicit Place search using SMT with State Equation took 492 ms to find 0 implicit places.
[2024-06-02 23:43:59] [INFO ] Invariant cache hit.
[2024-06-02 23:43:59] [INFO ] Dead Transitions using invariants and state equation in 227 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 635/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 774 ms. Remains : 379/411 places, 635/688 transitions.
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s11 1) (EQ s329 1)), p1:(EQ s21 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 80 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-20-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-01 finished in 923 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 301 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 340 transition count 578
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 305 transition count 578
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 207 place count 296 transition count 564
Iterating global reduction 3 with 9 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 217 place count 296 transition count 560
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 223 place count 293 transition count 560
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 226 place count 290 transition count 552
Iterating global reduction 4 with 3 rules applied. Total rules applied 229 place count 290 transition count 552
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 231 place count 288 transition count 548
Iterating global reduction 4 with 2 rules applied. Total rules applied 233 place count 288 transition count 548
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 235 place count 286 transition count 543
Iterating global reduction 4 with 2 rules applied. Total rules applied 237 place count 286 transition count 543
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 239 place count 284 transition count 539
Iterating global reduction 4 with 2 rules applied. Total rules applied 241 place count 284 transition count 539
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 242 place count 283 transition count 536
Iterating global reduction 4 with 1 rules applied. Total rules applied 243 place count 283 transition count 536
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 534
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 534
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 532
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 532
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 530
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 530
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 327 place count 241 transition count 490
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 240 transition count 488
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 240 transition count 488
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 419 place count 195 transition count 587
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 422 place count 195 transition count 584
Applied a total of 422 rules in 85 ms. Remains 195 /411 variables (removed 216) and now considering 584/688 (removed 104) transitions.
[2024-06-02 23:43:59] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 195 cols
[2024-06-02 23:43:59] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:43:59] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 23:43:59] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-02 23:43:59] [INFO ] Invariant cache hit.
[2024-06-02 23:43:59] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:44:00] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 414 ms to find 0 implicit places.
[2024-06-02 23:44:00] [INFO ] Redundant transitions in 6 ms returned []
[2024-06-02 23:44:00] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-02 23:44:00] [INFO ] Invariant cache hit.
[2024-06-02 23:44:00] [INFO ] Dead Transitions using invariants and state equation in 188 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 195/411 places, 584/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 704 ms. Remains : 195/411 places, 584/688 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s151 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-02 finished in 754 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||G(p1)))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 299 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 402 transition count 618
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 125 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 126 place count 341 transition count 579
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 296 transition count 564
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 296 transition count 559
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 292 transition count 559
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 289 transition count 551
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 289 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 287 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 285 transition count 542
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 285 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 283 transition count 538
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 283 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 531
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 279 transition count 529
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 279 transition count 529
Performed 37 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 4 with 74 rules applied. Total rules applied 325 place count 242 transition count 491
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 326 place count 241 transition count 489
Iterating global reduction 4 with 1 rules applied. Total rules applied 327 place count 241 transition count 489
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 415 place count 197 transition count 587
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 418 place count 197 transition count 584
Applied a total of 418 rules in 84 ms. Remains 197 /411 variables (removed 214) and now considering 584/688 (removed 104) transitions.
[2024-06-02 23:44:00] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
// Phase 1: matrix 555 rows 197 cols
[2024-06-02 23:44:00] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:44:00] [INFO ] Implicit Places using invariants in 108 ms returned []
[2024-06-02 23:44:00] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-02 23:44:00] [INFO ] Invariant cache hit.
[2024-06-02 23:44:00] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:44:00] [INFO ] Implicit Places using invariants and state equation in 436 ms returned []
Implicit Place search using SMT with State Equation took 548 ms to find 0 implicit places.
[2024-06-02 23:44:00] [INFO ] Redundant transitions in 9 ms returned []
[2024-06-02 23:44:00] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-02 23:44:00] [INFO ] Invariant cache hit.
[2024-06-02 23:44:01] [INFO ] Dead Transitions using invariants and state equation in 189 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/411 places, 584/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 841 ms. Remains : 197/411 places, 584/688 transitions.
Stuttering acceptance computed with spot in 130 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=2, aps=[p1:(NEQ s123 1), p0:(NEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 3 reset in 146 ms.
Product exploration explored 100000 steps with 5 reset in 90 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 130 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 4 states, 9 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 354 resets, run finished after 104 ms. (steps per millisecond=96 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:44:01] [INFO ] Flow matrix only has 555 transitions (discarded 29 similar events)
[2024-06-02 23:44:01] [INFO ] Invariant cache hit.
[2024-06-02 23:44:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:44:02] [INFO ] After 103ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-06-02 23:44:02] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:44:02] [INFO ] After 32ms SMT Verify possible using 12 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:44:02] [INFO ] After 185ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:44:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:44:02] [INFO ] After 135ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-06-02 23:44:02] [INFO ] After 59ms SMT Verify possible using 12 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-06-02 23:44:02] [INFO ] After 128ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-06-02 23:44:02] [INFO ] After 371ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 197/197 places, 584/584 transitions.
Drop transitions removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 581
Free-agglomeration rule applied 21 times.
Iterating global reduction 1 with 21 rules applied. Total rules applied 24 place count 197 transition count 560
Reduce places removed 21 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 30 rules applied. Total rules applied 54 place count 176 transition count 551
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 60 place count 170 transition count 545
Iterating global reduction 2 with 6 rules applied. Total rules applied 66 place count 170 transition count 545
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 75 place count 170 transition count 536
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 3 with 27 rules applied. Total rules applied 102 place count 170 transition count 509
Applied a total of 102 rules in 31 ms. Remains 170 /197 variables (removed 27) and now considering 509/584 (removed 75) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 170/197 places, 509/584 transitions.
Incomplete random walk after 10000 steps, including 302 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:44:02] [INFO ] Flow matrix only has 498 transitions (discarded 11 similar events)
// Phase 1: matrix 498 rows 170 cols
[2024-06-02 23:44:02] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:44:02] [INFO ] [Real]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:44:02] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:44:02] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:44:02] [INFO ] After 92ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:44:02] [INFO ] State equation strengthened by 93 read => feed constraints.
[2024-06-02 23:44:02] [INFO ] After 110ms SMT Verify possible using 93 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-06-02 23:44:03] [INFO ] After 136ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-06-02 23:44:03] [INFO ] After 288ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 170 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 170/170 places, 509/509 transitions.
Applied a total of 0 rules in 9 ms. Remains 170 /170 variables (removed 0) and now considering 509/509 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 170/170 places, 509/509 transitions.
Incomplete random walk after 10000 steps, including 314 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 394328 steps, run visited all 1 properties in 1308 ms. (steps per millisecond=301 )
Probabilistic random walk after 394328 steps, saw 127810 distinct states, run finished after 1310 ms. (steps per millisecond=301 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X p0)), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (AND p0 p1))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1))))]
False Knowledge obtained : [(F (AND (NOT p1) p0)), (F (AND p1 (NOT p0))), (F (NOT (AND p1 p0))), (F (NOT p1)), (F (AND (NOT p1) (NOT p0))), (F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (AND (NOT p1) (NOT p0)))
Knowledge based reduction with 14 factoid took 291 ms. Reduced automaton from 4 states, 9 edges and 2 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-20-LTLFireability-04 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-20-LTLFireability-04 finished in 4387 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((X(F(p0))||G(p1)) U p2)))'
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 34 place count 392 transition count 657
Iterating global reduction 1 with 5 rules applied. Total rules applied 39 place count 392 transition count 657
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 42 place count 389 transition count 652
Iterating global reduction 1 with 3 rules applied. Total rules applied 45 place count 389 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 47 place count 387 transition count 647
Iterating global reduction 1 with 2 rules applied. Total rules applied 49 place count 387 transition count 647
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 643
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 383 transition count 639
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 383 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 382 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 382 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Applied a total of 65 rules in 51 ms. Remains 379 /411 variables (removed 32) and now considering 632/688 (removed 56) transitions.
// Phase 1: matrix 632 rows 379 cols
[2024-06-02 23:44:04] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:44:04] [INFO ] Implicit Places using invariants in 131 ms returned []
[2024-06-02 23:44:04] [INFO ] Invariant cache hit.
[2024-06-02 23:44:05] [INFO ] Implicit Places using invariants and state equation in 322 ms returned []
Implicit Place search using SMT with State Equation took 454 ms to find 0 implicit places.
[2024-06-02 23:44:05] [INFO ] Invariant cache hit.
[2024-06-02 23:44:05] [INFO ] Dead Transitions using invariants and state equation in 209 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 632/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 379/411 places, 632/688 transitions.
Stuttering acceptance computed with spot in 158 ms :[(NOT p2), (NOT p2), (NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=1 dest: 2}, { cond=(AND (NOT p2) p1), acceptance={0} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 3}]], initial=0, aps=[p2:(NEQ s51 1), p1:(AND (EQ s23 1) (EQ s123 1)), p0:(AND (EQ s18 1) (EQ s233 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 385 ms.
Product exploration explored 100000 steps with 50000 reset in 368 ms.
Computed a total of 86 stabilizing places and 110 stable transitions
Computed a total of 86 stabilizing places and 110 stable transitions
Detected a total of 86/379 stabilizing places and 110/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p2 (NOT p1) (NOT p0)), (X (NOT (AND (NOT p2) p1))), (X p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p2) p1)))), (X (X p2)), (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 22 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-20-LTLFireability-05 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-20-LTLFireability-05 finished in 1681 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(p1)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 670
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 670
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 669
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 657
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 657
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 652
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 652
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 647
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 647
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 643
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 639
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 639
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 637
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 633
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 632
Applied a total of 67 rules in 48 ms. Remains 378 /411 variables (removed 33) and now considering 632/688 (removed 56) transitions.
// Phase 1: matrix 632 rows 378 cols
[2024-06-02 23:44:06] [INFO ] Computed 10 invariants in 7 ms
[2024-06-02 23:44:06] [INFO ] Implicit Places using invariants in 124 ms returned []
[2024-06-02 23:44:06] [INFO ] Invariant cache hit.
[2024-06-02 23:44:06] [INFO ] Implicit Places using invariants and state equation in 361 ms returned []
Implicit Place search using SMT with State Equation took 487 ms to find 0 implicit places.
[2024-06-02 23:44:06] [INFO ] Invariant cache hit.
[2024-06-02 23:44:07] [INFO ] Dead Transitions using invariants and state equation in 223 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 632/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 758 ms. Remains : 378/411 places, 632/688 transitions.
Stuttering acceptance computed with spot in 296 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(EQ s36 0), p0:(EQ s353 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 145 ms.
Product exploration explored 100000 steps with 0 reset in 151 ms.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Detected a total of 84/378 stabilizing places and 108/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1)))))]
Knowledge based reduction with 5 factoid took 264 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 193 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 6) seen :3
Incomplete Best-First random walk after 10000 steps, including 7 resets, run finished after 73 ms. (steps per millisecond=136 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 6 resets, run finished after 75 ms. (steps per millisecond=133 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-06-02 23:44:08] [INFO ] Invariant cache hit.
[2024-06-02 23:44:08] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-06-02 23:44:08] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:44:08] [INFO ] After 180ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :2
[2024-06-02 23:44:09] [INFO ] After 252ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :2
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-06-02 23:44:09] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :2
Fused 3 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 632/632 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 564
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 557
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 557
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 197 place count 274 transition count 517
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 263 place count 241 transition count 484
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 351 place count 197 transition count 579
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 354 place count 197 transition count 576
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 376 place count 197 transition count 554
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 407 place count 175 transition count 545
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 413 place count 169 transition count 539
Iterating global reduction 4 with 6 rules applied. Total rules applied 419 place count 169 transition count 539
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 169 transition count 530
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 455 place count 169 transition count 503
Applied a total of 455 rules in 56 ms. Remains 169 /378 variables (removed 209) and now considering 503/632 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 56 ms. Remains : 169/378 places, 503/632 transitions.
Finished random walk after 273 steps, including 9 resets, run visited all 2 properties in 4 ms. (steps per millisecond=68 )
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(X (X (AND p0 p1))), (X (X (NOT (AND p0 p1)))), (X (X (NOT p1))), (X (X p1)), (X (X (AND p0 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 6 factoid took 452 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 223 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Applied a total of 0 rules in 8 ms. Remains 378 /378 variables (removed 0) and now considering 632/632 (removed 0) transitions.
[2024-06-02 23:44:10] [INFO ] Invariant cache hit.
[2024-06-02 23:44:10] [INFO ] Implicit Places using invariants in 117 ms returned []
[2024-06-02 23:44:10] [INFO ] Invariant cache hit.
[2024-06-02 23:44:10] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-02 23:44:10] [INFO ] Invariant cache hit.
[2024-06-02 23:44:10] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 716 ms. Remains : 378/378 places, 632/632 transitions.
Computed a total of 84 stabilizing places and 108 stable transitions
Computed a total of 84 stabilizing places and 108 stable transitions
Detected a total of 84/378 stabilizing places and 108/632 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0))))]
Knowledge based reduction with 3 factoid took 190 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 207 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Incomplete random walk after 10000 steps, including 7 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 8 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-06-02 23:44:11] [INFO ] Invariant cache hit.
[2024-06-02 23:44:11] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:44:11] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:44:11] [INFO ] After 167ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:44:11] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 34 ms.
[2024-06-02 23:44:11] [INFO ] After 349ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Fused 2 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 378/378 places, 632/632 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 564
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 317 transition count 557
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 314 transition count 557
Performed 40 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 40 Pre rules applied. Total rules applied 117 place count 314 transition count 517
Deduced a syphon composed of 40 places in 0 ms
Reduce places removed 40 places and 0 transitions.
Iterating global reduction 3 with 80 rules applied. Total rules applied 197 place count 274 transition count 517
Performed 33 Post agglomeration using F-continuation condition.Transition count delta: 33
Deduced a syphon composed of 33 places in 0 ms
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 66 rules applied. Total rules applied 263 place count 241 transition count 484
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 3 with 88 rules applied. Total rules applied 351 place count 197 transition count 579
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 354 place count 197 transition count 576
Free-agglomeration rule applied 22 times.
Iterating global reduction 3 with 22 rules applied. Total rules applied 376 place count 197 transition count 554
Reduce places removed 22 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 31 rules applied. Total rules applied 407 place count 175 transition count 545
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 413 place count 169 transition count 539
Iterating global reduction 4 with 6 rules applied. Total rules applied 419 place count 169 transition count 539
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 428 place count 169 transition count 530
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 455 place count 169 transition count 503
Applied a total of 455 rules in 46 ms. Remains 169 /378 variables (removed 209) and now considering 503/632 (removed 129) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 169/378 places, 503/632 transitions.
Finished random walk after 506 steps, including 13 resets, run visited all 2 properties in 5 ms. (steps per millisecond=101 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(X (X (NOT p1))), (X (X p1)), (X (X (AND p1 p0))), (X (X (NOT (AND p1 p0)))), (F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 3 factoid took 260 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 318 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 225 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 203 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 2 reset in 99 ms.
Product exploration explored 100000 steps with 0 reset in 115 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 209 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Graph (trivial) has 281 edges and 378 vertex of which 11 / 378 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 370 transition count 623
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 370 transition count 619
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 24 Pre rules applied. Total rules applied 58 place count 370 transition count 652
Deduced a syphon composed of 77 places in 1 ms
Iterating global reduction 2 with 24 rules applied. Total rules applied 82 place count 370 transition count 652
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 88 place count 364 transition count 646
Deduced a syphon composed of 71 places in 0 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 94 place count 364 transition count 646
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 119 places in 1 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 142 place count 364 transition count 665
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 158 place count 348 transition count 649
Deduced a syphon composed of 103 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 174 place count 348 transition count 649
Performed 48 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 151 places in 0 ms
Iterating global reduction 2 with 48 rules applied. Total rules applied 222 place count 348 transition count 931
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 225 place count 348 transition count 928
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 232 place count 341 transition count 914
Deduced a syphon composed of 144 places in 0 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 239 place count 341 transition count 914
Deduced a syphon composed of 144 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 242 place count 341 transition count 911
Deduced a syphon composed of 144 places in 0 ms
Applied a total of 242 rules in 73 ms. Remains 341 /378 variables (removed 37) and now considering 911/632 (removed -279) transitions.
[2024-06-02 23:44:13] [INFO ] Redundant transitions in 52 ms returned []
[2024-06-02 23:44:13] [INFO ] Flow matrix only has 882 transitions (discarded 29 similar events)
// Phase 1: matrix 882 rows 341 cols
[2024-06-02 23:44:13] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:44:13] [INFO ] Dead Transitions using invariants and state equation in 299 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 341/378 places, 911/632 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 438 ms. Remains : 341/378 places, 911/632 transitions.
Built C files in :
/tmp/ltsmin15160329631744905002
[2024-06-02 23:44:13] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15160329631744905002
Running compilation step : cd /tmp/ltsmin15160329631744905002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 969 ms.
Running link step : cd /tmp/ltsmin15160329631744905002;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin15160329631744905002;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased8097591699093294777.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 378 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 378/378 places, 632/632 transitions.
Applied a total of 0 rules in 5 ms. Remains 378 /378 variables (removed 0) and now considering 632/632 (removed 0) transitions.
// Phase 1: matrix 632 rows 378 cols
[2024-06-02 23:44:28] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:44:29] [INFO ] Implicit Places using invariants in 128 ms returned []
[2024-06-02 23:44:29] [INFO ] Invariant cache hit.
[2024-06-02 23:44:29] [INFO ] Implicit Places using invariants and state equation in 369 ms returned []
Implicit Place search using SMT with State Equation took 499 ms to find 0 implicit places.
[2024-06-02 23:44:29] [INFO ] Invariant cache hit.
[2024-06-02 23:44:29] [INFO ] Dead Transitions using invariants and state equation in 230 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 734 ms. Remains : 378/378 places, 632/632 transitions.
Built C files in :
/tmp/ltsmin993890839829178375
[2024-06-02 23:44:29] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin993890839829178375
Running compilation step : cd /tmp/ltsmin993890839829178375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 918 ms.
Running link step : cd /tmp/ltsmin993890839829178375;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin993890839829178375;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2570671067829681370.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:44:44] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:44:44] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:44:44] [INFO ] Time to serialize gal into /tmp/LTL5956948099372541784.gal : 5 ms
[2024-06-02 23:44:44] [INFO ] Time to serialize properties into /tmp/LTL5640006299628533794.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5956948099372541784.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2580307795270773409.hoa' '-atoms' '/tmp/LTL5640006299628533794.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5640006299628533794.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2580307795270773409.hoa
Detected timeout of ITS tools.
[2024-06-02 23:45:00] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:45:00] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:45:00] [INFO ] Time to serialize gal into /tmp/LTL12553883159774378567.gal : 4 ms
[2024-06-02 23:45:00] [INFO ] Time to serialize properties into /tmp/LTL665786108945818449.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12553883159774378567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL665786108945818449.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(p563==0)"))||(X("(p60==0)"))))))
Formula 0 simplified : XF(F!"(p563==0)" & X!"(p60==0)")
Detected timeout of ITS tools.
[2024-06-02 23:45:15] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:45:15] [INFO ] Applying decomposition
[2024-06-02 23:45:15] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph15414835638327267491.txt' '-o' '/tmp/graph15414835638327267491.bin' '-w' '/tmp/graph15414835638327267491.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph15414835638327267491.bin' '-l' '-1' '-v' '-w' '/tmp/graph15414835638327267491.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:45:15] [INFO ] Decomposing Gal with order
[2024-06-02 23:45:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:45:15] [INFO ] Removed a total of 688 redundant transitions.
[2024-06-02 23:45:15] [INFO ] Flatten gal took : 77 ms
[2024-06-02 23:45:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 25 ms.
[2024-06-02 23:45:15] [INFO ] Time to serialize gal into /tmp/LTL5160633511927623811.gal : 18 ms
[2024-06-02 23:45:15] [INFO ] Time to serialize properties into /tmp/LTL6244001779914086287.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5160633511927623811.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6244001779914086287.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((G("(i13.i1.u125.p563==0)"))||(X("(i2.i1.u11.p60==0)"))))))
Formula 0 simplified : XF(F!"(i13.i1.u125.p563==0)" & X!"(i2.i1.u11.p60==0)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11739225635315099503
[2024-06-02 23:45:30] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11739225635315099503
Running compilation step : cd /tmp/ltsmin11739225635315099503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 911 ms.
Running link step : cd /tmp/ltsmin11739225635315099503;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin11739225635315099503;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X([](([]((LTLAPp0==true))||X((LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-20-LTLFireability-06 finished in 99260 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X(p0)&&F(p1))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 656
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 651
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 646
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 642
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 638
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 631
Applied a total of 67 rules in 53 ms. Remains 378 /411 variables (removed 33) and now considering 631/688 (removed 57) transitions.
// Phase 1: matrix 631 rows 378 cols
[2024-06-02 23:45:45] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:45:45] [INFO ] Implicit Places using invariants in 225 ms returned []
[2024-06-02 23:45:45] [INFO ] Invariant cache hit.
[2024-06-02 23:45:46] [INFO ] Implicit Places using invariants and state equation in 323 ms returned []
Implicit Place search using SMT with State Equation took 552 ms to find 0 implicit places.
[2024-06-02 23:45:46] [INFO ] Invariant cache hit.
[2024-06-02 23:45:46] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 631/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 842 ms. Remains : 378/411 places, 631/688 transitions.
Stuttering acceptance computed with spot in 182 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1), true]
Running random walk in product with property : FireWire-PT-20-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(AND (EQ s23 1) (EQ s342 1)), p0:(EQ s282 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-07 finished in 1064 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 36 place count 391 transition count 658
Iterating global reduction 1 with 5 rules applied. Total rules applied 41 place count 391 transition count 658
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 43 place count 389 transition count 655
Iterating global reduction 1 with 2 rules applied. Total rules applied 45 place count 389 transition count 655
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 46 place count 388 transition count 652
Iterating global reduction 1 with 1 rules applied. Total rules applied 47 place count 388 transition count 652
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 48 place count 387 transition count 650
Iterating global reduction 1 with 1 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 50 place count 386 transition count 647
Iterating global reduction 1 with 1 rules applied. Total rules applied 51 place count 386 transition count 647
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 52 place count 385 transition count 645
Iterating global reduction 1 with 1 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 384 transition count 643
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 383 transition count 641
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 383 transition count 641
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 58 place count 382 transition count 640
Iterating global reduction 1 with 1 rules applied. Total rules applied 59 place count 382 transition count 640
Applied a total of 59 rules in 44 ms. Remains 382 /411 variables (removed 29) and now considering 640/688 (removed 48) transitions.
// Phase 1: matrix 640 rows 382 cols
[2024-06-02 23:45:46] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:45:46] [INFO ] Implicit Places using invariants in 126 ms returned []
[2024-06-02 23:45:46] [INFO ] Invariant cache hit.
[2024-06-02 23:45:47] [INFO ] Implicit Places using invariants and state equation in 364 ms returned []
Implicit Place search using SMT with State Equation took 497 ms to find 0 implicit places.
[2024-06-02 23:45:47] [INFO ] Invariant cache hit.
[2024-06-02 23:45:47] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 382/411 places, 640/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 778 ms. Remains : 382/411 places, 640/688 transitions.
Stuttering acceptance computed with spot in 252 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s11 0) (EQ s146 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 245 ms.
Product exploration explored 100000 steps with 25000 reset in 271 ms.
Computed a total of 89 stabilizing places and 118 stable transitions
Computed a total of 89 stabilizing places and 118 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 75 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1184784 steps, run timeout after 3001 ms. (steps per millisecond=394 ) properties seen :{}
Probabilistic random walk after 1184784 steps, saw 193216 distinct states, run finished after 3004 ms. (steps per millisecond=394 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:45:51] [INFO ] Invariant cache hit.
[2024-06-02 23:45:51] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:45:51] [INFO ] [Nat]Absence check using 10 positive place invariants in 3 ms returned sat
[2024-06-02 23:45:51] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:45:51] [INFO ] After 196ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-06-02 23:45:51] [INFO ] After 292ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 572
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 321 transition count 565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 318 transition count 565
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 318 transition count 524
Deduced a syphon composed of 41 places in 0 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 277 transition count 524
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 267 place count 243 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 198 transition count 589
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 360 place count 198 transition count 586
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 198 transition count 566
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 178 transition count 557
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 172 transition count 551
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 172 transition count 551
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 172 transition count 542
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 172 transition count 515
Applied a total of 457 rules in 46 ms. Remains 172 /382 variables (removed 210) and now considering 515/640 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 172/382 places, 515/640 transitions.
Finished random walk after 2676 steps, including 83 resets, run visited all 1 properties in 7 ms. (steps per millisecond=382 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 91 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 148 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 382/382 places, 640/640 transitions.
Applied a total of 0 rules in 8 ms. Remains 382 /382 variables (removed 0) and now considering 640/640 (removed 0) transitions.
[2024-06-02 23:45:52] [INFO ] Invariant cache hit.
[2024-06-02 23:45:52] [INFO ] Implicit Places using invariants in 122 ms returned []
[2024-06-02 23:45:52] [INFO ] Invariant cache hit.
[2024-06-02 23:45:52] [INFO ] Implicit Places using invariants and state equation in 368 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-02 23:45:52] [INFO ] Invariant cache hit.
[2024-06-02 23:45:53] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 722 ms. Remains : 382/382 places, 640/640 transitions.
Computed a total of 89 stabilizing places and 118 stable transitions
Computed a total of 89 stabilizing places and 118 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 77 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 7 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1204707 steps, run timeout after 3001 ms. (steps per millisecond=401 ) properties seen :{}
Probabilistic random walk after 1204707 steps, saw 196656 distinct states, run finished after 3001 ms. (steps per millisecond=401 ) properties seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:45:56] [INFO ] Invariant cache hit.
[2024-06-02 23:45:56] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:45:56] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2024-06-02 23:45:56] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-06-02 23:45:56] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-06-02 23:45:56] [INFO ] After 306ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Drop transitions removed 15 transitions
Reduce isomorphic transitions removed 15 transitions.
Drop transitions removed 53 transitions
Trivial Post-agglo rules discarded 53 transitions
Performed 53 trivial Post agglomeration. Transition count delta: 53
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 572
Reduce places removed 53 places and 0 transitions.
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Drop transitions removed 3 transitions
Trivial Post-agglo rules discarded 3 transitions
Performed 3 trivial Post agglomeration. Transition count delta: 3
Iterating post reduction 1 with 60 rules applied. Total rules applied 114 place count 321 transition count 565
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 117 place count 318 transition count 565
Performed 41 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 41 Pre rules applied. Total rules applied 117 place count 318 transition count 524
Deduced a syphon composed of 41 places in 1 ms
Reduce places removed 41 places and 0 transitions.
Iterating global reduction 3 with 82 rules applied. Total rules applied 199 place count 277 transition count 524
Performed 34 Post agglomeration using F-continuation condition.Transition count delta: 34
Deduced a syphon composed of 34 places in 0 ms
Reduce places removed 34 places and 0 transitions.
Iterating global reduction 3 with 68 rules applied. Total rules applied 267 place count 243 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 3 with 90 rules applied. Total rules applied 357 place count 198 transition count 589
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 360 place count 198 transition count 586
Free-agglomeration rule applied 20 times.
Iterating global reduction 3 with 20 rules applied. Total rules applied 380 place count 198 transition count 566
Reduce places removed 20 places and 0 transitions.
Drop transitions removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 3 with 29 rules applied. Total rules applied 409 place count 178 transition count 557
Discarding 6 places :
Symmetric choice reduction at 4 with 6 rule applications. Total rules 415 place count 172 transition count 551
Iterating global reduction 4 with 6 rules applied. Total rules applied 421 place count 172 transition count 551
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 4 with 9 rules applied. Total rules applied 430 place count 172 transition count 542
Drop transitions removed 27 transitions
Redundant transition composition rules discarded 27 transitions
Iterating global reduction 5 with 27 rules applied. Total rules applied 457 place count 172 transition count 515
Applied a total of 457 rules in 41 ms. Remains 172 /382 variables (removed 210) and now considering 515/640 (removed 125) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 172/382 places, 515/640 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 329593 steps, run visited all 1 properties in 1084 ms. (steps per millisecond=304 )
Probabilistic random walk after 329593 steps, saw 106119 distinct states, run finished after 1084 ms. (steps per millisecond=304 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, true]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 120 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 240 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 165 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 150 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 204 ms.
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 159 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 382 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 382/382 places, 640/640 transitions.
Graph (trivial) has 282 edges and 382 vertex of which 11 / 382 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Performed 53 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 53 rules applied. Total rules applied 54 place count 374 transition count 631
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 58 place count 374 transition count 627
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 25 Pre rules applied. Total rules applied 58 place count 374 transition count 661
Deduced a syphon composed of 78 places in 0 ms
Iterating global reduction 2 with 25 rules applied. Total rules applied 83 place count 374 transition count 661
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 89 place count 368 transition count 655
Deduced a syphon composed of 72 places in 1 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 95 place count 368 transition count 655
Performed 49 Post agglomeration using F-continuation condition.Transition count delta: -19
Deduced a syphon composed of 121 places in 1 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 144 place count 368 transition count 674
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 160 place count 352 transition count 658
Deduced a syphon composed of 105 places in 0 ms
Iterating global reduction 2 with 16 rules applied. Total rules applied 176 place count 352 transition count 658
Performed 49 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 154 places in 0 ms
Iterating global reduction 2 with 49 rules applied. Total rules applied 225 place count 352 transition count 954
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 228 place count 352 transition count 951
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 235 place count 345 transition count 937
Deduced a syphon composed of 147 places in 1 ms
Iterating global reduction 3 with 7 rules applied. Total rules applied 242 place count 345 transition count 937
Deduced a syphon composed of 147 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 245 place count 345 transition count 934
Deduced a syphon composed of 147 places in 0 ms
Applied a total of 245 rules in 54 ms. Remains 345 /382 variables (removed 37) and now considering 934/640 (removed -294) transitions.
[2024-06-02 23:45:59] [INFO ] Redundant transitions in 12 ms returned []
[2024-06-02 23:45:59] [INFO ] Flow matrix only has 905 transitions (discarded 29 similar events)
// Phase 1: matrix 905 rows 345 cols
[2024-06-02 23:45:59] [INFO ] Computed 10 invariants in 8 ms
[2024-06-02 23:45:59] [INFO ] Dead Transitions using invariants and state equation in 303 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 345/382 places, 934/640 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 378 ms. Remains : 345/382 places, 934/640 transitions.
Built C files in :
/tmp/ltsmin4544672174341814083
[2024-06-02 23:45:59] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4544672174341814083
Running compilation step : cd /tmp/ltsmin4544672174341814083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 950 ms.
Running link step : cd /tmp/ltsmin4544672174341814083;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin4544672174341814083;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9587435890020281559.hoa' '--buchi-type=spotba'
LTSmin run took 234 ms.
FORMULA FireWire-PT-20-LTLFireability-08 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLFireability-08 finished in 14194 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0 U (p1&&X(!p1))))))'
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 397 transition count 669
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 397 transition count 669
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 29 place count 397 transition count 668
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 35 place count 391 transition count 656
Iterating global reduction 1 with 6 rules applied. Total rules applied 41 place count 391 transition count 656
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 44 place count 388 transition count 651
Iterating global reduction 1 with 3 rules applied. Total rules applied 47 place count 388 transition count 651
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 49 place count 386 transition count 646
Iterating global reduction 1 with 2 rules applied. Total rules applied 51 place count 386 transition count 646
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 53 place count 384 transition count 642
Iterating global reduction 1 with 2 rules applied. Total rules applied 55 place count 384 transition count 642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 57 place count 382 transition count 638
Iterating global reduction 1 with 2 rules applied. Total rules applied 59 place count 382 transition count 638
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 60 place count 381 transition count 636
Iterating global reduction 1 with 1 rules applied. Total rules applied 61 place count 381 transition count 636
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 634
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 634
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 632
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 632
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 66 place count 378 transition count 631
Iterating global reduction 1 with 1 rules applied. Total rules applied 67 place count 378 transition count 631
Applied a total of 67 rules in 35 ms. Remains 378 /411 variables (removed 33) and now considering 631/688 (removed 57) transitions.
// Phase 1: matrix 631 rows 378 cols
[2024-06-02 23:46:00] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:46:01] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:46:01] [INFO ] Invariant cache hit.
[2024-06-02 23:46:01] [INFO ] Implicit Places using invariants and state equation in 363 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-02 23:46:01] [INFO ] Invariant cache hit.
[2024-06-02 23:46:01] [INFO ] Dead Transitions using invariants and state equation in 225 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 378/411 places, 631/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 750 ms. Remains : 378/411 places, 631/688 transitions.
Stuttering acceptance computed with spot in 155 ms :[true, true, p1, p1]
Running random walk in product with property : FireWire-PT-20-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=0 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0)), acceptance={0} source=1 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=1 dest: 3}], [{ cond=p1, acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=2 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND p1 (NOT p0)), acceptance={0} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(NEQ s76 1), p0:(EQ s298 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 136 ms.
Stuttering criterion allowed to conclude after 76 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-11 finished in 1059 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&(p1||G(p2)))))'
Support contains 5 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 390 transition count 655
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 54 place count 384 transition count 643
Iterating global reduction 1 with 1 rules applied. Total rules applied 55 place count 384 transition count 643
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 56 place count 383 transition count 642
Iterating global reduction 1 with 1 rules applied. Total rules applied 57 place count 383 transition count 642
Applied a total of 57 rules in 26 ms. Remains 383 /411 variables (removed 28) and now considering 642/688 (removed 46) transitions.
// Phase 1: matrix 642 rows 383 cols
[2024-06-02 23:46:01] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:46:02] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:46:02] [INFO ] Invariant cache hit.
[2024-06-02 23:46:02] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 495 ms to find 0 implicit places.
[2024-06-02 23:46:02] [INFO ] Invariant cache hit.
[2024-06-02 23:46:02] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 383/411 places, 642/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 755 ms. Remains : 383/411 places, 642/688 transitions.
Stuttering acceptance computed with spot in 160 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), true, (NOT p0), (NOT p2)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 2}, { cond=(OR (AND (NOT p0) p1) (AND (NOT p0) p2)), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) p2), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}, { cond=p2, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(EQ s39 1), p2:(AND (EQ s14 1) (EQ s319 1)), p0:(OR (EQ s117 1) (EQ s16 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-12 finished in 937 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((p0||X(X(p1))))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 396 transition count 668
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 396 transition count 668
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 31 place count 396 transition count 667
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 37 place count 390 transition count 655
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 390 transition count 655
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 46 place count 387 transition count 650
Iterating global reduction 1 with 3 rules applied. Total rules applied 49 place count 387 transition count 650
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 51 place count 385 transition count 645
Iterating global reduction 1 with 2 rules applied. Total rules applied 53 place count 385 transition count 645
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 55 place count 383 transition count 641
Iterating global reduction 1 with 2 rules applied. Total rules applied 57 place count 383 transition count 641
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 59 place count 381 transition count 637
Iterating global reduction 1 with 2 rules applied. Total rules applied 61 place count 381 transition count 637
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 62 place count 380 transition count 635
Iterating global reduction 1 with 1 rules applied. Total rules applied 63 place count 380 transition count 635
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 64 place count 379 transition count 633
Iterating global reduction 1 with 1 rules applied. Total rules applied 65 place count 379 transition count 633
Applied a total of 65 rules in 32 ms. Remains 379 /411 variables (removed 32) and now considering 633/688 (removed 55) transitions.
// Phase 1: matrix 633 rows 379 cols
[2024-06-02 23:46:02] [INFO ] Computed 10 invariants in 6 ms
[2024-06-02 23:46:03] [INFO ] Implicit Places using invariants in 130 ms returned []
[2024-06-02 23:46:03] [INFO ] Invariant cache hit.
[2024-06-02 23:46:03] [INFO ] Implicit Places using invariants and state equation in 342 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2024-06-02 23:46:03] [INFO ] Invariant cache hit.
[2024-06-02 23:46:03] [INFO ] Dead Transitions using invariants and state equation in 231 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 379/411 places, 633/688 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 751 ms. Remains : 379/411 places, 633/688 transitions.
Stuttering acceptance computed with spot in 236 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-20-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}]], initial=0, aps=[p0:(EQ s343 1), p1:(AND (EQ s14 1) (EQ s323 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 119 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-20-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-13 finished in 1003 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 0 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 60 transitions
Trivial Post-agglo rules discarded 60 transitions
Performed 60 trivial Post agglomeration. Transition count delta: 60
Iterating post reduction 0 with 60 rules applied. Total rules applied 61 place count 402 transition count 618
Reduce places removed 60 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 64 rules applied. Total rules applied 125 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 126 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 126 place count 341 transition count 579
Deduced a syphon composed of 35 places in 0 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 196 place count 306 transition count 579
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 206 place count 296 transition count 564
Iterating global reduction 3 with 10 rules applied. Total rules applied 216 place count 296 transition count 564
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 296 transition count 563
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 296 transition count 559
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 292 transition count 559
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 289 transition count 551
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 289 transition count 551
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 287 transition count 547
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 287 transition count 547
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 285 transition count 542
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 285 transition count 542
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 283 transition count 538
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 283 transition count 538
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 280 transition count 531
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 279 transition count 529
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 279 transition count 529
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 0 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 327 place count 241 transition count 490
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 417 place count 196 transition count 586
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 420 place count 196 transition count 583
Applied a total of 420 rules in 63 ms. Remains 196 /411 variables (removed 215) and now considering 583/688 (removed 105) transitions.
[2024-06-02 23:46:03] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
// Phase 1: matrix 557 rows 196 cols
[2024-06-02 23:46:03] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:46:04] [INFO ] Implicit Places using invariants in 102 ms returned []
[2024-06-02 23:46:04] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-02 23:46:04] [INFO ] Invariant cache hit.
[2024-06-02 23:46:04] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:46:04] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 387 ms to find 0 implicit places.
[2024-06-02 23:46:04] [INFO ] Redundant transitions in 8 ms returned []
[2024-06-02 23:46:04] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-02 23:46:04] [INFO ] Invariant cache hit.
[2024-06-02 23:46:04] [INFO ] Dead Transitions using invariants and state equation in 185 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/411 places, 583/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 656 ms. Remains : 196/411 places, 583/688 transitions.
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s131 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 3 reset in 49 ms.
Product exploration explored 100000 steps with 5 reset in 54 ms.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 87 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 364 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25332 steps, run visited all 1 properties in 67 ms. (steps per millisecond=378 )
Probabilistic random walk after 25332 steps, saw 5306 distinct states, run finished after 67 ms. (steps per millisecond=378 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 123 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Support contains 1 out of 196 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 196/196 places, 583/583 transitions.
Applied a total of 0 rules in 5 ms. Remains 196 /196 variables (removed 0) and now considering 583/583 (removed 0) transitions.
[2024-06-02 23:46:05] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-02 23:46:05] [INFO ] Invariant cache hit.
[2024-06-02 23:46:05] [INFO ] Implicit Places using invariants in 110 ms returned []
[2024-06-02 23:46:05] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-02 23:46:05] [INFO ] Invariant cache hit.
[2024-06-02 23:46:05] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:46:05] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 408 ms to find 0 implicit places.
[2024-06-02 23:46:05] [INFO ] Redundant transitions in 5 ms returned []
[2024-06-02 23:46:05] [INFO ] Flow matrix only has 557 transitions (discarded 26 similar events)
[2024-06-02 23:46:05] [INFO ] Invariant cache hit.
[2024-06-02 23:46:05] [INFO ] Dead Transitions using invariants and state equation in 198 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 626 ms. Remains : 196/196 places, 583/583 transitions.
Computed a total of 31 stabilizing places and 56 stable transitions
Computed a total of 31 stabilizing places and 56 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 60 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 374 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 67 resets, run finished after 6 ms. (steps per millisecond=1666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 25332 steps, run visited all 1 properties in 68 ms. (steps per millisecond=372 )
Probabilistic random walk after 25332 steps, saw 5306 distinct states, run finished after 69 ms. (steps per millisecond=367 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 104 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 49 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 54 ms :[(NOT p0)]
Product exploration explored 100000 steps with 8 reset in 56 ms.
Product exploration explored 100000 steps with 0 reset in 50 ms.
Built C files in :
/tmp/ltsmin6458403283307934102
[2024-06-02 23:46:06] [INFO ] Computing symmetric may disable matrix : 583 transitions.
[2024-06-02 23:46:06] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:46:06] [INFO ] Computing symmetric may enable matrix : 583 transitions.
[2024-06-02 23:46:06] [INFO ] Computation of Complete enable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:46:06] [INFO ] Computing Do-Not-Accords matrix : 583 transitions.
[2024-06-02 23:46:06] [INFO ] Computation of Completed DNA matrix. took 18 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:46:06] [INFO ] Built C files in 117ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6458403283307934102
Running compilation step : cd /tmp/ltsmin6458403283307934102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1351 ms.
Running link step : cd /tmp/ltsmin6458403283307934102;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin6458403283307934102;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased4912301212103879636.hoa' '--buchi-type=spotba'
LTSmin run took 2112 ms.
FORMULA FireWire-PT-20-LTLFireability-14 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property FireWire-PT-20-LTLFireability-14 finished in 6102 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&F(G(p1)))))'
Support contains 3 out of 411 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 300 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 402 transition count 617
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 341 transition count 613
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 340 transition count 613
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 340 transition count 578
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 305 transition count 578
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 206 place count 297 transition count 566
Iterating global reduction 3 with 8 rules applied. Total rules applied 214 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 215 place count 297 transition count 565
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 215 place count 297 transition count 562
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 221 place count 294 transition count 562
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 223 place count 292 transition count 557
Iterating global reduction 4 with 2 rules applied. Total rules applied 225 place count 292 transition count 557
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 226 place count 291 transition count 555
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 291 transition count 555
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 228 place count 290 transition count 552
Iterating global reduction 4 with 1 rules applied. Total rules applied 229 place count 290 transition count 552
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 230 place count 289 transition count 550
Iterating global reduction 4 with 1 rules applied. Total rules applied 231 place count 289 transition count 550
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 232 place count 288 transition count 547
Iterating global reduction 4 with 1 rules applied. Total rules applied 233 place count 288 transition count 547
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 234 place count 287 transition count 545
Iterating global reduction 4 with 1 rules applied. Total rules applied 235 place count 287 transition count 545
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 236 place count 286 transition count 543
Iterating global reduction 4 with 1 rules applied. Total rules applied 237 place count 286 transition count 543
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 238 place count 285 transition count 541
Iterating global reduction 4 with 1 rules applied. Total rules applied 239 place count 285 transition count 541
Performed 39 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 4 with 78 rules applied. Total rules applied 317 place count 246 transition count 501
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 318 place count 245 transition count 499
Iterating global reduction 4 with 1 rules applied. Total rules applied 319 place count 245 transition count 499
Performed 45 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 45 places in 0 ms
Reduce places removed 45 places and 0 transitions.
Iterating global reduction 4 with 90 rules applied. Total rules applied 409 place count 200 transition count 598
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 4 with 3 rules applied. Total rules applied 412 place count 200 transition count 595
Applied a total of 412 rules in 59 ms. Remains 200 /411 variables (removed 211) and now considering 595/688 (removed 93) transitions.
[2024-06-02 23:46:10] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
// Phase 1: matrix 566 rows 200 cols
[2024-06-02 23:46:10] [INFO ] Computed 10 invariants in 5 ms
[2024-06-02 23:46:10] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 23:46:10] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-02 23:46:10] [INFO ] Invariant cache hit.
[2024-06-02 23:46:10] [INFO ] State equation strengthened by 12 read => feed constraints.
[2024-06-02 23:46:10] [INFO ] Implicit Places using invariants and state equation in 459 ms returned []
Implicit Place search using SMT with State Equation took 574 ms to find 0 implicit places.
[2024-06-02 23:46:10] [INFO ] Redundant transitions in 10 ms returned []
[2024-06-02 23:46:10] [INFO ] Flow matrix only has 566 transitions (discarded 29 similar events)
[2024-06-02 23:46:10] [INFO ] Invariant cache hit.
[2024-06-02 23:46:10] [INFO ] Dead Transitions using invariants and state equation in 200 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 200/411 places, 595/688 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 854 ms. Remains : 200/411 places, 595/688 transitions.
Stuttering acceptance computed with spot in 116 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : FireWire-PT-20-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s15 1) (EQ s75 1)), p1:(EQ s190 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-20-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-20-LTLFireability-15 finished in 990 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((G(p0)||X(p1)))))'
Found a Lengthening insensitive property : FireWire-PT-20-LTLFireability-06
Stuttering acceptance computed with spot in 214 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 411 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 411/411 places, 688/688 transitions.
Graph (trivial) has 299 edges and 411 vertex of which 11 / 411 are part of one of the 3 SCC in 1 ms
Free SCC test removed 8 places
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Drop transitions removed 61 transitions
Trivial Post-agglo rules discarded 61 transitions
Performed 61 trivial Post agglomeration. Transition count delta: 61
Iterating post reduction 0 with 61 rules applied. Total rules applied 62 place count 403 transition count 618
Reduce places removed 61 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 1 with 65 rules applied. Total rules applied 127 place count 342 transition count 614
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 128 place count 341 transition count 614
Performed 35 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 35 Pre rules applied. Total rules applied 128 place count 341 transition count 579
Deduced a syphon composed of 35 places in 1 ms
Reduce places removed 35 places and 0 transitions.
Iterating global reduction 3 with 70 rules applied. Total rules applied 198 place count 306 transition count 579
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 207 place count 297 transition count 566
Iterating global reduction 3 with 9 rules applied. Total rules applied 216 place count 297 transition count 566
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 217 place count 297 transition count 565
Performed 4 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 4 Pre rules applied. Total rules applied 217 place count 297 transition count 561
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 225 place count 293 transition count 561
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 228 place count 290 transition count 553
Iterating global reduction 4 with 3 rules applied. Total rules applied 231 place count 290 transition count 553
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 233 place count 288 transition count 549
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 288 transition count 549
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 237 place count 286 transition count 544
Iterating global reduction 4 with 2 rules applied. Total rules applied 239 place count 286 transition count 544
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 241 place count 284 transition count 540
Iterating global reduction 4 with 2 rules applied. Total rules applied 243 place count 284 transition count 540
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 244 place count 283 transition count 537
Iterating global reduction 4 with 1 rules applied. Total rules applied 245 place count 283 transition count 537
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 246 place count 282 transition count 535
Iterating global reduction 4 with 1 rules applied. Total rules applied 247 place count 282 transition count 535
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 248 place count 281 transition count 533
Iterating global reduction 4 with 1 rules applied. Total rules applied 249 place count 281 transition count 533
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 250 place count 280 transition count 531
Iterating global reduction 4 with 1 rules applied. Total rules applied 251 place count 280 transition count 531
Performed 38 Post agglomeration using F-continuation condition with reduction of 1 identical transitions.
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 4 with 76 rules applied. Total rules applied 327 place count 242 transition count 492
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 328 place count 241 transition count 490
Iterating global reduction 4 with 1 rules applied. Total rules applied 329 place count 241 transition count 490
Performed 44 Post agglomeration using F-continuation condition with reduction of 9 identical transitions.
Deduced a syphon composed of 44 places in 0 ms
Reduce places removed 44 places and 0 transitions.
Iterating global reduction 4 with 88 rules applied. Total rules applied 417 place count 197 transition count 585
Applied a total of 417 rules in 75 ms. Remains 197 /411 variables (removed 214) and now considering 585/688 (removed 103) transitions.
[2024-06-02 23:46:11] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 197 cols
[2024-06-02 23:46:11] [INFO ] Computed 10 invariants in 4 ms
[2024-06-02 23:46:11] [INFO ] Implicit Places using invariants in 113 ms returned []
[2024-06-02 23:46:11] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:11] [INFO ] Invariant cache hit.
[2024-06-02 23:46:11] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 23:46:11] [INFO ] Implicit Places using invariants and state equation in 320 ms returned []
Implicit Place search using SMT with State Equation took 435 ms to find 0 implicit places.
[2024-06-02 23:46:11] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:11] [INFO ] Invariant cache hit.
[2024-06-02 23:46:11] [INFO ] Dead Transitions using invariants and state equation in 194 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 197/411 places, 585/688 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 705 ms. Remains : 197/411 places, 585/688 transitions.
Running random walk in product with property : FireWire-PT-20-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=(NOT p0), acceptance={} source=5 dest: 1}, { cond=p0, acceptance={} source=5 dest: 2}]], initial=4, aps=[p1:(EQ s20 0), p0:(EQ s184 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 5 reset in 58 ms.
Product exploration explored 100000 steps with 1 reset in 76 ms.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/197 stabilizing places and 57/585 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 145 ms. Reduced automaton from 6 states, 13 edges and 2 AP (stutter sensitive) to 6 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 216 ms :[true, (NOT p1), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 359 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :5
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-06-02 23:46:12] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:12] [INFO ] Invariant cache hit.
[2024-06-02 23:46:12] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:46:12] [INFO ] [Nat]Absence check using 10 positive place invariants in 2 ms returned sat
[2024-06-02 23:46:12] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 p0), (X p0), (X (X (AND p0 p1))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (F (OR (G p1) (G (NOT p1)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p1) p0)), (F (NOT p1)), (F (NOT (AND p1 p0))), (F (AND p1 (NOT p0)))]
Knowledge based reduction with 9 factoid took 343 ms. Reduced automaton from 6 states, 12 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 202 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 192 ms :[true, (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p1), (NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Applied a total of 0 rules in 3 ms. Remains 197 /197 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-02 23:46:13] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:13] [INFO ] Invariant cache hit.
[2024-06-02 23:46:13] [INFO ] Implicit Places using invariants in 99 ms returned []
[2024-06-02 23:46:13] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:13] [INFO ] Invariant cache hit.
[2024-06-02 23:46:13] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 23:46:13] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 485 ms to find 0 implicit places.
[2024-06-02 23:46:13] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:13] [INFO ] Invariant cache hit.
[2024-06-02 23:46:14] [INFO ] Dead Transitions using invariants and state equation in 192 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 685 ms. Remains : 197/197 places, 585/585 transitions.
Computed a total of 32 stabilizing places and 57 stable transitions
Computed a total of 32 stabilizing places and 57 stable transitions
Detected a total of 32/197 stabilizing places and 57/585 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 108 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Finished random walk after 8173 steps, including 299 resets, run visited all 4 properties in 88 ms. (steps per millisecond=92 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0), (X (X p0)), (X (X p1)), (X (X (AND p1 p0))), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1)), (F (NOT (AND p0 p1))), (F (NOT p1)), (F (NOT p0))]
Knowledge based reduction with 5 factoid took 311 ms. Reduced automaton from 6 states, 11 edges and 2 AP (stutter sensitive) to 6 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 219 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 211 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Stuttering acceptance computed with spot in 267 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 52 ms.
Product exploration explored 100000 steps with 1 reset in 54 ms.
Applying partial POR strategy [true, false, false, false, false, true]
Stuttering acceptance computed with spot in 222 ms :[true, (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 197 transition count 582
Applied a total of 3 rules in 21 ms. Remains 197 /197 variables (removed 0) and now considering 582/585 (removed 3) transitions.
[2024-06-02 23:46:16] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:46:16] [INFO ] Flow matrix only has 553 transitions (discarded 29 similar events)
// Phase 1: matrix 553 rows 197 cols
[2024-06-02 23:46:16] [INFO ] Computed 10 invariants in 2 ms
[2024-06-02 23:46:16] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 197/197 places, 582/585 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 247 ms. Remains : 197/197 places, 582/585 transitions.
Built C files in :
/tmp/ltsmin1547749705504787819
[2024-06-02 23:46:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1547749705504787819
Running compilation step : cd /tmp/ltsmin1547749705504787819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 831 ms.
Running link step : cd /tmp/ltsmin1547749705504787819;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin1547749705504787819;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9655126375625031875.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 197 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 197/197 places, 585/585 transitions.
Applied a total of 0 rules in 7 ms. Remains 197 /197 variables (removed 0) and now considering 585/585 (removed 0) transitions.
[2024-06-02 23:46:31] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
// Phase 1: matrix 556 rows 197 cols
[2024-06-02 23:46:31] [INFO ] Computed 10 invariants in 3 ms
[2024-06-02 23:46:31] [INFO ] Implicit Places using invariants in 123 ms returned []
[2024-06-02 23:46:31] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:31] [INFO ] Invariant cache hit.
[2024-06-02 23:46:31] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-06-02 23:46:31] [INFO ] Implicit Places using invariants and state equation in 316 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2024-06-02 23:46:31] [INFO ] Flow matrix only has 556 transitions (discarded 29 similar events)
[2024-06-02 23:46:31] [INFO ] Invariant cache hit.
[2024-06-02 23:46:32] [INFO ] Dead Transitions using invariants and state equation in 191 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 644 ms. Remains : 197/197 places, 585/585 transitions.
Built C files in :
/tmp/ltsmin10305206473181455016
[2024-06-02 23:46:32] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10305206473181455016
Running compilation step : cd /tmp/ltsmin10305206473181455016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 867 ms.
Running link step : cd /tmp/ltsmin10305206473181455016;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10305206473181455016;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17265363999604323990.hoa' '--buchi-type=spotba'
LTSmin run took 13890 ms.
Treatment of property FireWire-PT-20-LTLFireability-06 finished in 35897 ms.
FORMULA FireWire-PT-20-LTLFireability-06 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2024-06-02 23:46:46] [INFO ] Flatten gal took : 20 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 188589 ms.

BK_STOP 1717372007910

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ 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//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="FireWire-PT-20"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
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 gold2023"
echo " Input is FireWire-PT-20, 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 r571-tall-171734910500203"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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