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.r517-tall-167987243300060.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 Anderson-PT-11, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r517-tall-167987243300060
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 2.0M
-rw-r--r-- 1 mcc users 6.2K Mar 23 15:19 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Mar 23 15:19 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.8K Mar 23 15:18 CTLFireability.txt
-rw-r--r-- 1 mcc users 52K Mar 23 15:18 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K Mar 23 07:06 LTLCardinality.txt
-rw-r--r-- 1 mcc users 25K Mar 23 07:06 LTLCardinality.xml
-rw-r--r-- 1 mcc users 3.1K Mar 23 07:06 LTLFireability.txt
-rw-r--r-- 1 mcc users 19K Mar 23 07:06 LTLFireability.xml
-rw-r--r-- 1 mcc users 1 Mar 26 22:42 NewModel
-rw-r--r-- 1 mcc users 11K Mar 23 15:19 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 98K Mar 23 15:19 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.4K Mar 23 15:19 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 59K Mar 23 15:19 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Mar 23 07:06 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Mar 23 07:06 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 equiv_col
-rw-r--r-- 1 mcc users 3 Mar 26 22:42 instance
-rw-r--r-- 1 mcc users 6 Mar 26 22:42 iscolored
-rw-r--r-- 1 mcc users 1.6M Mar 31 16:48 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 Anderson-PT-11-LTLFireability-00
FORMULA_NAME Anderson-PT-11-LTLFireability-01
FORMULA_NAME Anderson-PT-11-LTLFireability-02
FORMULA_NAME Anderson-PT-11-LTLFireability-03
FORMULA_NAME Anderson-PT-11-LTLFireability-04
FORMULA_NAME Anderson-PT-11-LTLFireability-05
FORMULA_NAME Anderson-PT-11-LTLFireability-06
FORMULA_NAME Anderson-PT-11-LTLFireability-07
FORMULA_NAME Anderson-PT-11-LTLFireability-08
FORMULA_NAME Anderson-PT-11-LTLFireability-09
FORMULA_NAME Anderson-PT-11-LTLFireability-10
FORMULA_NAME Anderson-PT-11-LTLFireability-11
FORMULA_NAME Anderson-PT-11-LTLFireability-12
FORMULA_NAME Anderson-PT-11-LTLFireability-13
FORMULA_NAME Anderson-PT-11-LTLFireability-14
FORMULA_NAME Anderson-PT-11-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1680848854361

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=Anderson-PT-11
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2023-04-07 06:27:35] [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-04-07 06:27:35] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-04-07 06:27:35] [INFO ] Load time of PNML (sax parser for PT used): 146 ms
[2023-04-07 06:27:35] [INFO ] Transformed 749 places.
[2023-04-07 06:27:36] [INFO ] Transformed 3245 transitions.
[2023-04-07 06:27:36] [INFO ] Found NUPN structural information;
[2023-04-07 06:27:36] [INFO ] Parsed PT model containing 749 places and 3245 transitions and 12540 arcs in 223 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 11 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-11-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-11-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 50 out of 749 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 749/749 places, 3245/3245 transitions.
Discarding 193 places :
Symmetric choice reduction at 0 with 193 rule applications. Total rules 193 place count 556 transition count 1372
Iterating global reduction 0 with 193 rules applied. Total rules applied 386 place count 556 transition count 1372
Applied a total of 386 rules in 125 ms. Remains 556 /749 variables (removed 193) and now considering 1372/3245 (removed 1873) transitions.
// Phase 1: matrix 1372 rows 556 cols
[2023-04-07 06:27:36] [INFO ] Computed 25 invariants in 64 ms
[2023-04-07 06:27:36] [INFO ] Implicit Places using invariants in 563 ms returned []
[2023-04-07 06:27:36] [INFO ] Invariant cache hit.
[2023-04-07 06:27:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:27:39] [INFO ] Implicit Places using invariants and state equation in 2212 ms returned []
Implicit Place search using SMT with State Equation took 2798 ms to find 0 implicit places.
[2023-04-07 06:27:39] [INFO ] Invariant cache hit.
[2023-04-07 06:27:39] [INFO ] Dead Transitions using invariants and state equation in 832 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 556/749 places, 1372/3245 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3756 ms. Remains : 556/749 places, 1372/3245 transitions.
Support contains 50 out of 556 places after structural reductions.
[2023-04-07 06:27:40] [INFO ] Flatten gal took : 121 ms
[2023-04-07 06:27:40] [INFO ] Flatten gal took : 77 ms
[2023-04-07 06:27:40] [INFO ] Input system was already deterministic with 1372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 515 ms. (steps per millisecond=19 ) properties (out of 35) seen :4
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 31) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 31) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 29) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 29) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 27) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 27) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=45 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 26) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 26) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 22) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 22) seen :2
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 20) seen :0
Running SMT prover for 20 properties.
[2023-04-07 06:27:41] [INFO ] Invariant cache hit.
[2023-04-07 06:27:41] [INFO ] [Real]Absence check using 13 positive place invariants in 16 ms returned sat
[2023-04-07 06:27:41] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 25 ms returned sat
[2023-04-07 06:27:42] [INFO ] After 1314ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:20
[2023-04-07 06:27:42] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 06:27:42] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 20 ms returned sat
[2023-04-07 06:27:46] [INFO ] After 3064ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :18
[2023-04-07 06:27:46] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:27:49] [INFO ] After 3355ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :2 sat :18
[2023-04-07 06:27:52] [INFO ] After 6107ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :18
Attempting to minimize the solution found.
Minimization took 2207 ms.
[2023-04-07 06:27:54] [INFO ] After 11868ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :18
Fused 20 Parikh solutions to 18 different solutions.
Parikh walk visited 7 properties in 142 ms.
Support contains 19 out of 556 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 2 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 236 place count 430 transition count 946
Iterating global reduction 0 with 16 rules applied. Total rules applied 252 place count 430 transition count 946
Applied a total of 252 rules in 95 ms. Remains 430 /556 variables (removed 126) and now considering 946/1372 (removed 426) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 96 ms. Remains : 430/556 places, 946/1372 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 11) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 9) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 946 rows 430 cols
[2023-04-07 06:27:55] [INFO ] Computed 25 invariants in 19 ms
[2023-04-07 06:27:55] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 06:27:55] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 06:27:55] [INFO ] After 839ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-04-07 06:27:56] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 06:27:56] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 13 ms returned sat
[2023-04-07 06:27:56] [INFO ] After 874ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-04-07 06:27:56] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:27:57] [INFO ] After 594ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-04-07 06:27:58] [INFO ] After 1153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 424 ms.
[2023-04-07 06:27:58] [INFO ] After 2627ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 1 properties in 42 ms.
Support contains 9 out of 430 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 430/430 places, 946/946 transitions.
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 6 place count 424 transition count 820
Iterating global reduction 0 with 6 rules applied. Total rules applied 12 place count 424 transition count 820
Applied a total of 12 rules in 55 ms. Remains 424 /430 variables (removed 6) and now considering 820/946 (removed 126) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 55 ms. Remains : 424/430 places, 820/946 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 126 ms. (steps per millisecond=79 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 357598 steps, run timeout after 3001 ms. (steps per millisecond=119 ) properties seen :{2=1, 3=1, 4=1}
Probabilistic random walk after 357598 steps, saw 272460 distinct states, run finished after 3002 ms. (steps per millisecond=119 ) properties seen :3
Running SMT prover for 2 properties.
// Phase 1: matrix 820 rows 424 cols
[2023-04-07 06:28:02] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 06:28:02] [INFO ] [Real]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 06:28:02] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 06:28:02] [INFO ] After 395ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-04-07 06:28:02] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:02] [INFO ] After 192ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 06:28:02] [INFO ] After 726ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-04-07 06:28:02] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 06:28:02] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 20 ms returned sat
[2023-04-07 06:28:03] [INFO ] After 384ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-04-07 06:28:03] [INFO ] After 325ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-04-07 06:28:03] [INFO ] After 515ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 134 ms.
[2023-04-07 06:28:03] [INFO ] After 1159ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 424 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 424/424 places, 820/820 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 421 transition count 757
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 421 transition count 757
Applied a total of 6 rules in 31 ms. Remains 421 /424 variables (removed 3) and now considering 757/820 (removed 63) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 31 ms. Remains : 421/424 places, 757/820 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 103 ms. (steps per millisecond=97 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 513705 steps, run timeout after 3001 ms. (steps per millisecond=171 ) properties seen :{1=1}
Probabilistic random walk after 513705 steps, saw 392788 distinct states, run finished after 3001 ms. (steps per millisecond=171 ) properties seen :1
Running SMT prover for 1 properties.
// Phase 1: matrix 757 rows 421 cols
[2023-04-07 06:28:07] [INFO ] Computed 25 invariants in 13 ms
[2023-04-07 06:28:07] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 06:28:07] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 15 ms returned sat
[2023-04-07 06:28:07] [INFO ] After 246ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 06:28:07] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:07] [INFO ] After 145ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:28:07] [INFO ] After 505ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:28:07] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 06:28:07] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 14 ms returned sat
[2023-04-07 06:28:08] [INFO ] After 231ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:28:08] [INFO ] After 122ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:28:08] [INFO ] After 173ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-04-07 06:28:08] [INFO ] After 526ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 421 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 421/421 places, 757/757 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 420 transition count 736
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 420 transition count 736
Applied a total of 2 rules in 24 ms. Remains 420 /421 variables (removed 1) and now considering 736/757 (removed 21) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 25 ms. Remains : 420/421 places, 736/757 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1034635 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1034635 steps, saw 787677 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 736 rows 420 cols
[2023-04-07 06:28:11] [INFO ] Computed 25 invariants in 16 ms
[2023-04-07 06:28:11] [INFO ] [Real]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 06:28:11] [INFO ] [Real]Absence check using 13 positive and 12 generalized place invariants in 16 ms returned sat
[2023-04-07 06:28:11] [INFO ] After 278ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 06:28:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:11] [INFO ] After 107ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:28:11] [INFO ] After 507ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:28:11] [INFO ] [Nat]Absence check using 13 positive place invariants in 7 ms returned sat
[2023-04-07 06:28:11] [INFO ] [Nat]Absence check using 13 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 06:28:12] [INFO ] After 250ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:28:12] [INFO ] After 172ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:28:12] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 06:28:12] [INFO ] After 607ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 420 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 736/736 transitions.
Applied a total of 0 rules in 19 ms. Remains 420 /420 variables (removed 0) and now considering 736/736 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 420/420 places, 736/736 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 420/420 places, 736/736 transitions.
Applied a total of 0 rules in 18 ms. Remains 420 /420 variables (removed 0) and now considering 736/736 (removed 0) transitions.
[2023-04-07 06:28:12] [INFO ] Invariant cache hit.
[2023-04-07 06:28:12] [INFO ] Implicit Places using invariants in 456 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 458 ms to find 1 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 419/420 places, 736/736 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 241 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 242 place count 298 transition count 615
Applied a total of 242 rules in 49 ms. Remains 298 /419 variables (removed 121) and now considering 615/736 (removed 121) transitions.
// Phase 1: matrix 615 rows 298 cols
[2023-04-07 06:28:12] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 06:28:13] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-04-07 06:28:13] [INFO ] Invariant cache hit.
[2023-04-07 06:28:13] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:14] [INFO ] Implicit Places using invariants and state equation in 955 ms returned []
Implicit Place search using SMT with State Equation took 1194 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 298/420 places, 615/736 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 1719 ms. Remains : 298/420 places, 615/736 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1170036 steps, run timeout after 3001 ms. (steps per millisecond=389 ) properties seen :{}
Probabilistic random walk after 1170036 steps, saw 870569 distinct states, run finished after 3001 ms. (steps per millisecond=389 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:28:17] [INFO ] Invariant cache hit.
[2023-04-07 06:28:17] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 06:28:17] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 06:28:17] [INFO ] After 155ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 06:28:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:17] [INFO ] After 63ms SMT Verify possible using 110 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:28:17] [INFO ] After 289ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:28:17] [INFO ] [Nat]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 06:28:17] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 06:28:17] [INFO ] After 143ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:28:17] [INFO ] After 83ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:28:17] [INFO ] After 124ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 25 ms.
[2023-04-07 06:28:17] [INFO ] After 353ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 298 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 11 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 11 ms. Remains : 298/298 places, 615/615 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 298/298 places, 615/615 transitions.
Applied a total of 0 rules in 8 ms. Remains 298 /298 variables (removed 0) and now considering 615/615 (removed 0) transitions.
[2023-04-07 06:28:17] [INFO ] Invariant cache hit.
[2023-04-07 06:28:18] [INFO ] Implicit Places using invariants in 227 ms returned []
[2023-04-07 06:28:18] [INFO ] Invariant cache hit.
[2023-04-07 06:28:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:19] [INFO ] Implicit Places using invariants and state equation in 969 ms returned []
Implicit Place search using SMT with State Equation took 1206 ms to find 0 implicit places.
[2023-04-07 06:28:19] [INFO ] Redundant transitions in 34 ms returned []
[2023-04-07 06:28:19] [INFO ] Invariant cache hit.
[2023-04-07 06:28:19] [INFO ] Dead Transitions using invariants and state equation in 333 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1588 ms. Remains : 298/298 places, 615/615 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 298 transition count 494
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 177 transition count 494
Applied a total of 242 rules in 12 ms. Remains 177 /298 variables (removed 121) and now considering 494/615 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 494 rows 177 cols
[2023-04-07 06:28:19] [INFO ] Computed 24 invariants in 8 ms
[2023-04-07 06:28:19] [INFO ] [Real]Absence check using 13 positive place invariants in 3 ms returned sat
[2023-04-07 06:28:19] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 06:28:19] [INFO ] After 107ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-04-07 06:28:19] [INFO ] After 136ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-04-07 06:28:19] [INFO ] After 212ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
FORMULA Anderson-PT-11-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 2 atomic propositions for a total of 13 simplifications.
Initial state reduction rules removed 1 formulas.
FORMULA Anderson-PT-11-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 0 stabilizing places and 0 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 246 place count 420 transition count 736
Iterating global reduction 0 with 26 rules applied. Total rules applied 272 place count 420 transition count 736
Applied a total of 272 rules in 52 ms. Remains 420 /556 variables (removed 136) and now considering 736/1372 (removed 636) transitions.
// Phase 1: matrix 736 rows 420 cols
[2023-04-07 06:28:20] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 06:28:20] [INFO ] Implicit Places using invariants in 542 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 546 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 419/556 places, 736/1372 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 15 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
// Phase 1: matrix 616 rows 299 cols
[2023-04-07 06:28:20] [INFO ] Computed 24 invariants in 11 ms
[2023-04-07 06:28:20] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-04-07 06:28:20] [INFO ] Invariant cache hit.
[2023-04-07 06:28:21] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:21] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1036 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 299/556 places, 616/1372 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1650 ms. Remains : 299/556 places, 616/1372 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 152 ms :[(NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (EQ s24 1) (EQ s43 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]]
Product exploration explored 100000 steps with 5 reset in 266 ms.
Stack based approach found an accepted trace after 43 steps with 0 reset with depth 44 and stack size 44 in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-00 FALSE TECHNIQUES STACK_TEST
Treatment of property Anderson-PT-11-LTLFireability-00 finished in 2113 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((p1&&F(p2)))&&p0)))'
Support contains 4 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 531 transition count 867
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 531 transition count 867
Applied a total of 50 rules in 25 ms. Remains 531 /556 variables (removed 25) and now considering 867/1372 (removed 505) transitions.
// Phase 1: matrix 867 rows 531 cols
[2023-04-07 06:28:22] [INFO ] Computed 25 invariants in 16 ms
[2023-04-07 06:28:22] [INFO ] Implicit Places using invariants in 455 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 456 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/556 places, 867/1372 transitions.
Applied a total of 0 rules in 9 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 491 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 543 ms :[(NOT p2), (OR (NOT p1) (NOT p2)), (OR (NOT p2) (NOT p0) (NOT p1)), (OR (NOT p2) (NOT p1) (NOT p0)), true]
Running random walk in product with property : Anderson-PT-11-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 0}, { cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=p0, acceptance={} source=2 dest: 1}, { cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={} source=3 dest: 2}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=3, aps=[p2:(OR (EQ s12 0) (EQ s37 0)), p1:(OR (NEQ s11 1) (NEQ s41 1)), p0:(AND (EQ s11 1) (EQ s41 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-01 finished in 1061 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (!p0&&X(X(G(p2))))))'
Support contains 5 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 24 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 06:28:23] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 06:28:23] [INFO ] Implicit Places using invariants in 455 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 456 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 9 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 492 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 331 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={0} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s34 1)), p1:(AND (EQ s24 1) (EQ s44 1)), p2:(OR (AND (EQ s24 1) (EQ s40 1)) (NOT (AND (EQ s24 1) (EQ s44 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][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 179 ms.
Product exploration explored 100000 steps with 0 reset in 231 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 302 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished Best-First random walk after 5049 steps, including 1 resets, run visited all 1 properties in 8 ms. (steps per millisecond=631 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 220 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 128 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 112 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 531 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 9 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 06:28:25] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 06:28:25] [INFO ] Implicit Places using invariants in 296 ms returned []
[2023-04-07 06:28:25] [INFO ] Invariant cache hit.
[2023-04-07 06:28:26] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:27] [INFO ] Implicit Places using invariants and state equation in 1314 ms returned []
Implicit Place search using SMT with State Equation took 1612 ms to find 0 implicit places.
[2023-04-07 06:28:27] [INFO ] Invariant cache hit.
[2023-04-07 06:28:27] [INFO ] Dead Transitions using invariants and state equation in 671 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2292 ms. Remains : 531/531 places, 888/888 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Finished probabilistic random walk after 232968 steps, run visited all 1 properties in 653 ms. (steps per millisecond=356 )
Probabilistic random walk after 232968 steps, saw 182967 distinct states, run finished after 653 ms. (steps per millisecond=356 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 123 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 166 ms.
Product exploration explored 100000 steps with 0 reset in 171 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Performed 119 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 531 transition count 888
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 119 place count 531 transition count 888
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 229 place count 531 transition count 888
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 230 place count 530 transition count 867
Deduced a syphon composed of 229 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 231 place count 530 transition count 867
Deduced a syphon composed of 229 places in 0 ms
Applied a total of 231 rules in 52 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
[2023-04-07 06:28:29] [INFO ] Redundant transitions in 27 ms returned []
// Phase 1: matrix 867 rows 530 cols
[2023-04-07 06:28:29] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 06:28:30] [INFO ] Dead Transitions using invariants and state equation in 679 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 530/531 places, 867/888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 766 ms. Remains : 530/531 places, 867/888 transitions.
Built C files in :
/tmp/ltsmin8820658428103624169
[2023-04-07 06:28:30] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8820658428103624169
Running compilation step : cd /tmp/ltsmin8820658428103624169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1449 ms.
Running link step : cd /tmp/ltsmin8820658428103624169;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin8820658428103624169;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased3764306576225835607.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 530 transition count 867
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 530 transition count 867
Applied a total of 2 rules in 37 ms. Remains 530 /531 variables (removed 1) and now considering 867/888 (removed 21) transitions.
// Phase 1: matrix 867 rows 530 cols
[2023-04-07 06:28:45] [INFO ] Computed 24 invariants in 11 ms
[2023-04-07 06:28:46] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-04-07 06:28:46] [INFO ] Invariant cache hit.
[2023-04-07 06:28:46] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:28:48] [INFO ] Implicit Places using invariants and state equation in 2120 ms returned []
Implicit Place search using SMT with State Equation took 2571 ms to find 0 implicit places.
[2023-04-07 06:28:48] [INFO ] Invariant cache hit.
[2023-04-07 06:28:49] [INFO ] Dead Transitions using invariants and state equation in 673 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 530/531 places, 867/888 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3283 ms. Remains : 530/531 places, 867/888 transitions.
Built C files in :
/tmp/ltsmin17679454354881283080
[2023-04-07 06:28:49] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17679454354881283080
Running compilation step : cd /tmp/ltsmin17679454354881283080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1347 ms.
Running link step : cd /tmp/ltsmin17679454354881283080;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17679454354881283080;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased4296723594872442195.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 06:29:04] [INFO ] Flatten gal took : 34 ms
[2023-04-07 06:29:04] [INFO ] Flatten gal took : 35 ms
[2023-04-07 06:29:04] [INFO ] Time to serialize gal into /tmp/LTL15710818154971574695.gal : 6 ms
[2023-04-07 06:29:04] [INFO ] Time to serialize properties into /tmp/LTL16429679357863157326.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15710818154971574695.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10878442635445673575.hoa' '-atoms' '/tmp/LTL16429679357863157326.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16429679357863157326.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10878442635445673575.hoa
Detected timeout of ITS tools.
[2023-04-07 06:29:19] [INFO ] Flatten gal took : 45 ms
[2023-04-07 06:29:19] [INFO ] Flatten gal took : 29 ms
[2023-04-07 06:29:19] [INFO ] Time to serialize gal into /tmp/LTL2444711618804183556.gal : 5 ms
[2023-04-07 06:29:19] [INFO ] Time to serialize properties into /tmp/LTL11510901958495755590.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2444711618804183556.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11510901958495755590.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((("((next_16==1)&&(ncs_0_8==1))")U("((next_13==1)&&(ncs_8_5==1))"))U((!("((next_16==1)&&(ncs_0_8==1))"))&&(X(X(G("(((next_13==1)&&(...209
Formula 0 simplified : (!"((next_16==1)&&(ncs_0_8==1))" R !"((next_13==1)&&(ncs_8_5==1))") R ("((next_16==1)&&(ncs_0_8==1))" | XXF!"(((next_13==1)&&(ncs_6_...197
Detected timeout of ITS tools.
[2023-04-07 06:29:34] [INFO ] Flatten gal took : 30 ms
[2023-04-07 06:29:34] [INFO ] Applying decomposition
[2023-04-07 06:29:34] [INFO ] Flatten gal took : 25 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10750665366147374782.txt' '-o' '/tmp/graph10750665366147374782.bin' '-w' '/tmp/graph10750665366147374782.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10750665366147374782.bin' '-l' '-1' '-v' '-w' '/tmp/graph10750665366147374782.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:29:34] [INFO ] Decomposing Gal with order
[2023-04-07 06:29:34] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:29:34] [INFO ] Removed a total of 1552 redundant transitions.
[2023-04-07 06:29:34] [INFO ] Flatten gal took : 95 ms
[2023-04-07 06:29:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 27 ms.
[2023-04-07 06:29:35] [INFO ] Time to serialize gal into /tmp/LTL789499122105604316.gal : 13 ms
[2023-04-07 06:29:35] [INFO ] Time to serialize properties into /tmp/LTL575018104177076930.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL789499122105604316.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL575018104177076930.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...252
Read 1 LTL properties
Checking formula 0 : !(((("((i1.i0.u7.next_16==1)&&(i2.u10.ncs_0_8==1))")U("((i0.i2.u6.next_13==1)&&(i1.i2.u61.ncs_8_5==1))"))U((!("((i1.i0.u7.next_16==1)&...296
Formula 0 simplified : (!"((i1.i0.u7.next_16==1)&&(i2.u10.ncs_0_8==1))" R !"((i0.i2.u6.next_13==1)&&(i1.i2.u61.ncs_8_5==1))") R ("((i1.i0.u7.next_16==1)&&(...284
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin18315159261171491949
[2023-04-07 06:29:50] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18315159261171491949
Running compilation step : cd /tmp/ltsmin18315159261171491949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1356 ms.
Running link step : cd /tmp/ltsmin18315159261171491949;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin18315159261171491949;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 101984 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(X((G(p0)||p0)))&&(X(X(G(p0))) U p1)))'
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 531 transition count 867
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 531 transition count 867
Applied a total of 50 rules in 17 ms. Remains 531 /556 variables (removed 25) and now considering 867/1372 (removed 505) transitions.
// Phase 1: matrix 867 rows 531 cols
[2023-04-07 06:30:05] [INFO ] Computed 25 invariants in 13 ms
[2023-04-07 06:30:05] [INFO ] Implicit Places using invariants in 477 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 479 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/556 places, 867/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 504 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 111 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), true]
Running random walk in product with property : Anderson-PT-11-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=true, acceptance={0} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s12 1) (EQ s38 1)), p0:(AND (EQ s12 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, no-univ-branch, stutter-sensitive, 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 0 ms.
FORMULA Anderson-PT-11-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-06 finished in 643 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p1)||p0)))'
Support contains 6 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 25 place count 531 transition count 867
Iterating global reduction 0 with 25 rules applied. Total rules applied 50 place count 531 transition count 867
Applied a total of 50 rules in 20 ms. Remains 531 /556 variables (removed 25) and now considering 867/1372 (removed 505) transitions.
// Phase 1: matrix 867 rows 531 cols
[2023-04-07 06:30:05] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 06:30:06] [INFO ] Implicit Places using invariants in 463 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 464 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 530/556 places, 867/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 530 /530 variables (removed 0) and now considering 867/867 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 493 ms. Remains : 530/556 places, 867/1372 transitions.
Stuttering acceptance computed with spot in 144 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(AND (EQ s19 1) (EQ s41 1)), p0:(OR (EQ s3 0) (EQ s339 0) (AND (OR (EQ s17 0) (EQ s44 0)) (OR (EQ s3 0) (EQ s339 0))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 452 ms.
Product exploration explored 100000 steps with 50000 reset in 397 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 18 ms. Reduced automaton from 4 states, 6 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-08 TRUE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-08 finished in 1526 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 26 place count 530 transition count 846
Iterating global reduction 0 with 26 rules applied. Total rules applied 52 place count 530 transition count 846
Applied a total of 52 rules in 21 ms. Remains 530 /556 variables (removed 26) and now considering 846/1372 (removed 526) transitions.
// Phase 1: matrix 846 rows 530 cols
[2023-04-07 06:30:07] [INFO ] Computed 25 invariants in 11 ms
[2023-04-07 06:30:07] [INFO ] Implicit Places using invariants in 478 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 479 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 529/556 places, 846/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 507 ms. Remains : 529/556 places, 846/1372 transitions.
Stuttering acceptance computed with spot in 244 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s26 1) (NEQ s44 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, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 152 ms.
Product exploration explored 100000 steps with 0 reset in 151 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 916915 steps, run timeout after 3001 ms. (steps per millisecond=305 ) properties seen :{}
Probabilistic random walk after 916915 steps, saw 699052 distinct states, run finished after 3001 ms. (steps per millisecond=305 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 846 rows 529 cols
[2023-04-07 06:30:11] [INFO ] Computed 24 invariants in 14 ms
[2023-04-07 06:30:11] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 06:30:11] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 06:30:12] [INFO ] After 510ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:30:12] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 06:30:12] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 16 ms returned sat
[2023-04-07 06:30:12] [INFO ] After 324ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:30:12] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:30:12] [INFO ] After 265ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:30:13] [INFO ] After 395ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 54 ms.
[2023-04-07 06:30:13] [INFO ] After 887ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 846/846 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 726
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 409 transition count 726
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 409 transition count 616
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 461 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 462 place count 298 transition count 615
Applied a total of 462 rules in 29 ms. Remains 298 /529 variables (removed 231) and now considering 615/846 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 29 ms. Remains : 298/529 places, 615/846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 933125 steps, run visited all 1 properties in 2696 ms. (steps per millisecond=346 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2696 ms. (steps per millisecond=346 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 113 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 136 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Applied a total of 0 rules in 7 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-04-07 06:30:16] [INFO ] Invariant cache hit.
[2023-04-07 06:30:16] [INFO ] Implicit Places using invariants in 279 ms returned []
[2023-04-07 06:30:16] [INFO ] Invariant cache hit.
[2023-04-07 06:30:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:30:18] [INFO ] Implicit Places using invariants and state equation in 1518 ms returned []
Implicit Place search using SMT with State Equation took 1799 ms to find 0 implicit places.
[2023-04-07 06:30:18] [INFO ] Invariant cache hit.
[2023-04-07 06:30:18] [INFO ] Dead Transitions using invariants and state equation in 615 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2423 ms. Remains : 529/529 places, 846/846 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 124 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 943985 steps, run timeout after 3001 ms. (steps per millisecond=314 ) properties seen :{}
Probabilistic random walk after 943985 steps, saw 719239 distinct states, run finished after 3001 ms. (steps per millisecond=314 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:30:21] [INFO ] Invariant cache hit.
[2023-04-07 06:30:22] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 06:30:22] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 17 ms returned sat
[2023-04-07 06:30:22] [INFO ] After 642ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:30:22] [INFO ] [Nat]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 06:30:22] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 15 ms returned sat
[2023-04-07 06:30:23] [INFO ] After 457ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:30:23] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:30:23] [INFO ] After 170ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:30:23] [INFO ] After 266ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 55 ms.
[2023-04-07 06:30:23] [INFO ] After 884ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 529/529 places, 846/846 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 726
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 409 transition count 726
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 240 place count 409 transition count 616
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 460 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 461 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 462 place count 298 transition count 615
Applied a total of 462 rules in 24 ms. Remains 298 /529 variables (removed 231) and now considering 615/846 (removed 231) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 298/529 places, 615/846 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 933125 steps, run visited all 1 properties in 2688 ms. (steps per millisecond=347 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2689 ms. (steps per millisecond=347 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 118 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 132 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 129 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 141 ms.
Product exploration explored 100000 steps with 0 reset in 152 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 140 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Performed 120 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 529 transition count 846
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 120 place count 529 transition count 846
Deduced a syphon composed of 230 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 230 place count 529 transition count 846
Deduced a syphon composed of 230 places in 0 ms
Applied a total of 230 rules in 26 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
[2023-04-07 06:30:27] [INFO ] Redundant transitions in 53 ms returned []
// Phase 1: matrix 846 rows 529 cols
[2023-04-07 06:30:27] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 06:30:28] [INFO ] Dead Transitions using invariants and state equation in 756 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 529/529 places, 846/846 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 848 ms. Remains : 529/529 places, 846/846 transitions.
Built C files in :
/tmp/ltsmin14494030809002127544
[2023-04-07 06:30:28] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14494030809002127544
Running compilation step : cd /tmp/ltsmin14494030809002127544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1297 ms.
Running link step : cd /tmp/ltsmin14494030809002127544;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin14494030809002127544;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16930734914549813567.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 529 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 529/529 places, 846/846 transitions.
Applied a total of 0 rules in 18 ms. Remains 529 /529 variables (removed 0) and now considering 846/846 (removed 0) transitions.
// Phase 1: matrix 846 rows 529 cols
[2023-04-07 06:30:43] [INFO ] Computed 24 invariants in 10 ms
[2023-04-07 06:30:43] [INFO ] Implicit Places using invariants in 286 ms returned []
[2023-04-07 06:30:43] [INFO ] Invariant cache hit.
[2023-04-07 06:30:43] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:30:45] [INFO ] Implicit Places using invariants and state equation in 1728 ms returned []
Implicit Place search using SMT with State Equation took 2016 ms to find 0 implicit places.
[2023-04-07 06:30:45] [INFO ] Invariant cache hit.
[2023-04-07 06:30:45] [INFO ] Dead Transitions using invariants and state equation in 652 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2687 ms. Remains : 529/529 places, 846/846 transitions.
Built C files in :
/tmp/ltsmin8696092983960951952
[2023-04-07 06:30:45] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8696092983960951952
Running compilation step : cd /tmp/ltsmin8696092983960951952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1378 ms.
Running link step : cd /tmp/ltsmin8696092983960951952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin8696092983960951952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased18206548600990490821.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 06:31:01] [INFO ] Flatten gal took : 25 ms
[2023-04-07 06:31:01] [INFO ] Flatten gal took : 26 ms
[2023-04-07 06:31:01] [INFO ] Time to serialize gal into /tmp/LTL10473126704846631490.gal : 5 ms
[2023-04-07 06:31:01] [INFO ] Time to serialize properties into /tmp/LTL16677587861957687414.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10473126704846631490.gal' '-t' 'CGAL' '-hoa' '/tmp/aut6188615851025761006.hoa' '-atoms' '/tmp/LTL16677587861957687414.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16677587861957687414.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut6188615851025761006.hoa
Detected timeout of ITS tools.
[2023-04-07 06:31:16] [INFO ] Flatten gal took : 21 ms
[2023-04-07 06:31:16] [INFO ] Flatten gal took : 22 ms
[2023-04-07 06:31:16] [INFO ] Time to serialize gal into /tmp/LTL5522597930267430476.gal : 5 ms
[2023-04-07 06:31:16] [INFO ] Time to serialize properties into /tmp/LTL642132712715145956.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5522597930267430476.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL642132712715145956.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...274
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((next_15!=1)||(ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((next_15!=1)||(ncs_10_8!=1))"
Detected timeout of ITS tools.
[2023-04-07 06:31:31] [INFO ] Flatten gal took : 22 ms
[2023-04-07 06:31:31] [INFO ] Applying decomposition
[2023-04-07 06:31:31] [INFO ] Flatten gal took : 24 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2039221513722988835.txt' '-o' '/tmp/graph2039221513722988835.bin' '-w' '/tmp/graph2039221513722988835.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2039221513722988835.bin' '-l' '-1' '-v' '-w' '/tmp/graph2039221513722988835.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:31:31] [INFO ] Decomposing Gal with order
[2023-04-07 06:31:31] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:31:31] [INFO ] Removed a total of 1422 redundant transitions.
[2023-04-07 06:31:31] [INFO ] Flatten gal took : 51 ms
[2023-04-07 06:31:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 26 labels/synchronizations in 17 ms.
[2023-04-07 06:31:31] [INFO ] Time to serialize gal into /tmp/LTL12243074435976165223.gal : 8 ms
[2023-04-07 06:31:31] [INFO ] Time to serialize properties into /tmp/LTL7402996493140933775.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12243074435976165223.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7402996493140933775.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i1.i0.u7.next_15!=1)||(i0.i1.u195.ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((i1.i0.u7.next_15!=1)||(i0.i1.u195.ncs_10_8!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9617254520954038017
[2023-04-07 06:31:46] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9617254520954038017
Running compilation step : cd /tmp/ltsmin9617254520954038017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1263 ms.
Running link step : cd /tmp/ltsmin9617254520954038017;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin9617254520954038017;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 114428 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)||X(p2)))||X(G(p3)))))'
Support contains 8 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 21 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 06:32:01] [INFO ] Computed 25 invariants in 14 ms
[2023-04-07 06:32:02] [INFO ] Implicit Places using invariants in 434 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 436 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 464 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s39 1)), p2:(AND (EQ s22 1) (EQ s134 1)), p3:(OR (EQ s12 0) (EQ s34 0)), p1:(AND (EQ s31 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33304 reset in 340 ms.
Product exploration explored 100000 steps with 33216 reset in 360 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 78 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 06:32:03] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 06:32:03] [INFO ] [Real]Absence check using 13 positive place invariants in 9 ms returned sat
[2023-04-07 06:32:03] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 20 ms returned sat
[2023-04-07 06:32:03] [INFO ] After 415ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:32:03] [INFO ] [Nat]Absence check using 13 positive place invariants in 8 ms returned sat
[2023-04-07 06:32:03] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 13 ms returned sat
[2023-04-07 06:32:04] [INFO ] After 428ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:04] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:04] [INFO ] After 169ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:04] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 141 ms.
[2023-04-07 06:32:04] [INFO ] After 952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 531 transition count 769
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 412 transition count 769
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 238 place count 412 transition count 659
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 458 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 459 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 460 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 464 place count 299 transition count 636
Applied a total of 464 rules in 26 ms. Remains 299 /531 variables (removed 232) and now considering 636/888 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 299/531 places, 636/888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1032744 steps, run timeout after 3001 ms. (steps per millisecond=344 ) properties seen :{}
Probabilistic random walk after 1032744 steps, saw 767187 distinct states, run finished after 3001 ms. (steps per millisecond=344 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 06:32:07] [INFO ] Computed 24 invariants in 6 ms
[2023-04-07 06:32:07] [INFO ] [Real]Absence check using 12 positive place invariants in 5 ms returned sat
[2023-04-07 06:32:07] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 06:32:07] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:32:07] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 06:32:07] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 23 ms returned sat
[2023-04-07 06:32:08] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:08] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:08] [INFO ] After 76ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:08] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-04-07 06:32:08] [INFO ] After 473ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 06:32:08] [INFO ] Invariant cache hit.
[2023-04-07 06:32:08] [INFO ] Implicit Places using invariants in 234 ms returned []
[2023-04-07 06:32:08] [INFO ] Invariant cache hit.
[2023-04-07 06:32:08] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:09] [INFO ] Implicit Places using invariants and state equation in 767 ms returned []
Implicit Place search using SMT with State Equation took 1007 ms to find 0 implicit places.
[2023-04-07 06:32:09] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 06:32:09] [INFO ] Invariant cache hit.
[2023-04-07 06:32:09] [INFO ] Dead Transitions using invariants and state equation in 311 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1337 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 14 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 06:32:09] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 06:32:09] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 06:32:09] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 06:32:09] [INFO ] After 168ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:32:09] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-04-07 06:32:09] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 19 ms returned sat
[2023-04-07 06:32:10] [INFO ] After 126ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:10] [INFO ] After 172ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 33 ms.
[2023-04-07 06:32:10] [INFO ] After 278ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 147 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 124 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 14 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 06:32:10] [INFO ] Computed 24 invariants in 8 ms
[2023-04-07 06:32:10] [INFO ] Implicit Places using invariants in 276 ms returned []
[2023-04-07 06:32:10] [INFO ] Invariant cache hit.
[2023-04-07 06:32:11] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:12] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1810 ms to find 0 implicit places.
[2023-04-07 06:32:12] [INFO ] Invariant cache hit.
[2023-04-07 06:32:12] [INFO ] Dead Transitions using invariants and state equation in 602 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2429 ms. Remains : 531/531 places, 888/888 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 82 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:32:13] [INFO ] Invariant cache hit.
[2023-04-07 06:32:13] [INFO ] [Real]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 06:32:13] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 23 ms returned sat
[2023-04-07 06:32:13] [INFO ] After 109ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:32:13] [INFO ] [Nat]Absence check using 13 positive place invariants in 10 ms returned sat
[2023-04-07 06:32:13] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 13 ms returned sat
[2023-04-07 06:32:13] [INFO ] After 426ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:13] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:14] [INFO ] After 124ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:14] [INFO ] After 261ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-04-07 06:32:14] [INFO ] After 849ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 531 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 531/531 places, 888/888 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 531 transition count 769
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 412 transition count 769
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 110 Pre rules applied. Total rules applied 238 place count 412 transition count 659
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 2 with 220 rules applied. Total rules applied 458 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 459 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 460 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 462 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 464 place count 299 transition count 636
Applied a total of 464 rules in 25 ms. Remains 299 /531 variables (removed 232) and now considering 636/888 (removed 252) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 26 ms. Remains : 299/531 places, 636/888 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1030497 steps, run timeout after 3001 ms. (steps per millisecond=343 ) properties seen :{}
Probabilistic random walk after 1030497 steps, saw 765544 distinct states, run finished after 3003 ms. (steps per millisecond=343 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 06:32:17] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 06:32:17] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 06:32:17] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 06:32:17] [INFO ] After 71ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:32:17] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 06:32:17] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 26 ms returned sat
[2023-04-07 06:32:17] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:17] [INFO ] After 80ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:17] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-04-07 06:32:17] [INFO ] After 463ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 8 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 06:32:17] [INFO ] Invariant cache hit.
[2023-04-07 06:32:18] [INFO ] Implicit Places using invariants in 220 ms returned []
[2023-04-07 06:32:18] [INFO ] Invariant cache hit.
[2023-04-07 06:32:18] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:18] [INFO ] Implicit Places using invariants and state equation in 735 ms returned []
Implicit Place search using SMT with State Equation took 956 ms to find 0 implicit places.
[2023-04-07 06:32:18] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 06:32:18] [INFO ] Invariant cache hit.
[2023-04-07 06:32:19] [INFO ] Dead Transitions using invariants and state equation in 326 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1305 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 1 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 10 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 06:32:19] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 06:32:19] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 06:32:19] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 06:32:19] [INFO ] After 167ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:32:19] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-04-07 06:32:19] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 06:32:19] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:32:19] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 35 ms.
[2023-04-07 06:32:19] [INFO ] After 268ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 140 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 103 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 125 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33431 reset in 335 ms.
Product exploration explored 100000 steps with 33342 reset in 349 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 101 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 531 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Performed 118 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 531 transition count 888
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 110 Pre rules applied. Total rules applied 118 place count 531 transition count 888
Deduced a syphon composed of 228 places in 0 ms
Iterating global reduction 1 with 110 rules applied. Total rules applied 228 place count 531 transition count 888
Deduced a syphon composed of 228 places in 1 ms
Applied a total of 228 rules in 24 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
[2023-04-07 06:32:21] [INFO ] Redundant transitions in 7 ms returned []
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 06:32:21] [INFO ] Computed 24 invariants in 7 ms
[2023-04-07 06:32:21] [INFO ] Dead Transitions using invariants and state equation in 733 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 531/531 places, 888/888 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 773 ms. Remains : 531/531 places, 888/888 transitions.
Built C files in :
/tmp/ltsmin3247180710520218343
[2023-04-07 06:32:21] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3247180710520218343
Running compilation step : cd /tmp/ltsmin3247180710520218343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1323 ms.
Running link step : cd /tmp/ltsmin3247180710520218343;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin3247180710520218343;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15746120883123229759.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 531 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 531/531 places, 888/888 transitions.
Applied a total of 0 rules in 16 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
// Phase 1: matrix 888 rows 531 cols
[2023-04-07 06:32:36] [INFO ] Computed 24 invariants in 8 ms
[2023-04-07 06:32:37] [INFO ] Implicit Places using invariants in 291 ms returned []
[2023-04-07 06:32:37] [INFO ] Invariant cache hit.
[2023-04-07 06:32:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:32:38] [INFO ] Implicit Places using invariants and state equation in 1505 ms returned []
Implicit Place search using SMT with State Equation took 1798 ms to find 0 implicit places.
[2023-04-07 06:32:38] [INFO ] Invariant cache hit.
[2023-04-07 06:32:39] [INFO ] Dead Transitions using invariants and state equation in 610 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2434 ms. Remains : 531/531 places, 888/888 transitions.
Built C files in :
/tmp/ltsmin10923560662220465910
[2023-04-07 06:32:39] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10923560662220465910
Running compilation step : cd /tmp/ltsmin10923560662220465910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1317 ms.
Running link step : cd /tmp/ltsmin10923560662220465910;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10923560662220465910;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased2810236736975732733.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 06:32:54] [INFO ] Flatten gal took : 21 ms
[2023-04-07 06:32:54] [INFO ] Flatten gal took : 19 ms
[2023-04-07 06:32:54] [INFO ] Time to serialize gal into /tmp/LTL4061641501870791923.gal : 5 ms
[2023-04-07 06:32:54] [INFO ] Time to serialize properties into /tmp/LTL16201239908239608072.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4061641501870791923.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8484963163388007703.hoa' '-atoms' '/tmp/LTL16201239908239608072.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL16201239908239608072.prop.
Loaded 4 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8484963163388007703.hoa
Detected timeout of ITS tools.
[2023-04-07 06:33:09] [INFO ] Flatten gal took : 19 ms
[2023-04-07 06:33:09] [INFO ] Flatten gal took : 19 ms
[2023-04-07 06:33:09] [INFO ] Time to serialize gal into /tmp/LTL9800726692691699222.gal : 5 ms
[2023-04-07 06:33:09] [INFO ] Time to serialize properties into /tmp/LTL8462924933644238722.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9800726692691699222.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8462924933644238722.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G((F((("((next_8==1)&&(ncs_4_3==1))")||(G("((next_20==1)&&(ncs_8_10==1))")))||(X("((next_11==1)&&(p1_7_10==1))"))))||(X(G("((next_1...181
Formula 0 simplified : F(G(!"((next_8==1)&&(ncs_4_3==1))" & F!"((next_20==1)&&(ncs_8_10==1))" & X!"((next_11==1)&&(p1_7_10==1))") & XF!"((next_1==0)||(ncs_...165
Detected timeout of ITS tools.
[2023-04-07 06:33:24] [INFO ] Flatten gal took : 19 ms
[2023-04-07 06:33:24] [INFO ] Applying decomposition
[2023-04-07 06:33:24] [INFO ] Flatten gal took : 20 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8240457522763352848.txt' '-o' '/tmp/graph8240457522763352848.bin' '-w' '/tmp/graph8240457522763352848.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8240457522763352848.bin' '-l' '-1' '-v' '-w' '/tmp/graph8240457522763352848.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:33:24] [INFO ] Decomposing Gal with order
[2023-04-07 06:33:24] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:33:24] [INFO ] Removed a total of 1570 redundant transitions.
[2023-04-07 06:33:24] [INFO ] Flatten gal took : 41 ms
[2023-04-07 06:33:24] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 9 ms.
[2023-04-07 06:33:24] [INFO ] Time to serialize gal into /tmp/LTL4482436435781334852.gal : 8 ms
[2023-04-07 06:33:24] [INFO ] Time to serialize properties into /tmp/LTL5853099846496451049.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4482436435781334852.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5853099846496451049.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F((("((i0.i2.u4.next_8==1)&&(i3.u37.ncs_4_3==1))")||(G("((i0.i2.u10.next_20==1)&&(i14.u231.ncs_8_10==1))")))||(X("((i0.i0.u5.nex...254
Formula 0 simplified : F(G(!"((i0.i2.u4.next_8==1)&&(i3.u37.ncs_4_3==1))" & F!"((i0.i2.u10.next_20==1)&&(i14.u231.ncs_8_10==1))" & X!"((i0.i0.u5.next_11==1...238
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11410824840592408699
[2023-04-07 06:33:40] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11410824840592408699
Running compilation step : cd /tmp/ltsmin11410824840592408699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1306 ms.
Running link step : cd /tmp/ltsmin11410824840592408699;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin11410824840592408699;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>(((LTLAPp0==true)||[]((LTLAPp1==true))||X((LTLAPp2==true))))||X([]((LTLAPp3==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-11-LTLFireability-10 finished in 113347 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 4 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 245 place count 421 transition count 757
Iterating global reduction 0 with 25 rules applied. Total rules applied 270 place count 421 transition count 757
Applied a total of 270 rules in 28 ms. Remains 421 /556 variables (removed 135) and now considering 757/1372 (removed 615) transitions.
// Phase 1: matrix 757 rows 421 cols
[2023-04-07 06:33:55] [INFO ] Computed 25 invariants in 8 ms
[2023-04-07 06:33:55] [INFO ] Implicit Places using invariants in 454 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 455 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/556 places, 757/1372 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 9 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2023-04-07 06:33:55] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 06:33:55] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-04-07 06:33:55] [INFO ] Invariant cache hit.
[2023-04-07 06:33:56] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:33:56] [INFO ] Implicit Places using invariants and state equation in 781 ms returned []
Implicit Place search using SMT with State Equation took 1027 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/556 places, 638/1372 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1519 ms. Remains : 301/556 places, 638/1372 transitions.
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s17 1) (EQ s45 1))) (NOT (AND (EQ s28 1) (EQ s34 1)))), p0:(AND (EQ s28 1) (EQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 149 ms.
Product exploration explored 100000 steps with 0 reset in 201 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 74 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:33:57] [INFO ] Invariant cache hit.
[2023-04-07 06:33:57] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 06:33:57] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 17 ms returned sat
[2023-04-07 06:33:57] [INFO ] After 269ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:33:57] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 06:33:57] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 14 ms returned sat
[2023-04-07 06:33:57] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:33:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:33:57] [INFO ] After 98ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:33:57] [INFO ] After 160ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-04-07 06:33:57] [INFO ] After 449ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 638/638 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 301 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 300 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 299 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 298 transition count 615
Applied a total of 6 rules in 18 ms. Remains 298 /301 variables (removed 3) and now considering 615/638 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 18 ms. Remains : 298/301 places, 615/638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21893 steps, run visited all 1 properties in 53 ms. (steps per millisecond=413 )
Probabilistic random walk after 21893 steps, saw 18041 distinct states, run finished after 53 ms. (steps per millisecond=413 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 135 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 62 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 7 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 06:33:58] [INFO ] Invariant cache hit.
[2023-04-07 06:33:58] [INFO ] Implicit Places using invariants in 226 ms returned []
[2023-04-07 06:33:58] [INFO ] Invariant cache hit.
[2023-04-07 06:33:58] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:33:59] [INFO ] Implicit Places using invariants and state equation in 761 ms returned []
Implicit Place search using SMT with State Equation took 991 ms to find 0 implicit places.
[2023-04-07 06:33:59] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 06:33:59] [INFO ] Invariant cache hit.
[2023-04-07 06:33:59] [INFO ] Dead Transitions using invariants and state equation in 331 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1340 ms. Remains : 301/301 places, 638/638 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 72 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:33:59] [INFO ] Invariant cache hit.
[2023-04-07 06:33:59] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 06:33:59] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 06:34:00] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:34:00] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 06:34:00] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 8 ms returned sat
[2023-04-07 06:34:00] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:34:00] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:34:00] [INFO ] After 103ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:34:00] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 37 ms.
[2023-04-07 06:34:00] [INFO ] After 443ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 301 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 301/301 places, 638/638 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 301 transition count 637
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 300 transition count 637
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 299 transition count 616
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 299 transition count 616
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 5 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 6 place count 298 transition count 615
Applied a total of 6 rules in 20 ms. Remains 298 /301 variables (removed 3) and now considering 615/638 (removed 23) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 21 ms. Remains : 298/301 places, 615/638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 21893 steps, run visited all 1 properties in 52 ms. (steps per millisecond=421 )
Probabilistic random walk after 21893 steps, saw 18041 distinct states, run finished after 53 ms. (steps per millisecond=413 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND p0 (NOT p1))), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 5 factoid took 107 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 58 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 52 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Stuttering acceptance computed with spot in 77 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 161 ms.
Built C files in :
/tmp/ltsmin3101029787628191018
[2023-04-07 06:34:01] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2023-04-07 06:34:01] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:34:01] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2023-04-07 06:34:01] [INFO ] Computation of Complete enable matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:34:01] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2023-04-07 06:34:01] [INFO ] Computation of Completed DNA matrix. took 19 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:34:01] [INFO ] Built C files in 135ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3101029787628191018
Running compilation step : cd /tmp/ltsmin3101029787628191018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1452 ms.
Running link step : cd /tmp/ltsmin3101029787628191018;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin3101029787628191018;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6147799622102651459.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 6 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 06:34:16] [INFO ] Invariant cache hit.
[2023-04-07 06:34:16] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-04-07 06:34:16] [INFO ] Invariant cache hit.
[2023-04-07 06:34:16] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:34:17] [INFO ] Implicit Places using invariants and state equation in 815 ms returned []
Implicit Place search using SMT with State Equation took 1070 ms to find 0 implicit places.
[2023-04-07 06:34:17] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 06:34:17] [INFO ] Invariant cache hit.
[2023-04-07 06:34:17] [INFO ] Dead Transitions using invariants and state equation in 351 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1439 ms. Remains : 301/301 places, 638/638 transitions.
Built C files in :
/tmp/ltsmin7573518303371870507
[2023-04-07 06:34:17] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2023-04-07 06:34:17] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:34:17] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2023-04-07 06:34:17] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:34:17] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2023-04-07 06:34:17] [INFO ] Computation of Completed DNA matrix. took 10 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:34:17] [INFO ] Built C files in 89ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7573518303371870507
Running compilation step : cd /tmp/ltsmin7573518303371870507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1503 ms.
Running link step : cd /tmp/ltsmin7573518303371870507;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin7573518303371870507;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased6830582326696285492.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 06:34:33] [INFO ] Flatten gal took : 16 ms
[2023-04-07 06:34:33] [INFO ] Flatten gal took : 20 ms
[2023-04-07 06:34:33] [INFO ] Time to serialize gal into /tmp/LTL1226294978696506949.gal : 3 ms
[2023-04-07 06:34:33] [INFO ] Time to serialize properties into /tmp/LTL4889763629230094486.prop : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1226294978696506949.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7509748459229013824.hoa' '-atoms' '/tmp/LTL4889763629230094486.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4889763629230094486.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7509748459229013824.hoa
Detected timeout of ITS tools.
[2023-04-07 06:34:48] [INFO ] Flatten gal took : 16 ms
[2023-04-07 06:34:48] [INFO ] Flatten gal took : 16 ms
[2023-04-07 06:34:48] [INFO ] Time to serialize gal into /tmp/LTL1342606790960314878.gal : 5 ms
[2023-04-07 06:34:48] [INFO ] Time to serialize properties into /tmp/LTL2070367127704884737.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1342606790960314878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL2070367127704884737.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((next_17==1)&&(ncs_0_5==1))"))U((G(!("((next_17==1)&&(ncs_0_5==1))")))||("((!((next_6==1)&&(ncs_10_5==1)))&&(!((next_17==1...180
Formula 0 simplified : FG("((next_17==1)&&(ncs_0_5==1))" M !"((!((next_6==1)&&(ncs_10_5==1)))&&(!((next_17==1)&&(ncs_0_5==1))))")
Detected timeout of ITS tools.
[2023-04-07 06:35:03] [INFO ] Flatten gal took : 18 ms
[2023-04-07 06:35:03] [INFO ] Applying decomposition
[2023-04-07 06:35:03] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph4706863994433740618.txt' '-o' '/tmp/graph4706863994433740618.bin' '-w' '/tmp/graph4706863994433740618.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4706863994433740618.bin' '-l' '-1' '-v' '-w' '/tmp/graph4706863994433740618.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:35:03] [INFO ] Decomposing Gal with order
[2023-04-07 06:35:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:35:03] [INFO ] Removed a total of 1137 redundant transitions.
[2023-04-07 06:35:03] [INFO ] Flatten gal took : 33 ms
[2023-04-07 06:35:03] [INFO ] Fuse similar labels procedure discarded/fused a total of 112 labels/synchronizations in 10 ms.
[2023-04-07 06:35:03] [INFO ] Time to serialize gal into /tmp/LTL11476453297728401397.gal : 4 ms
[2023-04-07 06:35:03] [INFO ] Time to serialize properties into /tmp/LTL7218610928426526726.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11476453297728401397.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7218610928426526726.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i3.u10.next_17==1)&&(u64.ncs_0_5==1))"))U((G(!("((i3.u10.next_17==1)&&(u64.ncs_0_5==1))")))||("((!((i3.u6.next_6==1)&&(i3...226
Formula 0 simplified : FG("((i3.u10.next_17==1)&&(u64.ncs_0_5==1))" M !"((!((i3.u6.next_6==1)&&(i3.u63.ncs_10_5==1)))&&(!((i3.u10.next_17==1)&&(u64.ncs_0_5...164
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14480737032022092410
[2023-04-07 06:35:18] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14480737032022092410
Running compilation step : cd /tmp/ltsmin14480737032022092410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 932 ms.
Running link step : cd /tmp/ltsmin14480737032022092410;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin14480737032022092410;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-11-LTLFireability-11 finished in 98382 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U X(p1))||G(p2)))'
Support contains 6 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 22 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 06:35:33] [INFO ] Computed 25 invariants in 12 ms
[2023-04-07 06:35:34] [INFO ] Implicit Places using invariants in 476 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 477 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 507 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 239 ms :[true, (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p2), (NOT p1), (NOT p1)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p0) p2), acceptance={} source=1 dest: 2}, { cond=(AND p0 p2), acceptance={} source=1 dest: 3}, { cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 5}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 6}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND p2 (NOT p1)), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) p2 (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND p0 p2 (NOT p1)), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=3 dest: 5}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=(NOT p2), acceptance={} source=4 dest: 0}, { cond=p2, acceptance={} source=4 dest: 4}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=5 dest: 5}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=5 dest: 6}], [{ cond=(NOT p1), acceptance={} source=6 dest: 0}]], initial=1, aps=[p0:(OR (AND (EQ s31 1) (EQ s38 1)) (AND (EQ s19 1) (EQ s44 1))), p2:(OR (NEQ s12 1) (NEQ s42 1)), p1:(AND (EQ s19 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 169 ms.
Product exploration explored 100000 steps with 0 reset in 154 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 21 factoid took 193 ms. Reduced automaton from 7 states, 16 edges and 3 AP (stutter sensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Finished Best-First random walk after 3757 steps, including 1 resets, run visited all 1 properties in 3 ms. (steps per millisecond=1252 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p2 (NOT p1)), (X (NOT (AND p0 (NOT p2) (NOT p1)))), (X (NOT (AND (NOT p2) (NOT p1)))), (X (AND (NOT p0) p2 (NOT p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND p2 (NOT p1))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (NOT p1)), (X (NOT (AND p0 p2 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (X (NOT (AND p0 (NOT p2) (NOT p1))))), true, (X (X (NOT (AND (NOT p2) (NOT p1))))), (X (X (AND (NOT p0) p2 (NOT p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X p2)), (X (X (AND p2 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1))))), (X (X (NOT p1))), (X (X (NOT (AND p0 p2 (NOT p1))))), (X (X (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (NOT p2))]
Property proved to be false thanks to negative knowledge :(F (NOT p2))
Knowledge based reduction with 21 factoid took 262 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 0 AP (stutter insensitive).
FORMULA Anderson-PT-11-LTLFireability-12 FALSE TECHNIQUES KNOWLEDGE
Treatment of property Anderson-PT-11-LTLFireability-12 finished in 1642 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X(p0)) U (p1||X((p2||(X(p4)&&p3))))))'
Support contains 7 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 868
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 868
Applied a total of 48 rules in 28 ms. Remains 532 /556 variables (removed 24) and now considering 868/1372 (removed 504) transitions.
// Phase 1: matrix 868 rows 532 cols
[2023-04-07 06:35:35] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 06:35:35] [INFO ] Implicit Places using invariants in 461 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 462 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 868/1372 transitions.
Applied a total of 0 rules in 6 ms. Remains 531 /531 variables (removed 0) and now considering 868/868 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 500 ms. Remains : 531/556 places, 868/1372 transitions.
Stuttering acceptance computed with spot in 235 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p4))), (OR (AND (NOT p0) (NOT p2) (NOT p3)) (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p2) (NOT p4)) (AND (NOT p1) (NOT p2) (NOT p4))), (NOT p0), (AND (NOT p0) (NOT p4)), true, (OR (AND (NOT p1) (NOT p2) (NOT p4)) (AND (NOT p0) (NOT p2) (NOT p4)))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p2) p3), acceptance={} source=1 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3), acceptance={} source=1 dest: 5}], [{ cond=(NOT p0), acceptance={} source=2 dest: 4}], [{ cond=(AND (NOT p0) (NOT p4)), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p2) (NOT p3) (NOT p4)), acceptance={} source=5 dest: 2}, { cond=(AND (NOT p2) p3 (NOT p4)), acceptance={} source=5 dest: 3}, { cond=(AND (NOT p1) (NOT p2) p3 (NOT p4)), acceptance={} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s68 1), p2:(AND (EQ s16 1) (EQ s40 1)), p3:(AND (EQ s24 1) (EQ s90 1)), p0:(AND (EQ s12 1) (EQ s35 1)), p4:(AND (EQ s24 1) (EQ s90 1))], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 3 steps with 0 reset in 1 ms.
FORMULA Anderson-PT-11-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-13 finished in 765 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0||G(p1))&&(G(p1)||F(p2)))))'
Support contains 5 out of 556 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 24 place count 532 transition count 888
Iterating global reduction 0 with 24 rules applied. Total rules applied 48 place count 532 transition count 888
Applied a total of 48 rules in 20 ms. Remains 532 /556 variables (removed 24) and now considering 888/1372 (removed 484) transitions.
// Phase 1: matrix 888 rows 532 cols
[2023-04-07 06:35:35] [INFO ] Computed 25 invariants in 10 ms
[2023-04-07 06:35:36] [INFO ] Implicit Places using invariants in 465 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 467 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 531/556 places, 888/1372 transitions.
Applied a total of 0 rules in 7 ms. Remains 531 /531 variables (removed 0) and now considering 888/888 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 494 ms. Remains : 531/556 places, 888/1372 transitions.
Stuttering acceptance computed with spot in 177 ms :[true, (NOT p2), (OR (AND (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p2) (NOT p1)), (OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2)))]
Running random walk in product with property : Anderson-PT-11-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 1}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=5 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=5 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=2, aps=[p2:(OR (EQ s25 0) (EQ s36 0)), p1:(AND (EQ s25 1) (EQ s40 1)), p0:(AND (EQ s27 1) (EQ s38 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA Anderson-PT-11-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property Anderson-PT-11-LTLFireability-14 finished in 697 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Support contains 3 out of 556 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 25 places :
Symmetric choice reduction at 0 with 25 rule applications. Total rules 245 place count 421 transition count 757
Iterating global reduction 0 with 25 rules applied. Total rules applied 270 place count 421 transition count 757
Applied a total of 270 rules in 29 ms. Remains 421 /556 variables (removed 135) and now considering 757/1372 (removed 615) transitions.
// Phase 1: matrix 757 rows 421 cols
[2023-04-07 06:35:36] [INFO ] Computed 25 invariants in 11 ms
[2023-04-07 06:35:37] [INFO ] Implicit Places using invariants in 417 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 418 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 420/556 places, 757/1372 transitions.
Drop transitions removed 119 transitions
Trivial Post-agglo rules discarded 119 transitions
Performed 119 trivial Post agglomeration. Transition count delta: 119
Iterating post reduction 0 with 119 rules applied. Total rules applied 119 place count 420 transition count 638
Reduce places removed 119 places and 0 transitions.
Iterating post reduction 1 with 119 rules applied. Total rules applied 238 place count 301 transition count 638
Applied a total of 238 rules in 8 ms. Remains 301 /420 variables (removed 119) and now considering 638/757 (removed 119) transitions.
// Phase 1: matrix 638 rows 301 cols
[2023-04-07 06:35:37] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 06:35:37] [INFO ] Implicit Places using invariants in 238 ms returned []
[2023-04-07 06:35:37] [INFO ] Invariant cache hit.
[2023-04-07 06:35:37] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:35:38] [INFO ] Implicit Places using invariants and state equation in 829 ms returned []
Implicit Place search using SMT with State Equation took 1069 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 301/556 places, 638/1372 transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 1526 ms. Remains : 301/556 places, 638/1372 transitions.
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) p0), (AND (NOT p1) p0)]
Running random walk in product with property : Anderson-PT-11-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(AND (NOT (AND (EQ s22 1) (EQ s44 1) (EQ s22 1) (EQ s37 1))) (NOT (AND (EQ s22 1) (EQ s37 1)))), p0:(AND (EQ s22 1) (EQ s37 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 27 reset in 154 ms.
Product exploration explored 100000 steps with 16 reset in 162 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 79 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND p0 (NOT p1)), (AND p0 (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:35:38] [INFO ] Invariant cache hit.
[2023-04-07 06:35:38] [INFO ] After 41ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p1) p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F (AND p0 (NOT p1)))]
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p1), (NOT p1)]
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 14 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 06:35:39] [INFO ] Invariant cache hit.
[2023-04-07 06:35:39] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-04-07 06:35:39] [INFO ] Invariant cache hit.
[2023-04-07 06:35:39] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:35:40] [INFO ] Implicit Places using invariants and state equation in 824 ms returned []
Implicit Place search using SMT with State Equation took 1054 ms to find 0 implicit places.
[2023-04-07 06:35:40] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-07 06:35:40] [INFO ] Invariant cache hit.
[2023-04-07 06:35:40] [INFO ] Dead Transitions using invariants and state equation in 318 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1398 ms. Remains : 301/301 places, 638/638 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 72 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 56 ms :[(NOT p1), (NOT p1)]
Finished random walk after 2330 steps, including 0 resets, run visited all 1 properties in 5 ms. (steps per millisecond=466 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p1, (X p1), (X (X p1))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 3 factoid took 102 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 62 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Stuttering acceptance computed with spot in 60 ms :[(NOT p1), (NOT p1)]
Product exploration explored 100000 steps with 20 reset in 156 ms.
Product exploration explored 100000 steps with 24 reset in 172 ms.
Built C files in :
/tmp/ltsmin7930805049324518511
[2023-04-07 06:35:41] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2023-04-07 06:35:41] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:35:41] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2023-04-07 06:35:41] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:35:41] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2023-04-07 06:35:41] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:35:41] [INFO ] Built C files in 87ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7930805049324518511
Running compilation step : cd /tmp/ltsmin7930805049324518511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1444 ms.
Running link step : cd /tmp/ltsmin7930805049324518511;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin7930805049324518511;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9781361363009394101.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 301 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 301/301 places, 638/638 transitions.
Applied a total of 0 rules in 18 ms. Remains 301 /301 variables (removed 0) and now considering 638/638 (removed 0) transitions.
[2023-04-07 06:35:56] [INFO ] Invariant cache hit.
[2023-04-07 06:35:56] [INFO ] Implicit Places using invariants in 235 ms returned []
[2023-04-07 06:35:56] [INFO ] Invariant cache hit.
[2023-04-07 06:35:56] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:35:57] [INFO ] Implicit Places using invariants and state equation in 875 ms returned []
Implicit Place search using SMT with State Equation took 1111 ms to find 0 implicit places.
[2023-04-07 06:35:57] [INFO ] Redundant transitions in 6 ms returned []
[2023-04-07 06:35:57] [INFO ] Invariant cache hit.
[2023-04-07 06:35:57] [INFO ] Dead Transitions using invariants and state equation in 322 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1464 ms. Remains : 301/301 places, 638/638 transitions.
Built C files in :
/tmp/ltsmin2878160449624635460
[2023-04-07 06:35:57] [INFO ] Computing symmetric may disable matrix : 638 transitions.
[2023-04-07 06:35:57] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:35:57] [INFO ] Computing symmetric may enable matrix : 638 transitions.
[2023-04-07 06:35:57] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:35:57] [INFO ] Computing Do-Not-Accords matrix : 638 transitions.
[2023-04-07 06:35:57] [INFO ] Computation of Completed DNA matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:35:57] [INFO ] Built C files in 102ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2878160449624635460
Running compilation step : cd /tmp/ltsmin2878160449624635460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1435 ms.
Running link step : cd /tmp/ltsmin2878160449624635460;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin2878160449624635460;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14974069644961717688.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 06:36:12] [INFO ] Flatten gal took : 16 ms
[2023-04-07 06:36:12] [INFO ] Flatten gal took : 18 ms
[2023-04-07 06:36:12] [INFO ] Time to serialize gal into /tmp/LTL15668351599498969458.gal : 4 ms
[2023-04-07 06:36:12] [INFO ] Time to serialize properties into /tmp/LTL9893749318159307621.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15668351599498969458.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16356125481130290500.hoa' '-atoms' '/tmp/LTL9893749318159307621.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL9893749318159307621.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16356125481130290500.hoa
Detected timeout of ITS tools.
[2023-04-07 06:36:28] [INFO ] Flatten gal took : 15 ms
[2023-04-07 06:36:28] [INFO ] Flatten gal took : 16 ms
[2023-04-07 06:36:28] [INFO ] Time to serialize gal into /tmp/LTL6697577536817299393.gal : 3 ms
[2023-04-07 06:36:28] [INFO ] Time to serialize properties into /tmp/LTL12842178586249143676.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6697577536817299393.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12842178586249143676.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((next_11==1)&&(ncs_3_10==1))"))U((G(!("((next_11==1)&&(ncs_3_10==1))")))||("((!(((next_11==1)&&(ncs_9_3==1))&&((next_11==1...216
Formula 0 simplified : FG("((next_11==1)&&(ncs_3_10==1))" M !"((!(((next_11==1)&&(ncs_9_3==1))&&((next_11==1)&&(ncs_3_10==1))))&&(!((next_11==1)&&(ncs_3_10...164
Detected timeout of ITS tools.
[2023-04-07 06:36:43] [INFO ] Flatten gal took : 15 ms
[2023-04-07 06:36:43] [INFO ] Applying decomposition
[2023-04-07 06:36:43] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph2120952433812408553.txt' '-o' '/tmp/graph2120952433812408553.bin' '-w' '/tmp/graph2120952433812408553.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph2120952433812408553.bin' '-l' '-1' '-v' '-w' '/tmp/graph2120952433812408553.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:36:43] [INFO ] Decomposing Gal with order
[2023-04-07 06:36:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:36:43] [INFO ] Removed a total of 1189 redundant transitions.
[2023-04-07 06:36:43] [INFO ] Flatten gal took : 32 ms
[2023-04-07 06:36:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 136 labels/synchronizations in 12 ms.
[2023-04-07 06:36:43] [INFO ] Time to serialize gal into /tmp/LTL4740586104859944721.gal : 4 ms
[2023-04-07 06:36:43] [INFO ] Time to serialize properties into /tmp/LTL7533071906813180393.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4740586104859944721.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7533071906813180393.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((!("((i3.u10.next_11==1)&&(i1.u25.ncs_3_10==1))"))U((G(!("((i3.u10.next_11==1)&&(i1.u25.ncs_3_10==1))")))||("((!(((i3.u10.next_...286
Formula 0 simplified : FG("((i3.u10.next_11==1)&&(i1.u25.ncs_3_10==1))" M !"((!(((i3.u10.next_11==1)&&(i4.u41.ncs_9_3==1))&&((i3.u10.next_11==1)&&(i1.u25.n...220
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6455966639826478196
[2023-04-07 06:36:58] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6455966639826478196
Running compilation step : cd /tmp/ltsmin6455966639826478196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 937 ms.
Running link step : cd /tmp/ltsmin6455966639826478196;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin6455966639826478196;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((!(LTLAPp0==true) U ([](!(LTLAPp0==true))||(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-11-LTLFireability-15 finished in 96836 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((p0 U p1) U (!p0&&X(X(G(p2))))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-03
Stuttering acceptance computed with spot in 348 ms :[(OR (NOT p2) p0), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p2), true, (NOT p2), (NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (NOT p2)]
Support contains 5 out of 556 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 244 place count 422 transition count 778
Iterating global reduction 0 with 24 rules applied. Total rules applied 268 place count 422 transition count 778
Applied a total of 268 rules in 29 ms. Remains 422 /556 variables (removed 134) and now considering 778/1372 (removed 594) transitions.
// Phase 1: matrix 778 rows 422 cols
[2023-04-07 06:37:13] [INFO ] Computed 25 invariants in 11 ms
[2023-04-07 06:37:14] [INFO ] Implicit Places using invariants in 462 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 466 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 421/556 places, 778/1372 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 421 transition count 660
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 303 transition count 660
Applied a total of 236 rules in 8 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 06:37:14] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 06:37:14] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-04-07 06:37:14] [INFO ] Invariant cache hit.
[2023-04-07 06:37:14] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:37:15] [INFO ] Implicit Places using invariants and state equation in 1167 ms returned []
Implicit Place search using SMT with State Equation took 1399 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/556 places, 660/1372 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1902 ms. Remains : 303/556 places, 660/1372 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=0 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 7}, { cond=p0, acceptance={0} source=3 dest: 8}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=(NOT p2), acceptance={} source=5 dest: 4}, { cond=p2, acceptance={} source=5 dest: 5}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 2}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=6 dest: 6}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 7}, { cond=(AND p0 p2), acceptance={} source=6 dest: 8}, { cond=(AND p0 (NOT p2)), acceptance={0} source=6 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=7 dest: 4}, { cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=7 dest: 5}], [{ cond=(AND p0 (NOT p2)), acceptance={0} source=8 dest: 0}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=8 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=8 dest: 2}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={0} source=8 dest: 3}, { cond=(AND (NOT p0) p1 p2), acceptance={} source=8 dest: 6}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=8 dest: 7}, { cond=(AND p0 p2), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s27 1) (EQ s34 1)), p1:(AND (EQ s24 1) (EQ s44 1)), p2:(OR (AND (EQ s24 1) (EQ s40 1)) (NOT (AND (EQ s24 1) (EQ s44 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 163 ms.
Product exploration explored 100000 steps with 0 reset in 261 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : []
Knowledge based reduction with 19 factoid took 168 ms. Reduced automaton from 9 states, 28 edges and 3 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Finished Best-First random walk after 1541 steps, including 0 resets, run visited all 1 properties in 2 ms. (steps per millisecond=770 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) (NOT p1) p2), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (AND (NOT p0) (NOT p1))), (X (NOT p0)), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) p2)))), (X (X (NOT (AND p0 p2)))), (X (X (NOT (AND p0 (NOT p2))))), true, (X (X (NOT (AND (NOT p0) p1 p2)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X p2)), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT p0))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) p2)))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 19 factoid took 222 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 91 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 303 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 3 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 06:37:17] [INFO ] Invariant cache hit.
[2023-04-07 06:37:17] [INFO ] Implicit Places using invariants in 232 ms returned []
[2023-04-07 06:37:17] [INFO ] Invariant cache hit.
[2023-04-07 06:37:17] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:37:18] [INFO ] Implicit Places using invariants and state equation in 1306 ms returned []
Implicit Place search using SMT with State Equation took 1544 ms to find 0 implicit places.
[2023-04-07 06:37:18] [INFO ] Invariant cache hit.
[2023-04-07 06:37:18] [INFO ] Dead Transitions using invariants and state equation in 336 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1887 ms. Remains : 303/303 places, 660/660 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Finished Best-First random walk after 3490 steps, including 1 resets, run visited all 1 properties in 4 ms. (steps per millisecond=872 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p2, (X (X p2))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 97 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 92 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 158 ms.
Product exploration explored 100000 steps with 0 reset in 178 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 100 ms :[true, (NOT p2), (NOT p2), (NOT p2)]
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 303 transition count 660
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 2 place count 302 transition count 639
Deduced a syphon composed of 1 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 3 place count 302 transition count 639
Deduced a syphon composed of 1 places in 0 ms
Applied a total of 3 rules in 17 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
[2023-04-07 06:37:20] [INFO ] Redundant transitions in 4 ms returned []
// Phase 1: matrix 639 rows 302 cols
[2023-04-07 06:37:20] [INFO ] Computed 24 invariants in 5 ms
[2023-04-07 06:37:20] [INFO ] Dead Transitions using invariants and state equation in 324 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 302/303 places, 639/660 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 354 ms. Remains : 302/303 places, 639/660 transitions.
Built C files in :
/tmp/ltsmin12899839581524012154
[2023-04-07 06:37:20] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12899839581524012154
Running compilation step : cd /tmp/ltsmin12899839581524012154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 967 ms.
Running link step : cd /tmp/ltsmin12899839581524012154;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin12899839581524012154;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16712608670959007262.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 302 transition count 639
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 302 transition count 639
Applied a total of 2 rules in 6 ms. Remains 302 /303 variables (removed 1) and now considering 639/660 (removed 21) transitions.
// Phase 1: matrix 639 rows 302 cols
[2023-04-07 06:37:35] [INFO ] Computed 24 invariants in 9 ms
[2023-04-07 06:37:35] [INFO ] Implicit Places using invariants in 285 ms returned []
[2023-04-07 06:37:35] [INFO ] Invariant cache hit.
[2023-04-07 06:37:35] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:37:36] [INFO ] Implicit Places using invariants and state equation in 1106 ms returned []
Implicit Place search using SMT with State Equation took 1391 ms to find 0 implicit places.
[2023-04-07 06:37:36] [INFO ] Invariant cache hit.
[2023-04-07 06:37:37] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 302/303 places, 639/660 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1711 ms. Remains : 302/303 places, 639/660 transitions.
Built C files in :
/tmp/ltsmin309698157232281170
[2023-04-07 06:37:37] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin309698157232281170
Running compilation step : cd /tmp/ltsmin309698157232281170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 941 ms.
Running link step : cd /tmp/ltsmin309698157232281170;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin309698157232281170;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1101953112281533328.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 06:37:52] [INFO ] Flatten gal took : 15 ms
[2023-04-07 06:37:52] [INFO ] Flatten gal took : 15 ms
[2023-04-07 06:37:52] [INFO ] Time to serialize gal into /tmp/LTL14802376176650038568.gal : 2 ms
[2023-04-07 06:37:52] [INFO ] Time to serialize properties into /tmp/LTL12388410810769103078.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14802376176650038568.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16383183921370112631.hoa' '-atoms' '/tmp/LTL12388410810769103078.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL12388410810769103078.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16383183921370112631.hoa
Detected timeout of ITS tools.
[2023-04-07 06:38:07] [INFO ] Flatten gal took : 16 ms
[2023-04-07 06:38:07] [INFO ] Flatten gal took : 16 ms
[2023-04-07 06:38:07] [INFO ] Time to serialize gal into /tmp/LTL17135245344695499599.gal : 3 ms
[2023-04-07 06:38:07] [INFO ] Time to serialize properties into /tmp/LTL16354047913021014775.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17135245344695499599.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16354047913021014775.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !(((("((next_16==1)&&(ncs_0_8==1))")U("((next_13==1)&&(ncs_8_5==1))"))U((!("((next_16==1)&&(ncs_0_8==1))"))&&(X(X(G("(((next_13==1)&&(...209
Formula 0 simplified : (!"((next_16==1)&&(ncs_0_8==1))" R !"((next_13==1)&&(ncs_8_5==1))") R ("((next_16==1)&&(ncs_0_8==1))" | XXF!"(((next_13==1)&&(ncs_6_...197
Detected timeout of ITS tools.
[2023-04-07 06:38:22] [INFO ] Flatten gal took : 18 ms
[2023-04-07 06:38:22] [INFO ] Applying decomposition
[2023-04-07 06:38:22] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph12492936115234925646.txt' '-o' '/tmp/graph12492936115234925646.bin' '-w' '/tmp/graph12492936115234925646.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph12492936115234925646.bin' '-l' '-1' '-v' '-w' '/tmp/graph12492936115234925646.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:38:22] [INFO ] Decomposing Gal with order
[2023-04-07 06:38:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:38:22] [INFO ] Removed a total of 1204 redundant transitions.
[2023-04-07 06:38:22] [INFO ] Flatten gal took : 34 ms
[2023-04-07 06:38:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 147 labels/synchronizations in 11 ms.
[2023-04-07 06:38:22] [INFO ] Time to serialize gal into /tmp/LTL7599481912267686743.gal : 4 ms
[2023-04-07 06:38:22] [INFO ] Time to serialize properties into /tmp/LTL9715679988493742708.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7599481912267686743.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9715679988493742708.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !(((("((i5.u12.next_16==1)&&(i13.u17.ncs_0_8==1))")U("((i4.u11.next_13==1)&&(u65.ncs_8_5==1))"))U((!("((i5.u12.next_16==1)&&(i13.u17.n...275
Formula 0 simplified : (!"((i5.u12.next_16==1)&&(i13.u17.ncs_0_8==1))" R !"((i4.u11.next_13==1)&&(u65.ncs_8_5==1))") R ("((i5.u12.next_16==1)&&(i13.u17.ncs...263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin629031839907951356
[2023-04-07 06:38:37] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin629031839907951356
Running compilation step : cd /tmp/ltsmin629031839907951356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1068 ms.
Running link step : cd /tmp/ltsmin629031839907951356;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin629031839907951356;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-11-LTLFireability-03 finished in 99323 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-09
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 556 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 1 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 26 places :
Symmetric choice reduction at 0 with 26 rule applications. Total rules 246 place count 420 transition count 736
Iterating global reduction 0 with 26 rules applied. Total rules applied 272 place count 420 transition count 736
Applied a total of 272 rules in 34 ms. Remains 420 /556 variables (removed 136) and now considering 736/1372 (removed 636) transitions.
// Phase 1: matrix 736 rows 420 cols
[2023-04-07 06:38:53] [INFO ] Computed 25 invariants in 6 ms
[2023-04-07 06:38:53] [INFO ] Implicit Places using invariants in 419 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 420 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 419/556 places, 736/1372 transitions.
Drop transitions removed 120 transitions
Trivial Post-agglo rules discarded 120 transitions
Performed 120 trivial Post agglomeration. Transition count delta: 120
Iterating post reduction 0 with 120 rules applied. Total rules applied 120 place count 419 transition count 616
Reduce places removed 120 places and 0 transitions.
Iterating post reduction 1 with 120 rules applied. Total rules applied 240 place count 299 transition count 616
Applied a total of 240 rules in 8 ms. Remains 299 /419 variables (removed 120) and now considering 616/736 (removed 120) transitions.
// Phase 1: matrix 616 rows 299 cols
[2023-04-07 06:38:53] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 06:38:53] [INFO ] Implicit Places using invariants in 207 ms returned []
[2023-04-07 06:38:53] [INFO ] Invariant cache hit.
[2023-04-07 06:38:53] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:38:54] [INFO ] Implicit Places using invariants and state equation in 866 ms returned []
Implicit Place search using SMT with State Equation took 1074 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 299/556 places, 616/1372 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1536 ms. Remains : 299/556 places, 616/1372 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(OR (NEQ s26 1) (NEQ s44 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, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 148 ms.
Product exploration explored 100000 steps with 0 reset in 165 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 122 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1047202 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Probabilistic random walk after 1047202 steps, saw 783760 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:38:58] [INFO ] Invariant cache hit.
[2023-04-07 06:38:58] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 06:38:58] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 06:38:58] [INFO ] After 252ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:38:58] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 06:38:58] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 06:38:58] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:58] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:38:58] [INFO ] After 167ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:38:58] [INFO ] After 227ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-04-07 06:38:58] [INFO ] After 554ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 616/616 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 298 transition count 615
Applied a total of 2 rules in 14 ms. Remains 298 /299 variables (removed 1) and now considering 615/616 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 298/299 places, 615/616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Finished Best-First random walk after 9990 steps, including 2 resets, run visited all 1 properties in 7 ms. (steps per millisecond=1427 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 97 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 111 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 06:38:59] [INFO ] Invariant cache hit.
[2023-04-07 06:38:59] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-04-07 06:38:59] [INFO ] Invariant cache hit.
[2023-04-07 06:38:59] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:39:00] [INFO ] Implicit Places using invariants and state equation in 859 ms returned []
Implicit Place search using SMT with State Equation took 1092 ms to find 0 implicit places.
[2023-04-07 06:39:00] [INFO ] Invariant cache hit.
[2023-04-07 06:39:00] [INFO ] Dead Transitions using invariants and state equation in 314 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1416 ms. Remains : 299/299 places, 616/616 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1038300 steps, run timeout after 3001 ms. (steps per millisecond=345 ) properties seen :{}
Probabilistic random walk after 1038300 steps, saw 777242 distinct states, run finished after 3002 ms. (steps per millisecond=345 ) properties seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:39:03] [INFO ] Invariant cache hit.
[2023-04-07 06:39:03] [INFO ] [Real]Absence check using 13 positive place invariants in 4 ms returned sat
[2023-04-07 06:39:04] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 06:39:04] [INFO ] After 244ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:39:04] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 06:39:04] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 10 ms returned sat
[2023-04-07 06:39:04] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:39:04] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:39:04] [INFO ] After 167ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:39:04] [INFO ] After 230ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 72 ms.
[2023-04-07 06:39:04] [INFO ] After 567ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 616/616 transitions.
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 299 transition count 615
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 298 transition count 615
Applied a total of 2 rules in 13 ms. Remains 298 /299 variables (removed 1) and now considering 615/616 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 14 ms. Remains : 298/299 places, 615/616 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 933125 steps, run visited all 1 properties in 2672 ms. (steps per millisecond=349 )
Probabilistic random walk after 933125 steps, saw 700574 distinct states, run finished after 2674 ms. (steps per millisecond=348 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 2 factoid took 87 ms. Reduced automaton from 4 states, 5 edges and 1 AP (stutter sensitive) to 4 states, 5 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 109 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 125 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 116 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 143 ms.
Product exploration explored 100000 steps with 0 reset in 213 ms.
Applying partial POR strategy [true, true, false, false]
Stuttering acceptance computed with spot in 103 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 10 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 06:39:08] [INFO ] Redundant transitions in 4 ms returned []
[2023-04-07 06:39:08] [INFO ] Invariant cache hit.
[2023-04-07 06:39:08] [INFO ] Dead Transitions using invariants and state equation in 310 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 330 ms. Remains : 299/299 places, 616/616 transitions.
Built C files in :
/tmp/ltsmin15560941531101736087
[2023-04-07 06:39:08] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15560941531101736087
Running compilation step : cd /tmp/ltsmin15560941531101736087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 910 ms.
Running link step : cd /tmp/ltsmin15560941531101736087;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15560941531101736087;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased14531786581608857083.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 299 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 299/299 places, 616/616 transitions.
Applied a total of 0 rules in 9 ms. Remains 299 /299 variables (removed 0) and now considering 616/616 (removed 0) transitions.
[2023-04-07 06:39:23] [INFO ] Invariant cache hit.
[2023-04-07 06:39:24] [INFO ] Implicit Places using invariants in 213 ms returned []
[2023-04-07 06:39:24] [INFO ] Invariant cache hit.
[2023-04-07 06:39:24] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:39:25] [INFO ] Implicit Places using invariants and state equation in 887 ms returned []
Implicit Place search using SMT with State Equation took 1101 ms to find 0 implicit places.
[2023-04-07 06:39:25] [INFO ] Invariant cache hit.
[2023-04-07 06:39:25] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1416 ms. Remains : 299/299 places, 616/616 transitions.
Built C files in :
/tmp/ltsmin8209656053959006679
[2023-04-07 06:39:25] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8209656053959006679
Running compilation step : cd /tmp/ltsmin8209656053959006679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 892 ms.
Running link step : cd /tmp/ltsmin8209656053959006679;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin8209656053959006679;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased5521431056687285189.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-04-07 06:39:40] [INFO ] Flatten gal took : 15 ms
[2023-04-07 06:39:40] [INFO ] Flatten gal took : 18 ms
[2023-04-07 06:39:40] [INFO ] Time to serialize gal into /tmp/LTL14190703630178565718.gal : 2 ms
[2023-04-07 06:39:40] [INFO ] Time to serialize properties into /tmp/LTL13134003306482818996.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14190703630178565718.gal' '-t' 'CGAL' '-hoa' '/tmp/aut18313122532493018647.hoa' '-atoms' '/tmp/LTL13134003306482818996.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL13134003306482818996.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut18313122532493018647.hoa
Detected timeout of ITS tools.
[2023-04-07 06:39:55] [INFO ] Flatten gal took : 14 ms
[2023-04-07 06:39:55] [INFO ] Flatten gal took : 15 ms
[2023-04-07 06:39:55] [INFO ] Time to serialize gal into /tmp/LTL10729893717667858837.gal : 3 ms
[2023-04-07 06:39:55] [INFO ] Time to serialize properties into /tmp/LTL7181506796164163628.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL10729893717667858837.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7181506796164163628.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((next_15!=1)||(ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((next_15!=1)||(ncs_10_8!=1))"
Detected timeout of ITS tools.
[2023-04-07 06:40:10] [INFO ] Flatten gal took : 14 ms
[2023-04-07 06:40:10] [INFO ] Applying decomposition
[2023-04-07 06:40:10] [INFO ] Flatten gal took : 15 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9043055821811181609.txt' '-o' '/tmp/graph9043055821811181609.bin' '-w' '/tmp/graph9043055821811181609.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9043055821811181609.bin' '-l' '-1' '-v' '-w' '/tmp/graph9043055821811181609.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:40:10] [INFO ] Decomposing Gal with order
[2023-04-07 06:40:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:40:10] [INFO ] Removed a total of 1150 redundant transitions.
[2023-04-07 06:40:10] [INFO ] Flatten gal took : 29 ms
[2023-04-07 06:40:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 79 labels/synchronizations in 9 ms.
[2023-04-07 06:40:10] [INFO ] Time to serialize gal into /tmp/LTL8205205137636880147.gal : 4 ms
[2023-04-07 06:40:10] [INFO ] Time to serialize properties into /tmp/LTL15609771939401193506.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8205205137636880147.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15609771939401193506.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X(X(G("((i3.u11.next_15!=1)||(i1.i1.u77.ncs_10_8!=1))")))))
Formula 0 simplified : XXF!"((i3.u11.next_15!=1)||(i1.i1.u77.ncs_10_8!=1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5466113811793783905
[2023-04-07 06:40:25] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5466113811793783905
Running compilation step : cd /tmp/ltsmin5466113811793783905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 912 ms.
Running link step : cd /tmp/ltsmin5466113811793783905;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin5466113811793783905;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property Anderson-PT-11-LTLFireability-09 finished in 108149 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F((p0||G(p1)||X(p2)))||X(G(p3)))))'
Found a Lengthening insensitive property : Anderson-PT-11-LTLFireability-10
Stuttering acceptance computed with spot in 121 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 556 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 556/556 places, 1372/1372 transitions.
Performed 110 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 110 Pre rules applied. Total rules applied 0 place count 556 transition count 1262
Deduced a syphon composed of 110 places in 0 ms
Reduce places removed 110 places and 0 transitions.
Iterating global reduction 0 with 220 rules applied. Total rules applied 220 place count 446 transition count 1262
Discarding 24 places :
Symmetric choice reduction at 0 with 24 rule applications. Total rules 244 place count 422 transition count 778
Iterating global reduction 0 with 24 rules applied. Total rules applied 268 place count 422 transition count 778
Applied a total of 268 rules in 26 ms. Remains 422 /556 variables (removed 134) and now considering 778/1372 (removed 594) transitions.
// Phase 1: matrix 778 rows 422 cols
[2023-04-07 06:40:41] [INFO ] Computed 25 invariants in 9 ms
[2023-04-07 06:40:41] [INFO ] Implicit Places using invariants in 435 ms returned [0]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 439 ms to find 1 implicit places.
Starting structural reductions in LI_LTL mode, iteration 1 : 421/556 places, 778/1372 transitions.
Drop transitions removed 118 transitions
Trivial Post-agglo rules discarded 118 transitions
Performed 118 trivial Post agglomeration. Transition count delta: 118
Iterating post reduction 0 with 118 rules applied. Total rules applied 118 place count 421 transition count 660
Reduce places removed 118 places and 0 transitions.
Iterating post reduction 1 with 118 rules applied. Total rules applied 236 place count 303 transition count 660
Applied a total of 236 rules in 15 ms. Remains 303 /421 variables (removed 118) and now considering 660/778 (removed 118) transitions.
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 06:40:41] [INFO ] Computed 24 invariants in 4 ms
[2023-04-07 06:40:41] [INFO ] Implicit Places using invariants in 244 ms returned []
[2023-04-07 06:40:41] [INFO ] Invariant cache hit.
[2023-04-07 06:40:42] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:42] [INFO ] Implicit Places using invariants and state equation in 974 ms returned []
Implicit Place search using SMT with State Equation took 1231 ms to find 0 implicit places.
Starting structural reductions in LI_LTL mode, iteration 2 : 303/556 places, 660/1372 transitions.
Finished structural reductions in LI_LTL mode , in 2 iterations and 1711 ms. Remains : 303/556 places, 660/1372 transitions.
Running random walk in product with property : Anderson-PT-11-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p2) (NOT p3)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s19 1) (EQ s39 1)), p2:(AND (EQ s22 1) (EQ s134 1)), p3:(OR (EQ s12 0) (EQ s34 0)), p1:(AND (EQ s31 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33181 reset in 261 ms.
Product exploration explored 100000 steps with 33456 reset in 270 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 95 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 200 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:40:43] [INFO ] Invariant cache hit.
[2023-04-07 06:40:43] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 06:40:43] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 06:40:44] [INFO ] After 262ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:40:44] [INFO ] [Nat]Absence check using 13 positive place invariants in 6 ms returned sat
[2023-04-07 06:40:44] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 06:40:44] [INFO ] After 244ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:44] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:44] [INFO ] After 85ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:44] [INFO ] After 150ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 67 ms.
[2023-04-07 06:40:44] [INFO ] After 536ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 660/660 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 303 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 299 transition count 636
Applied a total of 8 rules in 19 ms. Remains 299 /303 variables (removed 4) and now considering 636/660 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 299/303 places, 636/660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1026535 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1026535 steps, saw 762725 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 06:40:47] [INFO ] Computed 24 invariants in 6 ms
[2023-04-07 06:40:47] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 06:40:47] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 06:40:47] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:40:47] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 06:40:47] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 23 ms returned sat
[2023-04-07 06:40:48] [INFO ] After 191ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:48] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:48] [INFO ] After 79ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:48] [INFO ] After 135ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-04-07 06:40:48] [INFO ] After 455ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 06:40:48] [INFO ] Invariant cache hit.
[2023-04-07 06:40:48] [INFO ] Implicit Places using invariants in 217 ms returned []
[2023-04-07 06:40:48] [INFO ] Invariant cache hit.
[2023-04-07 06:40:48] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:49] [INFO ] Implicit Places using invariants and state equation in 749 ms returned []
Implicit Place search using SMT with State Equation took 978 ms to find 0 implicit places.
[2023-04-07 06:40:49] [INFO ] Redundant transitions in 7 ms returned []
[2023-04-07 06:40:49] [INFO ] Invariant cache hit.
[2023-04-07 06:40:49] [INFO ] Dead Transitions using invariants and state equation in 316 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1312 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 7 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 06:40:49] [INFO ] Computed 24 invariants in 2 ms
[2023-04-07 06:40:49] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 06:40:49] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 06:40:49] [INFO ] After 176ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:40:49] [INFO ] [Nat]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 06:40:49] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 06:40:49] [INFO ] After 124ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:49] [INFO ] After 164ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 06:40:49] [INFO ] After 249ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 165 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 112 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 111 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 5 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 06:40:50] [INFO ] Computed 24 invariants in 8 ms
[2023-04-07 06:40:50] [INFO ] Implicit Places using invariants in 253 ms returned []
[2023-04-07 06:40:50] [INFO ] Invariant cache hit.
[2023-04-07 06:40:50] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:51] [INFO ] Implicit Places using invariants and state equation in 958 ms returned []
Implicit Place search using SMT with State Equation took 1218 ms to find 0 implicit places.
[2023-04-07 06:40:51] [INFO ] Invariant cache hit.
[2023-04-07 06:40:51] [INFO ] Dead Transitions using invariants and state equation in 352 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1576 ms. Remains : 303/303 places, 660/660 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 74 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 108 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 4) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-04-07 06:40:52] [INFO ] Invariant cache hit.
[2023-04-07 06:40:52] [INFO ] [Real]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 06:40:52] [INFO ] [Real]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 06:40:52] [INFO ] After 258ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:40:52] [INFO ] [Nat]Absence check using 13 positive place invariants in 5 ms returned sat
[2023-04-07 06:40:52] [INFO ] [Nat]Absence check using 13 positive and 11 generalized place invariants in 9 ms returned sat
[2023-04-07 06:40:52] [INFO ] After 238ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:52] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:52] [INFO ] After 84ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:52] [INFO ] After 155ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 63 ms.
[2023-04-07 06:40:53] [INFO ] After 527ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 6 out of 303 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 303/303 places, 660/660 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 303 transition count 659
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 302 transition count 659
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 3 place count 301 transition count 638
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 301 transition count 638
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 301 transition count 636
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 8 place count 299 transition count 636
Applied a total of 8 rules in 22 ms. Remains 299 /303 variables (removed 4) and now considering 636/660 (removed 24) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 22 ms. Remains : 299/303 places, 636/660 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1026349 steps, run timeout after 3001 ms. (steps per millisecond=342 ) properties seen :{}
Probabilistic random walk after 1026349 steps, saw 762591 distinct states, run finished after 3001 ms. (steps per millisecond=342 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 636 rows 299 cols
[2023-04-07 06:40:56] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 06:40:56] [INFO ] [Real]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 06:40:56] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 06:40:56] [INFO ] After 66ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:40:56] [INFO ] [Nat]Absence check using 12 positive place invariants in 4 ms returned sat
[2023-04-07 06:40:56] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 26 ms returned sat
[2023-04-07 06:40:56] [INFO ] After 187ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:56] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:56] [INFO ] After 75ms SMT Verify possible using 110 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:56] [INFO ] After 141ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 41 ms.
[2023-04-07 06:40:56] [INFO ] After 457ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 6 out of 299 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 7 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 299/299 places, 636/636 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 299/299 places, 636/636 transitions.
Applied a total of 0 rules in 6 ms. Remains 299 /299 variables (removed 0) and now considering 636/636 (removed 0) transitions.
[2023-04-07 06:40:56] [INFO ] Invariant cache hit.
[2023-04-07 06:40:56] [INFO ] Implicit Places using invariants in 225 ms returned []
[2023-04-07 06:40:56] [INFO ] Invariant cache hit.
[2023-04-07 06:40:57] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:40:57] [INFO ] Implicit Places using invariants and state equation in 748 ms returned []
Implicit Place search using SMT with State Equation took 973 ms to find 0 implicit places.
[2023-04-07 06:40:57] [INFO ] Redundant transitions in 5 ms returned []
[2023-04-07 06:40:57] [INFO ] Invariant cache hit.
[2023-04-07 06:40:57] [INFO ] Dead Transitions using invariants and state equation in 313 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1312 ms. Remains : 299/299 places, 636/636 transitions.
Performed 121 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 121 Pre rules applied. Total rules applied 0 place count 299 transition count 515
Deduced a syphon composed of 121 places in 0 ms
Reduce places removed 121 places and 0 transitions.
Iterating global reduction 0 with 242 rules applied. Total rules applied 242 place count 178 transition count 515
Applied a total of 242 rules in 9 ms. Remains 178 /299 variables (removed 121) and now considering 515/636 (removed 121) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 515 rows 178 cols
[2023-04-07 06:40:57] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 06:40:58] [INFO ] [Real]Absence check using 12 positive place invariants in 3 ms returned sat
[2023-04-07 06:40:58] [INFO ] [Real]Absence check using 12 positive and 12 generalized place invariants in 12 ms returned sat
[2023-04-07 06:40:58] [INFO ] After 171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-04-07 06:40:58] [INFO ] [Nat]Absence check using 12 positive place invariants in 2 ms returned sat
[2023-04-07 06:40:58] [INFO ] [Nat]Absence check using 12 positive and 12 generalized place invariants in 11 ms returned sat
[2023-04-07 06:40:58] [INFO ] After 127ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-04-07 06:40:58] [INFO ] After 167ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 31 ms.
[2023-04-07 06:40:58] [INFO ] After 254ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) p3 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p2) (NOT p3)))), (X (X (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1))))]
False Knowledge obtained : [(F (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (F p0), (F (AND (NOT p0) (NOT p2) (NOT p3)))]
Knowledge based reduction with 4 factoid took 163 ms. Reduced automaton from 3 states, 5 edges and 4 AP (stutter sensitive) to 3 states, 5 edges and 4 AP (stutter sensitive).
Stuttering acceptance computed with spot in 116 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 123 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 33321 reset in 266 ms.
Product exploration explored 100000 steps with 33219 reset in 268 ms.
Applying partial POR strategy [false, true, true]
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p3) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 8 out of 303 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 10 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 06:40:59] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 660 rows 303 cols
[2023-04-07 06:40:59] [INFO ] Computed 24 invariants in 3 ms
[2023-04-07 06:41:00] [INFO ] Dead Transitions using invariants and state equation in 337 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 361 ms. Remains : 303/303 places, 660/660 transitions.
Built C files in :
/tmp/ltsmin15340390040249325235
[2023-04-07 06:41:00] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15340390040249325235
Running compilation step : cd /tmp/ltsmin15340390040249325235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 967 ms.
Running link step : cd /tmp/ltsmin15340390040249325235;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15340390040249325235;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9852351140158590881.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 8 out of 303 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 303/303 places, 660/660 transitions.
Applied a total of 0 rules in 6 ms. Remains 303 /303 variables (removed 0) and now considering 660/660 (removed 0) transitions.
[2023-04-07 06:41:15] [INFO ] Invariant cache hit.
[2023-04-07 06:41:15] [INFO ] Implicit Places using invariants in 265 ms returned []
[2023-04-07 06:41:15] [INFO ] Invariant cache hit.
[2023-04-07 06:41:15] [INFO ] State equation strengthened by 110 read => feed constraints.
[2023-04-07 06:41:16] [INFO ] Implicit Places using invariants and state equation in 999 ms returned []
Implicit Place search using SMT with State Equation took 1265 ms to find 0 implicit places.
[2023-04-07 06:41:16] [INFO ] Invariant cache hit.
[2023-04-07 06:41:16] [INFO ] Dead Transitions using invariants and state equation in 376 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1649 ms. Remains : 303/303 places, 660/660 transitions.
Built C files in :
/tmp/ltsmin11513975657704536946
[2023-04-07 06:41:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11513975657704536946
Running compilation step : cd /tmp/ltsmin11513975657704536946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 1035 ms.
Running link step : cd /tmp/ltsmin11513975657704536946;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin11513975657704536946;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16479369871741802552.hoa' '--buchi-type=spotba'
LTSmin run took 3018 ms.
Treatment of property Anderson-PT-11-LTLFireability-10 finished in 39989 ms.
FORMULA Anderson-PT-11-LTLFireability-10 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((!p0 U (p1||G(!p0))))))'
[2023-04-07 06:41:21] [INFO ] Flatten gal took : 36 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin10279138131730162066
[2023-04-07 06:41:21] [INFO ] Computing symmetric may disable matrix : 1372 transitions.
[2023-04-07 06:41:21] [INFO ] Computation of Complete disable matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:41:21] [INFO ] Applying decomposition
[2023-04-07 06:41:21] [INFO ] Computing symmetric may enable matrix : 1372 transitions.
[2023-04-07 06:41:21] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:41:21] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10930361728908757669.txt' '-o' '/tmp/graph10930361728908757669.bin' '-w' '/tmp/graph10930361728908757669.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10930361728908757669.bin' '-l' '-1' '-v' '-w' '/tmp/graph10930361728908757669.weights' '-q' '0' '-e' '0.001'
[2023-04-07 06:41:21] [INFO ] Decomposing Gal with order
[2023-04-07 06:41:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 06:41:21] [INFO ] Removed a total of 2588 redundant transitions.
[2023-04-07 06:41:21] [INFO ] Flatten gal took : 85 ms
[2023-04-07 06:41:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 130 labels/synchronizations in 15 ms.
[2023-04-07 06:41:21] [INFO ] Computing Do-Not-Accords matrix : 1372 transitions.
[2023-04-07 06:41:21] [INFO ] Time to serialize gal into /tmp/LTLFireability16756268425740643941.gal : 8 ms
[2023-04-07 06:41:21] [INFO ] Time to serialize properties into /tmp/LTLFireability16945805370514921463.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability16756268425740643941.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16945805370514921463.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 4 LTL properties
[2023-04-07 06:41:21] [INFO ] Computation of Completed DNA matrix. took 35 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-04-07 06:41:21] [INFO ] Built C files in 366ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10279138131730162066
Running compilation step : cd /tmp/ltsmin10279138131730162066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '180' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Checking formula 0 : !(((("((i3.i0.u7.next_16==1)&&(i1.u2.ncs_0_8==1))")U("((i2.u6.next_13==1)&&(i7.u104.ncs_8_5==1))"))U((!("((i3.i0.u7.next_16==1)&&(i1.u...281
Formula 0 simplified : (!"((i3.i0.u7.next_16==1)&&(i1.u2.ncs_0_8==1))" R !"((i2.u6.next_13==1)&&(i7.u104.ncs_8_5==1))") R ("((i3.i0.u7.next_16==1)&&(i1.u2....269
Compilation finished in 4633 ms.
Running link step : cd /tmp/ltsmin10279138131730162066;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 73 ms.
Running LTSmin : cd /tmp/ltsmin10279138131730162066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin10279138131730162066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '(((LTLAPp0==true) U (LTLAPp1==true)) U (!(LTLAPp0==true)&&X(X([]((LTLAPp2==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin10279138131730162066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp3==true))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.216: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.216: LTL layer: formula: X(X([]((LTLAPp3==true))))
pins2lts-mc-linux64( 3/ 8), 0.216: "X(X([]((LTLAPp3==true))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 3/ 8), 0.216: Using Spin LTL semantics
pins2lts-mc-linux64( 1/ 8), 0.219: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.224: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.230: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.240: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.258: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.265: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.283: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.285: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.513: DFS-FIFO for weak LTL, using special progress label 1385
pins2lts-mc-linux64( 0/ 8), 0.513: There are 1386 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.513: State length is 557, there are 1377 groups
pins2lts-mc-linux64( 0/ 8), 0.513: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.513: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.513: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.513: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 7/ 8), 0.662: ~1 levels ~960 states ~10520 transitions
pins2lts-mc-linux64( 1/ 8), 0.803: ~1 levels ~1920 states ~20704 transitions
pins2lts-mc-linux64( 3/ 8), 1.017: ~1 levels ~3840 states ~41288 transitions
pins2lts-mc-linux64( 3/ 8), 1.386: ~1 levels ~7680 states ~82344 transitions
pins2lts-mc-linux64( 0/ 8), 2.046: ~1 levels ~15360 states ~164720 transitions
pins2lts-mc-linux64( 0/ 8), 3.209: ~1 levels ~30720 states ~328008 transitions
pins2lts-mc-linux64( 7/ 8), 5.230: ~1 levels ~61440 states ~662936 transitions
pins2lts-mc-linux64( 5/ 8), 8.670: ~1 levels ~122880 states ~1301464 transitions
pins2lts-mc-linux64( 0/ 8), 14.903: ~1 levels ~245760 states ~2586000 transitions
pins2lts-mc-linux64( 0/ 8), 27.287: ~1 levels ~491520 states ~5139952 transitions
pins2lts-mc-linux64( 4/ 8), 51.820: ~1 levels ~983040 states ~10118600 transitions
pins2lts-mc-linux64( 4/ 8), 101.509: ~1 levels ~1966080 states ~20130896 transitions
pins2lts-mc-linux64( 4/ 8), 199.409: ~1 levels ~3932160 states ~39839160 transitions
pins2lts-mc-linux64( 6/ 8), 272.072: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 272.254:
pins2lts-mc-linux64( 0/ 8), 272.254: mean standard work distribution: 12.2% (states) 11.6% (transitions)
pins2lts-mc-linux64( 0/ 8), 272.254:
pins2lts-mc-linux64( 0/ 8), 272.254: Explored 5032603 states 51689374 transitions, fanout: 10.271
pins2lts-mc-linux64( 0/ 8), 272.254: Total exploration time 271.740 sec (271.550 sec minimum, 271.630 sec on average)
pins2lts-mc-linux64( 0/ 8), 272.254: States per second: 18520, Transitions per second: 190216
pins2lts-mc-linux64( 0/ 8), 272.254:
pins2lts-mc-linux64( 0/ 8), 272.254: Progress states detected: 26449278
pins2lts-mc-linux64( 0/ 8), 272.254: Redundant explorations: -80.9726
pins2lts-mc-linux64( 0/ 8), 272.254:
pins2lts-mc-linux64( 0/ 8), 272.254: Queue width: 8B, total height: 34115367, memory: 260.28MB
pins2lts-mc-linux64( 0/ 8), 272.254: Tree memory: 457.8MB, 18.1 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 272.254: Tree fill ratio (roots/leafs): 19.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 272.254: Stored 1414 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 272.254: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 272.254: Est. total memory use: 718.1MB (~1284.3MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10279138131730162066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp3==true))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin10279138131730162066;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X(X([]((LTLAPp3==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-04-07 07:05:57] [INFO ] Applying decomposition
[2023-04-07 07:05:57] [INFO ] Flatten gal took : 281 ms
[2023-04-07 07:05:57] [INFO ] Decomposing Gal with order
[2023-04-07 07:05:57] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-04-07 07:05:58] [INFO ] Removed a total of 1674 redundant transitions.
[2023-04-07 07:05:58] [INFO ] Flatten gal took : 590 ms
[2023-04-07 07:05:58] [INFO ] Fuse similar labels procedure discarded/fused a total of 438 labels/synchronizations in 64 ms.
[2023-04-07 07:05:58] [INFO ] Time to serialize gal into /tmp/LTLFireability2296692613497205389.gal : 31 ms
[2023-04-07 07:05:58] [INFO ] Time to serialize properties into /tmp/LTLFireability3557775909345966096.ltl : 6 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability2296692613497205389.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3557775909345966096.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 4 LTL properties
Checking formula 0 : !(((("((u12.next_16==1)&&(u8.ncs_0_8==1))")U("((u12.next_13==1)&&(u5.ncs_8_5==1))"))U((!("((u12.next_16==1)&&(u8.ncs_0_8==1))"))&&(X(X...244
Formula 0 simplified : (!"((u12.next_16==1)&&(u8.ncs_0_8==1))" R !"((u12.next_13==1)&&(u5.ncs_8_5==1))") R ("((u12.next_16==1)&&(u8.ncs_0_8==1))" | XXF!"((...232
Reverse transition relation is NOT exact ! Due to transitions t2, t4, t5, t12, t14, t52, t70, t74, t90, t103, t104, t107, t109, t110, t111, t112, t115, t11...1802
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 148932 kB
After kill :
MemTotal: 16393216 kB
MemFree: 15937596 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//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
++ perl -pe 's/.*\.//g'
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="Anderson-PT-11"
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 Anderson-PT-11, 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 r517-tall-167987243300060"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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