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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 596K
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLCardinality.txt
-rw-r--r-- 1 mcc users 61K Jun 2 17:16 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Jun 2 17:16 CTLFireability.txt
-rw-r--r-- 1 mcc users 58K Jun 2 17:16 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.5K Jun 2 17:12 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Jun 2 17:12 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Jun 2 17:12 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Jun 2 17:12 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Jun 2 16:33 NewModel
-rw-r--r-- 1 mcc users 11K Jun 2 17:16 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 110K Jun 2 17:16 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Jun 2 17:16 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Jun 2 17:16 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Jun 2 17:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Jun 2 17:12 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 equiv_col
-rw-r--r-- 1 mcc users 3 Jun 2 16:33 instance
-rw-r--r-- 1 mcc users 6 Jun 2 16:33 iscolored
-rw-r--r-- 1 mcc users 153K Jun 2 16:33 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1717370104888

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-14
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-06-02 23:15:06] [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:15:06] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-06-02 23:15:06] [INFO ] Load time of PNML (sax parser for PT used): 68 ms
[2024-06-02 23:15:06] [INFO ] Transformed 205 places.
[2024-06-02 23:15:06] [INFO ] Transformed 610 transitions.
[2024-06-02 23:15:06] [INFO ] Found NUPN structural information;
[2024-06-02 23:15:06] [INFO ] Parsed PT model containing 205 places and 610 transitions and 2315 arcs in 133 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 4 formulas.
Ensure Unique test removed 71 transitions
Reduce redundant transitions removed 71 transitions.
FORMULA FireWire-PT-14-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-09 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FireWire-PT-14-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 36 out of 205 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 205/205 places, 539/539 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 199 transition count 527
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 199 transition count 527
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 15 place count 199 transition count 524
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 198 transition count 521
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 198 transition count 521
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 197 transition count 519
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 197 transition count 519
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 196 transition count 516
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 196 transition count 516
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 195 transition count 514
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 195 transition count 514
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 194 transition count 511
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 194 transition count 511
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 193 transition count 509
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 193 transition count 509
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 192 transition count 506
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 192 transition count 506
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 191 transition count 504
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 191 transition count 504
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 190 transition count 501
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 190 transition count 501
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 34 place count 189 transition count 499
Iterating global reduction 1 with 1 rules applied. Total rules applied 35 place count 189 transition count 499
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 36 place count 188 transition count 497
Iterating global reduction 1 with 1 rules applied. Total rules applied 37 place count 188 transition count 497
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 38 place count 187 transition count 495
Iterating global reduction 1 with 1 rules applied. Total rules applied 39 place count 187 transition count 495
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 1 with 6 rules applied. Total rules applied 45 place count 187 transition count 489
Applied a total of 45 rules in 92 ms. Remains 187 /205 variables (removed 18) and now considering 489/539 (removed 50) transitions.
[2024-06-02 23:15:06] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
// Phase 1: matrix 457 rows 187 cols
[2024-06-02 23:15:07] [INFO ] Computed 10 invariants in 17 ms
[2024-06-02 23:15:07] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-06-02 23:15:07] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
[2024-06-02 23:15:07] [INFO ] Invariant cache hit.
[2024-06-02 23:15:07] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:15:07] [INFO ] Implicit Places using invariants and state equation in 383 ms returned [71, 133]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 828 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 185/205 places, 489/539 transitions.
Applied a total of 0 rules in 5 ms. Remains 185 /185 variables (removed 0) and now considering 489/489 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 925 ms. Remains : 185/205 places, 489/539 transitions.
Support contains 36 out of 185 places after structural reductions.
[2024-06-02 23:15:07] [INFO ] Flatten gal took : 72 ms
[2024-06-02 23:15:07] [INFO ] Flatten gal took : 32 ms
[2024-06-02 23:15:07] [INFO ] Input system was already deterministic with 489 transitions.
Incomplete random walk after 10000 steps, including 293 resets, run finished after 425 ms. (steps per millisecond=23 ) properties (out of 27) seen :17
Incomplete Best-First random walk after 10001 steps, including 4 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 61 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 61 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 49 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
[2024-06-02 23:15:08] [INFO ] Flow matrix only has 457 transitions (discarded 32 similar events)
// Phase 1: matrix 457 rows 185 cols
[2024-06-02 23:15:08] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:15:08] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:08] [INFO ] After 86ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2024-06-02 23:15:09] [INFO ] [Nat]Absence check using 8 positive place invariants in 3 ms returned sat
[2024-06-02 23:15:09] [INFO ] After 300ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2024-06-02 23:15:09] [INFO ] State equation strengthened by 68 read => feed constraints.
[2024-06-02 23:15:09] [INFO ] After 296ms SMT Verify possible using 68 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2024-06-02 23:15:09] [INFO ] Deduced a trap composed of 43 places in 48 ms of which 3 ms to minimize.
[2024-06-02 23:15:09] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 86 ms
[2024-06-02 23:15:10] [INFO ] After 689ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 207 ms.
[2024-06-02 23:15:10] [INFO ] After 1301ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 50 ms.
Support contains 13 out of 185 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 185/185 places, 489/489 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 185 transition count 486
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 3 Pre rules applied. Total rules applied 3 place count 185 transition count 483
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 9 place count 182 transition count 483
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 10 place count 181 transition count 480
Iterating global reduction 1 with 1 rules applied. Total rules applied 11 place count 181 transition count 480
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 12 place count 180 transition count 478
Iterating global reduction 1 with 1 rules applied. Total rules applied 13 place count 180 transition count 478
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 14 place count 179 transition count 475
Iterating global reduction 1 with 1 rules applied. Total rules applied 15 place count 179 transition count 475
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 16 place count 178 transition count 473
Iterating global reduction 1 with 1 rules applied. Total rules applied 17 place count 178 transition count 473
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 18 place count 177 transition count 470
Iterating global reduction 1 with 1 rules applied. Total rules applied 19 place count 177 transition count 470
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 20 place count 176 transition count 468
Iterating global reduction 1 with 1 rules applied. Total rules applied 21 place count 176 transition count 468
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 22 place count 175 transition count 465
Iterating global reduction 1 with 1 rules applied. Total rules applied 23 place count 175 transition count 465
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 24 place count 174 transition count 463
Iterating global reduction 1 with 1 rules applied. Total rules applied 25 place count 174 transition count 463
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 26 place count 173 transition count 460
Iterating global reduction 1 with 1 rules applied. Total rules applied 27 place count 173 transition count 460
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 28 place count 172 transition count 458
Iterating global reduction 1 with 1 rules applied. Total rules applied 29 place count 172 transition count 458
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 30 place count 171 transition count 456
Iterating global reduction 1 with 1 rules applied. Total rules applied 31 place count 171 transition count 456
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 32 place count 170 transition count 454
Iterating global reduction 1 with 1 rules applied. Total rules applied 33 place count 170 transition count 454
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 37 place count 168 transition count 452
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 1 with 6 rules applied. Total rules applied 43 place count 165 transition count 458
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 49 place count 165 transition count 452
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 52 place count 165 transition count 449
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 55 place count 165 transition count 455
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 2 with 9 rules applied. Total rules applied 64 place count 162 transition count 449
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 3 with 6 rules applied. Total rules applied 70 place count 162 transition count 443
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 71 place count 161 transition count 442
Applied a total of 71 rules in 159 ms. Remains 161 /185 variables (removed 24) and now considering 442/489 (removed 47) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 161/185 places, 442/489 transitions.
Incomplete random walk after 10000 steps, including 327 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 67 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 57 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 70 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 492625 steps, run timeout after 3001 ms. (steps per millisecond=164 ) properties seen :{2=1, 5=1}
Probabilistic random walk after 492625 steps, saw 145907 distinct states, run finished after 3002 ms. (steps per millisecond=164 ) properties seen :2
Running SMT prover for 6 properties.
[2024-06-02 23:15:14] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 161 cols
[2024-06-02 23:15:14] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:15:14] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:14] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-06-02 23:15:14] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:14] [INFO ] After 223ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-06-02 23:15:14] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:14] [INFO ] After 162ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-06-02 23:15:14] [INFO ] Deduced a trap composed of 32 places in 36 ms of which 1 ms to minimize.
[2024-06-02 23:15:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2024-06-02 23:15:14] [INFO ] Deduced a trap composed of 38 places in 45 ms of which 1 ms to minimize.
[2024-06-02 23:15:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 23:15:14] [INFO ] Deduced a trap composed of 50 places in 45 ms of which 0 ms to minimize.
[2024-06-02 23:15:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 70 ms
[2024-06-02 23:15:15] [INFO ] After 522ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 175 ms.
[2024-06-02 23:15:15] [INFO ] After 988ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 55 ms.
Support contains 11 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 9 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 161/161 places, 442/442 transitions.
Incomplete random walk after 10000 steps, including 334 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 65 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 6) seen :1
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 5) seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:15:15] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:15] [INFO ] Invariant cache hit.
[2024-06-02 23:15:15] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:15] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:15:15] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:15] [INFO ] After 171ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-06-02 23:15:15] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:16] [INFO ] After 223ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-06-02 23:15:16] [INFO ] Deduced a trap composed of 17 places in 81 ms of which 1 ms to minimize.
[2024-06-02 23:15:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 103 ms
[2024-06-02 23:15:16] [INFO ] After 473ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-06-02 23:15:16] [INFO ] After 842ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 3 ms.
Support contains 10 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 161/161 places, 442/442 transitions.
Incomplete random walk after 10000 steps, including 322 resets, run finished after 131 ms. (steps per millisecond=76 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 70 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 94 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 56 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 5 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:15:16] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:16] [INFO ] Invariant cache hit.
[2024-06-02 23:15:16] [INFO ] [Real]Absence check using 8 positive place invariants in 1 ms returned sat
[2024-06-02 23:15:16] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:15:16] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:17] [INFO ] After 142ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:17] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:17] [INFO ] After 104ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:17] [INFO ] After 248ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 107 ms.
[2024-06-02 23:15:17] [INFO ] After 562ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 11 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 161/161 places, 442/442 transitions.
Incomplete random walk after 10000 steps, including 324 resets, run finished after 183 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 57 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 58 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 10 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 488643 steps, run timeout after 3001 ms. (steps per millisecond=162 ) properties seen :{}
Probabilistic random walk after 488643 steps, saw 144595 distinct states, run finished after 3002 ms. (steps per millisecond=162 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:15:20] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:20] [INFO ] Invariant cache hit.
[2024-06-02 23:15:20] [INFO ] [Real]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:20] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:15:20] [INFO ] [Nat]Absence check using 8 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:21] [INFO ] After 150ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:21] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:21] [INFO ] After 101ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:21] [INFO ] After 241ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 105 ms.
[2024-06-02 23:15:21] [INFO ] After 553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 161 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 10 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 161/161 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 161/161 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 161 /161 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 23:15:21] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:21] [INFO ] Invariant cache hit.
[2024-06-02 23:15:21] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:15:21] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:21] [INFO ] Invariant cache hit.
[2024-06-02 23:15:21] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:21] [INFO ] Implicit Places using invariants and state equation in 283 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 366 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 160/161 places, 442/442 transitions.
Applied a total of 0 rules in 12 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 387 ms. Remains : 160/161 places, 442/442 transitions.
Incomplete random walk after 10000 steps, including 306 resets, run finished after 154 ms. (steps per millisecond=64 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 71 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 503671 steps, run timeout after 3001 ms. (steps per millisecond=167 ) properties seen :{}
Probabilistic random walk after 503671 steps, saw 149499 distinct states, run finished after 3001 ms. (steps per millisecond=167 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:15:25] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 23:15:25] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:15:25] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:25] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:15:25] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:15:25] [INFO ] After 162ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:25] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:25] [INFO ] After 177ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:25] [INFO ] Deduced a trap composed of 39 places in 43 ms of which 4 ms to minimize.
[2024-06-02 23:15:25] [INFO ] Deduced a trap composed of 32 places in 35 ms of which 0 ms to minimize.
[2024-06-02 23:15:25] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 117 ms
[2024-06-02 23:15:25] [INFO ] After 410ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-06-02 23:15:25] [INFO ] After 704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 1 ms.
Support contains 8 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 5 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 23:15:25] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:25] [INFO ] Invariant cache hit.
[2024-06-02 23:15:26] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-06-02 23:15:26] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:26] [INFO ] Invariant cache hit.
[2024-06-02 23:15:26] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:26] [INFO ] Implicit Places using invariants and state equation in 240 ms returned []
Implicit Place search using SMT with State Equation took 318 ms to find 0 implicit places.
[2024-06-02 23:15:26] [INFO ] Redundant transitions in 33 ms returned []
[2024-06-02 23:15:26] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:26] [INFO ] Invariant cache hit.
[2024-06-02 23:15:26] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 498 ms. Remains : 160/160 places, 442/442 transitions.
Graph (trivial) has 135 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 2 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 297
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 287
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 32 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 23:15:26] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 23:15:26] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:15:26] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:26] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:15:26] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:15:26] [INFO ] After 90ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:26] [INFO ] Deduced a trap composed of 21 places in 32 ms of which 0 ms to minimize.
[2024-06-02 23:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-06-02 23:15:26] [INFO ] Deduced a trap composed of 15 places in 58 ms of which 0 ms to minimize.
[2024-06-02 23:15:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 75 ms
[2024-06-02 23:15:26] [INFO ] After 280ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 50 ms.
[2024-06-02 23:15:26] [INFO ] After 381ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Computed a total of 44 stabilizing places and 101 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F((G(p1)||X(p2)||G(p3)||p0)))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 173 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 173 transition count 460
Applied a total of 24 rules in 26 ms. Remains 173 /185 variables (removed 12) and now considering 460/489 (removed 29) transitions.
[2024-06-02 23:15:27] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
// Phase 1: matrix 428 rows 173 cols
[2024-06-02 23:15:27] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:15:27] [INFO ] Implicit Places using invariants in 92 ms returned []
[2024-06-02 23:15:27] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2024-06-02 23:15:27] [INFO ] Invariant cache hit.
[2024-06-02 23:15:27] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:15:27] [INFO ] Implicit Places using invariants and state equation in 296 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 391 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/185 places, 460/489 transitions.
Applied a total of 0 rules in 3 ms. Remains 172 /172 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 421 ms. Remains : 172/185 places, 460/489 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 328 ms :[(AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p3) (NOT p2))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0) p3 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) p3 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p1 (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0) (NOT p3) (NOT p2)), acceptance={0, 1} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (AND (EQ s10 1) (EQ s159 1)) (AND (EQ s9 1) (EQ s109 1))), p1:(AND (EQ s7 1) (EQ s108 1)), p3:(AND (EQ s10 1) (EQ s159 1)), p2:(EQ s156 1)], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 1 steps with 0 reset in 3 ms.
FORMULA FireWire-PT-14-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-00 finished in 810 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 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 185 transition count 486
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 182 transition count 486
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 180 transition count 480
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 180 transition count 480
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 178 transition count 476
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 178 transition count 476
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 176 transition count 470
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 176 transition count 470
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 174 transition count 466
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 174 transition count 466
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 172 transition count 460
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 172 transition count 460
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 170 transition count 456
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 170 transition count 456
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 168 transition count 450
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 168 transition count 450
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 166 transition count 446
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 166 transition count 446
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 164 transition count 440
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 164 transition count 440
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 162 transition count 436
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 162 transition count 436
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 160 transition count 432
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 160 transition count 432
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 158 transition count 428
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 158 transition count 428
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 155 transition count 425
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 152 transition count 431
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 152 transition count 425
Applied a total of 72 rules in 96 ms. Remains 152 /185 variables (removed 33) and now considering 425/489 (removed 64) transitions.
[2024-06-02 23:15:28] [INFO ] Flow matrix only has 386 transitions (discarded 39 similar events)
// Phase 1: matrix 386 rows 152 cols
[2024-06-02 23:15:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:15:28] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:15:28] [INFO ] Flow matrix only has 386 transitions (discarded 39 similar events)
[2024-06-02 23:15:28] [INFO ] Invariant cache hit.
[2024-06-02 23:15:28] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:15:28] [INFO ] Implicit Places using invariants and state equation in 278 ms returned [19]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 349 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 151/185 places, 425/489 transitions.
Applied a total of 0 rules in 17 ms. Remains 151 /151 variables (removed 0) and now considering 425/425 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 462 ms. Remains : 151/185 places, 425/489 transitions.
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s16 1) (EQ s43 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 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-01 finished in 519 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(p1) U X(p2))&&p0)))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 24 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 23:15:28] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 23:15:28] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:15:28] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-06-02 23:15:28] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:15:28] [INFO ] Invariant cache hit.
[2024-06-02 23:15:28] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:15:28] [INFO ] Implicit Places using invariants and state equation in 220 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 294 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 1 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 321 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 303 ms :[(OR (NOT p0) (NOT p2)), (OR (NOT p0) (NOT p2)), true, (NOT p2), (NOT p2), (NOT p1)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=(AND p0 p1), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={} source=3 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=4 dest: 2}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 4}, { cond=(AND p1 (NOT p2)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 2}, { cond=p1, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(AND (EQ s9 1) (EQ s53 1)), p1:(AND (EQ s3 1) (EQ s151 1)), p2:(AND (EQ s6 1) (EQ s95 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, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA FireWire-PT-14-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-02 finished in 644 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(G(!p0))) U (!p1&&X(!p2))))'
Support contains 7 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 173 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 173 transition count 460
Applied a total of 24 rules in 21 ms. Remains 173 /185 variables (removed 12) and now considering 460/489 (removed 29) transitions.
[2024-06-02 23:15:29] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
// Phase 1: matrix 428 rows 173 cols
[2024-06-02 23:15:29] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:15:29] [INFO ] Implicit Places using invariants in 100 ms returned []
[2024-06-02 23:15:29] [INFO ] Flow matrix only has 428 transitions (discarded 32 similar events)
[2024-06-02 23:15:29] [INFO ] Invariant cache hit.
[2024-06-02 23:15:29] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:15:29] [INFO ] Implicit Places using invariants and state equation in 277 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 405 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 172/185 places, 460/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 172 /172 variables (removed 0) and now considering 460/460 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 428 ms. Remains : 172/185 places, 460/489 transitions.
Stuttering acceptance computed with spot in 151 ms :[(OR p1 p2), p0, p2, p0, true]
Running random walk in product with property : FireWire-PT-14-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={0} source=0 dest: 0}, { cond=p1, acceptance={0} source=0 dest: 1}, { cond=(NOT p1), acceptance={0} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(AND p1 p2), acceptance={0} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 2}, { cond=p2, acceptance={0} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 3}, { cond=p0, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s9 1) (EQ s158 1)) (AND (EQ s3 1) (EQ s136 1)) (AND (EQ s7 1) (EQ s105 1))), p2:(AND (EQ s7 1) (EQ s99 1)), p0:(AND (EQ s3 1) (EQ s136 1))...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 338 ms.
Product exploration explored 100000 steps with 50000 reset in 265 ms.
Computed a total of 31 stabilizing places and 72 stable transitions
Computed a total of 31 stabilizing places and 72 stable transitions
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT p2)), (X (NOT (AND p1 p2))), (X (NOT (AND (NOT p1) p2))), (X (NOT p1)), (X (X (NOT p2))), true, (X (X (NOT (AND p1 p2)))), (X (X (NOT (AND (NOT p1) p2)))), (X (X (NOT p1))), (X (X (NOT p0)))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 5 states, 10 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-03 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-03 finished in 1330 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(F(p0))||G(p1))))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 176 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 176 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 175 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 175 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 455
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 455
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 168 transition count 453
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 168 transition count 453
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 167 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 167 transition count 451
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 164 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 161 transition count 454
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 52 place count 161 transition count 448
Applied a total of 52 rules in 58 ms. Remains 161 /185 variables (removed 24) and now considering 448/489 (removed 41) transitions.
[2024-06-02 23:15:30] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
// Phase 1: matrix 409 rows 161 cols
[2024-06-02 23:15:30] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:15:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-06-02 23:15:30] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
[2024-06-02 23:15:30] [INFO ] Invariant cache hit.
[2024-06-02 23:15:30] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:15:30] [INFO ] Implicit Places using invariants and state equation in 239 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 405 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/185 places, 448/489 transitions.
Applied a total of 0 rules in 15 ms. Remains 160 /160 variables (removed 0) and now considering 448/448 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 478 ms. Remains : 160/185 places, 448/489 transitions.
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(OR (EQ s2 0) (EQ s102 0)), p0:(OR (EQ s9 0) (EQ s142 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 137 ms.
Product exploration explored 100000 steps with 3 reset in 96 ms.
Computed a total of 22 stabilizing places and 60 stable transitions
Computed a total of 22 stabilizing places and 60 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 70 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 319 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 91 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:15:31] [INFO ] Flow matrix only has 409 transitions (discarded 39 similar events)
// Phase 1: matrix 409 rows 160 cols
[2024-06-02 23:15:31] [INFO ] Computed 7 invariants in 4 ms
[2024-06-02 23:15:31] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-06-02 23:15:31] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:31] [INFO ] After 51ms 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 (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND (NOT p0) p1))]
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 12 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-04 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-04 finished in 1154 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 (p0 U p1)))'
Support contains 4 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 175 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 175 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 459
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 457
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 457
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 168 transition count 452
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 168 transition count 452
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 167 transition count 450
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 167 transition count 450
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 166 transition count 448
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 166 transition count 448
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 42 place count 163 transition count 445
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -4
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 46 place count 161 transition count 449
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 50 place count 161 transition count 445
Applied a total of 50 rules in 43 ms. Remains 161 /185 variables (removed 24) and now considering 445/489 (removed 44) transitions.
[2024-06-02 23:15:31] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
// Phase 1: matrix 409 rows 161 cols
[2024-06-02 23:15:31] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:15:31] [INFO ] Implicit Places using invariants in 86 ms returned []
[2024-06-02 23:15:31] [INFO ] Flow matrix only has 409 transitions (discarded 36 similar events)
[2024-06-02 23:15:31] [INFO ] Invariant cache hit.
[2024-06-02 23:15:31] [INFO ] State equation strengthened by 59 read => feed constraints.
[2024-06-02 23:15:32] [INFO ] Implicit Places using invariants and state equation in 251 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 342 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 160/185 places, 445/489 transitions.
Applied a total of 0 rules in 11 ms. Remains 160 /160 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 396 ms. Remains : 160/185 places, 445/489 transitions.
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), p0]
Running random walk in product with property : FireWire-PT-14-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 1}, { cond=p0, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s7 1) (EQ s53 1)), p0:(AND (EQ s3 1) (EQ s71 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA FireWire-PT-14-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property FireWire-PT-14-LTLFireability-05 finished in 477 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(p0))||!(p1 U (X((p1 U p2))||p1))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 19 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 23:15:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 23:15:32] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:15:32] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:15:32] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:15:32] [INFO ] Invariant cache hit.
[2024-06-02 23:15:32] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:15:32] [INFO ] Implicit Places using invariants and state equation in 236 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 329 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 350 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 169 ms :[true, (OR (AND (NOT p0) p2) (AND (NOT p0) p1)), (NOT p0), (AND (NOT p0) p2), p2]
Running random walk in product with property : FireWire-PT-14-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 2}, { cond=(NOT p1), acceptance={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}], [{ cond=(AND p2 (NOT p0)), acceptance={} source=3 dest: 0}, { cond=(AND p2 p0), acceptance={} source=3 dest: 2}, { cond=(AND p1 (NOT p2) p0), acceptance={} source=3 dest: 3}, { cond=(AND p1 (NOT p2) (NOT p0)), acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}]], initial=1, aps=[p1:(EQ s147 1), p0:(OR (EQ s8 0) (EQ s157 0)), p2:(AND (EQ s8 1) (EQ s157 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 186 ms.
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 (NOT p2)), (X (NOT (AND p2 (NOT p0)))), (X (NOT (AND p2 p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (NOT (AND p1 (NOT p2) p0))), (X p0), (X (X (NOT p2))), true, (X (X (NOT (AND p2 (NOT p0))))), (X (X (NOT (AND p2 p0)))), (X (X (NOT (AND p1 (NOT p2))))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to conjunction of knowledge (Minato strategy)
Knowledge based reduction with 14 factoid took 114 ms. Reduced automaton from 5 states, 11 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-07 finished in 1066 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||X(X(p1)))))))'
Support contains 3 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 172 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 172 transition count 456
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 171 transition count 454
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 171 transition count 454
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 170 transition count 451
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 170 transition count 451
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 169 transition count 449
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 168 transition count 447
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 168 transition count 447
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 35 place count 167 transition count 445
Iterating global reduction 0 with 1 rules applied. Total rules applied 36 place count 167 transition count 445
Applied a total of 36 rules in 17 ms. Remains 167 /185 variables (removed 18) and now considering 445/489 (removed 44) transitions.
[2024-06-02 23:15:33] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
// Phase 1: matrix 413 rows 167 cols
[2024-06-02 23:15:33] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:15:33] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:15:33] [INFO ] Flow matrix only has 413 transitions (discarded 32 similar events)
[2024-06-02 23:15:33] [INFO ] Invariant cache hit.
[2024-06-02 23:15:33] [INFO ] State equation strengthened by 60 read => feed constraints.
[2024-06-02 23:15:33] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 364 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 166/185 places, 445/489 transitions.
Applied a total of 0 rules in 1 ms. Remains 166 /166 variables (removed 0) and now considering 445/445 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 384 ms. Remains : 166/185 places, 445/489 transitions.
Stuttering acceptance computed with spot in 205 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}], [{ cond=(NOT p0), acceptance={} source=4 dest: 3}]], initial=1, aps=[p0:(EQ s143 0), p1:(OR (EQ s3 0) (EQ s158 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, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 157 ms.
Product exploration explored 100000 steps with 33333 reset in 156 ms.
Computed a total of 25 stabilizing places and 57 stable transitions
Computed a total of 25 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 p1), (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 2 factoid took 310 ms. Reduced automaton from 5 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-10 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-10 finished in 1239 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)||X(F(p1))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 184 transition count 486
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 184 transition count 486
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 183 transition count 484
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 183 transition count 484
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 182 transition count 481
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 182 transition count 481
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 181 transition count 479
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 180 transition count 476
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 180 transition count 476
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 179 transition count 474
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 179 transition count 474
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 178 transition count 471
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 178 transition count 471
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 177 transition count 469
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 176 transition count 466
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 176 transition count 466
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 175 transition count 464
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 175 transition count 464
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 174 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 174 transition count 462
Applied a total of 22 rules in 22 ms. Remains 174 /185 variables (removed 11) and now considering 462/489 (removed 27) transitions.
[2024-06-02 23:15:34] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
// Phase 1: matrix 430 rows 174 cols
[2024-06-02 23:15:34] [INFO ] Computed 8 invariants in 5 ms
[2024-06-02 23:15:34] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-06-02 23:15:34] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:15:34] [INFO ] Invariant cache hit.
[2024-06-02 23:15:34] [INFO ] State equation strengthened by 63 read => feed constraints.
[2024-06-02 23:15:34] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 470 ms to find 0 implicit places.
[2024-06-02 23:15:34] [INFO ] Flow matrix only has 430 transitions (discarded 32 similar events)
[2024-06-02 23:15:34] [INFO ] Invariant cache hit.
[2024-06-02 23:15:35] [INFO ] Dead Transitions using invariants and state equation in 152 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 174/185 places, 462/489 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 645 ms. Remains : 174/185 places, 462/489 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p1:(OR (EQ s9 0) (EQ s74 0)), p0:(OR (EQ s4 0) (EQ s171 0) (EQ s13 0) (EQ s21 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][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 191 ms.
Product exploration explored 100000 steps with 50000 reset in 190 ms.
Computed a total of 33 stabilizing places and 74 stable transitions
Computed a total of 33 stabilizing places and 74 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X p1)), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 16 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-12 finished in 1173 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)||G((p1||F(p2))))))'
Support contains 6 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 180 transition count 482
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 180 transition count 482
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 179 transition count 480
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 179 transition count 480
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 178 transition count 477
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 178 transition count 477
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 177 transition count 475
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 176 transition count 472
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 176 transition count 472
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 175 transition count 470
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 175 transition count 470
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 174 transition count 467
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 174 transition count 467
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 173 transition count 465
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 172 transition count 462
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 172 transition count 462
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 171 transition count 460
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 171 transition count 460
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 170 transition count 458
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 170 transition count 458
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 169 transition count 456
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 169 transition count 456
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 0 with 4 rules applied. Total rules applied 34 place count 167 transition count 454
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 40 place count 164 transition count 460
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 46 place count 164 transition count 454
Applied a total of 46 rules in 42 ms. Remains 164 /185 variables (removed 21) and now considering 454/489 (removed 35) transitions.
[2024-06-02 23:15:35] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 164 cols
[2024-06-02 23:15:35] [INFO ] Computed 8 invariants in 1 ms
[2024-06-02 23:15:35] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-06-02 23:15:35] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 23:15:35] [INFO ] Invariant cache hit.
[2024-06-02 23:15:35] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:35] [INFO ] Implicit Places using invariants and state equation in 228 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 306 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 163/185 places, 454/489 transitions.
Applied a total of 0 rules in 10 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 358 ms. Remains : 163/185 places, 454/489 transitions.
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Running random walk in product with property : FireWire-PT-14-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=1 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1} source=1 dest: 1}]], initial=0, aps=[p1:(AND (EQ s3 1) (EQ s87 1)), p2:(OR (EQ s121 0) (EQ s139 0)), p0:(OR (EQ s2 0) (EQ s102 0))], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5 reset in 61 ms.
Product exploration explored 100000 steps with 4 reset in 66 ms.
Computed a total of 25 stabilizing places and 66 stable transitions
Computed a total of 25 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 106 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Incomplete random walk after 10000 steps, including 348 resets, run finished after 177 ms. (steps per millisecond=56 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) 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 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 76 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 59 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 525500 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 525500 steps, saw 137408 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 5 properties.
[2024-06-02 23:15:39] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 23:15:39] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:15:39] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-06-02 23:15:39] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:39] [INFO ] After 166ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :4
[2024-06-02 23:15:39] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:40] [INFO ] After 106ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :1 sat :4
[2024-06-02 23:15:40] [INFO ] Deduced a trap composed of 51 places in 43 ms of which 0 ms to minimize.
[2024-06-02 23:15:40] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 73 ms
[2024-06-02 23:15:40] [INFO ] After 296ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :4
Attempting to minimize the solution found.
Minimization took 88 ms.
[2024-06-02 23:15:40] [INFO ] After 608ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :4
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 454/454 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 454
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 160 transition count 448
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 160 transition count 442
Applied a total of 24 rules in 16 ms. Remains 160 /163 variables (removed 3) and now considering 442/454 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 160/163 places, 442/454 transitions.
Incomplete random walk after 10000 steps, including 308 resets, run finished after 152 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 64 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 66 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 76 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 485472 steps, run timeout after 3001 ms. (steps per millisecond=161 ) properties seen :{}
Probabilistic random walk after 485472 steps, saw 143525 distinct states, run finished after 3004 ms. (steps per millisecond=161 ) properties seen :0
Running SMT prover for 4 properties.
[2024-06-02 23:15:43] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 23:15:43] [INFO ] Computed 7 invariants in 1 ms
[2024-06-02 23:15:43] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:15:43] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:15:43] [INFO ] After 152ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:43] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:44] [INFO ] After 118ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:44] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 86 ms.
[2024-06-02 23:15:44] [INFO ] After 520ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 9 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 23:15:44] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:44] [INFO ] Invariant cache hit.
[2024-06-02 23:15:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:15:44] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:44] [INFO ] Invariant cache hit.
[2024-06-02 23:15:44] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:44] [INFO ] Implicit Places using invariants and state equation in 253 ms returned []
Implicit Place search using SMT with State Equation took 336 ms to find 0 implicit places.
[2024-06-02 23:15:44] [INFO ] Redundant transitions in 13 ms returned []
[2024-06-02 23:15:44] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:44] [INFO ] Invariant cache hit.
[2024-06-02 23:15:44] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 499 ms. Remains : 160/160 places, 442/442 transitions.
Graph (trivial) has 137 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 1 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 297
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 287
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 20 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 4 properties.
[2024-06-02 23:15:44] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 23:15:44] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:15:44] [INFO ] After 36ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-06-02 23:15:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:44] [INFO ] After 107ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-06-02 23:15:45] [INFO ] Deduced a trap composed of 21 places in 22 ms of which 1 ms to minimize.
[2024-06-02 23:15:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 23:15:45] [INFO ] After 233ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-06-02 23:15:45] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p2 p0), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (G (NOT (AND (NOT p0) p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 128 ms. Reduced automaton from 2 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 97 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Support contains 4 out of 163 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 454/454 transitions.
Applied a total of 0 rules in 9 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-06-02 23:15:45] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 23:15:45] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:15:45] [INFO ] Implicit Places using invariants in 79 ms returned []
[2024-06-02 23:15:45] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 23:15:45] [INFO ] Invariant cache hit.
[2024-06-02 23:15:45] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:45] [INFO ] Implicit Places using invariants and state equation in 212 ms returned []
Implicit Place search using SMT with State Equation took 293 ms to find 0 implicit places.
[2024-06-02 23:15:45] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:15:45] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 23:15:45] [INFO ] Invariant cache hit.
[2024-06-02 23:15:45] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 447 ms. Remains : 163/163 places, 454/454 transitions.
Computed a total of 25 stabilizing places and 66 stable transitions
Computed a total of 25 stabilizing places and 66 stable transitions
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 80 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 314 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 63 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 834198 steps, run timeout after 3001 ms. (steps per millisecond=277 ) properties seen :{}
Probabilistic random walk after 834198 steps, saw 209350 distinct states, run finished after 3002 ms. (steps per millisecond=277 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-02 23:15:49] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 23:15:49] [INFO ] Invariant cache hit.
[2024-06-02 23:15:49] [INFO ] After 32ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:15:49] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:49] [INFO ] After 87ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:15:49] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:49] [INFO ] After 50ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:15:49] [INFO ] After 104ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-06-02 23:15:49] [INFO ] After 262ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 163/163 places, 454/454 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 6 place count 163 transition count 448
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 163 transition count 454
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 18 place count 160 transition count 448
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 24 place count 160 transition count 442
Applied a total of 24 rules in 18 ms. Remains 160 /163 variables (removed 3) and now considering 442/454 (removed 12) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 160/163 places, 442/454 transitions.
Incomplete random walk after 10000 steps, including 319 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 60 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 579250 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 579250 steps, saw 171394 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 2 properties.
[2024-06-02 23:15:52] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
// Phase 1: matrix 405 rows 160 cols
[2024-06-02 23:15:52] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:15:52] [INFO ] After 33ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:15:52] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-06-02 23:15:52] [INFO ] After 103ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:15:52] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:52] [INFO ] After 44ms SMT Verify possible using 61 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-06-02 23:15:52] [INFO ] After 95ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 30 ms.
[2024-06-02 23:15:52] [INFO ] After 271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 160 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 8 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 160/160 places, 442/442 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 160/160 places, 442/442 transitions.
Applied a total of 0 rules in 4 ms. Remains 160 /160 variables (removed 0) and now considering 442/442 (removed 0) transitions.
[2024-06-02 23:15:53] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:53] [INFO ] Invariant cache hit.
[2024-06-02 23:15:53] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-06-02 23:15:53] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:53] [INFO ] Invariant cache hit.
[2024-06-02 23:15:53] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:15:53] [INFO ] Implicit Places using invariants and state equation in 224 ms returned []
Implicit Place search using SMT with State Equation took 299 ms to find 0 implicit places.
[2024-06-02 23:15:53] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:15:53] [INFO ] Flow matrix only has 405 transitions (discarded 37 similar events)
[2024-06-02 23:15:53] [INFO ] Invariant cache hit.
[2024-06-02 23:15:53] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 455 ms. Remains : 160/160 places, 442/442 transitions.
Graph (trivial) has 137 edges and 160 vertex of which 29 / 160 are part of one of the 4 SCC in 0 ms
Free SCC test removed 25 places
Drop transitions removed 123 transitions
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 144 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 134 transition count 297
Drop transitions removed 9 transitions
Redundant transition composition rules discarded 9 transitions
Iterating global reduction 0 with 9 rules applied. Total rules applied 12 place count 134 transition count 288
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 133 transition count 287
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 15 place count 133 transition count 286
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 17 place count 132 transition count 285
Free-agglomeration rule applied 9 times with reduction of 6 identical transitions.
Iterating global reduction 0 with 9 rules applied. Total rules applied 26 place count 132 transition count 270
Reduce places removed 9 places and 0 transitions.
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 12 rules applied. Total rules applied 38 place count 123 transition count 267
Partial Free-agglomeration rule applied 5 times.
Drop transitions removed 5 transitions
Iterating global reduction 1 with 5 rules applied. Total rules applied 43 place count 123 transition count 267
Applied a total of 43 rules in 18 ms. Remains 123 /160 variables (removed 37) and now considering 267/442 (removed 175) transitions.
Running SMT prover for 2 properties.
[2024-06-02 23:15:53] [INFO ] Flow matrix only has 265 transitions (discarded 2 similar events)
// Phase 1: matrix 265 rows 123 cols
[2024-06-02 23:15:53] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:15:53] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-06-02 23:15:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-06-02 23:15:53] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-06-02 23:15:53] [INFO ] Deduced a trap composed of 21 places in 26 ms of which 0 ms to minimize.
[2024-06-02 23:15:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-06-02 23:15:53] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-06-02 23:15:53] [INFO ] After 184ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2), (X (NOT (AND p0 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (X (NOT (AND p0 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 92 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Product exploration explored 100000 steps with 2 reset in 48 ms.
Product exploration explored 100000 steps with 4 reset in 60 ms.
Built C files in :
/tmp/ltsmin11812135298248905441
[2024-06-02 23:15:54] [INFO ] Computing symmetric may disable matrix : 454 transitions.
[2024-06-02 23:15:54] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:15:54] [INFO ] Computing symmetric may enable matrix : 454 transitions.
[2024-06-02 23:15:54] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:15:54] [INFO ] Computing Do-Not-Accords matrix : 454 transitions.
[2024-06-02 23:15:54] [INFO ] Computation of Completed DNA matrix. took 14 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:15:54] [INFO ] Built C files in 81ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11812135298248905441
Running compilation step : cd /tmp/ltsmin11812135298248905441;'/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 982 ms.
Running link step : cd /tmp/ltsmin11812135298248905441;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11812135298248905441;'/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/stateBased16738674618590576337.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 163 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 163/163 places, 454/454 transitions.
Applied a total of 0 rules in 13 ms. Remains 163 /163 variables (removed 0) and now considering 454/454 (removed 0) transitions.
[2024-06-02 23:16:09] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
// Phase 1: matrix 415 rows 163 cols
[2024-06-02 23:16:09] [INFO ] Computed 7 invariants in 3 ms
[2024-06-02 23:16:09] [INFO ] Implicit Places using invariants in 83 ms returned []
[2024-06-02 23:16:09] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 23:16:09] [INFO ] Invariant cache hit.
[2024-06-02 23:16:09] [INFO ] State equation strengthened by 61 read => feed constraints.
[2024-06-02 23:16:09] [INFO ] Implicit Places using invariants and state equation in 245 ms returned []
Implicit Place search using SMT with State Equation took 328 ms to find 0 implicit places.
[2024-06-02 23:16:09] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:16:09] [INFO ] Flow matrix only has 415 transitions (discarded 39 similar events)
[2024-06-02 23:16:09] [INFO ] Invariant cache hit.
[2024-06-02 23:16:09] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 510 ms. Remains : 163/163 places, 454/454 transitions.
Built C files in :
/tmp/ltsmin3052700417286062740
[2024-06-02 23:16:09] [INFO ] Computing symmetric may disable matrix : 454 transitions.
[2024-06-02 23:16:09] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:16:09] [INFO ] Computing symmetric may enable matrix : 454 transitions.
[2024-06-02 23:16:09] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:16:09] [INFO ] Computing Do-Not-Accords matrix : 454 transitions.
[2024-06-02 23:16:09] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:16:09] [INFO ] Built C files in 63ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3052700417286062740
Running compilation step : cd /tmp/ltsmin3052700417286062740;'/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 898 ms.
Running link step : cd /tmp/ltsmin3052700417286062740;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3052700417286062740;'/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/stateBased498162922044157698.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:16:24] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:16:25] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:16:25] [INFO ] Time to serialize gal into /tmp/LTL10852140632365932104.gal : 4 ms
[2024-06-02 23:16:25] [INFO ] Time to serialize properties into /tmp/LTL590741490277392217.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10852140632365932104.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2849436409645937731.hoa' '-atoms' '/tmp/LTL590741490277392217.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/LTL590741490277392217.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2849436409645937731.hoa
Detected timeout of ITS tools.
[2024-06-02 23:16:40] [INFO ] Flatten gal took : 35 ms
[2024-06-02 23:16:40] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:16:40] [INFO ] Time to serialize gal into /tmp/LTL11915217683357614329.gal : 2 ms
[2024-06-02 23:16:40] [INFO ] Time to serialize properties into /tmp/LTL1239189684973771904.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/LTL11915217683357614329.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1239189684973771904.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...276
Read 1 LTL properties
Checking formula 0 : !((F((G("((p3==0)||(p127==0))"))||(G(("((p4==1)&&(p109==1))")||(F("((p146==0)||(p166==0))")))))))
Formula 0 simplified : G(F!"((p3==0)||(p127==0))" & F(!"((p4==1)&&(p109==1))" & G!"((p146==0)||(p166==0))"))
Detected timeout of ITS tools.
[2024-06-02 23:16:55] [INFO ] Flatten gal took : 21 ms
[2024-06-02 23:16:55] [INFO ] Applying decomposition
[2024-06-02 23:16:55] [INFO ] Flatten gal took : 23 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/graph8729415736380613065.txt' '-o' '/tmp/graph8729415736380613065.bin' '-w' '/tmp/graph8729415736380613065.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8729415736380613065.bin' '-l' '-1' '-v' '-w' '/tmp/graph8729415736380613065.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:16:55] [INFO ] Decomposing Gal with order
[2024-06-02 23:16:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:16:55] [INFO ] Removed a total of 697 redundant transitions.
[2024-06-02 23:16:55] [INFO ] Flatten gal took : 69 ms
[2024-06-02 23:16:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 113 labels/synchronizations in 15 ms.
[2024-06-02 23:16:55] [INFO ] Time to serialize gal into /tmp/LTL1852071605092658075.gal : 9 ms
[2024-06-02 23:16:55] [INFO ] Time to serialize properties into /tmp/LTL15394968409051117652.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1852071605092658075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15394968409051117652.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...255
Read 1 LTL properties
Checking formula 0 : !((F((G("((i0.u0.p3==0)||(i0.u22.p127==0))"))||(G(("((i6.u1.p4==1)&&(i5.u31.p109==1))")||(F("((i7.u41.p146==0)||(i2.u49.p166==0))"))))...158
Formula 0 simplified : G(F!"((i0.u0.p3==0)||(i0.u22.p127==0))" & F(!"((i6.u1.p4==1)&&(i5.u31.p109==1))" & G!"((i7.u41.p146==0)||(i2.u49.p166==0))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4073942195382604899
[2024-06-02 23:17:10] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4073942195382604899
Running compilation step : cd /tmp/ltsmin4073942195382604899;'/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 617 ms.
Running link step : cd /tmp/ltsmin4073942195382604899;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4073942195382604899;'/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' '<>(([]((LTLAPp0==true))||[](((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-14-LTLFireability-13 finished in 110079 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(p0)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 183 transition count 483
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 183 transition count 483
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 181 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 181 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 179 transition count 473
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 179 transition count 473
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 177 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 177 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 175 transition count 463
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 175 transition count 463
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 173 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 173 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 171 transition count 453
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 171 transition count 453
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 169 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 169 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 167 transition count 443
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 167 transition count 443
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 38 place count 165 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 40 place count 165 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 42 place count 163 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 44 place count 163 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 46 place count 161 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 48 place count 161 transition count 431
Applied a total of 48 rules in 13 ms. Remains 161 /185 variables (removed 24) and now considering 431/489 (removed 58) transitions.
[2024-06-02 23:17:25] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
// Phase 1: matrix 399 rows 161 cols
[2024-06-02 23:17:25] [INFO ] Computed 8 invariants in 2 ms
[2024-06-02 23:17:25] [INFO ] Implicit Places using invariants in 85 ms returned []
[2024-06-02 23:17:25] [INFO ] Flow matrix only has 399 transitions (discarded 32 similar events)
[2024-06-02 23:17:25] [INFO ] Invariant cache hit.
[2024-06-02 23:17:25] [INFO ] State equation strengthened by 58 read => feed constraints.
[2024-06-02 23:17:26] [INFO ] Implicit Places using invariants and state equation in 247 ms returned [21]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 334 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 160/185 places, 431/489 transitions.
Applied a total of 0 rules in 2 ms. Remains 160 /160 variables (removed 0) and now considering 431/431 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 349 ms. Remains : 160/185 places, 431/489 transitions.
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (NEQ s7 1) (NEQ s148 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 1 reset in 148 ms.
Product exploration explored 100000 steps with 1 reset in 193 ms.
Computed a total of 19 stabilizing places and 43 stable transitions
Computed a total of 19 stabilizing places and 43 stable transitions
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 4 factoid took 88 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[true, (NOT p0)]
Finished random walk after 801 steps, including 27 resets, run visited all 1 properties in 5 ms. (steps per millisecond=160 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), true, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Property proved to be false thanks to negative knowledge :(F (NOT p0))
Knowledge based reduction with 4 factoid took 97 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA FireWire-PT-14-LTLFireability-14 FALSE TECHNIQUES KNOWLEDGE
Treatment of property FireWire-PT-14-LTLFireability-14 finished in 1113 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)))'
Support contains 2 out of 185 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 185/185 places, 489/489 transitions.
Reduce places removed 1 places and 1 transitions.
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 3 Pre rules applied. Total rules applied 0 place count 184 transition count 485
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 181 transition count 485
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 179 transition count 479
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 179 transition count 479
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 12 place count 177 transition count 475
Iterating global reduction 0 with 2 rules applied. Total rules applied 14 place count 177 transition count 475
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 16 place count 175 transition count 469
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 175 transition count 469
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 20 place count 173 transition count 465
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 173 transition count 465
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 24 place count 171 transition count 459
Iterating global reduction 0 with 2 rules applied. Total rules applied 26 place count 171 transition count 459
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 28 place count 169 transition count 455
Iterating global reduction 0 with 2 rules applied. Total rules applied 30 place count 169 transition count 455
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 32 place count 167 transition count 449
Iterating global reduction 0 with 2 rules applied. Total rules applied 34 place count 167 transition count 449
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 36 place count 165 transition count 445
Iterating global reduction 0 with 2 rules applied. Total rules applied 38 place count 165 transition count 445
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 40 place count 163 transition count 439
Iterating global reduction 0 with 2 rules applied. Total rules applied 42 place count 163 transition count 439
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 44 place count 161 transition count 435
Iterating global reduction 0 with 2 rules applied. Total rules applied 46 place count 161 transition count 435
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 48 place count 159 transition count 431
Iterating global reduction 0 with 2 rules applied. Total rules applied 50 place count 159 transition count 431
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 52 place count 157 transition count 427
Iterating global reduction 0 with 2 rules applied. Total rules applied 54 place count 157 transition count 427
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 60 place count 154 transition count 424
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 0 with 6 rules applied. Total rules applied 66 place count 151 transition count 430
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 72 place count 151 transition count 424
Applied a total of 72 rules in 41 ms. Remains 151 /185 variables (removed 34) and now considering 424/489 (removed 65) transitions.
[2024-06-02 23:17:26] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 151 cols
[2024-06-02 23:17:26] [INFO ] Computed 8 invariants in 3 ms
[2024-06-02 23:17:26] [INFO ] Implicit Places using invariants in 80 ms returned []
[2024-06-02 23:17:26] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:17:26] [INFO ] Invariant cache hit.
[2024-06-02 23:17:26] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:17:27] [INFO ] Implicit Places using invariants and state equation in 248 ms returned [18]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 330 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 150/185 places, 424/489 transitions.
Applied a total of 0 rules in 5 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 377 ms. Remains : 150/185 places, 424/489 transitions.
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FireWire-PT-14-LTLFireability-15 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}]], initial=0, aps=[p0:(OR (NEQ s9 1) (NEQ s143 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 53 ms.
Product exploration explored 100000 steps with 3 reset in 51 ms.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(NOT p0), (NOT p0)]
Finished random walk after 1930 steps, including 63 resets, run visited all 1 properties in 11 ms. (steps per millisecond=175 )
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 91 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 77 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 424/424 transitions.
Applied a total of 0 rules in 4 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 23:17:27] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
// Phase 1: matrix 385 rows 150 cols
[2024-06-02 23:17:27] [INFO ] Computed 7 invariants in 2 ms
[2024-06-02 23:17:27] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-06-02 23:17:27] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:17:27] [INFO ] Invariant cache hit.
[2024-06-02 23:17:27] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:17:28] [INFO ] Implicit Places using invariants and state equation in 227 ms returned []
Implicit Place search using SMT with State Equation took 297 ms to find 0 implicit places.
[2024-06-02 23:17:28] [INFO ] Redundant transitions in 3 ms returned []
[2024-06-02 23:17:28] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:17:28] [INFO ] Invariant cache hit.
[2024-06-02 23:17:28] [INFO ] Dead Transitions using invariants and state equation in 133 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 447 ms. Remains : 150/150 places, 424/424 transitions.
Computed a total of 12 stabilizing places and 36 stable transitions
Computed a total of 12 stabilizing places and 36 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 73 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3221 steps, including 99 resets, run visited all 1 properties in 12 ms. (steps per millisecond=268 )
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 101 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 3 reset in 42 ms.
Product exploration explored 100000 steps with 5 reset in 47 ms.
Built C files in :
/tmp/ltsmin7745586194315796906
[2024-06-02 23:17:28] [INFO ] Computing symmetric may disable matrix : 424 transitions.
[2024-06-02 23:17:28] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:17:28] [INFO ] Computing symmetric may enable matrix : 424 transitions.
[2024-06-02 23:17:28] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:17:28] [INFO ] Computing Do-Not-Accords matrix : 424 transitions.
[2024-06-02 23:17:28] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:17:28] [INFO ] Built C files in 43ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7745586194315796906
Running compilation step : cd /tmp/ltsmin7745586194315796906;'/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 828 ms.
Running link step : cd /tmp/ltsmin7745586194315796906;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin7745586194315796906;'/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/stateBased8892472428873544423.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 150 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 150/150 places, 424/424 transitions.
Applied a total of 0 rules in 11 ms. Remains 150 /150 variables (removed 0) and now considering 424/424 (removed 0) transitions.
[2024-06-02 23:17:43] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:17:43] [INFO ] Invariant cache hit.
[2024-06-02 23:17:44] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-06-02 23:17:44] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:17:44] [INFO ] Invariant cache hit.
[2024-06-02 23:17:44] [INFO ] State equation strengthened by 56 read => feed constraints.
[2024-06-02 23:17:44] [INFO ] Implicit Places using invariants and state equation in 211 ms returned []
Implicit Place search using SMT with State Equation took 294 ms to find 0 implicit places.
[2024-06-02 23:17:44] [INFO ] Redundant transitions in 4 ms returned []
[2024-06-02 23:17:44] [INFO ] Flow matrix only has 385 transitions (discarded 39 similar events)
[2024-06-02 23:17:44] [INFO ] Invariant cache hit.
[2024-06-02 23:17:44] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 447 ms. Remains : 150/150 places, 424/424 transitions.
Built C files in :
/tmp/ltsmin756700869357394965
[2024-06-02 23:17:44] [INFO ] Computing symmetric may disable matrix : 424 transitions.
[2024-06-02 23:17:44] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:17:44] [INFO ] Computing symmetric may enable matrix : 424 transitions.
[2024-06-02 23:17:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:17:44] [INFO ] Computing Do-Not-Accords matrix : 424 transitions.
[2024-06-02 23:17:44] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:17:44] [INFO ] Built C files in 49ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin756700869357394965
Running compilation step : cd /tmp/ltsmin756700869357394965;'/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 834 ms.
Running link step : cd /tmp/ltsmin756700869357394965;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin756700869357394965;'/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/stateBased17607314528732183808.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-06-02 23:17:59] [INFO ] Flatten gal took : 26 ms
[2024-06-02 23:17:59] [INFO ] Flatten gal took : 31 ms
[2024-06-02 23:17:59] [INFO ] Time to serialize gal into /tmp/LTL949748340643464622.gal : 4 ms
[2024-06-02 23:17:59] [INFO ] Time to serialize properties into /tmp/LTL14965024849526177686.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL949748340643464622.gal' '-t' 'CGAL' '-hoa' '/tmp/aut788945177106327152.hoa' '-atoms' '/tmp/LTL14965024849526177686.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...316
Loading property file /tmp/LTL14965024849526177686.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut788945177106327152.hoa
Detected timeout of ITS tools.
[2024-06-02 23:18:14] [INFO ] Flatten gal took : 22 ms
[2024-06-02 23:18:14] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:18:14] [INFO ] Time to serialize gal into /tmp/LTL17655092433196695438.gal : 3 ms
[2024-06-02 23:18:14] [INFO ] Time to serialize properties into /tmp/LTL5727383917713386437.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17655092433196695438.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5727383917713386437.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((p10!=1)||(p184!=1))"))))
Formula 0 simplified : FG!"((p10!=1)||(p184!=1))"
Detected timeout of ITS tools.
[2024-06-02 23:18:29] [INFO ] Flatten gal took : 15 ms
[2024-06-02 23:18:29] [INFO ] Applying decomposition
[2024-06-02 23:18:29] [INFO ] Flatten gal took : 13 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/graph10856336458773795543.txt' '-o' '/tmp/graph10856336458773795543.bin' '-w' '/tmp/graph10856336458773795543.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10856336458773795543.bin' '-l' '-1' '-v' '-w' '/tmp/graph10856336458773795543.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:18:29] [INFO ] Decomposing Gal with order
[2024-06-02 23:18:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:18:29] [INFO ] Removed a total of 641 redundant transitions.
[2024-06-02 23:18:29] [INFO ] Flatten gal took : 28 ms
[2024-06-02 23:18:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 122 labels/synchronizations in 7 ms.
[2024-06-02 23:18:29] [INFO ] Time to serialize gal into /tmp/LTL1086356654835584567.gal : 3 ms
[2024-06-02 23:18:29] [INFO ] Time to serialize properties into /tmp/LTL9583005788017653927.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/LTL1086356654835584567.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9583005788017653927.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 : !((G(F("((i1.u3.p10!=1)||(i7.u49.p184!=1))"))))
Formula 0 simplified : FG!"((i1.u3.p10!=1)||(i7.u49.p184!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12617825453696171226
[2024-06-02 23:18:44] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12617825453696171226
Running compilation step : cd /tmp/ltsmin12617825453696171226;'/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 593 ms.
Running link step : cd /tmp/ltsmin12617825453696171226;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin12617825453696171226;'/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' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FireWire-PT-14-LTLFireability-15 finished in 93329 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)||G((p1||F(p2))))))'
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)))'
[2024-06-02 23:19:00] [INFO ] Flatten gal took : 26 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15929467219513461146
[2024-06-02 23:19:00] [INFO ] Computing symmetric may disable matrix : 489 transitions.
[2024-06-02 23:19:00] [INFO ] Applying decomposition
[2024-06-02 23:19:00] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:00] [INFO ] Computing symmetric may enable matrix : 489 transitions.
[2024-06-02 23:19:00] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:00] [INFO ] Flatten gal took : 16 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/graph188330178952235405.txt' '-o' '/tmp/graph188330178952235405.bin' '-w' '/tmp/graph188330178952235405.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph188330178952235405.bin' '-l' '-1' '-v' '-w' '/tmp/graph188330178952235405.weights' '-q' '0' '-e' '0.001'
[2024-06-02 23:19:00] [INFO ] Computing Do-Not-Accords matrix : 489 transitions.
[2024-06-02 23:19:00] [INFO ] Decomposing Gal with order
[2024-06-02 23:19:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:19:00] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-06-02 23:19:00] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15929467219513461146
Running compilation step : cd /tmp/ltsmin15929467219513461146;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '360' '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'
[2024-06-02 23:19:00] [INFO ] Removed a total of 782 redundant transitions.
[2024-06-02 23:19:00] [INFO ] Flatten gal took : 25 ms
[2024-06-02 23:19:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 146 labels/synchronizations in 11 ms.
[2024-06-02 23:19:00] [INFO ] Time to serialize gal into /tmp/LTLFireability6903707260923816907.gal : 4 ms
[2024-06-02 23:19:00] [INFO ] Time to serialize properties into /tmp/LTLFireability3915775866330276034.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability6903707260923816907.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3915775866330276034.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...276
Read 2 LTL properties
Checking formula 0 : !((F((G("((i0.u0.p3==0)||(i0.u27.p127==0))"))||(G(("((i1.u1.p4==1)&&(i4.u36.p109==1))")||(F("((i6.u48.p146==0)||(i7.i1.u54.p166==0))")...161
Formula 0 simplified : G(F!"((i0.u0.p3==0)||(i0.u27.p127==0))" & F(!"((i1.u1.p4==1)&&(i4.u36.p109==1))" & G!"((i6.u48.p146==0)||(i7.i1.u54.p166==0))"))
Compilation finished in 1056 ms.
Running link step : cd /tmp/ltsmin15929467219513461146;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15929467219513461146;'/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' '--ltl' '<>(([]((LTLAPp0==true))||[](((LTLAPp1==true)||<>((LTLAPp2==true))))))' '--buchi-type=spotba'
LTSmin run took 279680 ms.
FORMULA FireWire-PT-14-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Running LTSmin : cd /tmp/ltsmin15929467219513461146;'/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' '--ltl' '[](<>((LTLAPp3==true)))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-06-02 23:40:17] [INFO ] Applying decomposition
[2024-06-02 23:40:17] [INFO ] Flatten gal took : 30 ms
[2024-06-02 23:40:17] [INFO ] Decomposing Gal with order
[2024-06-02 23:40:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-06-02 23:40:18] [INFO ] Removed a total of 635 redundant transitions.
[2024-06-02 23:40:18] [INFO ] Flatten gal took : 109 ms
[2024-06-02 23:40:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 189 labels/synchronizations in 4 ms.
[2024-06-02 23:40:18] [INFO ] Time to serialize gal into /tmp/LTLFireability3656647061830727773.gal : 2 ms
[2024-06-02 23:40:18] [INFO ] Time to serialize properties into /tmp/LTLFireability3312624388416259925.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/LTLFireability3656647061830727773.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3312624388416259925.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...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((u1.p10!=1)||(u13.p184!=1))"))))
Formula 0 simplified : FG!"((u1.p10!=1)||(u13.p184!=1))"
Reverse transition relation is NOT exact ! Due to transitions t51, t75, t86, t97, t98, t191, t209, t210, t261, t272, t401, t407, t408, t432, t434, t438, t4...597
Computing Next relation with stutter on 3.25939e+06 deadlock states
3 unique states visited
0 strongly connected components in search stack
4 transitions explored
3 items max in DFS search stack
1873 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,18.7537,340332,1,0,248242,347246,1137,608361,1734,2.79369e+06,620154
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA FireWire-PT-14-LTLFireability-15 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Total runtime 1559890 ms.

BK_STOP 1717371667220

--------------------
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-14"
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-14, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r571-tall-171734910400173"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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

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