Execution Chart

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

Trace from the execution

Formatting '/data/fkordon/mcc2024-input.r153-tall-171631151600343.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
...............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is DoubleExponent-PT-004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r153-tall-171631151600343
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 476K
-rw-r--r-- 1 mcc users 7.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 39K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.2K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K May 19 15:46 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.0K May 19 07:16 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:14 LTLFireability.xml
-rw-r--r-- 1 mcc users 9.6K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 102K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 51K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:10 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K May 19 15:25 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 67K May 18 16:42 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 DoubleExponent-PT-004-LTLFireability-00
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-01
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-02
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-03
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-04
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-05
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-06
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-07
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-08
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-09
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-10
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-11
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-12
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-13
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-14
FORMULA_NAME DoubleExponent-PT-004-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1716422528906

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DoubleExponent-PT-004
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-23 00:02:10] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-23 00:02:10] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-23 00:02:10] [INFO ] Load time of PNML (sax parser for PT used): 43 ms
[2024-05-23 00:02:10] [INFO ] Transformed 216 places.
[2024-05-23 00:02:10] [INFO ] Transformed 198 transitions.
[2024-05-23 00:02:10] [INFO ] Parsed PT model containing 216 places and 198 transitions and 558 arcs in 103 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Support contains 40 out of 216 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 216/216 places, 198/198 transitions.
Reduce places removed 4 places and 0 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 4 place count 212 transition count 198
Applied a total of 4 rules in 21 ms. Remains 212 /216 variables (removed 4) and now considering 198/198 (removed 0) transitions.
// Phase 1: matrix 198 rows 212 cols
[2024-05-23 00:02:10] [INFO ] Computed 21 invariants in 13 ms
[2024-05-23 00:02:11] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-23 00:02:11] [INFO ] Invariant cache hit.
[2024-05-23 00:02:11] [INFO ] Implicit Places using invariants and state equation in 268 ms returned [84, 86]
Discarding 2 places :
Implicit Place search using SMT with State Equation took 659 ms to find 2 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 210/216 places, 198/198 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 209 transition count 197
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 209 transition count 197
Applied a total of 2 rules in 33 ms. Remains 209 /210 variables (removed 1) and now considering 197/198 (removed 1) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:02:11] [INFO ] Computed 19 invariants in 6 ms
[2024-05-23 00:02:11] [INFO ] Implicit Places using invariants in 84 ms returned []
[2024-05-23 00:02:11] [INFO ] Invariant cache hit.
[2024-05-23 00:02:11] [INFO ] Implicit Places using invariants and state equation in 261 ms returned []
Implicit Place search using SMT with State Equation took 348 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 209/216 places, 197/198 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 1063 ms. Remains : 209/216 places, 197/198 transitions.
Support contains 40 out of 209 places after structural reductions.
[2024-05-23 00:02:11] [INFO ] Flatten gal took : 35 ms
[2024-05-23 00:02:11] [INFO ] Flatten gal took : 15 ms
[2024-05-23 00:02:11] [INFO ] Input system was already deterministic with 197 transitions.
Support contains 39 out of 209 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 331 resets, run finished after 441 ms. (steps per millisecond=22 ) properties (out of 28) seen :9
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 21 ms. (steps per millisecond=47 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 32 ms. (steps per millisecond=31 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 24 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 26 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 24 ms. (steps per millisecond=41 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 29 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 25 ms. (steps per millisecond=40 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 29 ms. (steps per millisecond=34 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 29 resets, run finished after 27 ms. (steps per millisecond=37 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 31 resets, run finished after 28 ms. (steps per millisecond=35 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 34 ms. (steps per millisecond=29 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 27 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 30 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 28 resets, run finished after 26 ms. (steps per millisecond=38 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 25 resets, run finished after 23 ms. (steps per millisecond=43 ) properties (out of 19) seen :0
Running SMT prover for 19 properties.
[2024-05-23 00:02:12] [INFO ] Invariant cache hit.
[2024-05-23 00:02:13] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:13] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-23 00:02:13] [INFO ] After 308ms SMT Verify possible using state equation in real domain returned unsat :0 sat :18 real:1
[2024-05-23 00:02:13] [INFO ] Deduced a trap composed of 55 places in 62 ms of which 6 ms to minimize.
[2024-05-23 00:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-23 00:02:13] [INFO ] Deduced a trap composed of 41 places in 69 ms of which 1 ms to minimize.
[2024-05-23 00:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 90 ms
[2024-05-23 00:02:13] [INFO ] Deduced a trap composed of 43 places in 46 ms of which 0 ms to minimize.
[2024-05-23 00:02:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-23 00:02:14] [INFO ] After 947ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :5 real:14
Attempting to minimize the solution found.
Minimization took 75 ms.
[2024-05-23 00:02:14] [INFO ] After 1234ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :4 real:15
[2024-05-23 00:02:14] [INFO ] [Nat]Absence check using 2 positive place invariants in 26 ms returned sat
[2024-05-23 00:02:14] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 6 ms returned sat
[2024-05-23 00:02:14] [INFO ] After 317ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :19
[2024-05-23 00:02:14] [INFO ] Deduced a trap composed of 55 places in 54 ms of which 1 ms to minimize.
[2024-05-23 00:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-23 00:02:14] [INFO ] Deduced a trap composed of 43 places in 55 ms of which 0 ms to minimize.
[2024-05-23 00:02:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2024-05-23 00:02:15] [INFO ] After 847ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :19
Attempting to minimize the solution found.
Minimization took 249 ms.
[2024-05-23 00:02:15] [INFO ] After 1350ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :19
Parikh walk visited 0 properties in 359 ms.
Support contains 27 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 31 transitions
Trivial Post-agglo rules discarded 31 transitions
Performed 31 trivial Post agglomeration. Transition count delta: 31
Iterating post reduction 0 with 32 rules applied. Total rules applied 33 place count 207 transition count 164
Reduce places removed 31 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 34 rules applied. Total rules applied 67 place count 176 transition count 161
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 70 place count 173 transition count 161
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 70 place count 173 transition count 153
Deduced a syphon composed of 8 places in 1 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 86 place count 165 transition count 153
Performed 29 Post agglomeration using F-continuation condition.Transition count delta: 29
Deduced a syphon composed of 29 places in 1 ms
Reduce places removed 29 places and 0 transitions.
Iterating global reduction 3 with 58 rules applied. Total rules applied 144 place count 136 transition count 124
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 150 place count 133 transition count 124
Free-agglomeration rule (complex) applied 10 times.
Iterating global reduction 3 with 10 rules applied. Total rules applied 160 place count 133 transition count 114
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 3 with 10 rules applied. Total rules applied 170 place count 123 transition count 114
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 185 place count 123 transition count 114
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 186 place count 122 transition count 113
Applied a total of 186 rules in 52 ms. Remains 122 /209 variables (removed 87) and now considering 113/197 (removed 84) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 52 ms. Remains : 122/209 places, 113/197 transitions.
Incomplete random walk after 10000 steps, including 1261 resets, run finished after 275 ms. (steps per millisecond=36 ) properties (out of 19) seen :3
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 77 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 82 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 76 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 80 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 75 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 84 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 83 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 92 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 78 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 83 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 10 ms. (steps per millisecond=100 ) properties (out of 16) seen :0
Running SMT prover for 16 properties.
// Phase 1: matrix 113 rows 122 cols
[2024-05-23 00:02:16] [INFO ] Computed 19 invariants in 4 ms
[2024-05-23 00:02:16] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:16] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 6 ms returned sat
[2024-05-23 00:02:16] [INFO ] After 125ms SMT Verify possible using state equation in real domain returned unsat :0 sat :12 real:4
[2024-05-23 00:02:16] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:16] [INFO ] After 99ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-23 00:02:16] [INFO ] After 343ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:16
[2024-05-23 00:02:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:16] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-23 00:02:16] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :16
[2024-05-23 00:02:16] [INFO ] After 90ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :16
[2024-05-23 00:02:17] [INFO ] Deduced a trap composed of 58 places in 51 ms of which 1 ms to minimize.
[2024-05-23 00:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 68 ms
[2024-05-23 00:02:17] [INFO ] Deduced a trap composed of 56 places in 47 ms of which 0 ms to minimize.
[2024-05-23 00:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 57 ms
[2024-05-23 00:02:17] [INFO ] Deduced a trap composed of 52 places in 40 ms of which 1 ms to minimize.
[2024-05-23 00:02:17] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 56 ms
[2024-05-23 00:02:17] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :16
Attempting to minimize the solution found.
Minimization took 94 ms.
[2024-05-23 00:02:17] [INFO ] After 775ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :16
Parikh walk visited 0 properties in 214 ms.
Support contains 22 out of 122 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 122/122 places, 113/113 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 122 transition count 112
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 121 transition count 112
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: 4
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 0 with 8 rules applied. Total rules applied 10 place count 117 transition count 108
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 116 transition count 108
Applied a total of 12 rules in 16 ms. Remains 116 /122 variables (removed 6) and now considering 108/113 (removed 5) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 116/122 places, 108/113 transitions.
Incomplete random walk after 10000 steps, including 1284 resets, run finished after 190 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 97 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 84 resets, run finished after 13 ms. (steps per millisecond=76 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 88 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 75 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 78 resets, run finished after 13 ms. (steps per millisecond=77 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 89 resets, run finished after 16 ms. (steps per millisecond=62 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 87 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 95 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 80 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 96 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 85 resets, run finished after 14 ms. (steps per millisecond=71 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1001 steps, including 89 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 91 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Incomplete Best-First random walk after 1000 steps, including 86 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 16) seen :0
Interrupted probabilistic random walk after 302142 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{2=1, 3=1, 4=1, 5=1, 6=1, 7=1, 8=1, 9=1, 10=1, 14=1, 15=1}
Probabilistic random walk after 302142 steps, saw 151100 distinct states, run finished after 3002 ms. (steps per millisecond=100 ) properties seen :11
Running SMT prover for 5 properties.
// Phase 1: matrix 108 rows 116 cols
[2024-05-23 00:02:21] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:02:21] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:21] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-23 00:02:21] [INFO ] After 58ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2024-05-23 00:02:21] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:21] [INFO ] After 42ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:21] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:21] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:21] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 9 ms returned sat
[2024-05-23 00:02:21] [INFO ] After 64ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:21] [INFO ] After 54ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:21] [INFO ] Deduced a trap composed of 16 places in 32 ms of which 0 ms to minimize.
[2024-05-23 00:02:21] [INFO ] Deduced a trap composed of 17 places in 38 ms of which 0 ms to minimize.
[2024-05-23 00:02:21] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 90 ms
[2024-05-23 00:02:21] [INFO ] After 186ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 27 ms.
[2024-05-23 00:02:21] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 68 ms.
Support contains 8 out of 116 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 116/116 places, 108/108 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 116 transition count 106
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 4 place count 114 transition count 106
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 4 place count 114 transition count 105
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 113 transition count 105
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: 7
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 20 place count 106 transition count 98
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 2 with 6 rules applied. Total rules applied 26 place count 103 transition count 98
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 2 with 3 rules applied. Total rules applied 29 place count 103 transition count 95
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 32 place count 100 transition count 95
Partial Free-agglomeration rule applied 3 times.
Drop transitions removed 3 transitions
Iterating global reduction 3 with 3 rules applied. Total rules applied 35 place count 100 transition count 95
Applied a total of 35 rules in 20 ms. Remains 100 /116 variables (removed 16) and now considering 95/108 (removed 13) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 100/116 places, 95/108 transitions.
Incomplete random walk after 10000 steps, including 1298 resets, run finished after 148 ms. (steps per millisecond=67 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 108 ms. (steps per millisecond=92 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 846 resets, run finished after 106 ms. (steps per millisecond=94 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 845 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 852 resets, run finished after 98 ms. (steps per millisecond=102 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 312978 steps, run timeout after 3001 ms. (steps per millisecond=104 ) properties seen :{}
Probabilistic random walk after 312978 steps, saw 156573 distinct states, run finished after 3001 ms. (steps per millisecond=104 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 95 rows 100 cols
[2024-05-23 00:02:25] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:02:25] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:25] [INFO ] [Real]Absence check using 4 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:25] [INFO ] After 49ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:4
[2024-05-23 00:02:25] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:02:25] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:25] [INFO ] After 127ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:25] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:25] [INFO ] [Nat]Absence check using 4 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:25] [INFO ] After 49ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:25] [INFO ] After 33ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:25] [INFO ] Deduced a trap composed of 13 places in 36 ms of which 1 ms to minimize.
[2024-05-23 00:02:25] [INFO ] Deduced a trap composed of 20 places in 30 ms of which 1 ms to minimize.
[2024-05-23 00:02:25] [INFO ] Deduced a trap composed of 14 places in 23 ms of which 1 ms to minimize.
[2024-05-23 00:02:25] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 124 ms
[2024-05-23 00:02:25] [INFO ] Deduced a trap composed of 11 places in 31 ms of which 1 ms to minimize.
[2024-05-23 00:02:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 42 ms
[2024-05-23 00:02:25] [INFO ] After 235ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 32 ms.
[2024-05-23 00:02:25] [INFO ] After 365ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 34 ms.
Support contains 8 out of 100 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 95/95 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 100/100 places, 95/95 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 100/100 places, 95/95 transitions.
Applied a total of 0 rules in 3 ms. Remains 100 /100 variables (removed 0) and now considering 95/95 (removed 0) transitions.
[2024-05-23 00:02:25] [INFO ] Invariant cache hit.
[2024-05-23 00:02:25] [INFO ] Implicit Places using invariants in 67 ms returned [23, 29, 68, 73, 91, 97]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 68 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 94/100 places, 95/95 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 94 transition count 92
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 91 transition count 92
Applied a total of 6 rules in 6 ms. Remains 91 /94 variables (removed 3) and now considering 92/95 (removed 3) transitions.
// Phase 1: matrix 92 rows 91 cols
[2024-05-23 00:02:25] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:02:26] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 00:02:26] [INFO ] Invariant cache hit.
[2024-05-23 00:02:26] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:02:26] [INFO ] Implicit Places using invariants and state equation in 172 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 91/100 places, 92/95 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 304 ms. Remains : 91/100 places, 92/95 transitions.
Incomplete random walk after 10000 steps, including 1464 resets, run finished after 117 ms. (steps per millisecond=85 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 947 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 903 resets, run finished after 73 ms. (steps per millisecond=137 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 899 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 915 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 958 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 374822 steps, run timeout after 3001 ms. (steps per millisecond=124 ) properties seen :{}
Probabilistic random walk after 374822 steps, saw 187450 distinct states, run finished after 3001 ms. (steps per millisecond=124 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-23 00:02:29] [INFO ] Invariant cache hit.
[2024-05-23 00:02:29] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:29] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:29] [INFO ] After 50ms SMT Verify possible using state equation in real domain returned unsat :0 sat :4 real:1
[2024-05-23 00:02:29] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:02:29] [INFO ] After 24ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :4 real:1
[2024-05-23 00:02:29] [INFO ] Deduced a trap composed of 20 places in 37 ms of which 1 ms to minimize.
[2024-05-23 00:02:29] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 46 ms
[2024-05-23 00:02:29] [INFO ] After 92ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1 real:4
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 00:02:29] [INFO ] After 197ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:29] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:29] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:29] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:29] [INFO ] After 28ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 0 ms to minimize.
[2024-05-23 00:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 26 places in 37 ms of which 0 ms to minimize.
[2024-05-23 00:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 45 ms
[2024-05-23 00:02:30] [INFO ] After 149ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 20 ms.
[2024-05-23 00:02:30] [INFO ] After 261ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Parikh walk visited 0 properties in 46 ms.
Support contains 8 out of 91 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 91/91 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 91/91 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 91 /91 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-23 00:02:30] [INFO ] Invariant cache hit.
[2024-05-23 00:02:30] [INFO ] Implicit Places using invariants in 51 ms returned []
[2024-05-23 00:02:30] [INFO ] Invariant cache hit.
[2024-05-23 00:02:30] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:02:30] [INFO ] Implicit Places using invariants and state equation in 174 ms returned []
Implicit Place search using SMT with State Equation took 226 ms to find 0 implicit places.
[2024-05-23 00:02:30] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:02:30] [INFO ] Invariant cache hit.
[2024-05-23 00:02:30] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 288 ms. Remains : 91/91 places, 92/92 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 91 transition count 91
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 90 transition count 91
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 90 transition count 85
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 84 transition count 85
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 17 place count 81 transition count 82
Iterating global reduction 2 with 3 rules applied. Total rules applied 20 place count 81 transition count 82
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 21 place count 81 transition count 81
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 22 place count 80 transition count 81
Applied a total of 22 rules in 10 ms. Remains 80 /91 variables (removed 11) and now considering 81/92 (removed 11) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 81 rows 80 cols
[2024-05-23 00:02:30] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:02:30] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:30] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 00:02:30] [INFO ] After 40ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:3
[2024-05-23 00:02:30] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:02:30] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:30] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:30] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:30] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:30] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:30] [INFO ] After 18ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:30] [INFO ] Deduced a trap composed of 14 places in 25 ms of which 0 ms to minimize.
[2024-05-23 00:02:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 37 ms
[2024-05-23 00:02:30] [INFO ] After 88ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-23 00:02:30] [INFO ] After 194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p1 U X(p2)))))'
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:02:31] [INFO ] Computed 19 invariants in 8 ms
[2024-05-23 00:02:31] [INFO ] Implicit Places using invariants in 81 ms returned []
[2024-05-23 00:02:31] [INFO ] Invariant cache hit.
[2024-05-23 00:02:31] [INFO ] Implicit Places using invariants and state equation in 256 ms returned []
Implicit Place search using SMT with State Equation took 339 ms to find 0 implicit places.
[2024-05-23 00:02:31] [INFO ] Invariant cache hit.
[2024-05-23 00:02:31] [INFO ] Dead Transitions using invariants and state equation in 97 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 442 ms. Remains : 209/209 places, 197/197 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 438 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}, { cond=(AND p0 p1), acceptance={} source=2 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 7}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=4 dest: 3}, { cond=(AND p0 p1 (NOT p2)), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=4 dest: 6}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=4 dest: 7}], [{ cond=(NOT p0), acceptance={} source=5 dest: 0}, { cond=p0, acceptance={} source=5 dest: 5}], [{ cond=(AND p1 (NOT p2)), acceptance={0} source=6 dest: 6}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=6 dest: 7}], [{ cond=(NOT p2), acceptance={} source=7 dest: 0}]], initial=1, aps=[p0:(LT s100 1), p1:(OR (NOT (AND (GEQ s69 1) (GEQ s101 1))) (AND (GEQ s71 1) (GEQ s94 1))), p2:(AND (GEQ s23 1) (GEQ s155 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, null][false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 3566 reset in 224 ms.
Product exploration explored 100000 steps with 3586 reset in 162 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.3 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 168 ms. Reduced automaton from 8 states, 17 edges and 3 AP (stutter sensitive) to 8 states, 14 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 319 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2))]
Incomplete random walk after 10000 steps, including 333 resets, run finished after 248 ms. (steps per millisecond=40 ) properties (out of 10) seen :4
Incomplete Best-First random walk after 10000 steps, including 292 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 290 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 300 resets, run finished after 137 ms. (steps per millisecond=72 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 303 resets, run finished after 120 ms. (steps per millisecond=83 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 118 ms. (steps per millisecond=84 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 299 resets, run finished after 114 ms. (steps per millisecond=87 ) properties (out of 6) seen :0
Running SMT prover for 6 properties.
[2024-05-23 00:02:34] [INFO ] Invariant cache hit.
[2024-05-23 00:02:34] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:02:34] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-23 00:02:34] [INFO ] After 67ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-23 00:02:34] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:34] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-23 00:02:34] [INFO ] After 318ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-23 00:02:34] [INFO ] Deduced a trap composed of 55 places in 42 ms of which 1 ms to minimize.
[2024-05-23 00:02:34] [INFO ] Deduced a trap composed of 52 places in 32 ms of which 0 ms to minimize.
[2024-05-23 00:02:34] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 104 ms
[2024-05-23 00:02:34] [INFO ] After 694ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 197 ms.
[2024-05-23 00:02:35] [INFO ] After 972ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 152
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 164 transition count 149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 161 transition count 149
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 94 place count 161 transition count 138
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 116 place count 150 transition count 138
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 180 place count 118 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 112 transition count 106
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 205 place count 112 transition count 93
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 218 place count 99 transition count 93
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 233 place count 99 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 98 transition count 92
Applied a total of 234 rules in 34 ms. Remains 98 /209 variables (removed 111) and now considering 92/197 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 34 ms. Remains : 98/209 places, 92/197 transitions.
Incomplete random walk after 10000 steps, including 1154 resets, run finished after 145 ms. (steps per millisecond=68 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 646 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 669 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 691 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 779 resets, run finished after 97 ms. (steps per millisecond=103 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 648 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 328885 steps, run timeout after 3001 ms. (steps per millisecond=109 ) properties seen :{}
Probabilistic random walk after 328885 steps, saw 164533 distinct states, run finished after 3001 ms. (steps per millisecond=109 ) properties seen :0
Running SMT prover for 5 properties.
// Phase 1: matrix 92 rows 98 cols
[2024-05-23 00:02:38] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 00:02:38] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:38] [INFO ] [Real]Absence check using 4 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:38] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:38] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:38] [INFO ] [Nat]Absence check using 4 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:38] [INFO ] After 68ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:38] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:39] [INFO ] After 52ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:39] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 1 ms to minimize.
[2024-05-23 00:02:39] [INFO ] Deduced a trap composed of 19 places in 28 ms of which 1 ms to minimize.
[2024-05-23 00:02:39] [INFO ] Deduced a trap composed of 11 places in 34 ms of which 1 ms to minimize.
[2024-05-23 00:02:39] [INFO ] Deduced a trap composed of 11 places in 33 ms of which 0 ms to minimize.
[2024-05-23 00:02:39] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 171 ms
[2024-05-23 00:02:39] [INFO ] Deduced a trap composed of 13 places in 33 ms of which 2 ms to minimize.
[2024-05-23 00:02:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-23 00:02:39] [INFO ] Deduced a trap composed of 4 places in 36 ms of which 3 ms to minimize.
[2024-05-23 00:02:39] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-23 00:02:39] [INFO ] After 393ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-23 00:02:39] [INFO ] After 566ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 56 ms.
Support contains 7 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 4 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 98/98 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 3 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-23 00:02:39] [INFO ] Invariant cache hit.
[2024-05-23 00:02:39] [INFO ] Implicit Places using invariants in 73 ms returned [23, 29, 65, 71, 89, 95]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 74 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/98 places, 92/92 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 90
Applied a total of 4 rules in 5 ms. Remains 90 /92 variables (removed 2) and now considering 90/92 (removed 2) transitions.
// Phase 1: matrix 90 rows 90 cols
[2024-05-23 00:02:39] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:02:39] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 00:02:39] [INFO ] Invariant cache hit.
[2024-05-23 00:02:39] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:39] [INFO ] Implicit Places using invariants and state equation in 168 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/98 places, 90/92 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 305 ms. Remains : 90/98 places, 90/92 transitions.
Incomplete random walk after 10000 steps, including 1120 resets, run finished after 128 ms. (steps per millisecond=78 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 699 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 643 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 707 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 804 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10000 steps, including 685 resets, run finished after 78 ms. (steps per millisecond=128 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 395873 steps, run timeout after 3001 ms. (steps per millisecond=131 ) properties seen :{}
Probabilistic random walk after 395873 steps, saw 198021 distinct states, run finished after 3001 ms. (steps per millisecond=131 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-23 00:02:43] [INFO ] Invariant cache hit.
[2024-05-23 00:02:43] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:43] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:43] [INFO ] After 35ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:43] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 00:02:43] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-23 00:02:43] [INFO ] After 69ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:43] [INFO ] After 65ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:43] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 2 ms to minimize.
[2024-05-23 00:02:43] [INFO ] Deduced a trap composed of 4 places in 31 ms of which 0 ms to minimize.
[2024-05-23 00:02:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 89 ms
[2024-05-23 00:02:43] [INFO ] Deduced a trap composed of 11 places in 27 ms of which 0 ms to minimize.
[2024-05-23 00:02:43] [INFO ] Deduced a trap composed of 19 places in 21 ms of which 0 ms to minimize.
[2024-05-23 00:02:43] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 66 ms
[2024-05-23 00:02:43] [INFO ] Deduced a trap composed of 17 places in 36 ms of which 0 ms to minimize.
[2024-05-23 00:02:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 00:02:43] [INFO ] After 324ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-23 00:02:43] [INFO ] After 492ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 50 ms.
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-23 00:02:43] [INFO ] Invariant cache hit.
[2024-05-23 00:02:43] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 00:02:43] [INFO ] Invariant cache hit.
[2024-05-23 00:02:43] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:44] [INFO ] Implicit Places using invariants and state equation in 171 ms returned []
Implicit Place search using SMT with State Equation took 233 ms to find 0 implicit places.
[2024-05-23 00:02:44] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:02:44] [INFO ] Invariant cache hit.
[2024-05-23 00:02:44] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 298 ms. Remains : 90/90 places, 90/90 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 90 transition count 84
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 82 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 82 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 81 transition count 81
Applied a total of 18 rules in 5 ms. Remains 81 /90 variables (removed 9) and now considering 81/90 (removed 9) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 81 rows 81 cols
[2024-05-23 00:02:44] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:02:44] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:44] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:44] [INFO ] After 37ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-23 00:02:44] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:44] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:44] [INFO ] After 51ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:44] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:02:44] [INFO ] After 41ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-23 00:02:44] [INFO ] Deduced a trap composed of 12 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:02:44] [INFO ] Deduced a trap composed of 5 places in 30 ms of which 0 ms to minimize.
[2024-05-23 00:02:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 83 ms
[2024-05-23 00:02:44] [INFO ] Deduced a trap composed of 6 places in 37 ms of which 1 ms to minimize.
[2024-05-23 00:02:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 50 ms
[2024-05-23 00:02:44] [INFO ] After 219ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 45 ms.
[2024-05-23 00:02:44] [INFO ] After 360ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 p1 (NOT p2)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (AND p0 p1)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2)))), (X (X (NOT p2))), (X (X (AND p1 (NOT p2)))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (G (NOT (AND (NOT p0) (NOT p1) (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p1 (NOT p2)))), (F (NOT (AND p0 (NOT p2)))), (F (NOT (AND p1 (NOT p2)))), (F p2)]
Knowledge based reduction with 15 factoid took 335 ms. Reduced automaton from 8 states, 14 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 277 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 250 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:02:45] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:02:45] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 00:02:45] [INFO ] Invariant cache hit.
[2024-05-23 00:02:45] [INFO ] Implicit Places using invariants and state equation in 246 ms returned []
Implicit Place search using SMT with State Equation took 331 ms to find 0 implicit places.
[2024-05-23 00:02:45] [INFO ] Invariant cache hit.
[2024-05-23 00:02:45] [INFO ] Dead Transitions using invariants and state equation in 99 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 435 ms. Remains : 209/209 places, 197/197 transitions.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.2 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 116 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 274 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Incomplete random walk after 10000 steps, including 318 resets, run finished after 89 ms. (steps per millisecond=112 ) properties (out of 7) seen :4
Incomplete Best-First random walk after 10000 steps, including 304 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 294 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 276 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 3) seen :0
Running SMT prover for 3 properties.
[2024-05-23 00:02:46] [INFO ] Invariant cache hit.
[2024-05-23 00:02:46] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:46] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 5 ms returned sat
[2024-05-23 00:02:46] [INFO ] After 139ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-23 00:02:46] [INFO ] Deduced a trap composed of 55 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:02:46] [INFO ] Deduced a trap composed of 49 places in 29 ms of which 0 ms to minimize.
[2024-05-23 00:02:46] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 105 ms
[2024-05-23 00:02:46] [INFO ] After 272ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:02:46] [INFO ] After 326ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:02:46] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:46] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 4 ms returned sat
[2024-05-23 00:02:47] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 00:02:47] [INFO ] Deduced a trap composed of 18 places in 53 ms of which 0 ms to minimize.
[2024-05-23 00:02:47] [INFO ] Deduced a trap composed of 55 places in 39 ms of which 0 ms to minimize.
[2024-05-23 00:02:47] [INFO ] Deduced a trap composed of 49 places in 44 ms of which 1 ms to minimize.
[2024-05-23 00:02:47] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 192 ms
[2024-05-23 00:02:47] [INFO ] Deduced a trap composed of 41 places in 41 ms of which 0 ms to minimize.
[2024-05-23 00:02:47] [INFO ] Deduced a trap composed of 43 places in 40 ms of which 1 ms to minimize.
[2024-05-23 00:02:47] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 110 ms
[2024-05-23 00:02:47] [INFO ] After 569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 110 ms.
[2024-05-23 00:02:47] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 103 ms.
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 43 transitions
Trivial Post-agglo rules discarded 43 transitions
Performed 43 trivial Post agglomeration. Transition count delta: 43
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 207 transition count 152
Reduce places removed 43 places and 0 transitions.
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 3
Iterating post reduction 1 with 46 rules applied. Total rules applied 91 place count 164 transition count 149
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 94 place count 161 transition count 149
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 11 Pre rules applied. Total rules applied 94 place count 161 transition count 138
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 3 with 22 rules applied. Total rules applied 116 place count 150 transition count 138
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: 32
Deduced a syphon composed of 32 places in 0 ms
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 64 rules applied. Total rules applied 180 place count 118 transition count 106
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 192 place count 112 transition count 106
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 3 with 13 rules applied. Total rules applied 205 place count 112 transition count 93
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 3 with 13 rules applied. Total rules applied 218 place count 99 transition count 93
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 4 with 15 rules applied. Total rules applied 233 place count 99 transition count 93
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 234 place count 98 transition count 92
Applied a total of 234 rules in 19 ms. Remains 98 /209 variables (removed 111) and now considering 92/197 (removed 105) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 98/209 places, 92/197 transitions.
Incomplete random walk after 10000 steps, including 1156 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 677 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 641 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 766 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 582102 steps, run timeout after 3001 ms. (steps per millisecond=193 ) properties seen :{}
Probabilistic random walk after 582102 steps, saw 291222 distinct states, run finished after 3001 ms. (steps per millisecond=193 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 92 rows 98 cols
[2024-05-23 00:02:50] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 00:02:51] [INFO ] [Real]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:51] [INFO ] [Real]Absence check using 4 positive and 15 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:51] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:02:51] [INFO ] [Nat]Absence check using 4 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:51] [INFO ] [Nat]Absence check using 4 positive and 15 generalized place invariants in 5 ms returned sat
[2024-05-23 00:02:51] [INFO ] After 47ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 00:02:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:51] [INFO ] After 32ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-23 00:02:51] [INFO ] Deduced a trap composed of 15 places in 50 ms of which 1 ms to minimize.
[2024-05-23 00:02:51] [INFO ] Deduced a trap composed of 12 places in 36 ms of which 9 ms to minimize.
[2024-05-23 00:02:51] [INFO ] Deduced a trap composed of 19 places in 27 ms of which 1 ms to minimize.
[2024-05-23 00:02:51] [INFO ] Deduced a trap composed of 11 places in 28 ms of which 0 ms to minimize.
[2024-05-23 00:02:51] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 161 ms
[2024-05-23 00:02:51] [INFO ] After 234ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 37 ms.
[2024-05-23 00:02:51] [INFO ] After 363ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 15 ms.
Support contains 7 out of 98 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 98/98 places, 92/92 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 98/98 places, 92/92 transitions.
Applied a total of 0 rules in 2 ms. Remains 98 /98 variables (removed 0) and now considering 92/92 (removed 0) transitions.
[2024-05-23 00:02:51] [INFO ] Invariant cache hit.
[2024-05-23 00:02:51] [INFO ] Implicit Places using invariants in 70 ms returned [23, 29, 65, 71, 89, 95]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 71 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 92/98 places, 92/92 transitions.
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 92 transition count 90
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 90 transition count 90
Applied a total of 4 rules in 5 ms. Remains 90 /92 variables (removed 2) and now considering 90/92 (removed 2) transitions.
// Phase 1: matrix 90 rows 90 cols
[2024-05-23 00:02:51] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:02:51] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:02:51] [INFO ] Invariant cache hit.
[2024-05-23 00:02:51] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:51] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 216 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 90/98 places, 90/92 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 294 ms. Remains : 90/98 places, 90/92 transitions.
Incomplete random walk after 10000 steps, including 1141 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 662 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 668 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 780 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 525885 steps, run timeout after 3001 ms. (steps per millisecond=175 ) properties seen :{}
Probabilistic random walk after 525885 steps, saw 263046 distinct states, run finished after 3001 ms. (steps per millisecond=175 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-23 00:02:54] [INFO ] Invariant cache hit.
[2024-05-23 00:02:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:54] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:55] [INFO ] After 34ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-23 00:02:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:55] [INFO ] After 10ms SMT Verify possible using 9 Read/Feed constraints in real domain returned unsat :0 sat :1 real:2
[2024-05-23 00:02:55] [INFO ] Deduced a trap composed of 19 places in 30 ms of which 0 ms to minimize.
[2024-05-23 00:02:55] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 43 ms
[2024-05-23 00:02:55] [INFO ] After 58ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:02:55] [INFO ] After 136ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:02:55] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:02:55] [INFO ] [Nat]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-23 00:02:55] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 00:02:55] [INFO ] After 37ms SMT Verify possible using 9 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-23 00:02:55] [INFO ] Deduced a trap composed of 12 places in 44 ms of which 0 ms to minimize.
[2024-05-23 00:02:55] [INFO ] Deduced a trap composed of 4 places in 34 ms of which 0 ms to minimize.
[2024-05-23 00:02:55] [INFO ] Deduced a trap composed of 19 places in 31 ms of which 1 ms to minimize.
[2024-05-23 00:02:55] [INFO ] Deduced a trap composed of 15 places in 32 ms of which 2 ms to minimize.
[2024-05-23 00:02:55] [INFO ] Deduced a trap composed of 10 places in 31 ms of which 0 ms to minimize.
[2024-05-23 00:02:55] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 213 ms
[2024-05-23 00:02:55] [INFO ] After 292ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-23 00:02:55] [INFO ] After 406ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 25 ms.
Support contains 7 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 7 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 90/90 places, 90/90 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 90/90 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 90/90 (removed 0) transitions.
[2024-05-23 00:02:55] [INFO ] Invariant cache hit.
[2024-05-23 00:02:55] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-23 00:02:55] [INFO ] Invariant cache hit.
[2024-05-23 00:02:55] [INFO ] State equation strengthened by 9 read => feed constraints.
[2024-05-23 00:02:55] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2024-05-23 00:02:55] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-23 00:02:55] [INFO ] Invariant cache hit.
[2024-05-23 00:02:55] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 287 ms. Remains : 90/90 places, 90/90 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 90 transition count 84
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 84 transition count 84
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 82 transition count 82
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 82 transition count 82
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 18 place count 81 transition count 81
Applied a total of 18 rules in 5 ms. Remains 81 /90 variables (removed 9) and now considering 81/90 (removed 9) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 81 rows 81 cols
[2024-05-23 00:02:55] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:02:55] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:55] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:55] [INFO ] After 36ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-23 00:02:55] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:02:55] [INFO ] After 8ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:02:55] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-23 00:02:55] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:02:55] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:02:55] [INFO ] After 33ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-23 00:02:55] [INFO ] After 21ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-23 00:02:56] [INFO ] Deduced a trap composed of 11 places in 43 ms of which 1 ms to minimize.
[2024-05-23 00:02:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 51 ms
[2024-05-23 00:02:56] [INFO ] Deduced a trap composed of 12 places in 27 ms of which 0 ms to minimize.
[2024-05-23 00:02:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 39 ms
[2024-05-23 00:02:56] [INFO ] After 140ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 25 ms.
[2024-05-23 00:02:56] [INFO ] After 232ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p0 (NOT p2) p1), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (AND p0 p1 (NOT p2))))]
False Knowledge obtained : [(F (NOT (AND p0 p1 (NOT p2)))), (F p2), (F (NOT (AND p1 (NOT p2)))), (F (NOT (AND p0 (NOT p2))))]
Knowledge based reduction with 4 factoid took 210 ms. Reduced automaton from 8 states, 13 edges and 3 AP (stutter sensitive) to 8 states, 13 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 307 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 317 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Stuttering acceptance computed with spot in 371 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Product exploration explored 100000 steps with 3582 reset in 175 ms.
Product exploration explored 100000 steps with 3570 reset in 444 ms.
Applying partial POR strategy [true, false, false, true, false, true, false, true]
Stuttering acceptance computed with spot in 334 ms :[true, (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (AND (NOT p0) (NOT p2)), (NOT p0), (NOT p2), (NOT p2)]
Support contains 7 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.6 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Performed 44 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 44 rules applied. Total rules applied 45 place count 208 transition count 196
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 11 Pre rules applied. Total rules applied 45 place count 208 transition count 202
Deduced a syphon composed of 55 places in 1 ms
Iterating global reduction 1 with 11 rules applied. Total rules applied 56 place count 208 transition count 202
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 60 place count 204 transition count 198
Deduced a syphon composed of 51 places in 0 ms
Iterating global reduction 1 with 4 rules applied. Total rules applied 64 place count 204 transition count 198
Performed 32 Post agglomeration using F-continuation condition.Transition count delta: -6
Deduced a syphon composed of 83 places in 0 ms
Iterating global reduction 1 with 32 rules applied. Total rules applied 96 place count 204 transition count 204
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 97 place count 203 transition count 203
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 1 rules applied. Total rules applied 98 place count 203 transition count 203
Performed 7 Post agglomeration using F-continuation condition.Transition count delta: -38
Deduced a syphon composed of 89 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 105 place count 203 transition count 241
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 112 place count 196 transition count 227
Deduced a syphon composed of 82 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 119 place count 196 transition count 227
Deduced a syphon composed of 82 places in 0 ms
Applied a total of 119 rules in 42 ms. Remains 196 /209 variables (removed 13) and now considering 227/197 (removed -30) transitions.
[2024-05-23 00:02:58] [INFO ] Redundant transitions in 8 ms returned []
// Phase 1: matrix 227 rows 196 cols
[2024-05-23 00:02:58] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 00:02:58] [INFO ] Dead Transitions using invariants and state equation in 101 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 196/209 places, 227/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 160 ms. Remains : 196/209 places, 227/197 transitions.
Built C files in :
/tmp/ltsmin12681341865684077716
[2024-05-23 00:02:58] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12681341865684077716
Running compilation step : cd /tmp/ltsmin12681341865684077716;'/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 436 ms.
Running link step : cd /tmp/ltsmin12681341865684077716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin12681341865684077716;'/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/stateBased11257449137526822699.hoa' '--buchi-type=spotba'
LTSmin run took 84 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-00 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DoubleExponent-PT-004-LTLFireability-00 finished in 28198 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 99 place count 158 transition count 139
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 113 place count 151 transition count 139
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 201 place count 107 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 99
Applied a total of 202 rules in 19 ms. Remains 106 /209 variables (removed 103) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 106 cols
[2024-05-23 00:02:59] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:02:59] [INFO ] Implicit Places using invariants in 75 ms returned []
[2024-05-23 00:02:59] [INFO ] Invariant cache hit.
[2024-05-23 00:02:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:02:59] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 220 ms to find 0 implicit places.
[2024-05-23 00:02:59] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:02:59] [INFO ] Invariant cache hit.
[2024-05-23 00:02:59] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 299 ms. Remains : 106/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(OR (GEQ s89 1) (GEQ s34 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 5 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-01 finished in 347 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)))||(p2&&F(p3))))))'
Support contains 5 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 97 place count 159 transition count 139
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 113 place count 151 transition count 139
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 1 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 187 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 199 place count 108 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 200 place count 107 transition count 101
Applied a total of 200 rules in 20 ms. Remains 107 /209 variables (removed 102) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-23 00:02:59] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:02:59] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:02:59] [INFO ] Invariant cache hit.
[2024-05-23 00:02:59] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:02:59] [INFO ] Implicit Places using invariants and state equation in 138 ms returned []
Implicit Place search using SMT with State Equation took 199 ms to find 0 implicit places.
[2024-05-23 00:02:59] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:02:59] [INFO ] Invariant cache hit.
[2024-05-23 00:02:59] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 107/209 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 107/209 places, 101/197 transitions.
Stuttering acceptance computed with spot in 127 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p1) (NOT p0) (NOT p3))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p2) (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p2) (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}, { cond=(AND p2 (NOT p3) (NOT p1)), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p3) (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p3) (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p2:(GEQ s89 1), p1:(AND (LT s67 1) (LT s23 1)), p0:(LT s23 1), p3:(AND (GEQ s68 1) (GEQ s79 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 12279 reset in 112 ms.
Product exploration explored 100000 steps with 12223 reset in 102 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 321 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 112 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 123 ms :[(OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (OR (AND (NOT p0) (NOT p1) (NOT p2)) (AND (NOT p0) (NOT p1) (NOT p3))), (AND (NOT p0) (NOT p1) (NOT p3))]
Incomplete random walk after 10000 steps, including 1203 resets, run finished after 135 ms. (steps per millisecond=74 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 728 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 736 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 759 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 756 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-23 00:03:00] [INFO ] Invariant cache hit.
[2024-05-23 00:03:00] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:03:00] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:03:01] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-23 00:03:01] [INFO ] [Nat]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:03:01] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:03:01] [INFO ] After 42ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-23 00:03:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:03:01] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :2 sat :2
[2024-05-23 00:03:01] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-23 00:03:01] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-23 00:03:01] [INFO ] After 75ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-23 00:03:01] [INFO ] After 175ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 1 different solutions.
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 305 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 106 transition count 100
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 106 transition count 87
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 93 transition count 87
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 2 with 14 rules applied. Total rules applied 42 place count 93 transition count 87
Applied a total of 42 rules in 9 ms. Remains 93 /107 variables (removed 14) and now considering 87/101 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 93/107 places, 87/101 transitions.
Incomplete random walk after 10000 steps, including 1254 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 838 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 865 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 2) seen :0
Finished probabilistic random walk after 2061 steps, run visited all 2 properties in 15 ms. (steps per millisecond=137 )
Probabilistic random walk after 2061 steps, saw 1061 distinct states, run finished after 15 ms. (steps per millisecond=137 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Found 2 invariant AP formulas.
Knowledge obtained : [(AND (NOT p2) p1 p0 (NOT p3)), (X (NOT (AND (NOT p2) (NOT p1) (NOT p0)))), (X (NOT (AND (NOT p3) (NOT p1) (NOT p0)))), (X (NOT (AND p2 (NOT p3) (NOT p1)))), (X (NOT (AND (NOT p3) (NOT p1) p0))), (X (NOT (AND (NOT p2) (NOT p1) p0))), (X (X (NOT (AND (NOT p2) (NOT p1) (NOT p0))))), (X (X (NOT (AND (NOT p3) (NOT p1) (NOT p0))))), (X (X (NOT (AND p2 (NOT p3) (NOT p1))))), (X (X (NOT (AND (NOT p3) (NOT p1) p0)))), (X (X (NOT (AND (NOT p2) (NOT p1) p0)))), (G (NOT (AND (NOT p1) p2 (NOT p3)))), (G (NOT (AND (NOT p0) (NOT p1) p2 (NOT p3))))]
False Knowledge obtained : [(F (AND p0 (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p3))), (F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 13 factoid took 244 ms. Reduced automaton from 3 states, 8 edges and 4 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 100 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p1) (NOT p2) (NOT p0)), (AND (NOT p1) (NOT p2) (NOT p0))]
Support contains 3 out of 107 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 transitions.
Applied a total of 0 rules in 7 ms. Remains 107 /107 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-23 00:03:01] [INFO ] Invariant cache hit.
[2024-05-23 00:03:01] [INFO ] Implicit Places using invariants in 98 ms returned []
[2024-05-23 00:03:01] [INFO ] Invariant cache hit.
[2024-05-23 00:03:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:03:02] [INFO ] Implicit Places using invariants and state equation in 189 ms returned []
Implicit Place search using SMT with State Equation took 289 ms to find 0 implicit places.
[2024-05-23 00:03:02] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:03:02] [INFO ] Invariant cache hit.
[2024-05-23 00:03:02] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 360 ms. Remains : 107/107 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 321 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 73 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Incomplete random walk after 10000 steps, including 1211 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 764 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:03:02] [INFO ] Invariant cache hit.
[2024-05-23 00:03:02] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:03:02] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:03:02] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:03:02] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:03:02] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:03:02] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:03:02] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:03:02] [INFO ] After 7ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:03:02] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 00:03:02] [INFO ] After 82ms 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 107 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 107/107 places, 101/101 transitions.
Graph (complete) has 305 edges and 107 vertex of which 106 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 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 2 rules applied. Total rules applied 3 place count 106 transition count 99
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 4 place count 105 transition count 99
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 6 place count 104 transition count 98
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 2 with 13 rules applied. Total rules applied 19 place count 104 transition count 85
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 2 with 13 rules applied. Total rules applied 32 place count 91 transition count 85
Partial Free-agglomeration rule applied 14 times.
Drop transitions removed 14 transitions
Iterating global reduction 3 with 14 rules applied. Total rules applied 46 place count 91 transition count 85
Applied a total of 46 rules in 8 ms. Remains 91 /107 variables (removed 16) and now considering 85/101 (removed 16) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 91/107 places, 85/101 transitions.
Incomplete random walk after 10000 steps, including 1289 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 858 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1995 steps, run visited all 1 properties in 9 ms. (steps per millisecond=221 )
Probabilistic random walk after 1995 steps, saw 1028 distinct states, run finished after 9 ms. (steps per millisecond=221 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 (NOT p2) p0), (X (NOT (AND (NOT p1) (NOT p2) (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (X (NOT (AND (NOT p1) (NOT p2) (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p2) p0))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1) (NOT p2))), (F (AND p0 (NOT p1) (NOT p2)))]
Knowledge based reduction with 5 factoid took 117 ms. Reduced automaton from 2 states, 4 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 12275 reset in 88 ms.
Product exploration explored 100000 steps with 12263 reset in 92 ms.
Built C files in :
/tmp/ltsmin6014109437915996951
[2024-05-23 00:03:03] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-23 00:03:03] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:03:03] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-23 00:03:03] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:03:03] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-23 00:03:03] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:03:03] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6014109437915996951
Running compilation step : cd /tmp/ltsmin6014109437915996951;'/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 193 ms.
Running link step : cd /tmp/ltsmin6014109437915996951;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin6014109437915996951;'/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/stateBased3103252758806606643.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 107 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 107/107 places, 101/101 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 107 transition count 100
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 106 transition count 100
Applied a total of 2 rules in 8 ms. Remains 106 /107 variables (removed 1) and now considering 100/101 (removed 1) transitions.
// Phase 1: matrix 100 rows 106 cols
[2024-05-23 00:03:18] [INFO ] Computed 19 invariants in 4 ms
[2024-05-23 00:03:18] [INFO ] Implicit Places using invariants in 71 ms returned []
[2024-05-23 00:03:18] [INFO ] Invariant cache hit.
[2024-05-23 00:03:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:03:18] [INFO ] Implicit Places using invariants and state equation in 156 ms returned []
Implicit Place search using SMT with State Equation took 229 ms to find 0 implicit places.
[2024-05-23 00:03:18] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:03:18] [INFO ] Invariant cache hit.
[2024-05-23 00:03:18] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/107 places, 100/101 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 315 ms. Remains : 106/107 places, 100/101 transitions.
Built C files in :
/tmp/ltsmin974208587061214023
[2024-05-23 00:03:18] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-23 00:03:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:03:18] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-23 00:03:18] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:03:18] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-23 00:03:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:03:18] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin974208587061214023
Running compilation step : cd /tmp/ltsmin974208587061214023;'/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 211 ms.
Running link step : cd /tmp/ltsmin974208587061214023;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin974208587061214023;'/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/stateBased10557115013603988975.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:03:33] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:33] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:03:33] [INFO ] Time to serialize gal into /tmp/LTL12444728850317002145.gal : 2 ms
[2024-05-23 00:03:33] [INFO ] Time to serialize properties into /tmp/LTL7019149578808783876.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/LTL12444728850317002145.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17852215847078418472.hoa' '-atoms' '/tmp/LTL7019149578808783876.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/LTL7019149578808783876.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17852215847078418472.hoa
Detected timeout of ITS tools.
[2024-05-23 00:03:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:48] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:03:48] [INFO ] Time to serialize gal into /tmp/LTL9077981076215850387.gal : 1 ms
[2024-05-23 00:03:48] [INFO ] Time to serialize properties into /tmp/LTL364855491215811158.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/LTL9077981076215850387.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL364855491215811158.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 : !((G(F((("(p135<1)")U(("((p35<1)&&(p135<1))")||(G("(p135<1)"))))||(("(p70>=1)")&&(F("((p36>=1)&&(p54>=1))")))))))
Formula 0 simplified : FG((!"(p70>=1)" | G!"((p36>=1)&&(p54>=1))") & (!"(p135<1)" M !"((p35<1)&&(p135<1))"))
Detected timeout of ITS tools.
[2024-05-23 00:04:03] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:04:03] [INFO ] Applying decomposition
[2024-05-23 00:04:03] [INFO ] Flatten gal took : 6 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/graph13309303261987152155.txt' '-o' '/tmp/graph13309303261987152155.bin' '-w' '/tmp/graph13309303261987152155.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13309303261987152155.bin' '-l' '-1' '-v' '-w' '/tmp/graph13309303261987152155.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:04:03] [INFO ] Decomposing Gal with order
[2024-05-23 00:04:03] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:04:03] [INFO ] Removed a total of 65 redundant transitions.
[2024-05-23 00:04:04] [INFO ] Flatten gal took : 50 ms
[2024-05-23 00:04:04] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 3 ms.
[2024-05-23 00:04:04] [INFO ] Time to serialize gal into /tmp/LTL7112427281989699611.gal : 13 ms
[2024-05-23 00:04:04] [INFO ] Time to serialize properties into /tmp/LTL8482416546955670358.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/LTL7112427281989699611.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8482416546955670358.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((("(i2.i1.u6.p135<1)")U(("((i5.u21.p35<1)&&(i2.i1.u6.p135<1))")||(G("(i2.i1.u6.p135<1)"))))||(("(i6.u30.p70>=1)")&&(F("((i5.u22...189
Formula 0 simplified : FG((!"(i6.u30.p70>=1)" | G!"((i5.u22.p36>=1)&&(i5.u25.p54>=1))") & (!"(i2.i1.u6.p135<1)" M !"((i5.u21.p35<1)&&(i2.i1.u6.p135<1))"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin14536281642588621297
[2024-05-23 00:04:19] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14536281642588621297
Running compilation step : cd /tmp/ltsmin14536281642588621297;'/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 186 ms.
Running link step : cd /tmp/ltsmin14536281642588621297;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin14536281642588621297;'/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)||[]((LTLAPp0==true))))||((LTLAPp2==true)&&<>((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-02 finished in 94603 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:04:34] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 00:04:34] [INFO ] Implicit Places using invariants in 101 ms returned []
[2024-05-23 00:04:34] [INFO ] Invariant cache hit.
[2024-05-23 00:04:34] [INFO ] Implicit Places using invariants and state equation in 234 ms returned []
Implicit Place search using SMT with State Equation took 342 ms to find 0 implicit places.
[2024-05-23 00:04:34] [INFO ] Invariant cache hit.
[2024-05-23 00:04:34] [INFO ] Dead Transitions using invariants and state equation in 107 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 455 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s126 1) (LT s146 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 697 steps with 23 reset in 3 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-03 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-03 finished in 563 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 99 place count 158 transition count 137
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 117 place count 149 transition count 137
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 11 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-23 00:04:34] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 00:04:34] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 00:04:34] [INFO ] Invariant cache hit.
[2024-05-23 00:04:34] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:04:34] [INFO ] Implicit Places using invariants and state equation in 132 ms returned []
Implicit Place search using SMT with State Equation took 206 ms to find 0 implicit places.
[2024-05-23 00:04:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:04:35] [INFO ] Invariant cache hit.
[2024-05-23 00:04:35] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 273 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (GEQ s8 1) (GEQ s30 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 4 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-04 finished in 313 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 48 transitions
Trivial Post-agglo rules discarded 48 transitions
Performed 48 trivial Post agglomeration. Transition count delta: 48
Iterating post reduction 0 with 48 rules applied. Total rules applied 49 place count 207 transition count 147
Reduce places removed 48 places and 0 transitions.
Iterating post reduction 1 with 48 rules applied. Total rules applied 97 place count 159 transition count 147
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 97 place count 159 transition count 138
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 203 place count 106 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 204 place count 105 transition count 99
Applied a total of 204 rules in 18 ms. Remains 105 /209 variables (removed 104) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 105 cols
[2024-05-23 00:04:35] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:04:35] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 00:04:35] [INFO ] Invariant cache hit.
[2024-05-23 00:04:35] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:04:35] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 238 ms to find 0 implicit places.
[2024-05-23 00:04:35] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:04:35] [INFO ] Invariant cache hit.
[2024-05-23 00:04:35] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 105/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 314 ms. Remains : 105/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (LT s52 1) (LT s103 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13888 reset in 169 ms.
Product exploration explored 100000 steps with 13859 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 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 69 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1385 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 783 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Finished probabilistic random walk after 130 steps, run visited all 1 properties in 4 ms. (steps per millisecond=32 )
Probabilistic random walk after 130 steps, saw 71 distinct states, run finished after 5 ms. (steps per millisecond=26 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 88 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 78 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 2 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-23 00:04:36] [INFO ] Invariant cache hit.
[2024-05-23 00:04:36] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:04:36] [INFO ] Invariant cache hit.
[2024-05-23 00:04:36] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:04:36] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-23 00:04:36] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:04:36] [INFO ] Invariant cache hit.
[2024-05-23 00:04:36] [INFO ] Dead Transitions using invariants and state equation in 56 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 105/105 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 105 vertex of which 104 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 1409 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 798 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 130 steps, run visited all 1 properties in 3 ms. (steps per millisecond=43 )
Probabilistic random walk after 130 steps, saw 71 distinct states, run finished after 3 ms. (steps per millisecond=43 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 13923 reset in 94 ms.
Product exploration explored 100000 steps with 13890 reset in 97 ms.
Built C files in :
/tmp/ltsmin10853771221438944582
[2024-05-23 00:04:37] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-23 00:04:37] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:37] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-23 00:04:37] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:37] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-23 00:04:37] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:37] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10853771221438944582
Running compilation step : cd /tmp/ltsmin10853771221438944582;'/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 211 ms.
Running link step : cd /tmp/ltsmin10853771221438944582;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin10853771221438944582;'/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/stateBased11823890896339541599.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 105 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 105/105 places, 99/99 transitions.
Applied a total of 0 rules in 7 ms. Remains 105 /105 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-23 00:04:52] [INFO ] Invariant cache hit.
[2024-05-23 00:04:52] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 00:04:52] [INFO ] Invariant cache hit.
[2024-05-23 00:04:52] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:04:52] [INFO ] Implicit Places using invariants and state equation in 145 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-23 00:04:52] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:04:52] [INFO ] Invariant cache hit.
[2024-05-23 00:04:52] [INFO ] Dead Transitions using invariants and state equation in 50 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 105/105 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin8613800142490175698
[2024-05-23 00:04:52] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-23 00:04:52] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:52] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-23 00:04:52] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:52] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-23 00:04:52] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:04:52] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8613800142490175698
Running compilation step : cd /tmp/ltsmin8613800142490175698;'/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 202 ms.
Running link step : cd /tmp/ltsmin8613800142490175698;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin8613800142490175698;'/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/stateBased9775162143078205920.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:05:07] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:05:07] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:05:07] [INFO ] Time to serialize gal into /tmp/LTL7253927896017036045.gal : 1 ms
[2024-05-23 00:05:07] [INFO ] Time to serialize properties into /tmp/LTL3462297310177429146.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/LTL7253927896017036045.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9109247613228366181.hoa' '-atoms' '/tmp/LTL3462297310177429146.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/LTL3462297310177429146.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9109247613228366181.hoa
Detected timeout of ITS tools.
[2024-05-23 00:05:22] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:05:22] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:05:22] [INFO ] Time to serialize gal into /tmp/LTL3246311002531378970.gal : 1 ms
[2024-05-23 00:05:22] [INFO ] Time to serialize properties into /tmp/LTL12666319279201569113.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/LTL3246311002531378970.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12666319279201569113.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("((p198<1)&&(p98<1))"))))
Formula 0 simplified : FG!"((p198<1)&&(p98<1))"
Detected timeout of ITS tools.
[2024-05-23 00:05:37] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:05:37] [INFO ] Applying decomposition
[2024-05-23 00:05:37] [INFO ] Flatten gal took : 5 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/graph5448713752392016424.txt' '-o' '/tmp/graph5448713752392016424.bin' '-w' '/tmp/graph5448713752392016424.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5448713752392016424.bin' '-l' '-1' '-v' '-w' '/tmp/graph5448713752392016424.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:05:37] [INFO ] Decomposing Gal with order
[2024-05-23 00:05:37] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:05:37] [INFO ] Removed a total of 75 redundant transitions.
[2024-05-23 00:05:37] [INFO ] Flatten gal took : 12 ms
[2024-05-23 00:05:38] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 4 ms.
[2024-05-23 00:05:38] [INFO ] Time to serialize gal into /tmp/LTL8054073604526454274.gal : 3 ms
[2024-05-23 00:05:38] [INFO ] Time to serialize properties into /tmp/LTL8472416115882770316.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/LTL8054073604526454274.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8472416115882770316.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("((i2.u18.p198<1)&&(i3.i2.u37.p98<1))"))))
Formula 0 simplified : FG!"((i2.u18.p198<1)&&(i3.i2.u37.p98<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5653049939596918761
[2024-05-23 00:05:53] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5653049939596918761
Running compilation step : cd /tmp/ltsmin5653049939596918761;'/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 185 ms.
Running link step : cd /tmp/ltsmin5653049939596918761;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin5653049939596918761;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-05 finished in 93070 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 37 Post agglomeration using F-continuation condition.Transition count delta: 37
Deduced a syphon composed of 37 places in 0 ms
Reduce places removed 37 places and 0 transitions.
Iterating global reduction 2 with 74 rules applied. Total rules applied 189 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 107 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 100
Applied a total of 202 rules in 13 ms. Remains 106 /209 variables (removed 103) and now considering 100/197 (removed 97) transitions.
// Phase 1: matrix 100 rows 106 cols
[2024-05-23 00:06:08] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:06:08] [INFO ] Implicit Places using invariants in 66 ms returned []
[2024-05-23 00:06:08] [INFO ] Invariant cache hit.
[2024-05-23 00:06:08] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:06:08] [INFO ] Implicit Places using invariants and state equation in 146 ms returned []
Implicit Place search using SMT with State Equation took 214 ms to find 0 implicit places.
[2024-05-23 00:06:08] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:06:08] [INFO ] Invariant cache hit.
[2024-05-23 00:06:08] [INFO ] Dead Transitions using invariants and state equation in 63 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 100/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 106/209 places, 100/197 transitions.
Stuttering acceptance computed with spot in 41 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(AND (LT s54 1) (LT s64 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 9737 reset in 88 ms.
Product exploration explored 100000 steps with 9711 reset in 140 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-23 00:06:09] [INFO ] Invariant cache hit.
[2024-05-23 00:06:09] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 00:06:09] [INFO ] Invariant cache hit.
[2024-05-23 00:06:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:06:09] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2024-05-23 00:06:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:06:09] [INFO ] Invariant cache hit.
[2024-05-23 00:06:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 274 ms. Remains : 106/106 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 59 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Product exploration explored 100000 steps with 9755 reset in 93 ms.
Product exploration explored 100000 steps with 9746 reset in 99 ms.
Built C files in :
/tmp/ltsmin13246750241220491344
[2024-05-23 00:06:09] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-23 00:06:09] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:06:09] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-23 00:06:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:06:09] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-23 00:06:09] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:06:09] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13246750241220491344
Running compilation step : cd /tmp/ltsmin13246750241220491344;'/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 204 ms.
Running link step : cd /tmp/ltsmin13246750241220491344;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin13246750241220491344;'/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/stateBased18237990595053914419.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 5 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-23 00:06:25] [INFO ] Invariant cache hit.
[2024-05-23 00:06:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 00:06:25] [INFO ] Invariant cache hit.
[2024-05-23 00:06:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:06:25] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 223 ms to find 0 implicit places.
[2024-05-23 00:06:25] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:06:25] [INFO ] Invariant cache hit.
[2024-05-23 00:06:25] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 287 ms. Remains : 106/106 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin17617531113414605184
[2024-05-23 00:06:25] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-23 00:06:25] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:06:25] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-23 00:06:25] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:06:25] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-23 00:06:25] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:06:25] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17617531113414605184
Running compilation step : cd /tmp/ltsmin17617531113414605184;'/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 202 ms.
Running link step : cd /tmp/ltsmin17617531113414605184;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17617531113414605184;'/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/stateBased299784668138882753.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:06:40] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:06:40] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:06:40] [INFO ] Time to serialize gal into /tmp/LTL8117162191810019008.gal : 1 ms
[2024-05-23 00:06:40] [INFO ] Time to serialize properties into /tmp/LTL13870655699462637090.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/LTL8117162191810019008.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16267285713301871280.hoa' '-atoms' '/tmp/LTL13870655699462637090.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/LTL13870655699462637090.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16267285713301871280.hoa
Detected timeout of ITS tools.
[2024-05-23 00:06:55] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:06:55] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:06:55] [INFO ] Time to serialize gal into /tmp/LTL12223981113818054932.gal : 3 ms
[2024-05-23 00:06:55] [INFO ] Time to serialize properties into /tmp/LTL15854807006099946519.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/LTL12223981113818054932.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15854807006099946519.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 : !((F(G("((p20<1)&&(p25<1))"))))
Formula 0 simplified : GF!"((p20<1)&&(p25<1))"
Detected timeout of ITS tools.
[2024-05-23 00:07:10] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:07:10] [INFO ] Applying decomposition
[2024-05-23 00:07:10] [INFO ] Flatten gal took : 4 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/graph6135803794954541969.txt' '-o' '/tmp/graph6135803794954541969.bin' '-w' '/tmp/graph6135803794954541969.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6135803794954541969.bin' '-l' '-1' '-v' '-w' '/tmp/graph6135803794954541969.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:07:10] [INFO ] Decomposing Gal with order
[2024-05-23 00:07:10] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:07:10] [INFO ] Removed a total of 69 redundant transitions.
[2024-05-23 00:07:10] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:07:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-23 00:07:10] [INFO ] Time to serialize gal into /tmp/LTL13829578999588844314.gal : 1 ms
[2024-05-23 00:07:10] [INFO ] Time to serialize properties into /tmp/LTL18141490121618558236.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/LTL13829578999588844314.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18141490121618558236.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...256
Read 1 LTL properties
Checking formula 0 : !((F(G("((i4.u21.p20<1)&&(i6.u31.p25<1))"))))
Formula 0 simplified : GF!"((i4.u21.p20<1)&&(i6.u31.p25<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11369572423460047308
[2024-05-23 00:07:25] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11369572423460047308
Running compilation step : cd /tmp/ltsmin11369572423460047308;'/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 178 ms.
Running link step : cd /tmp/ltsmin11369572423460047308;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11369572423460047308;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-06 finished in 92554 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(F(p1))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 46 transitions
Trivial Post-agglo rules discarded 46 transitions
Performed 46 trivial Post agglomeration. Transition count delta: 46
Iterating post reduction 0 with 46 rules applied. Total rules applied 47 place count 207 transition count 149
Reduce places removed 46 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 47 rules applied. Total rules applied 94 place count 161 transition count 148
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 8 Pre rules applied. Total rules applied 95 place count 160 transition count 140
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 3 with 16 rules applied. Total rules applied 111 place count 152 transition count 140
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 3 with 78 rules applied. Total rules applied 189 place count 113 transition count 101
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 201 place count 107 transition count 101
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 202 place count 106 transition count 100
Applied a total of 202 rules in 14 ms. Remains 106 /209 variables (removed 103) and now considering 100/197 (removed 97) transitions.
// Phase 1: matrix 100 rows 106 cols
[2024-05-23 00:07:40] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:07:40] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 00:07:40] [INFO ] Invariant cache hit.
[2024-05-23 00:07:40] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 00:07:40] [INFO ] Implicit Places using invariants and state equation in 147 ms returned []
Implicit Place search using SMT with State Equation took 210 ms to find 0 implicit places.
[2024-05-23 00:07:40] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:07:40] [INFO ] Invariant cache hit.
[2024-05-23 00:07:41] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 100/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 278 ms. Remains : 106/209 places, 100/197 transitions.
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(LT s36 1), p1:(AND (GEQ s88 1) (GEQ s98 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 13897 reset in 84 ms.
Product exploration explored 100000 steps with 13808 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1416 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 811 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5534 steps, run visited all 1 properties in 18 ms. (steps per millisecond=307 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 19 ms. (steps per millisecond=291 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 121 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 2 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-23 00:07:41] [INFO ] Invariant cache hit.
[2024-05-23 00:07:41] [INFO ] Implicit Places using invariants in 52 ms returned []
[2024-05-23 00:07:41] [INFO ] Invariant cache hit.
[2024-05-23 00:07:41] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 00:07:41] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 203 ms to find 0 implicit places.
[2024-05-23 00:07:41] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:07:41] [INFO ] Invariant cache hit.
[2024-05-23 00:07:42] [INFO ] Dead Transitions using invariants and state equation in 48 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 258 ms. Remains : 106/106 places, 100/100 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 319 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 70 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 81 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 1410 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 823 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Finished probabilistic random walk after 5534 steps, run visited all 1 properties in 16 ms. (steps per millisecond=345 )
Probabilistic random walk after 5534 steps, saw 2797 distinct states, run finished after 17 ms. (steps per millisecond=325 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 13841 reset in 82 ms.
Product exploration explored 100000 steps with 13953 reset in 88 ms.
Built C files in :
/tmp/ltsmin17603084773271150666
[2024-05-23 00:07:42] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-23 00:07:42] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:42] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-23 00:07:42] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:42] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-23 00:07:42] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:42] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17603084773271150666
Running compilation step : cd /tmp/ltsmin17603084773271150666;'/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 201 ms.
Running link step : cd /tmp/ltsmin17603084773271150666;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 27 ms.
Running LTSmin : cd /tmp/ltsmin17603084773271150666;'/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/stateBased10367552019267329703.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 100/100 transitions.
Applied a total of 0 rules in 10 ms. Remains 106 /106 variables (removed 0) and now considering 100/100 (removed 0) transitions.
[2024-05-23 00:07:57] [INFO ] Invariant cache hit.
[2024-05-23 00:07:57] [INFO ] Implicit Places using invariants in 70 ms returned []
[2024-05-23 00:07:57] [INFO ] Invariant cache hit.
[2024-05-23 00:07:58] [INFO ] State equation strengthened by 5 read => feed constraints.
[2024-05-23 00:07:58] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 234 ms to find 0 implicit places.
[2024-05-23 00:07:58] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:07:58] [INFO ] Invariant cache hit.
[2024-05-23 00:07:58] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 320 ms. Remains : 106/106 places, 100/100 transitions.
Built C files in :
/tmp/ltsmin8351162853024342490
[2024-05-23 00:07:58] [INFO ] Computing symmetric may disable matrix : 100 transitions.
[2024-05-23 00:07:58] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:58] [INFO ] Computing symmetric may enable matrix : 100 transitions.
[2024-05-23 00:07:58] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:58] [INFO ] Computing Do-Not-Accords matrix : 100 transitions.
[2024-05-23 00:07:58] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:07:58] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8351162853024342490
Running compilation step : cd /tmp/ltsmin8351162853024342490;'/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 212 ms.
Running link step : cd /tmp/ltsmin8351162853024342490;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin8351162853024342490;'/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/stateBased11310084046240658195.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:08:13] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:08:13] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:08:13] [INFO ] Time to serialize gal into /tmp/LTL8758844422568717589.gal : 1 ms
[2024-05-23 00:08:13] [INFO ] Time to serialize properties into /tmp/LTL11208357708540547834.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/LTL8758844422568717589.gal' '-t' 'CGAL' '-hoa' '/tmp/aut2695193137436935688.hoa' '-atoms' '/tmp/LTL11208357708540547834.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/LTL11208357708540547834.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut2695193137436935688.hoa
Detected timeout of ITS tools.
[2024-05-23 00:08:28] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:08:28] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:08:28] [INFO ] Time to serialize gal into /tmp/LTL16735681711943197537.gal : 0 ms
[2024-05-23 00:08:28] [INFO ] Time to serialize properties into /tmp/LTL6618935311217095974.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/LTL16735681711943197537.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6618935311217095974.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(("(p158<1)")||(G(F("((p71>=1)&&(p89>=1))")))))))
Formula 0 simplified : FG(!"((p71>=1)&&(p89>=1))" & !"(p158<1)")
Detected timeout of ITS tools.
[2024-05-23 00:08:43] [INFO ] Flatten gal took : 10 ms
[2024-05-23 00:08:43] [INFO ] Applying decomposition
[2024-05-23 00:08:43] [INFO ] Flatten gal took : 4 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/graph10340434600195769877.txt' '-o' '/tmp/graph10340434600195769877.bin' '-w' '/tmp/graph10340434600195769877.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10340434600195769877.bin' '-l' '-1' '-v' '-w' '/tmp/graph10340434600195769877.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:08:43] [INFO ] Decomposing Gal with order
[2024-05-23 00:08:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:08:43] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-23 00:08:43] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:08:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-23 00:08:43] [INFO ] Time to serialize gal into /tmp/LTL5613785441427444975.gal : 2 ms
[2024-05-23 00:08:43] [INFO ] Time to serialize properties into /tmp/LTL6402538212853245902.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/LTL5613785441427444975.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6402538212853245902.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(("(i6.i1.u14.p158<1)")||(G(F("((i6.i1.u27.p71>=1)&&(i6.i0.u32.p89>=1))")))))))
Formula 0 simplified : FG(!"((i6.i1.u27.p71>=1)&&(i6.i0.u32.p89>=1))" & !"(i6.i1.u14.p158<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin5438435567456901243
[2024-05-23 00:08:58] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5438435567456901243
Running compilation step : cd /tmp/ltsmin5438435567456901243;'/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 178 ms.
Running link step : cd /tmp/ltsmin5438435567456901243;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin5438435567456901243;'/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))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-07 finished in 92886 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 207 transition count 145
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 157 transition count 145
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 101 place count 157 transition count 138
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 38 Post agglomeration using F-continuation condition.Transition count delta: 38
Deduced a syphon composed of 38 places in 1 ms
Reduce places removed 38 places and 0 transitions.
Iterating global reduction 2 with 76 rules applied. Total rules applied 191 place count 112 transition count 100
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 201 place count 107 transition count 100
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 202 place count 106 transition count 99
Applied a total of 202 rules in 19 ms. Remains 106 /209 variables (removed 103) and now considering 99/197 (removed 98) transitions.
// Phase 1: matrix 99 rows 106 cols
[2024-05-23 00:09:13] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:09:13] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 00:09:13] [INFO ] Invariant cache hit.
[2024-05-23 00:09:13] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:09:13] [INFO ] Implicit Places using invariants and state equation in 139 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-23 00:09:13] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:09:13] [INFO ] Invariant cache hit.
[2024-05-23 00:09:13] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 106/209 places, 99/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 106/209 places, 99/197 transitions.
Stuttering acceptance computed with spot in 43 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s19 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13931 reset in 96 ms.
Product exploration explored 100000 steps with 13918 reset in 103 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.2 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 74 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 29 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1379 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 788 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 10 ms. (steps per millisecond=316 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 10 ms. (steps per millisecond=316 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 103 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 3 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-23 00:09:14] [INFO ] Invariant cache hit.
[2024-05-23 00:09:14] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:09:14] [INFO ] Invariant cache hit.
[2024-05-23 00:09:14] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:09:14] [INFO ] Implicit Places using invariants and state equation in 140 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-23 00:09:14] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:09:14] [INFO ] Invariant cache hit.
[2024-05-23 00:09:14] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 106/106 places, 99/99 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 317 edges and 106 vertex of which 105 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 63 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1392 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 793 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 3164 steps, run visited all 1 properties in 13 ms. (steps per millisecond=243 )
Probabilistic random walk after 3164 steps, saw 1608 distinct states, run finished after 13 ms. (steps per millisecond=243 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 95 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 26 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13964 reset in 85 ms.
Product exploration explored 100000 steps with 13910 reset in 93 ms.
Built C files in :
/tmp/ltsmin9121339636209632742
[2024-05-23 00:09:15] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-23 00:09:15] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:09:15] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-23 00:09:15] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:09:15] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-23 00:09:15] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:09:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9121339636209632742
Running compilation step : cd /tmp/ltsmin9121339636209632742;'/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 209 ms.
Running link step : cd /tmp/ltsmin9121339636209632742;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin9121339636209632742;'/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/stateBased14060480373532263729.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 106 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 106/106 places, 99/99 transitions.
Applied a total of 0 rules in 4 ms. Remains 106 /106 variables (removed 0) and now considering 99/99 (removed 0) transitions.
[2024-05-23 00:09:30] [INFO ] Invariant cache hit.
[2024-05-23 00:09:30] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:09:30] [INFO ] Invariant cache hit.
[2024-05-23 00:09:30] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:09:30] [INFO ] Implicit Places using invariants and state equation in 141 ms returned []
Implicit Place search using SMT with State Equation took 200 ms to find 0 implicit places.
[2024-05-23 00:09:30] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:09:30] [INFO ] Invariant cache hit.
[2024-05-23 00:09:30] [INFO ] Dead Transitions using invariants and state equation in 54 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 266 ms. Remains : 106/106 places, 99/99 transitions.
Built C files in :
/tmp/ltsmin15885821892281198716
[2024-05-23 00:09:30] [INFO ] Computing symmetric may disable matrix : 99 transitions.
[2024-05-23 00:09:30] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:09:30] [INFO ] Computing symmetric may enable matrix : 99 transitions.
[2024-05-23 00:09:30] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:09:30] [INFO ] Computing Do-Not-Accords matrix : 99 transitions.
[2024-05-23 00:09:30] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:09:30] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15885821892281198716
Running compilation step : cd /tmp/ltsmin15885821892281198716;'/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 206 ms.
Running link step : cd /tmp/ltsmin15885821892281198716;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15885821892281198716;'/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/stateBased14965168591424878089.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:09:45] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:09:45] [INFO ] Flatten gal took : 11 ms
[2024-05-23 00:09:45] [INFO ] Time to serialize gal into /tmp/LTL13202376394198876659.gal : 1 ms
[2024-05-23 00:09:45] [INFO ] Time to serialize properties into /tmp/LTL746183178490791246.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/LTL13202376394198876659.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9787000264898302334.hoa' '-atoms' '/tmp/LTL746183178490791246.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/LTL746183178490791246.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9787000264898302334.hoa
Detected timeout of ITS tools.
[2024-05-23 00:10:00] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:10:00] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:10:00] [INFO ] Time to serialize gal into /tmp/LTL16921432483872258478.gal : 1 ms
[2024-05-23 00:10:00] [INFO ] Time to serialize properties into /tmp/LTL7623966397472036643.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/LTL16921432483872258478.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7623966397472036643.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G("(p126<1)"))))
Formula 0 simplified : GF!"(p126<1)"
Detected timeout of ITS tools.
[2024-05-23 00:10:15] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:10:15] [INFO ] Applying decomposition
[2024-05-23 00:10:15] [INFO ] Flatten gal took : 5 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/graph5219666002521190526.txt' '-o' '/tmp/graph5219666002521190526.bin' '-w' '/tmp/graph5219666002521190526.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph5219666002521190526.bin' '-l' '-1' '-v' '-w' '/tmp/graph5219666002521190526.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:10:15] [INFO ] Decomposing Gal with order
[2024-05-23 00:10:15] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:10:15] [INFO ] Removed a total of 60 redundant transitions.
[2024-05-23 00:10:15] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:10:15] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 3 ms.
[2024-05-23 00:10:15] [INFO ] Time to serialize gal into /tmp/LTL7538006377602524283.gal : 2 ms
[2024-05-23 00:10:15] [INFO ] Time to serialize properties into /tmp/LTL8096407075075230712.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/LTL7538006377602524283.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8096407075075230712.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 : !((F(G("(i0.i2.u6.p126<1)"))))
Formula 0 simplified : GF!"(i0.i2.u6.p126<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin13857403716203001299
[2024-05-23 00:10:30] [INFO ] Built C files in 1ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13857403716203001299
Running compilation step : cd /tmp/ltsmin13857403716203001299;'/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 173 ms.
Running link step : cd /tmp/ltsmin13857403716203001299;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13857403716203001299;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-08 finished in 92483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 2 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:10:46] [INFO ] Computed 19 invariants in 6 ms
[2024-05-23 00:10:46] [INFO ] Implicit Places using invariants in 76 ms returned []
[2024-05-23 00:10:46] [INFO ] Invariant cache hit.
[2024-05-23 00:10:46] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 312 ms to find 0 implicit places.
[2024-05-23 00:10:46] [INFO ] Invariant cache hit.
[2024-05-23 00:10:46] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 393 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s53 1) (LT s193 1)), p1:(LT s18 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 24999 reset in 127 ms.
Product exploration explored 100000 steps with 24981 reset in 132 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 93 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 66 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 337 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 290 resets, run finished after 45 ms. (steps per millisecond=222 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 286 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 2) seen :0
Finished probabilistic random walk after 274895 steps, run visited all 2 properties in 1000 ms. (steps per millisecond=274 )
Probabilistic random walk after 274895 steps, saw 137480 distinct states, run finished after 1000 ms. (steps per millisecond=274 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), true, (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 143 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 207 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 95 place count 160 transition count 141
Deduced a syphon composed of 7 places in 1 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 153 transition count 141
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 187 place count 114 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 197 place count 109 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 108 transition count 101
Applied a total of 198 rules in 14 ms. Remains 108 /209 variables (removed 101) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 108 cols
[2024-05-23 00:10:48] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:10:48] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 00:10:48] [INFO ] Invariant cache hit.
[2024-05-23 00:10:48] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:10:48] [INFO ] Implicit Places using invariants and state equation in 175 ms returned []
Implicit Place search using SMT with State Equation took 237 ms to find 0 implicit places.
[2024-05-23 00:10:48] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:10:48] [INFO ] Invariant cache hit.
[2024-05-23 00:10:48] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/209 places, 101/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 108/209 places, 101/197 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 78 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1405 resets, run finished after 95 ms. (steps per millisecond=105 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 801 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 2) seen :0
Finished probabilistic random walk after 135027 steps, run visited all 2 properties in 388 ms. (steps per millisecond=348 )
Probabilistic random walk after 135027 steps, saw 67543 distinct states, run finished after 388 ms. (steps per millisecond=348 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 254 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 63 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 34036 reset in 129 ms.
Product exploration explored 100000 steps with 34025 reset in 129 ms.
Built C files in :
/tmp/ltsmin2122542976994556024
[2024-05-23 00:10:50] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-23 00:10:50] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:10:50] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-23 00:10:50] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:10:50] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-23 00:10:50] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:10:50] [INFO ] Built C files in 8ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2122542976994556024
Running compilation step : cd /tmp/ltsmin2122542976994556024;'/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 191 ms.
Running link step : cd /tmp/ltsmin2122542976994556024;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin2122542976994556024;'/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/stateBased15728814227668048126.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 101/101 transitions.
Applied a total of 0 rules in 5 ms. Remains 108 /108 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-23 00:11:05] [INFO ] Invariant cache hit.
[2024-05-23 00:11:05] [INFO ] Implicit Places using invariants in 53 ms returned []
[2024-05-23 00:11:05] [INFO ] Invariant cache hit.
[2024-05-23 00:11:05] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:11:05] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 212 ms to find 0 implicit places.
[2024-05-23 00:11:05] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:11:05] [INFO ] Invariant cache hit.
[2024-05-23 00:11:05] [INFO ] Dead Transitions using invariants and state equation in 51 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 272 ms. Remains : 108/108 places, 101/101 transitions.
Built C files in :
/tmp/ltsmin18154480130471051275
[2024-05-23 00:11:05] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-23 00:11:05] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:11:05] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-23 00:11:05] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:11:05] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-23 00:11:05] [INFO ] Computation of Completed DNA matrix. took 7 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:11:05] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18154480130471051275
Running compilation step : cd /tmp/ltsmin18154480130471051275;'/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 202 ms.
Running link step : cd /tmp/ltsmin18154480130471051275;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18154480130471051275;'/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/stateBased8172751028293759422.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:11:20] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:11:20] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:11:20] [INFO ] Time to serialize gal into /tmp/LTL14184261843852631261.gal : 1 ms
[2024-05-23 00:11:20] [INFO ] Time to serialize properties into /tmp/LTL11847619621476443561.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/LTL14184261843852631261.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16800177747471838805.hoa' '-atoms' '/tmp/LTL11847619621476443561.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/LTL11847619621476443561.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16800177747471838805.hoa
Detected timeout of ITS tools.
[2024-05-23 00:11:35] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:11:35] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:11:35] [INFO ] Time to serialize gal into /tmp/LTL9996216967110054622.gal : 1 ms
[2024-05-23 00:11:35] [INFO ] Time to serialize properties into /tmp/LTL1006714919833999280.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/LTL9996216967110054622.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1006714919833999280.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(p115<1)")))||("((p147>=1)&&(p85<1))")))))
Formula 0 simplified : XF(!"((p147>=1)&&(p85<1))" & XG!"(p115<1)")
Detected timeout of ITS tools.
[2024-05-23 00:11:50] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:11:50] [INFO ] Applying decomposition
[2024-05-23 00:11:50] [INFO ] Flatten gal took : 5 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/graph9417147981941315326.txt' '-o' '/tmp/graph9417147981941315326.bin' '-w' '/tmp/graph9417147981941315326.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9417147981941315326.bin' '-l' '-1' '-v' '-w' '/tmp/graph9417147981941315326.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:11:50] [INFO ] Decomposing Gal with order
[2024-05-23 00:11:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:11:50] [INFO ] Removed a total of 57 redundant transitions.
[2024-05-23 00:11:50] [INFO ] Flatten gal took : 6 ms
[2024-05-23 00:11:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 2 ms.
[2024-05-23 00:11:50] [INFO ] Time to serialize gal into /tmp/LTL15353366743782262500.gal : 2 ms
[2024-05-23 00:11:50] [INFO ] Time to serialize properties into /tmp/LTL6957123602799627405.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/LTL15353366743782262500.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6957123602799627405.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(G((X(F("(i0.i0.u2.p115<1)")))||("((i2.u10.p147>=1)&&(i4.i0.u34.p85<1))")))))
Formula 0 simplified : XF(!"((i2.u10.p147>=1)&&(i4.i0.u34.p85<1))" & XG!"(i0.i0.u2.p115<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12349106181036235009
[2024-05-23 00:12:05] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12349106181036235009
Running compilation step : cd /tmp/ltsmin12349106181036235009;'/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 180 ms.
Running link step : cd /tmp/ltsmin12349106181036235009;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12349106181036235009;'/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)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-09 finished in 95011 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0&&F(p1)))||X(p2)))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 3 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:12:21] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 00:12:21] [INFO ] Implicit Places using invariants in 87 ms returned []
[2024-05-23 00:12:21] [INFO ] Invariant cache hit.
[2024-05-23 00:12:21] [INFO ] Implicit Places using invariants and state equation in 238 ms returned []
Implicit Place search using SMT with State Equation took 327 ms to find 0 implicit places.
[2024-05-23 00:12:21] [INFO ] Invariant cache hit.
[2024-05-23 00:12:21] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 410 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 211 ms :[(OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), (NOT p2), (OR (AND (NOT p0) (NOT p2)) (AND (NOT p1) (NOT p2))), true, (NOT p1), (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=p0, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p2)), acceptance={} source=2 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 4}, { cond=(AND p0 (NOT p2)), acceptance={} source=2 dest: 5}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={0} source=4 dest: 4}], [{ cond=(NOT p0), acceptance={} source=5 dest: 3}, { cond=(AND p0 (NOT p1)), acceptance={} source=5 dest: 4}, { cond=p0, acceptance={} source=5 dest: 5}]], initial=0, aps=[p0:(GEQ s156 1), p2:(GEQ s84 1), p1:(GEQ s31 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-10 finished in 647 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 49 transitions
Trivial Post-agglo rules discarded 49 transitions
Performed 49 trivial Post agglomeration. Transition count delta: 49
Iterating post reduction 0 with 49 rules applied. Total rules applied 50 place count 207 transition count 146
Reduce places removed 49 places and 0 transitions.
Iterating post reduction 1 with 49 rules applied. Total rules applied 99 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 99 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 115 place count 150 transition count 138
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 193 place count 111 transition count 99
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 205 place count 105 transition count 99
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 206 place count 104 transition count 98
Applied a total of 206 rules in 12 ms. Remains 104 /209 variables (removed 105) and now considering 98/197 (removed 99) transitions.
// Phase 1: matrix 98 rows 104 cols
[2024-05-23 00:12:21] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 00:12:21] [INFO ] Implicit Places using invariants in 58 ms returned []
[2024-05-23 00:12:21] [INFO ] Invariant cache hit.
[2024-05-23 00:12:21] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:12:21] [INFO ] Implicit Places using invariants and state equation in 150 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-23 00:12:21] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:12:21] [INFO ] Invariant cache hit.
[2024-05-23 00:12:22] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 104/209 places, 98/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 293 ms. Remains : 104/209 places, 98/197 transitions.
Stuttering acceptance computed with spot in 130 ms :[(NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(LT s48 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 13774 reset in 85 ms.
Product exploration explored 100000 steps with 13847 reset in 91 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1388 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 801 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 439712 states, properties seen :0
Probabilistic random walk after 879439 steps, saw 439712 distinct states, run finished after 2430 ms. (steps per millisecond=361 ) properties seen :0
Interrupted probabilistic random walk after 1044591 steps, run timeout after 3001 ms. (steps per millisecond=348 ) properties seen :{}
Exhaustive walk after 1044591 steps, saw 522456 distinct states, run finished after 3001 ms. (steps per millisecond=348 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:12:27] [INFO ] Invariant cache hit.
[2024-05-23 00:12:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:12:27] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:12:28] [INFO ] After 31ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:28] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:12:28] [INFO ] After 13ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 00:12:28] [INFO ] After 21ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:12:28] [INFO ] After 98ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Graph (complete) has 302 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 103 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 90 transition count 84
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 43 place count 90 transition count 84
Applied a total of 43 rules in 6 ms. Remains 90 /104 variables (removed 14) and now considering 84/98 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/104 places, 84/98 transitions.
Incomplete random walk after 10000 steps, including 1253 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 808 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Probably explored full state space saw : 480715 states, properties seen :0
Probabilistic random walk after 961443 steps, saw 480715 distinct states, run finished after 2756 ms. (steps per millisecond=348 ) properties seen :0
Interrupted probabilistic random walk after 1186199 steps, run timeout after 3001 ms. (steps per millisecond=395 ) properties seen :{}
Exhaustive walk after 1186199 steps, saw 593335 distinct states, run finished after 3001 ms. (steps per millisecond=395 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 90 cols
[2024-05-23 00:12:33] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:12:33] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 00:12:33] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 11 ms returned sat
[2024-05-23 00:12:33] [INFO ] After 28ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:33] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:33] [INFO ] After 12ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:33] [INFO ] After 95ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:33] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:12:33] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-23 00:12:34] [INFO ] After 23ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:34] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:34] [INFO ] After 20ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-23 00:12:34] [INFO ] After 100ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 3 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3 ms. Remains : 90/90 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-23 00:12:34] [INFO ] Invariant cache hit.
[2024-05-23 00:12:34] [INFO ] Implicit Places using invariants in 65 ms returned [21, 27, 58, 63, 81, 87]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 66 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/90 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 81 transition count 81
Applied a total of 6 rules in 8 ms. Remains 81 /84 variables (removed 3) and now considering 81/84 (removed 3) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-23 00:12:34] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:12:34] [INFO ] Implicit Places using invariants in 82 ms returned []
[2024-05-23 00:12:34] [INFO ] Invariant cache hit.
[2024-05-23 00:12:34] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:34] [INFO ] Implicit Places using invariants and state equation in 180 ms returned []
Implicit Place search using SMT with State Equation took 277 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/90 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 355 ms. Remains : 81/90 places, 81/84 transitions.
Incomplete random walk after 10000 steps, including 1369 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 906 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1131250 steps, run timeout after 3001 ms. (steps per millisecond=376 ) properties seen :{}
Probabilistic random walk after 1131250 steps, saw 565613 distinct states, run finished after 3001 ms. (steps per millisecond=376 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:12:37] [INFO ] Invariant cache hit.
[2024-05-23 00:12:37] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:12:37] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 2 ms returned sat
[2024-05-23 00:12:37] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:37] [INFO ] After 17ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:37] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:37] [INFO ] [Nat]Absence check using 7 positive place invariants in 1 ms returned sat
[2024-05-23 00:12:37] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:12:37] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:37] [INFO ] After 12ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:37] [INFO ] After 17ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:12:37] [INFO ] After 84ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 2 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-23 00:12:37] [INFO ] Invariant cache hit.
[2024-05-23 00:12:37] [INFO ] Implicit Places using invariants in 62 ms returned []
[2024-05-23 00:12:37] [INFO ] Invariant cache hit.
[2024-05-23 00:12:37] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:37] [INFO ] Implicit Places using invariants and state equation in 167 ms returned []
Implicit Place search using SMT with State Equation took 236 ms to find 0 implicit places.
[2024-05-23 00:12:37] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:12:37] [INFO ] Invariant cache hit.
[2024-05-23 00:12:37] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 308 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 5 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2024-05-23 00:12:37] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:12:37] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:12:37] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 2 ms returned sat
[2024-05-23 00:12:37] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:37] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:12:37] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 00:12:37] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 3 ms.
[2024-05-23 00:12:38] [INFO ] After 60ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 98/98 transitions.
Applied a total of 0 rules in 4 ms. Remains 104 /104 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 104 cols
[2024-05-23 00:12:38] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 00:12:38] [INFO ] Implicit Places using invariants in 68 ms returned []
[2024-05-23 00:12:38] [INFO ] Invariant cache hit.
[2024-05-23 00:12:38] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:12:38] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 222 ms to find 0 implicit places.
[2024-05-23 00:12:38] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:12:38] [INFO ] Invariant cache hit.
[2024-05-23 00:12:38] [INFO ] Dead Transitions using invariants and state equation in 64 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 296 ms. Remains : 104/104 places, 98/98 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 318 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.3 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 81 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p0)]
Incomplete random walk after 10000 steps, including 1382 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 822 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 439712 states, properties seen :0
Probabilistic random walk after 879439 steps, saw 439712 distinct states, run finished after 2854 ms. (steps per millisecond=308 ) properties seen :0
Interrupted probabilistic random walk after 1080245 steps, run timeout after 3001 ms. (steps per millisecond=359 ) properties seen :{}
Exhaustive walk after 1080245 steps, saw 540288 distinct states, run finished after 3001 ms. (steps per millisecond=359 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:12:44] [INFO ] Invariant cache hit.
[2024-05-23 00:12:44] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:12:44] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:12:44] [INFO ] After 33ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:12:44] [INFO ] After 14ms SMT Verify possible using 6 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 00:12:44] [INFO ] After 22ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:12:44] [INFO ] After 92ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 104/104 places, 98/98 transitions.
Graph (complete) has 302 edges and 104 vertex of which 103 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 103 transition count 97
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 15 place count 103 transition count 84
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 28 place count 90 transition count 84
Partial Free-agglomeration rule applied 15 times.
Drop transitions removed 15 transitions
Iterating global reduction 2 with 15 rules applied. Total rules applied 43 place count 90 transition count 84
Applied a total of 43 rules in 5 ms. Remains 90 /104 variables (removed 14) and now considering 84/98 (removed 14) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 90/104 places, 84/98 transitions.
Incomplete random walk after 10000 steps, including 1281 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Probably explored full state space saw : 480715 states, properties seen :0
Probabilistic random walk after 961443 steps, saw 480715 distinct states, run finished after 2551 ms. (steps per millisecond=376 ) properties seen :0
Interrupted probabilistic random walk after 1212869 steps, run timeout after 3001 ms. (steps per millisecond=404 ) properties seen :{}
Exhaustive walk after 1212869 steps, saw 606635 distinct states, run finished after 3001 ms. (steps per millisecond=404 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 84 rows 90 cols
[2024-05-23 00:12:50] [INFO ] Computed 19 invariants in 5 ms
[2024-05-23 00:12:50] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:12:50] [INFO ] [Real]Absence check using 3 positive and 16 generalized place invariants in 4 ms returned sat
[2024-05-23 00:12:50] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:50] [INFO ] After 12ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:50] [INFO ] After 77ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:50] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-23 00:12:50] [INFO ] [Nat]Absence check using 3 positive and 16 generalized place invariants in 3 ms returned sat
[2024-05-23 00:12:50] [INFO ] After 26ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:50] [INFO ] After 15ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:50] [INFO ] After 22ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:12:50] [INFO ] After 87ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 90 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 2 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 90/90 places, 84/84 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 90/90 places, 84/84 transitions.
Applied a total of 0 rules in 1 ms. Remains 90 /90 variables (removed 0) and now considering 84/84 (removed 0) transitions.
[2024-05-23 00:12:50] [INFO ] Invariant cache hit.
[2024-05-23 00:12:50] [INFO ] Implicit Places using invariants in 77 ms returned [21, 27, 58, 63, 81, 87]
Discarding 6 places :
Implicit Place search using SMT only with invariants took 79 ms to find 6 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 84/90 places, 84/84 transitions.
Free-agglomeration rule (complex) applied 3 times.
Iterating global reduction 0 with 3 rules applied. Total rules applied 3 place count 84 transition count 81
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 6 place count 81 transition count 81
Applied a total of 6 rules in 2 ms. Remains 81 /84 variables (removed 3) and now considering 81/84 (removed 3) transitions.
// Phase 1: matrix 81 rows 81 cols
[2024-05-23 00:12:50] [INFO ] Computed 13 invariants in 1 ms
[2024-05-23 00:12:50] [INFO ] Implicit Places using invariants in 54 ms returned []
[2024-05-23 00:12:50] [INFO ] Invariant cache hit.
[2024-05-23 00:12:50] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:50] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 81/90 places, 81/84 transitions.
Finished structural reductions in REACHABILITY mode , in 2 iterations and 303 ms. Remains : 81/90 places, 81/84 transitions.
Incomplete random walk after 10000 steps, including 1416 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 938 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1225451 steps, run timeout after 3001 ms. (steps per millisecond=408 ) properties seen :{}
Probabilistic random walk after 1225451 steps, saw 612722 distinct states, run finished after 3001 ms. (steps per millisecond=408 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:12:53] [INFO ] Invariant cache hit.
[2024-05-23 00:12:53] [INFO ] [Real]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:12:53] [INFO ] [Real]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:12:53] [INFO ] After 24ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:53] [INFO ] After 17ms SMT Verify possible using 13 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:53] [INFO ] After 81ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:12:53] [INFO ] [Nat]Absence check using 7 positive place invariants in 2 ms returned sat
[2024-05-23 00:12:53] [INFO ] [Nat]Absence check using 7 positive and 6 generalized place invariants in 1 ms returned sat
[2024-05-23 00:12:53] [INFO ] After 22ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:53] [INFO ] After 13ms SMT Verify possible using 13 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:12:53] [INFO ] After 23ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-23 00:12:53] [INFO ] After 88ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 1 out of 81 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2 ms. Remains : 81/81 places, 81/81 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 81/81 places, 81/81 transitions.
Applied a total of 0 rules in 1 ms. Remains 81 /81 variables (removed 0) and now considering 81/81 (removed 0) transitions.
[2024-05-23 00:12:53] [INFO ] Invariant cache hit.
[2024-05-23 00:12:53] [INFO ] Implicit Places using invariants in 55 ms returned []
[2024-05-23 00:12:53] [INFO ] Invariant cache hit.
[2024-05-23 00:12:53] [INFO ] State equation strengthened by 13 read => feed constraints.
[2024-05-23 00:12:54] [INFO ] Implicit Places using invariants and state equation in 164 ms returned []
Implicit Place search using SMT with State Equation took 221 ms to find 0 implicit places.
[2024-05-23 00:12:54] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:12:54] [INFO ] Invariant cache hit.
[2024-05-23 00:12:54] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 274 ms. Remains : 81/81 places, 81/81 transitions.
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 6 Pre rules applied. Total rules applied 0 place count 81 transition count 75
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 0 with 12 rules applied. Total rules applied 12 place count 75 transition count 75
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 15 place count 72 transition count 72
Iterating global reduction 0 with 3 rules applied. Total rules applied 18 place count 72 transition count 72
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 71 transition count 71
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 22 place count 71 transition count 69
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 24 place count 69 transition count 69
Applied a total of 24 rules in 5 ms. Remains 69 /81 variables (removed 12) and now considering 69/81 (removed 12) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 69 rows 69 cols
[2024-05-23 00:12:54] [INFO ] Computed 13 invariants in 2 ms
[2024-05-23 00:12:54] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-23 00:12:54] [INFO ] [Real]Absence check using 3 positive and 10 generalized place invariants in 3 ms returned sat
[2024-05-23 00:12:54] [INFO ] After 20ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:12:54] [INFO ] State equation strengthened by 1 read => feed constraints.
[2024-05-23 00:12:54] [INFO ] After 3ms SMT Verify possible using 1 Read/Feed constraints in real domain returned unsat :0 sat :1
[2024-05-23 00:12:54] [INFO ] After 8ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:12:54] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 89 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 13845 reset in 85 ms.
Product exploration explored 100000 steps with 13878 reset in 89 ms.
Built C files in :
/tmp/ltsmin9461730427572569935
[2024-05-23 00:12:54] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-23 00:12:54] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:12:54] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-23 00:12:54] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:12:54] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-23 00:12:54] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:12:54] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9461730427572569935
Running compilation step : cd /tmp/ltsmin9461730427572569935;'/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 230 ms.
Running link step : cd /tmp/ltsmin9461730427572569935;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9461730427572569935;'/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/stateBased13975393199589918031.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 1 out of 104 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 104/104 places, 98/98 transitions.
Applied a total of 0 rules in 2 ms. Remains 104 /104 variables (removed 0) and now considering 98/98 (removed 0) transitions.
// Phase 1: matrix 98 rows 104 cols
[2024-05-23 00:13:09] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 00:13:09] [INFO ] Implicit Places using invariants in 56 ms returned []
[2024-05-23 00:13:09] [INFO ] Invariant cache hit.
[2024-05-23 00:13:09] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:13:09] [INFO ] Implicit Places using invariants and state equation in 152 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-23 00:13:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:13:09] [INFO ] Invariant cache hit.
[2024-05-23 00:13:09] [INFO ] Dead Transitions using invariants and state equation in 52 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 267 ms. Remains : 104/104 places, 98/98 transitions.
Built C files in :
/tmp/ltsmin10772977780638617636
[2024-05-23 00:13:09] [INFO ] Computing symmetric may disable matrix : 98 transitions.
[2024-05-23 00:13:09] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:13:09] [INFO ] Computing symmetric may enable matrix : 98 transitions.
[2024-05-23 00:13:09] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:13:09] [INFO ] Computing Do-Not-Accords matrix : 98 transitions.
[2024-05-23 00:13:09] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:13:09] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10772977780638617636
Running compilation step : cd /tmp/ltsmin10772977780638617636;'/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 205 ms.
Running link step : cd /tmp/ltsmin10772977780638617636;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin10772977780638617636;'/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/stateBased5113735761648893555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:13:25] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:13:25] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:13:25] [INFO ] Time to serialize gal into /tmp/LTL2345609373308229240.gal : 1 ms
[2024-05-23 00:13:25] [INFO ] Time to serialize properties into /tmp/LTL846273492507303217.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/LTL2345609373308229240.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9629520126487149858.hoa' '-atoms' '/tmp/LTL846273492507303217.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...316
Loading property file /tmp/LTL846273492507303217.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9629520126487149858.hoa
Detected timeout of ITS tools.
[2024-05-23 00:13:40] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:13:40] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:13:40] [INFO ] Time to serialize gal into /tmp/LTL16216923684751470326.gal : 1 ms
[2024-05-23 00:13:40] [INFO ] Time to serialize properties into /tmp/LTL14206025760062314212.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/LTL16216923684751470326.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14206025760062314212.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 : !((F(G("(p185<1)"))))
Formula 0 simplified : GF!"(p185<1)"
Detected timeout of ITS tools.
[2024-05-23 00:13:55] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:13:55] [INFO ] Applying decomposition
[2024-05-23 00:13:55] [INFO ] Flatten gal took : 4 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/graph13047216057790173391.txt' '-o' '/tmp/graph13047216057790173391.bin' '-w' '/tmp/graph13047216057790173391.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13047216057790173391.bin' '-l' '-1' '-v' '-w' '/tmp/graph13047216057790173391.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:13:55] [INFO ] Decomposing Gal with order
[2024-05-23 00:13:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:13:55] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-23 00:13:55] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:13:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2024-05-23 00:13:55] [INFO ] Time to serialize gal into /tmp/LTL9970254902361679789.gal : 2 ms
[2024-05-23 00:13:55] [INFO ] Time to serialize properties into /tmp/LTL13152783228882513838.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/LTL9970254902361679789.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13152783228882513838.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F(G("(i1.u15.p185<1)"))))
Formula 0 simplified : GF!"(i1.u15.p185<1)"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7002341781462076892
[2024-05-23 00:14:10] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7002341781462076892
Running compilation step : cd /tmp/ltsmin7002341781462076892;'/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 187 ms.
Running link step : cd /tmp/ltsmin7002341781462076892;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin7002341781462076892;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-11 finished in 123564 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0)||(p0&&F(p1)))))'
Support contains 2 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 4 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:14:25] [INFO ] Computed 19 invariants in 2 ms
[2024-05-23 00:14:25] [INFO ] Implicit Places using invariants in 69 ms returned []
[2024-05-23 00:14:25] [INFO ] Invariant cache hit.
[2024-05-23 00:14:25] [INFO ] Implicit Places using invariants and state equation in 235 ms returned []
Implicit Place search using SMT with State Equation took 304 ms to find 0 implicit places.
[2024-05-23 00:14:25] [INFO ] Invariant cache hit.
[2024-05-23 00:14:25] [INFO ] Dead Transitions using invariants and state equation in 79 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (NOT p0), (NOT p0), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=4 dest: 1}, { cond=(AND p0 (NOT p1)), acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(LT s168 1), p0:(LT s138 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]]
Product exploration explored 100000 steps with 50000 reset in 218 ms.
Product exploration explored 100000 steps with 50000 reset in 189 ms.
Computed a total of 7 stabilizing places and 7 stable transitions
Graph (complete) has 349 edges and 209 vertex of which 207 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Computed a total of 7 stabilizing places and 7 stable transitions
Knowledge obtained : [(AND p1 p0), (X p0), (X (NOT (AND p0 (NOT p1)))), true, (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 6 factoid took 17 ms. Reduced automaton from 5 states, 7 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DoubleExponent-PT-004-LTLFireability-12 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DoubleExponent-PT-004-LTLFireability-12 finished in 987 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
[2024-05-23 00:14:26] [INFO ] Invariant cache hit.
[2024-05-23 00:14:26] [INFO ] Implicit Places using invariants in 65 ms returned []
[2024-05-23 00:14:26] [INFO ] Invariant cache hit.
[2024-05-23 00:14:26] [INFO ] Implicit Places using invariants and state equation in 251 ms returned []
Implicit Place search using SMT with State Equation took 317 ms to find 0 implicit places.
[2024-05-23 00:14:26] [INFO ] Invariant cache hit.
[2024-05-23 00:14:26] [INFO ] Dead Transitions using invariants and state equation in 80 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 400 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 66 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(GEQ s80 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-13 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Drop transitions removed 50 transitions
Trivial Post-agglo rules discarded 50 transitions
Performed 50 trivial Post agglomeration. Transition count delta: 50
Iterating post reduction 0 with 50 rules applied. Total rules applied 51 place count 208 transition count 146
Reduce places removed 50 places and 0 transitions.
Iterating post reduction 1 with 50 rules applied. Total rules applied 101 place count 158 transition count 146
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 8 Pre rules applied. Total rules applied 101 place count 158 transition count 138
Deduced a syphon composed of 8 places in 0 ms
Reduce places removed 8 places and 0 transitions.
Iterating global reduction 2 with 16 rules applied. Total rules applied 117 place count 150 transition count 138
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: 36
Deduced a syphon composed of 36 places in 0 ms
Reduce places removed 36 places and 0 transitions.
Iterating global reduction 2 with 72 rules applied. Total rules applied 189 place count 114 transition count 102
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 201 place count 108 transition count 102
Applied a total of 201 rules in 7 ms. Remains 108 /209 variables (removed 101) and now considering 102/197 (removed 95) transitions.
// Phase 1: matrix 102 rows 108 cols
[2024-05-23 00:14:26] [INFO ] Computed 19 invariants in 3 ms
[2024-05-23 00:14:26] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 00:14:26] [INFO ] Invariant cache hit.
[2024-05-23 00:14:26] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 00:14:27] [INFO ] Implicit Places using invariants and state equation in 181 ms returned []
Implicit Place search using SMT with State Equation took 242 ms to find 0 implicit places.
[2024-05-23 00:14:27] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:14:27] [INFO ] Invariant cache hit.
[2024-05-23 00:14:27] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 108/209 places, 102/197 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 108/209 places, 102/197 transitions.
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (NOT p2)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(NOT p2), acceptance={} source=0 dest: 3}], [{ cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 1}, { cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(AND (LT s17 1) (LT s54 1)), p0:(LT s17 1), p2:(GEQ s0 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 8839 reset in 83 ms.
Product exploration explored 100000 steps with 8838 reset in 88 ms.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Detected a total of 1/108 stabilizing places and 1/102 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 121 ms. Reduced automaton from 4 states, 8 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 880 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 609 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:14:27] [INFO ] Invariant cache hit.
[2024-05-23 00:14:27] [INFO ] [Real]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:14:27] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:14:27] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:14:27] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 00:14:27] [INFO ] After 30ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:14:27] [INFO ] After 87ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:14:27] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:14:27] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:14:27] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:14:27] [INFO ] After 21ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:14:27] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 4 ms.
[2024-05-23 00:14:27] [INFO ] After 96ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 8 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 91/108 places, 85/102 transitions.
Incomplete random walk after 10000 steps, including 1263 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 824 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 7 ms. (steps per millisecond=278 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 7 ms. (steps per millisecond=278 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p1 p0 p2), (X (NOT (AND (NOT p1) p0))), (X (NOT p2)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), true, (X (X (NOT p2))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 9 factoid took 176 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 57 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 2 out of 108 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Applied a total of 0 rules in 1 ms. Remains 108 /108 variables (removed 0) and now considering 102/102 (removed 0) transitions.
[2024-05-23 00:14:28] [INFO ] Invariant cache hit.
[2024-05-23 00:14:28] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 00:14:28] [INFO ] Invariant cache hit.
[2024-05-23 00:14:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 00:14:28] [INFO ] Implicit Places using invariants and state equation in 178 ms returned []
Implicit Place search using SMT with State Equation took 249 ms to find 0 implicit places.
[2024-05-23 00:14:28] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-23 00:14:28] [INFO ] Invariant cache hit.
[2024-05-23 00:14:28] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 304 ms. Remains : 108/108 places, 102/102 transitions.
Computed a total of 1 stabilizing places and 1 stable transitions
Graph (complete) has 318 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 1 stabilizing places and 1 stable transitions
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 76 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 55 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 885 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 608 resets, run finished after 7 ms. (steps per millisecond=1428 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2024-05-23 00:14:28] [INFO ] Invariant cache hit.
[2024-05-23 00:14:28] [INFO ] [Real]Absence check using 2 positive place invariants in 1 ms returned sat
[2024-05-23 00:14:28] [INFO ] [Real]Absence check using 2 positive and 17 generalized place invariants in 3 ms returned sat
[2024-05-23 00:14:28] [INFO ] After 26ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-23 00:14:28] [INFO ] State equation strengthened by 8 read => feed constraints.
[2024-05-23 00:14:28] [INFO ] After 36ms SMT Verify possible using 8 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:14:28] [INFO ] After 97ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-23 00:14:28] [INFO ] [Nat]Absence check using 2 positive place invariants in 0 ms returned sat
[2024-05-23 00:14:28] [INFO ] [Nat]Absence check using 2 positive and 17 generalized place invariants in 7 ms returned sat
[2024-05-23 00:14:28] [INFO ] After 30ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-23 00:14:28] [INFO ] After 20ms SMT Verify possible using 8 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-23 00:14:28] [INFO ] After 31ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-23 00:14:28] [INFO ] After 107ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 1 out of 108 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 108/108 places, 102/102 transitions.
Graph (complete) has 302 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Discarding 1 places :
Also discarding 0 output transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 2 place count 107 transition count 101
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 6 place count 105 transition count 99
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 1 with 13 rules applied. Total rules applied 19 place count 105 transition count 86
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 32 place count 92 transition count 86
Partial Free-agglomeration rule applied 17 times.
Drop transitions removed 17 transitions
Iterating global reduction 2 with 17 rules applied. Total rules applied 49 place count 92 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 50 place count 91 transition count 85
Applied a total of 50 rules in 7 ms. Remains 91 /108 variables (removed 17) and now considering 85/102 (removed 17) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 91/108 places, 85/102 transitions.
Incomplete random walk after 10000 steps, including 1238 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 826 resets, run finished after 8 ms. (steps per millisecond=1250 ) properties (out of 1) seen :0
Finished probabilistic random walk after 1946 steps, run visited all 1 properties in 7 ms. (steps per millisecond=278 )
Probabilistic random walk after 1946 steps, saw 1003 distinct states, run finished after 7 ms. (steps per millisecond=278 ) properties seen :1
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND p0 (NOT p1)))]
Knowledge based reduction with 5 factoid took 149 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 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 58 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 8849 reset in 79 ms.
Product exploration explored 100000 steps with 8929 reset in 80 ms.
Built C files in :
/tmp/ltsmin10256630134506642581
[2024-05-23 00:14:29] [INFO ] Computing symmetric may disable matrix : 102 transitions.
[2024-05-23 00:14:29] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:14:29] [INFO ] Computing symmetric may enable matrix : 102 transitions.
[2024-05-23 00:14:29] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:14:29] [INFO ] Computing Do-Not-Accords matrix : 102 transitions.
[2024-05-23 00:14:29] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:14:29] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10256630134506642581
Running compilation step : cd /tmp/ltsmin10256630134506642581;'/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 195 ms.
Running link step : cd /tmp/ltsmin10256630134506642581;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin10256630134506642581;'/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/stateBased671677266056366757.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 102/102 transitions.
Reduce places removed 1 places and 1 transitions.
Applied a total of 0 rules in 4 ms. Remains 107 /108 variables (removed 1) and now considering 101/102 (removed 1) transitions.
// Phase 1: matrix 101 rows 107 cols
[2024-05-23 00:14:44] [INFO ] Computed 19 invariants in 4 ms
[2024-05-23 00:14:44] [INFO ] Implicit Places using invariants in 61 ms returned []
[2024-05-23 00:14:44] [INFO ] Invariant cache hit.
[2024-05-23 00:14:44] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:14:44] [INFO ] Implicit Places using invariants and state equation in 142 ms returned []
Implicit Place search using SMT with State Equation took 205 ms to find 0 implicit places.
[2024-05-23 00:14:44] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:14:44] [INFO ] Invariant cache hit.
[2024-05-23 00:14:44] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 263 ms. Remains : 107/108 places, 101/102 transitions.
Built C files in :
/tmp/ltsmin3227654449927867968
[2024-05-23 00:14:44] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-23 00:14:44] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:14:44] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-23 00:14:44] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:14:44] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-23 00:14:44] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:14:44] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3227654449927867968
Running compilation step : cd /tmp/ltsmin3227654449927867968;'/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 200 ms.
Running link step : cd /tmp/ltsmin3227654449927867968;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin3227654449927867968;'/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/stateBased8988718868549335596.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:14:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:14:59] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:14:59] [INFO ] Time to serialize gal into /tmp/LTL3168750873670639573.gal : 1 ms
[2024-05-23 00:14:59] [INFO ] Time to serialize properties into /tmp/LTL3148282306126222449.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/LTL3168750873670639573.gal' '-t' 'CGAL' '-hoa' '/tmp/aut15525838751604338052.hoa' '-atoms' '/tmp/LTL3148282306126222449.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/LTL3148282306126222449.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut15525838751604338052.hoa
Detected timeout of ITS tools.
[2024-05-23 00:15:14] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:15:14] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:15:14] [INFO ] Time to serialize gal into /tmp/LTL4664017202499109305.gal : 1 ms
[2024-05-23 00:15:14] [INFO ] Time to serialize properties into /tmp/LTL12631093024031296849.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/LTL4664017202499109305.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12631093024031296849.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(p120<1)")U(("((p120<1)&&(p19<1))")||(G("(p120<1)"))))))&&(("(p1>=1)")||(X(F(("(p1>=1)")&&(F("(p120>=1)")))))))))
Formula 0 simplified : FG(!"(p120<1)" M !"((p120<1)&&(p19<1))") | G(!"(p1>=1)" & XG(!"(p1>=1)" | G!"(p120>=1)"))
Detected timeout of ITS tools.
[2024-05-23 00:15:30] [INFO ] Flatten gal took : 8 ms
[2024-05-23 00:15:30] [INFO ] Applying decomposition
[2024-05-23 00:15:30] [INFO ] Flatten gal took : 5 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/graph4964428719876774368.txt' '-o' '/tmp/graph4964428719876774368.bin' '-w' '/tmp/graph4964428719876774368.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4964428719876774368.bin' '-l' '-1' '-v' '-w' '/tmp/graph4964428719876774368.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:15:30] [INFO ] Decomposing Gal with order
[2024-05-23 00:15:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:15:30] [INFO ] Removed a total of 63 redundant transitions.
[2024-05-23 00:15:30] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:15:30] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 3 ms.
[2024-05-23 00:15:30] [INFO ] Time to serialize gal into /tmp/LTL8827523603678231512.gal : 1 ms
[2024-05-23 00:15:30] [INFO ] Time to serialize properties into /tmp/LTL10511322242205469702.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/LTL8827523603678231512.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10511322242205469702.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((F((G(F(("(i1.i0.u3.p120<1)")U(("((i1.i0.u3.p120<1)&&(i2.i0.u25.p19<1))")||(G("(i1.i0.u3.p120<1)"))))))&&(("(i2.i1.u1.p1>=1)")||(X(F...210
Formula 0 simplified : FG(!"(i1.i0.u3.p120<1)" M !"((i1.i0.u3.p120<1)&&(i2.i0.u25.p19<1))") | G(!"(i2.i1.u1.p1>=1)" & XG(!"(i2.i1.u1.p1>=1)" | G!"(i1.i0.u3...167
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10302919400980148830
[2024-05-23 00:15:45] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10302919400980148830
Running compilation step : cd /tmp/ltsmin10302919400980148830;'/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 187 ms.
Running link step : cd /tmp/ltsmin10302919400980148830;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin10302919400980148830;'/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)||[]((LTLAPp0==true))))))&&((LTLAPp2==true)||X(<>(((LTLAPp2==true)&&<>(!(LTLAPp0==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-14 finished in 93424 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(!p0)||X(X(F((!p0&&F(p1)))))))'
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Applied a total of 0 rules in 1 ms. Remains 209 /209 variables (removed 0) and now considering 197/197 (removed 0) transitions.
// Phase 1: matrix 197 rows 209 cols
[2024-05-23 00:16:00] [INFO ] Computed 19 invariants in 6 ms
[2024-05-23 00:16:00] [INFO ] Implicit Places using invariants in 73 ms returned []
[2024-05-23 00:16:00] [INFO ] Invariant cache hit.
[2024-05-23 00:16:00] [INFO ] Implicit Places using invariants and state equation in 231 ms returned []
Implicit Place search using SMT with State Equation took 305 ms to find 0 implicit places.
[2024-05-23 00:16:00] [INFO ] Invariant cache hit.
[2024-05-23 00:16:00] [INFO ] Dead Transitions using invariants and state equation in 81 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 389 ms. Remains : 209/209 places, 197/197 transitions.
Stuttering acceptance computed with spot in 221 ms :[(OR (NOT p1) p0), (NOT p1), (OR (NOT p1) p0), p0, p0, p0, (AND (NOT p1) p0)]
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=p0, acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(NOT p0), acceptance={} source=3 dest: 4}], [{ cond=p0, acceptance={} source=4 dest: 2}, { cond=(NOT p0), acceptance={} source=4 dest: 5}], [{ cond=p0, acceptance={} source=5 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=5 dest: 6}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=6 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=6 dest: 6}]], initial=3, aps=[p1:(OR (LT s66 1) (LT s197 1)), p0:(LT s138 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]]
Stuttering criterion allowed to conclude after 28 steps with 0 reset in 0 ms.
FORMULA DoubleExponent-PT-004-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DoubleExponent-PT-004-LTLFireability-15 finished in 633 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)))||(p2&&F(p3))))))'
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)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
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(F(p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((p0||X(F(p1))))))'
Found a Lengthening insensitive property : DoubleExponent-PT-004-LTLFireability-09
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 209 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 209/209 places, 197/197 transitions.
Graph (complete) has 349 edges and 209 vertex of which 208 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Discarding 1 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 47 transitions
Trivial Post-agglo rules discarded 47 transitions
Performed 47 trivial Post agglomeration. Transition count delta: 47
Iterating post reduction 0 with 47 rules applied. Total rules applied 48 place count 207 transition count 148
Reduce places removed 47 places and 0 transitions.
Iterating post reduction 1 with 47 rules applied. Total rules applied 95 place count 160 transition count 148
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 7 Pre rules applied. Total rules applied 95 place count 160 transition count 141
Deduced a syphon composed of 7 places in 0 ms
Reduce places removed 7 places and 0 transitions.
Iterating global reduction 2 with 14 rules applied. Total rules applied 109 place count 153 transition count 141
Performed 39 Post agglomeration using F-continuation condition.Transition count delta: 39
Deduced a syphon composed of 39 places in 0 ms
Reduce places removed 39 places and 0 transitions.
Iterating global reduction 2 with 78 rules applied. Total rules applied 187 place count 114 transition count 102
Performed 5 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 5 places in 0 ms
Reduce places removed 5 places and 0 transitions.
Iterating global reduction 2 with 10 rules applied. Total rules applied 197 place count 109 transition count 102
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 2 with 1 rules applied. Total rules applied 198 place count 108 transition count 101
Applied a total of 198 rules in 15 ms. Remains 108 /209 variables (removed 101) and now considering 101/197 (removed 96) transitions.
// Phase 1: matrix 101 rows 108 cols
[2024-05-23 00:16:01] [INFO ] Computed 19 invariants in 1 ms
[2024-05-23 00:16:01] [INFO ] Implicit Places using invariants in 50 ms returned []
[2024-05-23 00:16:01] [INFO ] Invariant cache hit.
[2024-05-23 00:16:01] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:16:01] [INFO ] Implicit Places using invariants and state equation in 154 ms returned []
Implicit Place search using SMT with State Equation took 207 ms to find 0 implicit places.
[2024-05-23 00:16:01] [INFO ] Invariant cache hit.
[2024-05-23 00:16:01] [INFO ] Dead Transitions using invariants and state equation in 49 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 108/209 places, 101/197 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 271 ms. Remains : 108/209 places, 101/197 transitions.
Running random walk in product with property : DoubleExponent-PT-004-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s31 1) (LT s98 1)), p1:(LT s13 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 25720 reset in 110 ms.
Product exploration explored 100000 steps with 25835 reset in 119 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.1 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), true, (X (X p1))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 5 factoid took 96 ms. Reduced automaton from 3 states, 4 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1401 resets, run finished after 94 ms. (steps per millisecond=106 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 821 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 800 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 2) seen :0
Finished probabilistic random walk after 135027 steps, run visited all 2 properties in 377 ms. (steps per millisecond=358 )
Probabilistic random walk after 135027 steps, saw 67543 distinct states, run finished after 377 ms. (steps per millisecond=358 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X (NOT p0)), (X (X (NOT p0))), true, (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 5 factoid took 145 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-23 00:16:02] [INFO ] Invariant cache hit.
[2024-05-23 00:16:03] [INFO ] Implicit Places using invariants in 59 ms returned []
[2024-05-23 00:16:03] [INFO ] Invariant cache hit.
[2024-05-23 00:16:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:16:03] [INFO ] Implicit Places using invariants and state equation in 157 ms returned []
Implicit Place search using SMT with State Equation took 240 ms to find 0 implicit places.
[2024-05-23 00:16:03] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:16:03] [INFO ] Invariant cache hit.
[2024-05-23 00:16:03] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 302 ms. Remains : 108/108 places, 101/101 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Graph (complete) has 320 edges and 108 vertex of which 107 are kept as prefixes of interest. Removing 1 places using SCC suffix rule.0 ms
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 65 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Incomplete random walk after 10000 steps, including 1374 resets, run finished after 102 ms. (steps per millisecond=98 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 816 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 809 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 2) seen :0
Finished probabilistic random walk after 135027 steps, run visited all 2 properties in 378 ms. (steps per millisecond=357 )
Probabilistic random walk after 135027 steps, saw 67543 distinct states, run finished after 378 ms. (steps per millisecond=357 ) properties seen :2
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND (NOT p0) p1), (X p1), (X (X p1))]
False Knowledge obtained : [(F p0), (F (NOT p1))]
Knowledge based reduction with 3 factoid took 140 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p0) (NOT p1)), (NOT p1)]
Product exploration explored 100000 steps with 34034 reset in 123 ms.
Product exploration explored 100000 steps with 34022 reset in 125 ms.
Built C files in :
/tmp/ltsmin15414556439897616178
[2024-05-23 00:16:04] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-23 00:16:04] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:04] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-23 00:16:04] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:04] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-23 00:16:04] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:04] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15414556439897616178
Running compilation step : cd /tmp/ltsmin15414556439897616178;'/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 210 ms.
Running link step : cd /tmp/ltsmin15414556439897616178;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin15414556439897616178;'/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/stateBased7790517221009583076.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 108 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 108/108 places, 101/101 transitions.
Applied a total of 0 rules in 4 ms. Remains 108 /108 variables (removed 0) and now considering 101/101 (removed 0) transitions.
[2024-05-23 00:16:19] [INFO ] Invariant cache hit.
[2024-05-23 00:16:19] [INFO ] Implicit Places using invariants in 57 ms returned []
[2024-05-23 00:16:19] [INFO ] Invariant cache hit.
[2024-05-23 00:16:19] [INFO ] State equation strengthened by 6 read => feed constraints.
[2024-05-23 00:16:19] [INFO ] Implicit Places using invariants and state equation in 149 ms returned []
Implicit Place search using SMT with State Equation took 208 ms to find 0 implicit places.
[2024-05-23 00:16:19] [INFO ] Redundant transitions in 0 ms returned []
[2024-05-23 00:16:19] [INFO ] Invariant cache hit.
[2024-05-23 00:16:20] [INFO ] Dead Transitions using invariants and state equation in 55 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 271 ms. Remains : 108/108 places, 101/101 transitions.
Built C files in :
/tmp/ltsmin9210598833964526363
[2024-05-23 00:16:20] [INFO ] Computing symmetric may disable matrix : 101 transitions.
[2024-05-23 00:16:20] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:20] [INFO ] Computing symmetric may enable matrix : 101 transitions.
[2024-05-23 00:16:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:20] [INFO ] Computing Do-Not-Accords matrix : 101 transitions.
[2024-05-23 00:16:20] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:16:20] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9210598833964526363
Running compilation step : cd /tmp/ltsmin9210598833964526363;'/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 203 ms.
Running link step : cd /tmp/ltsmin9210598833964526363;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin9210598833964526363;'/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/stateBased14196344684425248865.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-23 00:16:35] [INFO ] Flatten gal took : 4 ms
[2024-05-23 00:16:35] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:16:35] [INFO ] Time to serialize gal into /tmp/LTL10310434638468035386.gal : 1 ms
[2024-05-23 00:16:35] [INFO ] Time to serialize properties into /tmp/LTL6284295318304294997.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/LTL10310434638468035386.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10833084265152099407.hoa' '-atoms' '/tmp/LTL6284295318304294997.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/LTL6284295318304294997.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10833084265152099407.hoa
Detected timeout of ITS tools.
[2024-05-23 00:16:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:16:50] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:16:50] [INFO ] Time to serialize gal into /tmp/LTL3887835570443555568.gal : 1 ms
[2024-05-23 00:16:50] [INFO ] Time to serialize properties into /tmp/LTL1201613255519115707.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/LTL3887835570443555568.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1201613255519115707.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(p115<1)")))||("((p147>=1)&&(p85<1))")))))
Formula 0 simplified : XF(!"((p147>=1)&&(p85<1))" & XG!"(p115<1)")
Detected timeout of ITS tools.
[2024-05-23 00:17:05] [INFO ] Flatten gal took : 3 ms
[2024-05-23 00:17:05] [INFO ] Applying decomposition
[2024-05-23 00:17:05] [INFO ] Flatten gal took : 3 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/graph4886856769930001490.txt' '-o' '/tmp/graph4886856769930001490.bin' '-w' '/tmp/graph4886856769930001490.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph4886856769930001490.bin' '-l' '-1' '-v' '-w' '/tmp/graph4886856769930001490.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:17:05] [INFO ] Decomposing Gal with order
[2024-05-23 00:17:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:17:05] [INFO ] Removed a total of 66 redundant transitions.
[2024-05-23 00:17:05] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:17:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 2 ms.
[2024-05-23 00:17:05] [INFO ] Time to serialize gal into /tmp/LTL4086564329950768583.gal : 6 ms
[2024-05-23 00:17:05] [INFO ] Time to serialize properties into /tmp/LTL9298861797099604145.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/LTL4086564329950768583.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9298861797099604145.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((X(G((X(F("(i1.i0.u4.p115<1)")))||("((i1.i0.u10.p147>=1)&&(i6.u37.p85<1))")))))
Formula 0 simplified : XF(!"((i1.i0.u10.p147>=1)&&(i6.u37.p85<1))" & XG!"(i1.i0.u4.p115<1)")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11603481160013697328
[2024-05-23 00:17:20] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11603481160013697328
Running compilation step : cd /tmp/ltsmin11603481160013697328;'/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 179 ms.
Running link step : cd /tmp/ltsmin11603481160013697328;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin11603481160013697328;'/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)))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DoubleExponent-PT-004-LTLFireability-09 finished in 94084 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F((p0 U (p1||G(p0)))))&&(p2||X(F((p2&&F(!p0))))))))'
[2024-05-23 00:17:35] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin2674340829429442990
[2024-05-23 00:17:35] [INFO ] Computing symmetric may disable matrix : 197 transitions.
[2024-05-23 00:17:35] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:17:35] [INFO ] Computing symmetric may enable matrix : 197 transitions.
[2024-05-23 00:17:35] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:17:35] [INFO ] Applying decomposition
[2024-05-23 00:17:35] [INFO ] Flatten gal took : 5 ms
[2024-05-23 00:17:35] [INFO ] Computing Do-Not-Accords matrix : 197 transitions.
[2024-05-23 00:17:35] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-23 00:17:35] [INFO ] Built C files in 18ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2674340829429442990
Running compilation step : cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '90' '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'
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/graph14326476983531428869.txt' '-o' '/tmp/graph14326476983531428869.bin' '-w' '/tmp/graph14326476983531428869.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph14326476983531428869.bin' '-l' '-1' '-v' '-w' '/tmp/graph14326476983531428869.weights' '-q' '0' '-e' '0.001'
[2024-05-23 00:17:35] [INFO ] Decomposing Gal with order
[2024-05-23 00:17:35] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-23 00:17:35] [INFO ] Removed a total of 62 redundant transitions.
[2024-05-23 00:17:35] [INFO ] Flatten gal took : 9 ms
[2024-05-23 00:17:35] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 2 ms.
[2024-05-23 00:17:35] [INFO ] Time to serialize gal into /tmp/LTLFireability5824476208867872156.gal : 13 ms
[2024-05-23 00:17:35] [INFO ] Time to serialize properties into /tmp/LTLFireability7450306866811222557.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/LTLFireability5824476208867872156.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability7450306866811222557.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 8 LTL properties
Checking formula 0 : !((G(F((("(i1.i1.u14.p135<1)")U(("((i0.i2.u59.p35<1)&&(i1.i1.u14.p135<1))")||(G("(i1.i1.u14.p135<1)"))))||(("(i6.i1.u79.p70>=1)")&&(F(...204
Formula 0 simplified : FG((!"(i6.i1.u79.p70>=1)" | G!"((i5.i1.u61.p36>=1)&&(i5.i2.u68.p54>=1))") & (!"(i1.i1.u14.p135<1)" M !"((i0.i2.u59.p35<1)&&(i1.i1.u1...168
Compilation finished in 351 ms.
Running link step : cd /tmp/ltsmin2674340829429442990;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))||((LTLAPp2==true)&&<>((LTLAPp3==true))))))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((((LTLAPp0==true) U ((LTLAPp1==true)||[]((LTLAPp0==true))))||((LTLAPp2==true)&&<>((LTLAPp3==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp4==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp5==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp6==true)||[](<>((LTLAPp7==true))))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2024-05-23 00:42:43] [INFO ] Flatten gal took : 7 ms
[2024-05-23 00:42:43] [INFO ] Time to serialize gal into /tmp/LTLFireability10721524038898040275.gal : 1 ms
[2024-05-23 00:42:43] [INFO ] Time to serialize properties into /tmp/LTLFireability13227455056921787326.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/LTLFireability10721524038898040275.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability13227455056921787326.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...299
Read 8 LTL properties
Checking formula 0 : !((G(F((("(p135<1)")U(("((p35<1)&&(p135<1))")||(G("(p135<1)"))))||(("(p70>=1)")&&(F("((p36>=1)&&(p54>=1))")))))))
Formula 0 simplified : FG((!"(p70>=1)" | G!"((p36>=1)&&(p54>=1))") & (!"(p135<1)" M !"((p35<1)&&(p135<1))"))
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp6==true)||[](<>((LTLAPp7==true))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>450 s) on command cd /tmp/ltsmin2674340829429442990;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>([]((LTLAPp8==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin2674340829429442990;'/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([](((LTLAPp9==true)||X(<>((LTLAPp10==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( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.004: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.004: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.006: LTL layer: formula: X([](((LTLAPp9==true)||X(<>((LTLAPp10==true))))))
pins2lts-mc-linux64( 2/ 8), 0.006: "X([](((LTLAPp9==true)||X(<>((LTLAPp10==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 0.006: Using Spin LTL semantics
pins2lts-mc-linux64( 3/ 8), 0.007: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.007: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.009: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.009: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.012: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.011: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.011: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.012: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.014: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.024: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.025: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.027: Weak Buchi automaton detected, adding non-accepting as progress label.
pins2lts-mc-linux64( 0/ 8), 0.097: DFS-FIFO for weak LTL, using special progress label 213
pins2lts-mc-linux64( 0/ 8), 0.097: There are 214 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.097: State length is 210, there are 201 groups
pins2lts-mc-linux64( 0/ 8), 0.097: Running dfsfifo using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.097: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.097: Successor permutation: rr
pins2lts-mc-linux64( 0/ 8), 0.097: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 2/ 8), 0.104: ~2 levels ~960 states ~1064 transitions
pins2lts-mc-linux64( 2/ 8), 0.125: ~2 levels ~1920 states ~2120 transitions
pins2lts-mc-linux64( 2/ 8), 0.151: ~2 levels ~3840 states ~4200 transitions
pins2lts-mc-linux64( 2/ 8), 0.182: ~2 levels ~7680 states ~8408 transitions
pins2lts-mc-linux64( 1/ 8), 0.369: ~2 levels ~15360 states ~16896 transitions
pins2lts-mc-linux64( 1/ 8), 0.587: ~3 levels ~30720 states ~33544 transitions
pins2lts-mc-linux64( 1/ 8), 0.887: ~3 levels ~61440 states ~67288 transitions
pins2lts-mc-linux64( 1/ 8), 1.293: ~3 levels ~122880 states ~135400 transitions
pins2lts-mc-linux64( 1/ 8), 2.048: ~3 levels ~245760 states ~271656 transitions
pins2lts-mc-linux64( 1/ 8), 3.348: ~3 levels ~491520 states ~543720 transitions
pins2lts-mc-linux64( 5/ 8), 5.413: ~2 levels ~983040 states ~1085872 transitions
pins2lts-mc-linux64( 1/ 8), 8.778: ~3 levels ~1966080 states ~2177608 transitions
pins2lts-mc-linux64( 0/ 8), 15.576: ~3 levels ~3932160 states ~4349432 transitions
pins2lts-mc-linux64( 7/ 8), 27.503: ~3 levels ~7864320 states ~8668848 transitions
pins2lts-mc-linux64( 0/ 8), 50.038: ~3 levels ~15728640 states ~17406728 transitions
pins2lts-mc-linux64( 0/ 8), 94.756: ~3 levels ~31457280 states ~34854536 transitions
pins2lts-mc-linux64( 0/ 8), 186.151: ~3 levels ~62914560 states ~69668424 transitions
pins2lts-mc-linux64( 0/ 8), 368.984: ~3 levels ~125829120 states ~139373608 transitions
pins2lts-mc-linux64( 3/ 8), 403.078: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 403.092:
pins2lts-mc-linux64( 0/ 8), 403.092: mean standard work distribution: 0.7% (states) 0.8% (transitions)
pins2lts-mc-linux64( 0/ 8), 403.092:
pins2lts-mc-linux64( 0/ 8), 403.092: Explored 134049210 states 148147489 transitions, fanout: 1.105
pins2lts-mc-linux64( 0/ 8), 403.092: Total exploration time 402.980 sec (402.950 sec minimum, 402.970 sec on average)
pins2lts-mc-linux64( 0/ 8), 403.092: States per second: 332645, Transitions per second: 367630
pins2lts-mc-linux64( 0/ 8), 403.092:
pins2lts-mc-linux64( 0/ 8), 403.092: Progress states detected: 67108030
pins2lts-mc-linux64( 0/ 8), 403.092: Redundant explorations: -0.1239
pins2lts-mc-linux64( 0/ 8), 403.092:
pins2lts-mc-linux64( 0/ 8), 403.092: Queue width: 8B, total height: 423854, memory: 3.23MB
pins2lts-mc-linux64( 0/ 8), 403.092: Tree memory: 1039.7MB, 8.1 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 403.092: Tree fill ratio (roots/leafs): 99.0%/6.0%
pins2lts-mc-linux64( 0/ 8), 403.092: Stored 197 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 403.092: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 403.092: Est. total memory use: 1042.9MB (~1027.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2674340829429442990;'/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([](((LTLAPp9==true)||X(<>((LTLAPp10==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin2674340829429442990;'/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([](((LTLAPp9==true)||X(<>((LTLAPp10==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)
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9708828 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16039300 kB

BK_TIME_CONFINEMENT_REACHED

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

+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600

Sequence of Actions to be Executed by the VM

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

set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="DoubleExponent-PT-004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DoubleExponent-PT-004, 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 r153-tall-171631151600343"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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