Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2023-input.r101-tall-167814475400500.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is DES-PT-60b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r101-tall-167814475400500
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 576K
-rw-r--r-- 1 mcc users 8.6K Feb 26 15:44 CTLCardinality.txt
-rw-r--r-- 1 mcc users 102K Feb 26 15:44 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.4K Feb 26 15:43 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 26 15:43 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 16K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 8.3K Feb 26 15:45 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 85K Feb 26 15:45 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 7.3K Feb 26 15:44 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:44 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 139K Mar 5 18:22 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 DES-PT-60b-LTLFireability-00
FORMULA_NAME DES-PT-60b-LTLFireability-01
FORMULA_NAME DES-PT-60b-LTLFireability-02
FORMULA_NAME DES-PT-60b-LTLFireability-03
FORMULA_NAME DES-PT-60b-LTLFireability-04
FORMULA_NAME DES-PT-60b-LTLFireability-05
FORMULA_NAME DES-PT-60b-LTLFireability-06
FORMULA_NAME DES-PT-60b-LTLFireability-07
FORMULA_NAME DES-PT-60b-LTLFireability-08
FORMULA_NAME DES-PT-60b-LTLFireability-09
FORMULA_NAME DES-PT-60b-LTLFireability-10
FORMULA_NAME DES-PT-60b-LTLFireability-11
FORMULA_NAME DES-PT-60b-LTLFireability-12
FORMULA_NAME DES-PT-60b-LTLFireability-13
FORMULA_NAME DES-PT-60b-LTLFireability-14
FORMULA_NAME DES-PT-60b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678281596740

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=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-60b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 13:19:58] [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]
[2023-03-08 13:19:58] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 13:19:58] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2023-03-08 13:19:58] [INFO ] Transformed 519 places.
[2023-03-08 13:19:58] [INFO ] Transformed 470 transitions.
[2023-03-08 13:19:58] [INFO ] Found NUPN structural information;
[2023-03-08 13:19:58] [INFO ] Parsed PT model containing 519 places and 470 transitions and 1623 arcs in 137 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-60b-LTLFireability-04 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 43 out of 519 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 519/519 places, 470/470 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 516 transition count 470
Discarding 24 places :
Symmetric choice reduction at 1 with 24 rule applications. Total rules 27 place count 492 transition count 446
Iterating global reduction 1 with 24 rules applied. Total rules applied 51 place count 492 transition count 446
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 66 place count 477 transition count 431
Iterating global reduction 1 with 15 rules applied. Total rules applied 81 place count 477 transition count 431
Ensure Unique test removed 11 transitions
Reduce isomorphic transitions removed 11 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 92 place count 477 transition count 420
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 93 place count 476 transition count 419
Iterating global reduction 2 with 1 rules applied. Total rules applied 94 place count 476 transition count 419
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 476 transition count 418
Applied a total of 95 rules in 142 ms. Remains 476 /519 variables (removed 43) and now considering 418/470 (removed 52) transitions.
// Phase 1: matrix 418 rows 476 cols
[2023-03-08 13:19:58] [INFO ] Computed 62 place invariants in 46 ms
[2023-03-08 13:19:59] [INFO ] Implicit Places using invariants in 574 ms returned []
[2023-03-08 13:19:59] [INFO ] Invariant cache hit.
[2023-03-08 13:19:59] [INFO ] Implicit Places using invariants and state equation in 590 ms returned []
Implicit Place search using SMT with State Equation took 1190 ms to find 0 implicit places.
[2023-03-08 13:19:59] [INFO ] Invariant cache hit.
[2023-03-08 13:20:00] [INFO ] Dead Transitions using invariants and state equation in 234 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 476/519 places, 418/470 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1568 ms. Remains : 476/519 places, 418/470 transitions.
Support contains 43 out of 476 places after structural reductions.
[2023-03-08 13:20:00] [INFO ] Flatten gal took : 64 ms
[2023-03-08 13:20:00] [INFO ] Flatten gal took : 28 ms
[2023-03-08 13:20:00] [INFO ] Input system was already deterministic with 418 transitions.
Incomplete random walk after 10000 steps, including 86 resets, run finished after 635 ms. (steps per millisecond=15 ) properties (out of 30) seen :17
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 13) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 13) seen :1
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 12) seen :0
Running SMT prover for 12 properties.
[2023-03-08 13:20:01] [INFO ] Invariant cache hit.
[2023-03-08 13:20:01] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 13:20:01] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 40 ms returned sat
[2023-03-08 13:20:02] [INFO ] After 351ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 13:20:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 9 ms returned sat
[2023-03-08 13:20:02] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 47 ms returned sat
[2023-03-08 13:20:03] [INFO ] After 861ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 13:20:03] [INFO ] Deduced a trap composed of 9 places in 125 ms of which 4 ms to minimize.
[2023-03-08 13:20:03] [INFO ] Deduced a trap composed of 33 places in 127 ms of which 1 ms to minimize.
[2023-03-08 13:20:03] [INFO ] Deduced a trap composed of 14 places in 40 ms of which 1 ms to minimize.
[2023-03-08 13:20:03] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 388 ms
[2023-03-08 13:20:04] [INFO ] Deduced a trap composed of 16 places in 114 ms of which 0 ms to minimize.
[2023-03-08 13:20:04] [INFO ] Deduced a trap composed of 18 places in 110 ms of which 1 ms to minimize.
[2023-03-08 13:20:04] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 328 ms
[2023-03-08 13:20:04] [INFO ] Deduced a trap composed of 18 places in 97 ms of which 1 ms to minimize.
[2023-03-08 13:20:04] [INFO ] Deduced a trap composed of 32 places in 73 ms of which 1 ms to minimize.
[2023-03-08 13:20:04] [INFO ] Deduced a trap composed of 24 places in 52 ms of which 0 ms to minimize.
[2023-03-08 13:20:04] [INFO ] Deduced a trap composed of 34 places in 53 ms of which 0 ms to minimize.
[2023-03-08 13:20:04] [INFO ] Deduced a trap composed of 35 places in 55 ms of which 1 ms to minimize.
[2023-03-08 13:20:04] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 520 ms
[2023-03-08 13:20:05] [INFO ] Deduced a trap composed of 34 places in 79 ms of which 0 ms to minimize.
[2023-03-08 13:20:05] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-08 13:20:05] [INFO ] After 3205ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 651 ms.
[2023-03-08 13:20:06] [INFO ] After 4249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 1847 ms.
Support contains 18 out of 476 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 12 transitions
Trivial Post-agglo rules discarded 12 transitions
Performed 12 trivial Post agglomeration. Transition count delta: 12
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 470 transition count 401
Reduce places removed 12 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 458 transition count 400
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 29 place count 457 transition count 400
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 29 place count 457 transition count 389
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 51 place count 446 transition count 389
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 53 place count 444 transition count 387
Iterating global reduction 3 with 2 rules applied. Total rules applied 55 place count 444 transition count 387
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 444 transition count 386
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 56 place count 444 transition count 385
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 58 place count 443 transition count 385
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 59 place count 442 transition count 384
Iterating global reduction 4 with 1 rules applied. Total rules applied 60 place count 442 transition count 384
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 61 place count 442 transition count 383
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 207 place count 369 transition count 310
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 5 with 4 rules applied. Total rules applied 211 place count 367 transition count 312
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 212 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 213 place count 366 transition count 311
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 214 place count 365 transition count 310
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 215 place count 364 transition count 310
Applied a total of 215 rules in 159 ms. Remains 364 /476 variables (removed 112) and now considering 310/418 (removed 108) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 160 ms. Remains : 364/476 places, 310/418 transitions.
Incomplete random walk after 10000 steps, including 397 resets, run finished after 218 ms. (steps per millisecond=45 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 87 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 78 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 81 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 90 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 82 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10000 steps, including 85 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 12) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 12) seen :0
Interrupted probabilistic random walk after 546410 steps, run timeout after 3001 ms. (steps per millisecond=182 ) properties seen :{}
Probabilistic random walk after 546410 steps, saw 86163 distinct states, run finished after 3003 ms. (steps per millisecond=181 ) properties seen :0
Running SMT prover for 12 properties.
// Phase 1: matrix 310 rows 364 cols
[2023-03-08 13:20:12] [INFO ] Computed 60 place invariants in 14 ms
[2023-03-08 13:20:12] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 13:20:12] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 16 ms returned sat
[2023-03-08 13:20:12] [INFO ] After 195ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 13:20:12] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 13:20:12] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 110 ms returned sat
[2023-03-08 13:20:13] [INFO ] After 1145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 13:20:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:14] [INFO ] After 624ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :12
[2023-03-08 13:20:14] [INFO ] Deduced a trap composed of 18 places in 108 ms of which 1 ms to minimize.
[2023-03-08 13:20:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 160 ms
[2023-03-08 13:20:15] [INFO ] Deduced a trap composed of 15 places in 93 ms of which 0 ms to minimize.
[2023-03-08 13:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 141 ms
[2023-03-08 13:20:15] [INFO ] Deduced a trap composed of 12 places in 84 ms of which 0 ms to minimize.
[2023-03-08 13:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2023-03-08 13:20:15] [INFO ] Deduced a trap composed of 16 places in 84 ms of which 1 ms to minimize.
[2023-03-08 13:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 120 ms
[2023-03-08 13:20:15] [INFO ] Deduced a trap composed of 9 places in 39 ms of which 0 ms to minimize.
[2023-03-08 13:20:15] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 13:20:16] [INFO ] After 2132ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 691 ms.
[2023-03-08 13:20:16] [INFO ] After 4358ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
Fused 12 Parikh solutions to 11 different solutions.
Parikh walk visited 0 properties in 690 ms.
Support contains 18 out of 364 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 17 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 17 ms. Remains : 364/364 places, 310/310 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 14 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
[2023-03-08 13:20:17] [INFO ] Invariant cache hit.
[2023-03-08 13:20:17] [INFO ] Implicit Places using invariants in 177 ms returned []
[2023-03-08 13:20:17] [INFO ] Invariant cache hit.
[2023-03-08 13:20:17] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:18] [INFO ] Implicit Places using invariants and state equation in 381 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2023-03-08 13:20:18] [INFO ] Redundant transitions in 20 ms returned []
[2023-03-08 13:20:18] [INFO ] Invariant cache hit.
[2023-03-08 13:20:18] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 770 ms. Remains : 364/364 places, 310/310 transitions.
Applied a total of 0 rules in 17 ms. Remains 364 /364 variables (removed 0) and now considering 310/310 (removed 0) transitions.
Running SMT prover for 12 properties.
[2023-03-08 13:20:18] [INFO ] Invariant cache hit.
[2023-03-08 13:20:18] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 13:20:18] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 18 ms returned sat
[2023-03-08 13:20:18] [INFO ] After 207ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:12
[2023-03-08 13:20:18] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 13:20:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 150 ms returned sat
[2023-03-08 13:20:19] [INFO ] After 530ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :12
[2023-03-08 13:20:19] [INFO ] Deduced a trap composed of 17 places in 115 ms of which 0 ms to minimize.
[2023-03-08 13:20:19] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 139 ms
[2023-03-08 13:20:20] [INFO ] After 1155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :12
Attempting to minimize the solution found.
Minimization took 354 ms.
[2023-03-08 13:20:20] [INFO ] After 1924ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :12
FORMULA DES-PT-60b-LTLFireability-08 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA DES-PT-60b-LTLFireability-02 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Computed a total of 296 stabilizing places and 288 stable transitions
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.23 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 32 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:20:20] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 13:20:21] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-08 13:20:21] [INFO ] Invariant cache hit.
[2023-03-08 13:20:21] [INFO ] Implicit Places using invariants and state equation in 615 ms returned []
Implicit Place search using SMT with State Equation took 834 ms to find 0 implicit places.
[2023-03-08 13:20:21] [INFO ] Invariant cache hit.
[2023-03-08 13:20:21] [INFO ] Dead Transitions using invariants and state equation in 217 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1085 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 280 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s53 1) (EQ s329 1)), p0:(AND (EQ s339 1) (EQ s441 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 2 ms.
FORMULA DES-PT-60b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-00 finished in 1503 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.4 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 454 transition count 388
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 211 place count 365 transition count 308
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 4 with 4 rules applied. Total rules applied 215 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 360 transition count 308
Applied a total of 218 rules in 90 ms. Remains 360 /476 variables (removed 116) and now considering 308/418 (removed 110) transitions.
// Phase 1: matrix 308 rows 360 cols
[2023-03-08 13:20:22] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 13:20:22] [INFO ] Implicit Places using invariants in 180 ms returned []
[2023-03-08 13:20:22] [INFO ] Invariant cache hit.
[2023-03-08 13:20:22] [INFO ] Implicit Places using invariants and state equation in 402 ms returned []
Implicit Place search using SMT with State Equation took 584 ms to find 0 implicit places.
[2023-03-08 13:20:22] [INFO ] Redundant transitions in 15 ms returned []
[2023-03-08 13:20:22] [INFO ] Invariant cache hit.
[2023-03-08 13:20:23] [INFO ] Dead Transitions using invariants and state equation in 158 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/476 places, 308/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 856 ms. Remains : 360/476 places, 308/418 transitions.
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s308 1) (EQ s326 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-01 finished in 906 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0) U (p1 U p2)))))'
Support contains 5 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 31 place count 454 transition count 390
Deduced a syphon composed of 9 places in 0 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 49 place count 445 transition count 390
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 50 place count 444 transition count 389
Iterating global reduction 2 with 1 rules applied. Total rules applied 51 place count 444 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 52 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 52 place count 444 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 54 place count 443 transition count 387
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 3 with 152 rules applied. Total rules applied 206 place count 367 transition count 311
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 210 place count 365 transition count 316
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 212 place count 363 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 213 place count 362 transition count 314
Applied a total of 213 rules in 73 ms. Remains 362 /476 variables (removed 114) and now considering 314/418 (removed 104) transitions.
// Phase 1: matrix 314 rows 362 cols
[2023-03-08 13:20:23] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 13:20:23] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 13:20:23] [INFO ] Invariant cache hit.
[2023-03-08 13:20:23] [INFO ] Implicit Places using invariants and state equation in 440 ms returned []
Implicit Place search using SMT with State Equation took 620 ms to find 0 implicit places.
[2023-03-08 13:20:23] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:20:23] [INFO ] Invariant cache hit.
[2023-03-08 13:20:24] [INFO ] Dead Transitions using invariants and state equation in 162 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 362/476 places, 314/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 869 ms. Remains : 362/476 places, 314/418 transitions.
Stuttering acceptance computed with spot in 171 ms :[(NOT p2), (NOT p2), (AND p0 (NOT p2)), (AND p0 (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p2), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(OR (AND p2 p0) (AND p1 p0)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p2) p1 p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s279 1) (EQ s283 1)), p1:(EQ s243 1), p0:(AND (EQ s4 1) (EQ s273 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 12 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-03 finished in 1066 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(((F(p0) U p1)||X(X((F(G(p0))&&p2))))))'
Support contains 6 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 25 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:20:24] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 13:20:24] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-08 13:20:24] [INFO ] Invariant cache hit.
[2023-03-08 13:20:25] [INFO ] Implicit Places using invariants and state equation in 620 ms returned []
Implicit Place search using SMT with State Equation took 837 ms to find 0 implicit places.
[2023-03-08 13:20:25] [INFO ] Invariant cache hit.
[2023-03-08 13:20:25] [INFO ] Dead Transitions using invariants and state equation in 212 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1075 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-60b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(NOT p1), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=3 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (EQ s37 1) (EQ s329 1)), p2:(AND (EQ s178 1) (EQ s322 1)), p0:(AND (EQ s113 1) (EQ s465 1))], nbAcceptance=1, 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 118 steps with 0 reset in 3 ms.
FORMULA DES-PT-60b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-05 finished in 1262 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 454 transition count 388
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 213 place count 364 transition count 307
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 4 with 4 rules applied. Total rules applied 217 place count 362 transition count 309
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 360 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 359 transition count 307
Applied a total of 220 rules in 69 ms. Remains 359 /476 variables (removed 117) and now considering 307/418 (removed 111) transitions.
// Phase 1: matrix 307 rows 359 cols
[2023-03-08 13:20:25] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 13:20:25] [INFO ] Implicit Places using invariants in 185 ms returned []
[2023-03-08 13:20:25] [INFO ] Invariant cache hit.
[2023-03-08 13:20:26] [INFO ] Implicit Places using invariants and state equation in 512 ms returned []
Implicit Place search using SMT with State Equation took 700 ms to find 0 implicit places.
[2023-03-08 13:20:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:20:26] [INFO ] Invariant cache hit.
[2023-03-08 13:20:26] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/476 places, 307/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 932 ms. Remains : 359/476 places, 307/418 transitions.
Stuttering acceptance computed with spot in 137 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-06 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 s167 1) (EQ s270 1) (OR (EQ s125 0) (EQ s270 0)))], 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 20 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-06 finished in 1085 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p1)&&p0))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 24 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:20:26] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 13:20:26] [INFO ] Implicit Places using invariants in 216 ms returned []
[2023-03-08 13:20:26] [INFO ] Invariant cache hit.
[2023-03-08 13:20:27] [INFO ] Implicit Places using invariants and state equation in 638 ms returned []
Implicit Place search using SMT with State Equation took 861 ms to find 0 implicit places.
[2023-03-08 13:20:27] [INFO ] Invariant cache hit.
[2023-03-08 13:20:27] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1097 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 126 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-60b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(AND (EQ s305 1) (EQ s307 1) (EQ s312 0)), p1:(EQ s462 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-07 finished in 1243 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 469 transition count 403
Reduce places removed 11 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 12 rules applied. Total rules applied 24 place count 458 transition count 402
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 457 transition count 402
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 25 place count 457 transition count 391
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 47 place count 446 transition count 391
Discarding 2 places :
Symmetric choice reduction at 3 with 2 rule applications. Total rules 49 place count 444 transition count 389
Iterating global reduction 3 with 2 rules applied. Total rules applied 51 place count 444 transition count 389
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 52 place count 444 transition count 388
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 52 place count 444 transition count 387
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 54 place count 443 transition count 387
Discarding 1 places :
Symmetric choice reduction at 4 with 1 rule applications. Total rules 55 place count 442 transition count 386
Iterating global reduction 4 with 1 rules applied. Total rules applied 56 place count 442 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 57 place count 442 transition count 385
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 209 place count 366 transition count 309
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 5 with 4 rules applied. Total rules applied 213 place count 364 transition count 311
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 215 place count 362 transition count 309
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 216 place count 361 transition count 309
Applied a total of 216 rules in 74 ms. Remains 361 /476 variables (removed 115) and now considering 309/418 (removed 109) transitions.
// Phase 1: matrix 309 rows 361 cols
[2023-03-08 13:20:27] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 13:20:28] [INFO ] Implicit Places using invariants in 169 ms returned []
[2023-03-08 13:20:28] [INFO ] Invariant cache hit.
[2023-03-08 13:20:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:28] [INFO ] Implicit Places using invariants and state equation in 507 ms returned []
Implicit Place search using SMT with State Equation took 678 ms to find 0 implicit places.
[2023-03-08 13:20:28] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:20:28] [INFO ] Invariant cache hit.
[2023-03-08 13:20:28] [INFO ] Dead Transitions using invariants and state equation in 156 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 361/476 places, 309/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 916 ms. Remains : 361/476 places, 309/418 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-09 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 (EQ s223 0) (EQ s244 0) (EQ s268 0))], 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 4833 reset in 275 ms.
Product exploration explored 100000 steps with 4813 reset in 267 ms.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 107 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 66 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 483 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 106 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1430519 steps, run timeout after 3001 ms. (steps per millisecond=476 ) properties seen :{}
Probabilistic random walk after 1430519 steps, saw 196530 distinct states, run finished after 3001 ms. (steps per millisecond=476 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 13:20:32] [INFO ] Invariant cache hit.
[2023-03-08 13:20:32] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:20:32] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 13:20:32] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 112 ms returned sat
[2023-03-08 13:20:33] [INFO ] After 439ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:33] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:33] [INFO ] After 27ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:33] [INFO ] After 57ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 13:20:33] [INFO ] After 714ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 307
Applied a total of 4 rules in 24 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 473 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1466934 steps, run timeout after 3001 ms. (steps per millisecond=488 ) properties seen :{}
Probabilistic random walk after 1466934 steps, saw 200907 distinct states, run finished after 3002 ms. (steps per millisecond=488 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 13:20:36] [INFO ] Computed 59 place invariants in 11 ms
[2023-03-08 13:20:36] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:20:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 13:20:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 140 ms returned sat
[2023-03-08 13:20:37] [INFO ] After 503ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:37] [INFO ] After 32ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:37] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 13:20:37] [INFO ] After 840ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 7 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-08 13:20:37] [INFO ] Invariant cache hit.
[2023-03-08 13:20:37] [INFO ] Implicit Places using invariants in 172 ms returned []
[2023-03-08 13:20:37] [INFO ] Invariant cache hit.
[2023-03-08 13:20:37] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:38] [INFO ] Implicit Places using invariants and state equation in 461 ms returned []
Implicit Place search using SMT with State Equation took 639 ms to find 0 implicit places.
[2023-03-08 13:20:38] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:20:38] [INFO ] Invariant cache hit.
[2023-03-08 13:20:38] [INFO ] Dead Transitions using invariants and state equation in 154 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 812 ms. Remains : 360/360 places, 307/307 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 360 transition count 307
Applied a total of 1 rules in 17 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 13:20:38] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 13:20:38] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:20:38] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:20:38] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 132 ms returned sat
[2023-03-08 13:20:38] [INFO ] After 409ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:38] [INFO ] After 461ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 13:20:38] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 117 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 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 81 ms :[(NOT p0), (NOT p0)]
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 16 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2023-03-08 13:20:39] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 13:20:39] [INFO ] Implicit Places using invariants in 183 ms returned []
[2023-03-08 13:20:39] [INFO ] Invariant cache hit.
[2023-03-08 13:20:39] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:39] [INFO ] Implicit Places using invariants and state equation in 497 ms returned []
Implicit Place search using SMT with State Equation took 682 ms to find 0 implicit places.
[2023-03-08 13:20:39] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:20:39] [INFO ] Invariant cache hit.
[2023-03-08 13:20:40] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 867 ms. Remains : 361/361 places, 309/309 transitions.
Computed a total of 255 stabilizing places and 250 stable transitions
Computed a total of 255 stabilizing places and 250 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 112 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 70 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 461 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 105 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1445488 steps, run timeout after 3001 ms. (steps per millisecond=481 ) properties seen :{}
Probabilistic random walk after 1445488 steps, saw 198473 distinct states, run finished after 3001 ms. (steps per millisecond=481 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 13:20:43] [INFO ] Invariant cache hit.
[2023-03-08 13:20:43] [INFO ] After 58ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:20:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 13:20:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 110 ms returned sat
[2023-03-08 13:20:44] [INFO ] After 440ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:44] [INFO ] After 28ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:44] [INFO ] After 63ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 13:20:44] [INFO ] After 710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 361/361 places, 309/309 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 361 transition count 308
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 361 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 360 transition count 307
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 360 transition count 307
Applied a total of 4 rules in 21 ms. Remains 360 /361 variables (removed 1) and now considering 307/309 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 360/361 places, 307/309 transitions.
Incomplete random walk after 10000 steps, including 433 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 94 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1419877 steps, run timeout after 3001 ms. (steps per millisecond=473 ) properties seen :{}
Probabilistic random walk after 1419877 steps, saw 195203 distinct states, run finished after 3001 ms. (steps per millisecond=473 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 13:20:47] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 13:20:47] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:20:47] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 13:20:47] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 135 ms returned sat
[2023-03-08 13:20:48] [INFO ] After 511ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:48] [INFO ] After 36ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:48] [INFO ] After 68ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2023-03-08 13:20:48] [INFO ] After 843ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 8 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 360/360 places, 307/307 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 360/360 places, 307/307 transitions.
Applied a total of 0 rules in 6 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
[2023-03-08 13:20:48] [INFO ] Invariant cache hit.
[2023-03-08 13:20:48] [INFO ] Implicit Places using invariants in 191 ms returned []
[2023-03-08 13:20:48] [INFO ] Invariant cache hit.
[2023-03-08 13:20:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:20:48] [INFO ] Implicit Places using invariants and state equation in 454 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-03-08 13:20:48] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:20:48] [INFO ] Invariant cache hit.
[2023-03-08 13:20:48] [INFO ] Dead Transitions using invariants and state equation in 163 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 841 ms. Remains : 360/360 places, 307/307 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 360 transition count 307
Applied a total of 1 rules in 11 ms. Remains 360 /360 variables (removed 0) and now considering 307/307 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 307 rows 360 cols
[2023-03-08 13:20:48] [INFO ] Computed 59 place invariants in 8 ms
[2023-03-08 13:20:49] [INFO ] After 55ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 13:20:49] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 13:20:49] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 137 ms returned sat
[2023-03-08 13:20:49] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 13:20:49] [INFO ] After 484ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-08 13:20:49] [INFO ] After 751ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 98 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 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 4835 reset in 219 ms.
Product exploration explored 100000 steps with 4754 reset in 228 ms.
Built C files in :
/tmp/ltsmin9365425483973129903
[2023-03-08 13:20:50] [INFO ] Computing symmetric may disable matrix : 309 transitions.
[2023-03-08 13:20:50] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:20:50] [INFO ] Computing symmetric may enable matrix : 309 transitions.
[2023-03-08 13:20:50] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:20:50] [INFO ] Computing Do-Not-Accords matrix : 309 transitions.
[2023-03-08 13:20:50] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:20:50] [INFO ] Built C files in 51ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9365425483973129903
Running compilation step : cd /tmp/ltsmin9365425483973129903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 755 ms.
Running link step : cd /tmp/ltsmin9365425483973129903;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 48 ms.
Running LTSmin : cd /tmp/ltsmin9365425483973129903;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13877133286497542345.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 361 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 361/361 places, 309/309 transitions.
Applied a total of 0 rules in 7 ms. Remains 361 /361 variables (removed 0) and now considering 309/309 (removed 0) transitions.
// Phase 1: matrix 309 rows 361 cols
[2023-03-08 13:21:05] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 13:21:05] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 13:21:05] [INFO ] Invariant cache hit.
[2023-03-08 13:21:06] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:21:06] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 693 ms to find 0 implicit places.
[2023-03-08 13:21:06] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:21:06] [INFO ] Invariant cache hit.
[2023-03-08 13:21:06] [INFO ] Dead Transitions using invariants and state equation in 145 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 853 ms. Remains : 361/361 places, 309/309 transitions.
Built C files in :
/tmp/ltsmin8061653855011313546
[2023-03-08 13:21:06] [INFO ] Computing symmetric may disable matrix : 309 transitions.
[2023-03-08 13:21:06] [INFO ] Computation of Complete disable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:21:06] [INFO ] Computing symmetric may enable matrix : 309 transitions.
[2023-03-08 13:21:06] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:21:06] [INFO ] Computing Do-Not-Accords matrix : 309 transitions.
[2023-03-08 13:21:06] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:21:06] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8061653855011313546
Running compilation step : cd /tmp/ltsmin8061653855011313546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 680 ms.
Running link step : cd /tmp/ltsmin8061653855011313546;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8061653855011313546;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13113433886785711025.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 13:21:21] [INFO ] Flatten gal took : 25 ms
[2023-03-08 13:21:21] [INFO ] Flatten gal took : 24 ms
[2023-03-08 13:21:21] [INFO ] Time to serialize gal into /tmp/LTL506808387743861765.gal : 6 ms
[2023-03-08 13:21:21] [INFO ] Time to serialize properties into /tmp/LTL4442382757091834481.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL506808387743861765.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12551315025152447466.hoa' '-atoms' '/tmp/LTL4442382757091834481.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4442382757091834481.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12551315025152447466.hoa
Detected timeout of ITS tools.
[2023-03-08 13:21:36] [INFO ] Flatten gal took : 20 ms
[2023-03-08 13:21:36] [INFO ] Flatten gal took : 18 ms
[2023-03-08 13:21:36] [INFO ] Time to serialize gal into /tmp/LTL10253682701452759950.gal : 3 ms
[2023-03-08 13:21:36] [INFO ] Time to serialize properties into /tmp/LTL396056340331958403.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10253682701452759950.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL396056340331958403.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.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("(((p232==0)||(p269==0))||(p357==0))"))))
Formula 0 simplified : FG!"(((p232==0)||(p269==0))||(p357==0))"
Detected timeout of ITS tools.
[2023-03-08 13:21:52] [INFO ] Flatten gal took : 20 ms
[2023-03-08 13:21:52] [INFO ] Applying decomposition
[2023-03-08 13:21:52] [INFO ] Flatten gal took : 18 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph1049986416624815519.txt' '-o' '/tmp/graph1049986416624815519.bin' '-w' '/tmp/graph1049986416624815519.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1049986416624815519.bin' '-l' '-1' '-v' '-w' '/tmp/graph1049986416624815519.weights' '-q' '0' '-e' '0.001'
[2023-03-08 13:21:52] [INFO ] Decomposing Gal with order
[2023-03-08 13:21:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 13:21:52] [INFO ] Removed a total of 92 redundant transitions.
[2023-03-08 13:21:52] [INFO ] Flatten gal took : 57 ms
[2023-03-08 13:21:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 61 labels/synchronizations in 6 ms.
[2023-03-08 13:21:52] [INFO ] Time to serialize gal into /tmp/LTL9275289702581236046.gal : 4 ms
[2023-03-08 13:21:52] [INFO ] Time to serialize properties into /tmp/LTL16611536175842896524.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9275289702581236046.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16611536175842896524.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F("(((u2.p232==0)||(u2.p269==0))||(i0.u7.p357==0))"))))
Formula 0 simplified : FG!"(((u2.p232==0)||(u2.p269==0))||(i0.u7.p357==0))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16077127936803882604
[2023-03-08 13:22:07] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16077127936803882604
Running compilation step : cd /tmp/ltsmin16077127936803882604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 508 ms.
Running link step : cd /tmp/ltsmin16077127936803882604;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin16077127936803882604;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/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 DES-PT-60b-LTLFireability-09 finished in 114572 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 23 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:22:22] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 13:22:22] [INFO ] Implicit Places using invariants in 242 ms returned []
[2023-03-08 13:22:22] [INFO ] Invariant cache hit.
[2023-03-08 13:22:23] [INFO ] Implicit Places using invariants and state equation in 623 ms returned []
Implicit Place search using SMT with State Equation took 874 ms to find 0 implicit places.
[2023-03-08 13:22:23] [INFO ] Invariant cache hit.
[2023-03-08 13:22:23] [INFO ] Dead Transitions using invariants and state equation in 201 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1099 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 85 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-10 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:(AND (EQ s356 1) (EQ s381 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]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 5 ms.
FORMULA DES-PT-60b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-10 finished in 1216 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 454 transition count 388
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 213 place count 364 transition count 307
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 4 with 4 rules applied. Total rules applied 217 place count 362 transition count 309
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 219 place count 360 transition count 307
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 220 place count 359 transition count 307
Applied a total of 220 rules in 50 ms. Remains 359 /476 variables (removed 117) and now considering 307/418 (removed 111) transitions.
// Phase 1: matrix 307 rows 359 cols
[2023-03-08 13:22:23] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 13:22:23] [INFO ] Implicit Places using invariants in 189 ms returned []
[2023-03-08 13:22:23] [INFO ] Invariant cache hit.
[2023-03-08 13:22:24] [INFO ] Implicit Places using invariants and state equation in 526 ms returned []
Implicit Place search using SMT with State Equation took 720 ms to find 0 implicit places.
[2023-03-08 13:22:24] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:22:24] [INFO ] Invariant cache hit.
[2023-03-08 13:22:24] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 359/476 places, 307/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 937 ms. Remains : 359/476 places, 307/418 transitions.
Stuttering acceptance computed with spot in 105 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s159 1) (EQ s270 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 25 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-11 finished in 1065 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((F(!p0) U p1))))'
Support contains 4 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 469 transition count 400
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 455 transition count 400
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 455 transition count 390
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 445 transition count 390
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 51 place count 443 transition count 388
Iterating global reduction 2 with 2 rules applied. Total rules applied 53 place count 443 transition count 388
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 54 place count 443 transition count 387
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 54 place count 443 transition count 386
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 56 place count 442 transition count 386
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 57 place count 441 transition count 385
Iterating global reduction 3 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 59 place count 441 transition count 384
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 211 place count 365 transition count 308
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 4 with 4 rules applied. Total rules applied 215 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 360 transition count 308
Applied a total of 218 rules in 61 ms. Remains 360 /476 variables (removed 116) and now considering 308/418 (removed 110) transitions.
// Phase 1: matrix 308 rows 360 cols
[2023-03-08 13:22:24] [INFO ] Computed 58 place invariants in 10 ms
[2023-03-08 13:22:24] [INFO ] Implicit Places using invariants in 178 ms returned []
[2023-03-08 13:22:24] [INFO ] Invariant cache hit.
[2023-03-08 13:22:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 13:22:25] [INFO ] Implicit Places using invariants and state equation in 452 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2023-03-08 13:22:25] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:22:25] [INFO ] Invariant cache hit.
[2023-03-08 13:22:25] [INFO ] Dead Transitions using invariants and state equation in 155 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/476 places, 308/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 863 ms. Remains : 360/476 places, 308/418 transitions.
Stuttering acceptance computed with spot in 118 ms :[(NOT p1), (NOT p1), (AND (NOT p1) p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 2}], [{ cond=(AND p1 p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s200 1) (EQ s244 1)), p0:(AND (EQ s279 1) (EQ s281 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 18 steps with 0 reset in 1 ms.
FORMULA DES-PT-60b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-12 finished in 1002 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(p0)||G(p1)||G(p2))))'
Support contains 3 out of 476 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Graph (complete) has 1134 edges and 476 vertex of which 470 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 469 transition count 399
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 454 transition count 399
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 454 transition count 388
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 443 transition count 388
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 55 place count 441 transition count 386
Iterating global reduction 2 with 2 rules applied. Total rules applied 57 place count 441 transition count 386
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 58 place count 441 transition count 385
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 58 place count 441 transition count 384
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 60 place count 440 transition count 384
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 61 place count 439 transition count 383
Iterating global reduction 3 with 1 rules applied. Total rules applied 62 place count 439 transition count 383
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 63 place count 439 transition count 382
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 1 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 211 place count 365 transition count 308
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 4 with 4 rules applied. Total rules applied 215 place count 363 transition count 310
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 217 place count 361 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 218 place count 360 transition count 308
Applied a total of 218 rules in 50 ms. Remains 360 /476 variables (removed 116) and now considering 308/418 (removed 110) transitions.
// Phase 1: matrix 308 rows 360 cols
[2023-03-08 13:22:25] [INFO ] Computed 58 place invariants in 8 ms
[2023-03-08 13:22:25] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 13:22:25] [INFO ] Invariant cache hit.
[2023-03-08 13:22:26] [INFO ] Implicit Places using invariants and state equation in 472 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2023-03-08 13:22:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 13:22:26] [INFO ] Invariant cache hit.
[2023-03-08 13:22:26] [INFO ] Dead Transitions using invariants and state equation in 157 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 360/476 places, 308/418 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 879 ms. Remains : 360/476 places, 308/418 transitions.
Stuttering acceptance computed with spot in 39 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-60b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1 p2), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) p1 p2), acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1) p2), acceptance={1} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={0, 1} source=0 dest: 0}, { cond=(AND p0 p1 (NOT p2)), acceptance={2} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0, 2} source=0 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={1, 2} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0, 1, 2} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s309 1), p1:(NEQ s279 1), p2:(EQ s312 0)], nbAcceptance=3, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5495 reset in 314 ms.
Product exploration explored 100000 steps with 5394 reset in 399 ms.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 680 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 529 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 8) seen :6
Finished Best-First random walk after 2909 steps, including 27 resets, run visited all 2 properties in 4 ms. (steps per millisecond=727 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 809 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 41 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Support contains 3 out of 360 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 360/360 places, 308/308 transitions.
Applied a total of 0 rules in 12 ms. Remains 360 /360 variables (removed 0) and now considering 308/308 (removed 0) transitions.
[2023-03-08 13:22:29] [INFO ] Invariant cache hit.
[2023-03-08 13:22:29] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 13:22:29] [INFO ] Invariant cache hit.
[2023-03-08 13:22:29] [INFO ] Implicit Places using invariants and state equation in 470 ms returned []
Implicit Place search using SMT with State Equation took 655 ms to find 0 implicit places.
[2023-03-08 13:22:29] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 13:22:29] [INFO ] Invariant cache hit.
[2023-03-08 13:22:29] [INFO ] Dead Transitions using invariants and state equation in 143 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 816 ms. Remains : 360/360 places, 308/308 transitions.
Computed a total of 254 stabilizing places and 249 stable transitions
Computed a total of 254 stabilizing places and 249 stable transitions
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : []
Knowledge based reduction with 17 factoid took 710 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Finished random walk after 5398 steps, including 285 resets, run visited all 8 properties in 74 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND (NOT p0) p1 p2), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (AND (NOT p0) p1 p2)), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) p2))), (X (NOT (AND p0 (NOT p1) p2))), (X (NOT (AND p0 p1 p2))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) p1 p2))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) p2)))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p1 p2))))]
False Knowledge obtained : [(F (AND p0 p1 (NOT p2))), (F (AND (NOT p0) (NOT p1) p2)), (F (AND p0 (NOT p1) (NOT p2))), (F (AND (NOT p0) p1 (NOT p2))), (F (AND p0 p1 p2)), (F (AND p0 (NOT p1) p2)), (F (NOT (AND (NOT p0) p1 p2))), (F (AND (NOT p0) (NOT p1) (NOT p2)))]
Knowledge based reduction with 17 factoid took 804 ms. Reduced automaton from 1 states, 8 edges and 3 AP (stutter insensitive) to 1 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 49 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 47 ms :[(AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 5428 reset in 265 ms.
Product exploration explored 100000 steps with 5402 reset in 284 ms.
Built C files in :
/tmp/ltsmin490201964642193431
[2023-03-08 13:22:32] [INFO ] Computing symmetric may disable matrix : 308 transitions.
[2023-03-08 13:22:32] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:22:32] [INFO ] Computing symmetric may enable matrix : 308 transitions.
[2023-03-08 13:22:32] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:22:32] [INFO ] Computing Do-Not-Accords matrix : 308 transitions.
[2023-03-08 13:22:32] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:22:32] [INFO ] Built C files in 41ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin490201964642193431
Running compilation step : cd /tmp/ltsmin490201964642193431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 697 ms.
Running link step : cd /tmp/ltsmin490201964642193431;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin490201964642193431;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased15375177714805709639.hoa' '--buchi-type=spotba'
LTSmin run took 1596 ms.
FORMULA DES-PT-60b-LTLFireability-13 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-60b-LTLFireability-13 finished in 9004 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(X(!p1))) U X((G(p2) U p3))))'
Support contains 5 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 19 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
// Phase 1: matrix 413 rows 473 cols
[2023-03-08 13:22:34] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 13:22:34] [INFO ] Implicit Places using invariants in 215 ms returned []
[2023-03-08 13:22:34] [INFO ] Invariant cache hit.
[2023-03-08 13:22:35] [INFO ] Implicit Places using invariants and state equation in 612 ms returned []
Implicit Place search using SMT with State Equation took 828 ms to find 0 implicit places.
[2023-03-08 13:22:35] [INFO ] Invariant cache hit.
[2023-03-08 13:22:35] [INFO ] Dead Transitions using invariants and state equation in 211 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1059 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 649 ms :[(NOT p3), (AND p1 (NOT p3)), (NOT p3), (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), p1, (AND (NOT p3) p2 p1), (AND (NOT p2) p1), true, p1, (AND p1 (NOT p2)), p1, (OR (AND p1 (NOT p2) (NOT p3)) (AND p0 p1 (NOT p3))), (AND p1 (NOT p2)), (NOT p2), (NOT p3)]
Running random walk in product with property : DES-PT-60b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=1 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p3) p2), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p0) (NOT p3)), acceptance={} source=2 dest: 1}, { cond=(NOT p3), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p3)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=3 dest: 8}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={} source=3 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p2)), acceptance={} source=3 dest: 10}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 11}, { cond=(AND p0 (NOT p3) p2), acceptance={} source=3 dest: 12}], [{ cond=p1, acceptance={} source=4 dest: 7}], [{ cond=(AND (NOT p3) p2 p1), acceptance={} source=5 dest: 14}], [{ cond=(AND (NOT p2) p1), acceptance={} source=6 dest: 7}, { cond=(AND p2 p1), acceptance={} source=6 dest: 13}], [{ cond=true, acceptance={0} source=7 dest: 7}], [{ cond=p1, acceptance={} source=8 dest: 4}], [{ cond=(AND (NOT p2) p1), acceptance={} source=9 dest: 4}, { cond=(AND p2 p1), acceptance={} source=9 dest: 6}], [{ cond=(AND (NOT p0) p1), acceptance={} source=10 dest: 8}, { cond=(AND p0 p1), acceptance={0} source=10 dest: 10}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2) p1), acceptance={} source=11 dest: 8}, { cond=(AND (NOT p0) (NOT p3) p2 p1), acceptance={} source=11 dest: 9}, { cond=(AND p0 (NOT p3) (NOT p2) p1), acceptance={} source=11 dest: 10}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={0} source=11 dest: 11}, { cond=(AND p0 (NOT p3) p2 p1), acceptance={} source=11 dest: 12}], [{ cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=12 dest: 8}, { cond=(AND (NOT p0) p2 p1), acceptance={} source=12 dest: 9}, { cond=(AND p0 (NOT p2) p1), acceptance={} source=12 dest: 10}, { cond=(AND p0 p2 p1), acceptance={} source=12 dest: 12}], [{ cond=(NOT p2), acceptance={} source=13 dest: 7}, { cond=p2, acceptance={} source=13 dest: 13}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=14 dest: 7}, { cond=(AND (NOT p3) p2), acceptance={} source=14 dest: 13}, { cond=(AND (NOT p3) p2), acceptance={0} source=14 dest: 14}]], initial=0, aps=[p0:(EQ s375 1), p3:(EQ s296 1), p2:(AND (EQ s15 1) (EQ s329 1)), p1:(OR (AND (EQ s27 1) (EQ s329 1)) (NOT (AND (EQ s15 1) (EQ s329 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-14 finished in 1740 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 476 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 476/476 places, 418/418 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 474 transition count 416
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 474 transition count 416
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 5 place count 474 transition count 415
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 473 transition count 414
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 473 transition count 414
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 8 place count 473 transition count 413
Applied a total of 8 rules in 33 ms. Remains 473 /476 variables (removed 3) and now considering 413/418 (removed 5) transitions.
[2023-03-08 13:22:36] [INFO ] Invariant cache hit.
[2023-03-08 13:22:36] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-08 13:22:36] [INFO ] Invariant cache hit.
[2023-03-08 13:22:37] [INFO ] Implicit Places using invariants and state equation in 654 ms returned []
Implicit Place search using SMT with State Equation took 860 ms to find 0 implicit places.
[2023-03-08 13:22:37] [INFO ] Invariant cache hit.
[2023-03-08 13:22:37] [INFO ] Dead Transitions using invariants and state equation in 207 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 473/476 places, 413/418 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1101 ms. Remains : 473/476 places, 413/418 transitions.
Stuttering acceptance computed with spot in 83 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-60b-LTLFireability-15 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:(EQ s315 0)], 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]]
Entered a terminal (fully accepting) state of product in 99 steps with 0 reset in 0 ms.
FORMULA DES-PT-60b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-60b-LTLFireability-15 finished in 1198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
[2023-03-08 13:22:37] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin919877649532322528
[2023-03-08 13:22:37] [INFO ] Computing symmetric may disable matrix : 418 transitions.
[2023-03-08 13:22:37] [INFO ] Applying decomposition
[2023-03-08 13:22:37] [INFO ] Computation of Complete disable matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:22:37] [INFO ] Computing symmetric may enable matrix : 418 transitions.
[2023-03-08 13:22:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 13:22:37] [INFO ] Flatten gal took : 16 ms
[2023-03-08 13:22:37] [INFO ] Computing Do-Not-Accords matrix : 418 transitions.
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph17155994224508224462.txt' '-o' '/tmp/graph17155994224508224462.bin' '-w' '/tmp/graph17155994224508224462.weights'
[2023-03-08 13:22:37] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17155994224508224462.bin' '-l' '-1' '-v' '-w' '/tmp/graph17155994224508224462.weights' '-q' '0' '-e' '0.001'
[2023-03-08 13:22:37] [INFO ] Decomposing Gal with order
[2023-03-08 13:22:37] [INFO ] Built C files in 80ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin919877649532322528
Running compilation step : cd /tmp/ltsmin919877649532322528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-08 13:22:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 13:22:37] [INFO ] Removed a total of 17 redundant transitions.
[2023-03-08 13:22:37] [INFO ] Flatten gal took : 31 ms
[2023-03-08 13:22:37] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 7 ms.
[2023-03-08 13:22:37] [INFO ] Time to serialize gal into /tmp/LTLFireability7908573301455793708.gal : 6 ms
[2023-03-08 13:22:37] [INFO ] Time to serialize properties into /tmp/LTLFireability10159727555411996669.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability7908573301455793708.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability10159727555411996669.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i1.u9.p232==0)||(i1.u9.p269==0))||(i3.i3.u31.p357==0))"))))
Formula 0 simplified : FG!"(((i1.u9.p232==0)||(i1.u9.p269==0))||(i3.i3.u31.p357==0))"
Compilation finished in 909 ms.
Running link step : cd /tmp/ltsmin919877649532322528;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin919877649532322528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t56, t58, t310, t379, t380, t412, u33.t79, i1.t116, i1.u9.t251, i1.u9.t252, i1.u9.t253, i...1460
Computing Next relation with stutter on 6.23803e+08 deadlock states
Detected timeout of ITS tools.
[2023-03-08 13:43:31] [INFO ] Applying decomposition
[2023-03-08 13:43:31] [INFO ] Flatten gal took : 68 ms
[2023-03-08 13:43:31] [INFO ] Decomposing Gal with order
[2023-03-08 13:43:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 13:43:31] [INFO ] Removed a total of 245 redundant transitions.
[2023-03-08 13:43:31] [INFO ] Flatten gal took : 124 ms
[2023-03-08 13:43:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 816 labels/synchronizations in 47 ms.
[2023-03-08 13:43:31] [INFO ] Time to serialize gal into /tmp/LTLFireability10978798134768328945.gal : 7 ms
[2023-03-08 13:43:31] [INFO ] Time to serialize properties into /tmp/LTLFireability14461958643596844072.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability10978798134768328945.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14461958643596844072.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((G(F("(((i0.u7.p232==0)||(i1.i0.i0.i0.i0.i0.u17.p269==0))||(i1.i0.i1.i0.i1.i1.u134.p357==0))"))))
Formula 0 simplified : FG!"(((i0.u7.p232==0)||(i1.i0.i0.i0.i0.i0.u17.p269==0))||(i1.i0.i1.i0.i1.i1.u134.p357==0))"
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: Loading model from ./gal.so
pins2lts-mc-linux64( 0/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.021: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.021: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.021: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.029: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.029: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.028: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.036: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.036: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.039: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.044: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.044: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.057: Initializing POR dependencies: labels 419, guards 418
pins2lts-mc-linux64( 7/ 8), 0.058: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.064: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.070: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 2.325: LTL layer: formula: [](<>((LTLAPp0==true)))
pins2lts-mc-linux64( 0/ 8), 2.325: "[](<>((LTLAPp0==true)))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 2.325: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.345: buchi has 2 states
pins2lts-mc-linux64( 0/ 8), 2.519: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 2.539: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.600: There are 421 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.600: State length is 477, there are 421 groups
pins2lts-mc-linux64( 0/ 8), 2.600: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.600: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.600: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.600: Visible groups: 0 / 421, labels: 1 / 421
pins2lts-mc-linux64( 0/ 8), 2.600: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.600: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 0/ 8), 2.636: [Blue] ~109 levels ~960 states ~1232 transitions
pins2lts-mc-linux64( 2/ 8), 2.654: [Blue] ~111 levels ~1920 states ~2344 transitions
pins2lts-mc-linux64( 1/ 8), 2.697: [Blue] ~124 levels ~3840 states ~5128 transitions
pins2lts-mc-linux64( 0/ 8), 2.757: [Blue] ~127 levels ~7680 states ~9168 transitions
pins2lts-mc-linux64( 0/ 8), 2.892: [Blue] ~130 levels ~15360 states ~17920 transitions
pins2lts-mc-linux64( 0/ 8), 3.211: [Blue] ~130 levels ~30720 states ~35832 transitions
pins2lts-mc-linux64( 1/ 8), 3.794: [Blue] ~393 levels ~61440 states ~70448 transitions
pins2lts-mc-linux64( 1/ 8), 4.895: [Blue] ~450 levels ~122880 states ~135624 transitions
pins2lts-mc-linux64( 1/ 8), 6.818: [Blue] ~831 levels ~245760 states ~268080 transitions
pins2lts-mc-linux64( 1/ 8), 10.207: [Blue] ~1471 levels ~491520 states ~532880 transitions
pins2lts-mc-linux64( 1/ 8), 16.600: [Blue] ~3024 levels ~983040 states ~1067904 transitions
pins2lts-mc-linux64( 1/ 8), 28.600: [Blue] ~6676 levels ~1966080 states ~2145360 transitions
pins2lts-mc-linux64( 1/ 8), 52.374: [Blue] ~12921 levels ~3932160 states ~4409240 transitions
pins2lts-mc-linux64( 1/ 8), 102.143: [Blue] ~18862 levels ~7864320 states ~8904568 transitions
pins2lts-mc-linux64( 1/ 8), 200.026: [Blue] ~19312 levels ~15728640 states ~18007240 transitions
pins2lts-mc-linux64( 1/ 8), 403.828: [Blue] ~19921 levels ~31457280 states ~36344920 transitions
pins2lts-mc-linux64( 1/ 8), 813.170: [Blue] ~20936 levels ~62914560 states ~72935080 transitions
pins2lts-mc-linux64( 1/ 8), 1627.593: [Blue] ~23477 levels ~125829120 states ~145828888 transitions
pins2lts-mc-linux64( 6/ 8), 2313.241: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 2313.271:
pins2lts-mc-linux64( 0/ 8), 2313.271: Explored 123008296 states 137547359 transitions, fanout: 1.118
pins2lts-mc-linux64( 0/ 8), 2313.271: Total exploration time 2310.660 sec (2310.620 sec minimum, 2310.641 sec on average)
pins2lts-mc-linux64( 0/ 8), 2313.271: States per second: 53235, Transitions per second: 59527
pins2lts-mc-linux64( 0/ 8), 2313.271:
pins2lts-mc-linux64( 0/ 8), 2313.271: State space has 134217069 states, 3268 are accepting
pins2lts-mc-linux64( 0/ 8), 2313.271: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 2313.271: blue states: 123008296 (91.65%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 2313.271: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 2313.271: all-red states: 3268 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 2313.271:
pins2lts-mc-linux64( 0/ 8), 2313.271: Total memory used for local state coloring: 164.3MB
pins2lts-mc-linux64( 0/ 8), 2313.271:
pins2lts-mc-linux64( 0/ 8), 2313.271: Queue width: 8B, total height: 10768380, memory: 82.16MB
pins2lts-mc-linux64( 0/ 8), 2313.271: Tree memory: 1174.1MB, 9.2 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 2313.271: Tree fill ratio (roots/leafs): 99.0%/58.0%
pins2lts-mc-linux64( 0/ 8), 2313.271: Stored 420 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 2313.271: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 2313.271: Est. total memory use: 1256.2MB (~1106.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin919877649532322528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin919877649532322528;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 14:04:25] [INFO ] Flatten gal took : 16 ms
[2023-03-08 14:04:25] [INFO ] Input system was already deterministic with 418 transitions.
[2023-03-08 14:04:25] [INFO ] Transformed 476 places.
[2023-03-08 14:04:25] [INFO ] Transformed 418 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 14:04:25] [INFO ] Time to serialize gal into /tmp/LTLFireability1879415534614202254.gal : 5 ms
[2023-03-08 14:04:25] [INFO ] Time to serialize properties into /tmp/LTLFireability6218133617841880665.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability1879415534614202254.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6218133617841880665.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F("(((p232==0)||(p269==0))||(p357==0))"))))
Formula 0 simplified : FG!"(((p232==0)||(p269==0))||(p357==0))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 8131128 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16038268 kB

BK_TIME_CONFINEMENT_REACHED

--------------------
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.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /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="DES-PT-60b"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="itstools"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-60b, 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 r101-tall-167814475400500"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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