Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 528K
-rw-r--r-- 1 mcc users 7.8K Feb 26 15:37 CTLCardinality.txt
-rw-r--r-- 1 mcc users 87K Feb 26 15:37 CTLCardinality.xml
-rw-r--r-- 1 mcc users 4.9K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 44K Feb 26 15:36 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:50 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K Feb 25 15:50 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 15:50 LTLFireability.xml
-rw-r--r-- 1 mcc users 11K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 123K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 8.0K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 71K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:50 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:50 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 69K Mar 5 18:22 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1678260962642

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-02b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 07:36:04] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-08 07:36:04] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 07:36:04] [INFO ] Load time of PNML (sax parser for PT used): 58 ms
[2023-03-08 07:36:04] [INFO ] Transformed 288 places.
[2023-03-08 07:36:04] [INFO ] Transformed 239 transitions.
[2023-03-08 07:36:04] [INFO ] Found NUPN structural information;
[2023-03-08 07:36:04] [INFO ] Parsed PT model containing 288 places and 239 transitions and 699 arcs in 123 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA DES-PT-02b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-06 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-02b-LTLFireability-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 39 out of 288 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 288/288 places, 239/239 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 285 transition count 239
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 20 place count 268 transition count 222
Iterating global reduction 1 with 17 rules applied. Total rules applied 37 place count 268 transition count 222
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 44 place count 261 transition count 215
Iterating global reduction 1 with 7 rules applied. Total rules applied 51 place count 261 transition count 215
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 55 place count 261 transition count 211
Applied a total of 55 rules in 50 ms. Remains 261 /288 variables (removed 27) and now considering 211/239 (removed 28) transitions.
// Phase 1: matrix 211 rows 261 cols
[2023-03-08 07:36:05] [INFO ] Computed 62 place invariants in 20 ms
[2023-03-08 07:36:05] [INFO ] Implicit Places using invariants in 280 ms returned []
[2023-03-08 07:36:05] [INFO ] Invariant cache hit.
[2023-03-08 07:36:05] [INFO ] Implicit Places using invariants and state equation in 329 ms returned [8]
Discarding 1 places :
Implicit Place search using SMT with State Equation took 636 ms to find 1 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 260/288 places, 211/239 transitions.
Applied a total of 0 rules in 7 ms. Remains 260 /260 variables (removed 0) and now considering 211/211 (removed 0) transitions.
Finished structural reductions in LTL mode , in 2 iterations and 694 ms. Remains : 260/288 places, 211/239 transitions.
Support contains 39 out of 260 places after structural reductions.
[2023-03-08 07:36:05] [INFO ] Flatten gal took : 49 ms
[2023-03-08 07:36:05] [INFO ] Flatten gal took : 18 ms
[2023-03-08 07:36:05] [INFO ] Input system was already deterministic with 211 transitions.
Support contains 34 out of 260 places (down from 39) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 507 ms. (steps per millisecond=19 ) properties (out of 28) seen :26
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 211 rows 260 cols
[2023-03-08 07:36:06] [INFO ] Computed 61 place invariants in 6 ms
[2023-03-08 07:36:06] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 07:36:06] [INFO ] [Real]Absence check using 33 positive and 28 generalized place invariants in 9 ms returned sat
[2023-03-08 07:36:06] [INFO ] After 72ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2023-03-08 07:36:06] [INFO ] Deduced a trap composed of 37 places in 82 ms of which 4 ms to minimize.
[2023-03-08 07:36:06] [INFO ] Deduced a trap composed of 17 places in 95 ms of which 1 ms to minimize.
[2023-03-08 07:36:06] [INFO ] Deduced a trap composed of 29 places in 85 ms of which 2 ms to minimize.
[2023-03-08 07:36:07] [INFO ] Deduced a trap composed of 26 places in 46 ms of which 1 ms to minimize.
[2023-03-08 07:36:07] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 1 ms to minimize.
[2023-03-08 07:36:07] [INFO ] Deduced a trap composed of 17 places in 50 ms of which 1 ms to minimize.
[2023-03-08 07:36:07] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 496 ms
[2023-03-08 07:36:07] [INFO ] After 586ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:36:07] [INFO ] After 690ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:36:07] [INFO ] [Nat]Absence check using 33 positive place invariants in 12 ms returned sat
[2023-03-08 07:36:07] [INFO ] [Nat]Absence check using 33 positive and 28 generalized place invariants in 10 ms returned sat
[2023-03-08 07:36:07] [INFO ] After 72ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 07:36:07] [INFO ] Deduced a trap composed of 38 places in 56 ms of which 1 ms to minimize.
[2023-03-08 07:36:07] [INFO ] Deduced a trap composed of 14 places in 49 ms of which 1 ms to minimize.
[2023-03-08 07:36:07] [INFO ] Deduced a trap composed of 33 places in 47 ms of which 1 ms to minimize.
[2023-03-08 07:36:07] [INFO ] Trap strengthening (SAT) tested/added 4/3 trap constraints in 195 ms
[2023-03-08 07:36:07] [INFO ] After 277ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2023-03-08 07:36:07] [INFO ] After 362ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 6 ms.
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 19 transitions
Trivial Post-agglo rules discarded 19 transitions
Performed 19 trivial Post agglomeration. Transition count delta: 19
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 254 transition count 186
Reduce places removed 19 places and 0 transitions.
Iterating post reduction 1 with 19 rules applied. Total rules applied 41 place count 235 transition count 186
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 41 place count 235 transition count 177
Deduced a syphon composed of 9 places in 7 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 59 place count 226 transition count 177
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 68 place count 217 transition count 168
Iterating global reduction 2 with 9 rules applied. Total rules applied 77 place count 217 transition count 168
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 81 place count 217 transition count 164
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 86 place count 212 transition count 159
Iterating global reduction 3 with 5 rules applied. Total rules applied 91 place count 212 transition count 159
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 97 place count 212 transition count 153
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 99 place count 211 transition count 152
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 99 place count 211 transition count 149
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 105 place count 208 transition count 149
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 5 with 152 rules applied. Total rules applied 257 place count 132 transition count 73
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 261 place count 130 transition count 75
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 262 place count 130 transition count 74
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 263 place count 129 transition count 74
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 264 place count 129 transition count 74
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 265 place count 128 transition count 73
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 266 place count 127 transition count 73
Applied a total of 266 rules in 90 ms. Remains 127 /260 variables (removed 133) and now considering 73/211 (removed 138) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 90 ms. Remains : 127/260 places, 73/211 transitions.
Finished random walk after 6552 steps, including 327 resets, run visited all 1 properties in 19 ms. (steps per millisecond=344 )
Computed a total of 66 stabilizing places and 59 stable transitions
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.6 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 253 transition count 190
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 33 place count 237 transition count 190
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 33 place count 237 transition count 180
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 53 place count 227 transition count 180
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 62 place count 218 transition count 171
Iterating global reduction 2 with 9 rules applied. Total rules applied 71 place count 218 transition count 171
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 75 place count 218 transition count 167
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 80 place count 213 transition count 162
Iterating global reduction 3 with 5 rules applied. Total rules applied 85 place count 213 transition count 162
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 91 place count 213 transition count 156
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 93 place count 212 transition count 155
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 93 place count 212 transition count 152
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 99 place count 209 transition count 152
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 247 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 251 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 130 transition count 78
Applied a total of 254 rules in 43 ms. Remains 130 /260 variables (removed 130) and now considering 78/211 (removed 133) transitions.
// Phase 1: matrix 78 rows 130 cols
[2023-03-08 07:36:08] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 07:36:08] [INFO ] Implicit Places using invariants in 88 ms returned []
[2023-03-08 07:36:08] [INFO ] Invariant cache hit.
[2023-03-08 07:36:08] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 209 ms to find 0 implicit places.
[2023-03-08 07:36:08] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:36:08] [INFO ] Invariant cache hit.
[2023-03-08 07:36:08] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/260 places, 78/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 318 ms. Remains : 130/260 places, 78/211 transitions.
Stuttering acceptance computed with spot in 167 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s49 0) (EQ s123 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 8128 reset in 322 ms.
Product exploration explored 100000 steps with 8224 reset in 274 ms.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 109 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(NOT p0), (NOT p0)]
Finished random walk after 2 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=2 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 132 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 59 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 11 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 07:36:09] [INFO ] Invariant cache hit.
[2023-03-08 07:36:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 07:36:09] [INFO ] Invariant cache hit.
[2023-03-08 07:36:09] [INFO ] Implicit Places using invariants and state equation in 117 ms returned []
Implicit Place search using SMT with State Equation took 227 ms to find 0 implicit places.
[2023-03-08 07:36:09] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:36:09] [INFO ] Invariant cache hit.
[2023-03-08 07:36:09] [INFO ] Dead Transitions using invariants and state equation in 60 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 303 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 23 stabilizing places and 18 stable transitions
Computed a total of 23 stabilizing places and 18 stable transitions
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 115 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 80 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Knowledge obtained : [p0]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F (NOT p0))]
Knowledge based reduction with 1 factoid took 134 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 68 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 8023 reset in 203 ms.
Product exploration explored 100000 steps with 8160 reset in 221 ms.
Built C files in :
/tmp/ltsmin2911781986682944810
[2023-03-08 07:36:10] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2023-03-08 07:36:10] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:36:10] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2023-03-08 07:36:10] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:36:10] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2023-03-08 07:36:10] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:36:10] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2911781986682944810
Running compilation step : cd /tmp/ltsmin2911781986682944810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 369 ms.
Running link step : cd /tmp/ltsmin2911781986682944810;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin2911781986682944810;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9303050243349313465.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 4 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 07:36:26] [INFO ] Invariant cache hit.
[2023-03-08 07:36:26] [INFO ] Implicit Places using invariants in 81 ms returned []
[2023-03-08 07:36:26] [INFO ] Invariant cache hit.
[2023-03-08 07:36:26] [INFO ] Implicit Places using invariants and state equation in 128 ms returned []
Implicit Place search using SMT with State Equation took 219 ms to find 0 implicit places.
[2023-03-08 07:36:26] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:36:26] [INFO ] Invariant cache hit.
[2023-03-08 07:36:26] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 288 ms. Remains : 130/130 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin12004435905937159150
[2023-03-08 07:36:26] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2023-03-08 07:36:26] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:36:26] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2023-03-08 07:36:26] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:36:26] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2023-03-08 07:36:26] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:36:26] [INFO ] Built C files in 10ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12004435905937159150
Running compilation step : cd /tmp/ltsmin12004435905937159150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin12004435905937159150;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 30 ms.
Running LTSmin : cd /tmp/ltsmin12004435905937159150;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased12291964140618735649.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 07:36:41] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:36:41] [INFO ] Flatten gal took : 7 ms
[2023-03-08 07:36:41] [INFO ] Time to serialize gal into /tmp/LTL1927560579808310227.gal : 2 ms
[2023-03-08 07:36:41] [INFO ] Time to serialize properties into /tmp/LTL1249529063078395699.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL1927560579808310227.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10731694208656928989.hoa' '-atoms' '/tmp/LTL1249529063078395699.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL1249529063078395699.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10731694208656928989.hoa
Detected timeout of ITS tools.
[2023-03-08 07:36:56] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:36:56] [INFO ] Flatten gal took : 8 ms
[2023-03-08 07:36:56] [INFO ] Time to serialize gal into /tmp/LTL8755374317167884437.gal : 1 ms
[2023-03-08 07:36:56] [INFO ] Time to serialize properties into /tmp/LTL3260382526370568800.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8755374317167884437.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3260382526370568800.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F("((p163==0)||(p277==1))"))))
Formula 0 simplified : FG!"((p163==0)||(p277==1))"
Detected timeout of ITS tools.
[2023-03-08 07:37:11] [INFO ] Flatten gal took : 11 ms
[2023-03-08 07:37:11] [INFO ] Applying decomposition
[2023-03-08 07:37:11] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph1859689142739093192.txt' '-o' '/tmp/graph1859689142739093192.bin' '-w' '/tmp/graph1859689142739093192.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1859689142739093192.bin' '-l' '-1' '-v' '-w' '/tmp/graph1859689142739093192.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:37:11] [INFO ] Decomposing Gal with order
[2023-03-08 07:37:11] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:37:11] [INFO ] Removed a total of 41 redundant transitions.
[2023-03-08 07:37:11] [INFO ] Flatten gal took : 33 ms
[2023-03-08 07:37:11] [INFO ] Fuse similar labels procedure discarded/fused a total of 16 labels/synchronizations in 5 ms.
[2023-03-08 07:37:11] [INFO ] Time to serialize gal into /tmp/LTL16680283875197004508.gal : 3 ms
[2023-03-08 07:37:11] [INFO ] Time to serialize properties into /tmp/LTL14904052270847095893.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16680283875197004508.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14904052270847095893.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i10.i0.u14.p163==0)||(i13.u43.p277==1))"))))
Formula 0 simplified : FG!"((i10.i0.u14.p163==0)||(i13.u43.p277==1))"
Reverse transition relation is NOT exact ! Due to transitions t9_t34, t10_t31, t201_t81, t7_t50_t41, t169_t36, t168_t25, u44.t11.t17, i0.i1.t113_t114_t135_...413
Computing Next relation with stutter on 89695 deadlock states
130 unique states visited
0 strongly connected components in search stack
132 transitions explored
67 items max in DFS search stack
1051 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,10.5419,454888,1,0,1.12988e+06,1820,1371,1.29176e+06,527,9532,1725553
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLFireability-00 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-02b-LTLFireability-00 finished in 76887 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 253 transition count 189
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 236 transition count 189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 236 transition count 179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 226 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 217 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 217 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 217 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 212 transition count 161
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 212 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 93 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 211 transition count 154
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 95 place count 211 transition count 152
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 99 place count 209 transition count 152
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 5 with 148 rules applied. Total rules applied 247 place count 135 transition count 78
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 251 place count 133 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 253 place count 131 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 254 place count 130 transition count 78
Applied a total of 254 rules in 55 ms. Remains 130 /260 variables (removed 130) and now considering 78/211 (removed 133) transitions.
// Phase 1: matrix 78 rows 130 cols
[2023-03-08 07:37:24] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 07:37:25] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-08 07:37:25] [INFO ] Invariant cache hit.
[2023-03-08 07:37:25] [INFO ] Implicit Places using invariants and state equation in 134 ms returned []
Implicit Place search using SMT with State Equation took 279 ms to find 0 implicit places.
[2023-03-08 07:37:25] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:37:25] [INFO ] Invariant cache hit.
[2023-03-08 07:37:25] [INFO ] Dead Transitions using invariants and state equation in 62 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 130/260 places, 78/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 407 ms. Remains : 130/260 places, 78/211 transitions.
Stuttering acceptance computed with spot in 62 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s17 0), p0:(AND (EQ s78 1) (EQ s96 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4979 reset in 300 ms.
Product exploration explored 100000 steps with 5008 reset in 211 ms.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0)))))]
Knowledge based reduction with 3 factoid took 193 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 4 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=4 )
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (AND p1 (NOT p0)))]
False Knowledge obtained : [(X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (AND p1 (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 228 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 63 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 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 07:37:26] [INFO ] Invariant cache hit.
[2023-03-08 07:37:26] [INFO ] Implicit Places using invariants in 78 ms returned []
[2023-03-08 07:37:26] [INFO ] Invariant cache hit.
[2023-03-08 07:37:26] [INFO ] Implicit Places using invariants and state equation in 109 ms returned []
Implicit Place search using SMT with State Equation took 189 ms to find 0 implicit places.
[2023-03-08 07:37:26] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:37:26] [INFO ] Invariant cache hit.
[2023-03-08 07:37:26] [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 255 ms. Remains : 130/130 places, 78/78 transitions.
Computed a total of 24 stabilizing places and 19 stable transitions
Computed a total of 24 stabilizing places and 19 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
Knowledge based reduction with 3 factoid took 191 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 66 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 5 steps, including 0 resets, run visited all 2 properties in 1 ms. (steps per millisecond=5 )
Knowledge obtained : [(AND (NOT p0) p1), (X (AND (NOT p0) p1)), (X (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(X (X (AND (NOT p0) p1))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (F (AND (NOT p0) (NOT p1))), (F (NOT (AND (NOT p0) p1)))]
Knowledge based reduction with 3 factoid took 218 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 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5030 reset in 197 ms.
Product exploration explored 100000 steps with 5026 reset in 223 ms.
Built C files in :
/tmp/ltsmin7788206423997937605
[2023-03-08 07:37:27] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2023-03-08 07:37:27] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:37:27] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2023-03-08 07:37:27] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:37:27] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2023-03-08 07:37:27] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:37:27] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7788206423997937605
Running compilation step : cd /tmp/ltsmin7788206423997937605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 190 ms.
Running link step : cd /tmp/ltsmin7788206423997937605;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin7788206423997937605;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3291055861052018856.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 130 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 130/130 places, 78/78 transitions.
Applied a total of 0 rules in 7 ms. Remains 130 /130 variables (removed 0) and now considering 78/78 (removed 0) transitions.
[2023-03-08 07:37:43] [INFO ] Invariant cache hit.
[2023-03-08 07:37:43] [INFO ] Implicit Places using invariants in 72 ms returned []
[2023-03-08 07:37:43] [INFO ] Invariant cache hit.
[2023-03-08 07:37:43] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 170 ms to find 0 implicit places.
[2023-03-08 07:37:43] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:37:43] [INFO ] Invariant cache hit.
[2023-03-08 07:37:43] [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 239 ms. Remains : 130/130 places, 78/78 transitions.
Built C files in :
/tmp/ltsmin11273408514669552409
[2023-03-08 07:37:43] [INFO ] Computing symmetric may disable matrix : 78 transitions.
[2023-03-08 07:37:43] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:37:43] [INFO ] Computing symmetric may enable matrix : 78 transitions.
[2023-03-08 07:37:43] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:37:43] [INFO ] Computing Do-Not-Accords matrix : 78 transitions.
[2023-03-08 07:37:43] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:37:43] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11273408514669552409
Running compilation step : cd /tmp/ltsmin11273408514669552409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 180 ms.
Running link step : cd /tmp/ltsmin11273408514669552409;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin11273408514669552409;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3383270123657312862.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 07:37:58] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:37:58] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:37:58] [INFO ] Time to serialize gal into /tmp/LTL4652518774912513596.gal : 1 ms
[2023-03-08 07:37:58] [INFO ] Time to serialize properties into /tmp/LTL3123685430769388625.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4652518774912513596.gal' '-t' 'CGAL' '-hoa' '/tmp/aut3360351070799954845.hoa' '-atoms' '/tmp/LTL3123685430769388625.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL3123685430769388625.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut3360351070799954845.hoa
Detected timeout of ITS tools.
[2023-03-08 07:38:13] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:38:13] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:38:13] [INFO ] Time to serialize gal into /tmp/LTL9909962869933546662.gal : 1 ms
[2023-03-08 07:38:13] [INFO ] Time to serialize properties into /tmp/LTL5958781529579048195.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9909962869933546662.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL5958781529579048195.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(p62==0)"))||("((p207==1)&&(p235==1))")))))
Formula 0 simplified : G(F!"(p62==0)" & FG!"((p207==1)&&(p235==1))")
Detected timeout of ITS tools.
[2023-03-08 07:38:28] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:38:28] [INFO ] Applying decomposition
[2023-03-08 07:38:28] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph17360117090482519660.txt' '-o' '/tmp/graph17360117090482519660.bin' '-w' '/tmp/graph17360117090482519660.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph17360117090482519660.bin' '-l' '-1' '-v' '-w' '/tmp/graph17360117090482519660.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:38:28] [INFO ] Decomposing Gal with order
[2023-03-08 07:38:28] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:38:28] [INFO ] Removed a total of 44 redundant transitions.
[2023-03-08 07:38:28] [INFO ] Flatten gal took : 14 ms
[2023-03-08 07:38:28] [INFO ] Fuse similar labels procedure discarded/fused a total of 19 labels/synchronizations in 2 ms.
[2023-03-08 07:38:28] [INFO ] Time to serialize gal into /tmp/LTL559418582712384889.gal : 6 ms
[2023-03-08 07:38:28] [INFO ] Time to serialize properties into /tmp/LTL15324962326113029103.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL559418582712384889.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15324962326113029103.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G(F((G("(i0.i0.u4.p62==0)"))||("((i8.u28.p207==1)&&(i8.u36.p235==1))")))))
Formula 0 simplified : G(F!"(i0.i0.u4.p62==0)" & FG!"((i8.u28.p207==1)&&(i8.u36.p235==1))")
Reverse transition relation is NOT exact ! Due to transitions t9_t34, t10_t31, t54_t56_t58_t60_t62_t64, t7_t50_t41, t169_t36, t168_t25, t113_t114_t135_t210...448
Computing Next relation with stutter on 89695 deadlock states
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2553526815632427059
[2023-03-08 07:38:43] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2553526815632427059
Running compilation step : cd /tmp/ltsmin2553526815632427059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 175 ms.
Running link step : cd /tmp/ltsmin2553526815632427059;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin2553526815632427059;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(LTLAPp1==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-02b-LTLFireability-01 finished in 93890 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((G(p1)||p0))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 253 transition count 191
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 238 transition count 191
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 31 place count 238 transition count 180
Deduced a syphon composed of 11 places in 0 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 227 transition count 180
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 61 place count 219 transition count 172
Iterating global reduction 2 with 8 rules applied. Total rules applied 69 place count 219 transition count 172
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 72 place count 219 transition count 169
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 77 place count 214 transition count 164
Iterating global reduction 3 with 5 rules applied. Total rules applied 82 place count 214 transition count 164
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 88 place count 214 transition count 158
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 90 place count 213 transition count 157
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 90 place count 213 transition count 155
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 94 place count 211 transition count 155
Performed 73 Post agglomeration using F-continuation condition.Transition count delta: 73
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 5 with 146 rules applied. Total rules applied 240 place count 138 transition count 82
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 246 place count 135 transition count 85
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 248 place count 133 transition count 83
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 249 place count 132 transition count 83
Applied a total of 249 rules in 33 ms. Remains 132 /260 variables (removed 128) and now considering 83/211 (removed 128) transitions.
// Phase 1: matrix 83 rows 132 cols
[2023-03-08 07:38:58] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 07:38:58] [INFO ] Implicit Places using invariants in 92 ms returned []
[2023-03-08 07:38:58] [INFO ] Invariant cache hit.
[2023-03-08 07:38:58] [INFO ] Implicit Places using invariants and state equation in 100 ms returned []
Implicit Place search using SMT with State Equation took 193 ms to find 0 implicit places.
[2023-03-08 07:38:58] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:38:58] [INFO ] Invariant cache hit.
[2023-03-08 07:38:59] [INFO ] Dead Transitions using invariants and state equation in 59 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/260 places, 83/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 290 ms. Remains : 132/260 places, 83/211 transitions.
Stuttering acceptance computed with spot in 67 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s105 1), p0:(OR (NEQ s16 1) (NEQ s107 1) (AND (EQ s1 1) (EQ s42 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 5747 reset in 203 ms.
Product exploration explored 100000 steps with 5784 reset in 225 ms.
Computed a total of 26 stabilizing places and 21 stable transitions
Computed a total of 26 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 210 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 79 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 428 steps, including 19 resets, run visited all 2 properties in 7 ms. (steps per millisecond=61 )
Knowledge obtained : [(AND (NOT p1) p0), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 202 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 67 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 61 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-08 07:39:00] [INFO ] Invariant cache hit.
[2023-03-08 07:39:00] [INFO ] Implicit Places using invariants in 84 ms returned []
[2023-03-08 07:39:00] [INFO ] Invariant cache hit.
[2023-03-08 07:39:00] [INFO ] Implicit Places using invariants and state equation in 96 ms returned []
Implicit Place search using SMT with State Equation took 184 ms to find 0 implicit places.
[2023-03-08 07:39:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 07:39:00] [INFO ] Invariant cache hit.
[2023-03-08 07:39:00] [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 258 ms. Remains : 132/132 places, 83/83 transitions.
Computed a total of 26 stabilizing places and 21 stable transitions
Computed a total of 26 stabilizing places and 21 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 162 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 75 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Finished random walk after 145 steps, including 6 resets, run visited all 2 properties in 2 ms. (steps per millisecond=72 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p1))), (F (AND (NOT p0) p1))]
Knowledge based reduction with 5 factoid took 191 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 56 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 5745 reset in 199 ms.
Product exploration explored 100000 steps with 5765 reset in 215 ms.
Built C files in :
/tmp/ltsmin2052124205886115411
[2023-03-08 07:39:01] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2023-03-08 07:39:01] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:39:01] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2023-03-08 07:39:01] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:39:01] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2023-03-08 07:39:01] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:39:01] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2052124205886115411
Running compilation step : cd /tmp/ltsmin2052124205886115411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 194 ms.
Running link step : cd /tmp/ltsmin2052124205886115411;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin2052124205886115411;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased13229265959514393786.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 5 out of 132 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 132/132 places, 83/83 transitions.
Applied a total of 0 rules in 7 ms. Remains 132 /132 variables (removed 0) and now considering 83/83 (removed 0) transitions.
[2023-03-08 07:39:16] [INFO ] Invariant cache hit.
[2023-03-08 07:39:16] [INFO ] Implicit Places using invariants in 77 ms returned []
[2023-03-08 07:39:16] [INFO ] Invariant cache hit.
[2023-03-08 07:39:16] [INFO ] Implicit Places using invariants and state equation in 97 ms returned []
Implicit Place search using SMT with State Equation took 182 ms to find 0 implicit places.
[2023-03-08 07:39:16] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:39:16] [INFO ] Invariant cache hit.
[2023-03-08 07:39:16] [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 246 ms. Remains : 132/132 places, 83/83 transitions.
Built C files in :
/tmp/ltsmin12976685881398424048
[2023-03-08 07:39:16] [INFO ] Computing symmetric may disable matrix : 83 transitions.
[2023-03-08 07:39:16] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:39:16] [INFO ] Computing symmetric may enable matrix : 83 transitions.
[2023-03-08 07:39:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:39:16] [INFO ] Computing Do-Not-Accords matrix : 83 transitions.
[2023-03-08 07:39:16] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:39:16] [INFO ] Built C files in 7ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12976685881398424048
Running compilation step : cd /tmp/ltsmin12976685881398424048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 185 ms.
Running link step : cd /tmp/ltsmin12976685881398424048;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin12976685881398424048;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased16433742701447234944.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 07:39:32] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:39:32] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:39:32] [INFO ] Time to serialize gal into /tmp/LTL14407178079151657460.gal : 1 ms
[2023-03-08 07:39:32] [INFO ] Time to serialize properties into /tmp/LTL13047764681382779859.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.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14407178079151657460.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17204266651903195569.hoa' '-atoms' '/tmp/LTL13047764681382779859.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

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

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F(("((p57!=1)||(p246!=1))")||((G("(p244==1)"))||("((p7==1)&&(p139==1))"))))))
Formula 0 simplified : G(F!"(p244==1)" & FG(!"((p7==1)&&(p139==1))" & !"((p57!=1)||(p246!=1))"))
Detected timeout of ITS tools.
[2023-03-08 07:40:02] [INFO ] Flatten gal took : 5 ms
[2023-03-08 07:40:02] [INFO ] Applying decomposition
[2023-03-08 07:40:02] [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.202303021504/bin/convert-linux64' '-i' '/tmp/graph1524487429942546049.txt' '-o' '/tmp/graph1524487429942546049.bin' '-w' '/tmp/graph1524487429942546049.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1524487429942546049.bin' '-l' '-1' '-v' '-w' '/tmp/graph1524487429942546049.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:40:02] [INFO ] Decomposing Gal with order
[2023-03-08 07:40:02] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:40:02] [INFO ] Removed a total of 51 redundant transitions.
[2023-03-08 07:40:02] [INFO ] Flatten gal took : 9 ms
[2023-03-08 07:40:02] [INFO ] Fuse similar labels procedure discarded/fused a total of 23 labels/synchronizations in 3 ms.
[2023-03-08 07:40:02] [INFO ] Time to serialize gal into /tmp/LTL5084013761097787165.gal : 2 ms
[2023-03-08 07:40:02] [INFO ] Time to serialize properties into /tmp/LTL11379039364612408229.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5084013761097787165.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11379039364612408229.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.u3.p57!=1)||(i1.u40.p246!=1))")||((G("(i14.u39.p244==1)"))||("((u10.p7==1)&&(u10.p139==1))"))))))
Formula 0 simplified : G(F!"(i14.u39.p244==1)" & FG(!"((i1.u3.p57!=1)||(i1.u40.p246!=1))" & !"((u10.p7==1)&&(u10.p139==1))"))
Reverse transition relation is NOT exact ! Due to transitions t9_t34, t10_t31, t7_t50_t41, t26_t37_t75_t38_t40_t51_t67_t68_t69_t70_t71_t72_t73_t52_t54_t56_...505
Computing Next relation with stutter on 144064 deadlock states
90 unique states visited
0 strongly connected components in search stack
124 transitions explored
63 items max in DFS search stack
218 ticks for the emptiness check
Model ,|S| ,Time ,Mem(kb) ,fin. SDD ,fin. DDD ,peak SDD ,peak DDD ,SDD Hom ,SDD cache peak ,DDD Hom ,DDD cachepeak ,SHom cache
STATS,0,2.20081,123864,1,0,304162,1670,1581,250624,508,7745,443046
no accepting run found
Formula 0 is TRUE no accepting run found.
FORMULA DES-PT-02b-LTLFireability-03 TRUE TECHNIQUES DECISION_DIAGRAMS TOPOLOGICAL USE_NUPN
Treatment of property DES-PT-02b-LTLFireability-03 finished in 66140 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((G(p0) U G(p1))))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 248 transition count 199
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 248 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 248 transition count 195
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 32 place count 244 transition count 191
Iterating global reduction 1 with 4 rules applied. Total rules applied 36 place count 244 transition count 191
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 40 place count 244 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 243 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 243 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 243 transition count 185
Applied a total of 43 rules in 16 ms. Remains 243 /260 variables (removed 17) and now considering 185/211 (removed 26) transitions.
// Phase 1: matrix 185 rows 243 cols
[2023-03-08 07:40:04] [INFO ] Computed 61 place invariants in 6 ms
[2023-03-08 07:40:05] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 07:40:05] [INFO ] Invariant cache hit.
[2023-03-08 07:40:05] [INFO ] Implicit Places using invariants and state equation in 163 ms returned []
Implicit Place search using SMT with State Equation took 264 ms to find 0 implicit places.
[2023-03-08 07:40:05] [INFO ] Invariant cache hit.
[2023-03-08 07:40:05] [INFO ] Dead Transitions using invariants and state equation in 98 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/260 places, 185/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 390 ms. Remains : 243/260 places, 185/211 transitions.
Stuttering acceptance computed with spot in 153 ms :[(NOT p1), (NOT p1), true, (AND p1 (NOT p0)), (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(AND p1 p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 3}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 2}, { cond=(AND p1 p0), acceptance={} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 2}, { cond=p1, acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (AND (EQ s4 1) (EQ s99 1)) (AND (EQ s40 1) (NOT (AND (EQ s4 1) (EQ s99 1))))), p0:(NEQ s40 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 25058 reset in 143 ms.
Product exploration explored 100000 steps with 24937 reset in 148 ms.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 11 factoid took 428 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (AND (NOT p0) p1), (NOT p1)]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 5) seen :4
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 07:40:06] [INFO ] Invariant cache hit.
[2023-03-08 07:40:06] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND p1 p0))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p0))))), true, (X (X (NOT p1))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND p1 p0)))), (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p0) p1)), (F (AND p0 p1)), (F (NOT (AND p0 (NOT p1))))]
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 12 factoid took 608 ms. Reduced automaton from 5 states, 12 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 152 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 156 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
[2023-03-08 07:40:07] [INFO ] Invariant cache hit.
[2023-03-08 07:40:07] [INFO ] [Real]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 07:40:07] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-08 07:40:07] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:07] [INFO ] [Real]Absence check using state equation in 303 ms returned sat
[2023-03-08 07:40:07] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:40:07] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 07:40:07] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-08 07:40:07] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:08] [INFO ] [Nat]Absence check using state equation in 223 ms returned sat
[2023-03-08 07:40:08] [INFO ] Computed and/alt/rep : 183/311/183 causal constraints (skipped 1 transitions) in 24 ms.
[2023-03-08 07:40:08] [INFO ] Added : 166 causal constraints over 34 iterations in 752 ms. Result :sat
Could not prove EG (NOT p1)
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Applied a total of 0 rules in 4 ms. Remains 243 /243 variables (removed 0) and now considering 185/185 (removed 0) transitions.
[2023-03-08 07:40:08] [INFO ] Invariant cache hit.
[2023-03-08 07:40:09] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 07:40:09] [INFO ] Invariant cache hit.
[2023-03-08 07:40:09] [INFO ] Implicit Places using invariants and state equation in 160 ms returned []
Implicit Place search using SMT with State Equation took 262 ms to find 0 implicit places.
[2023-03-08 07:40:09] [INFO ] Invariant cache hit.
[2023-03-08 07:40:09] [INFO ] Dead Transitions using invariants and state equation in 91 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 359 ms. Remains : 243/243 places, 185/185 transitions.
Computed a total of 64 stabilizing places and 57 stable transitions
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Computed a total of 64 stabilizing places and 57 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 309 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Incomplete random walk after 10000 steps, including 90 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :2
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 07:40:09] [INFO ] Invariant cache hit.
[2023-03-08 07:40:09] [INFO ] [Real]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 07:40:09] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-08 07:40:09] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 07:40:09] [INFO ] [Nat]Absence check using 32 positive place invariants in 5 ms returned sat
[2023-03-08 07:40:09] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 8 ms returned sat
[2023-03-08 07:40:10] [INFO ] After 63ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 07:40:10] [INFO ] Deduced a trap composed of 18 places in 37 ms of which 0 ms to minimize.
[2023-03-08 07:40:10] [INFO ] Deduced a trap composed of 15 places in 35 ms of which 1 ms to minimize.
[2023-03-08 07:40:10] [INFO ] Deduced a trap composed of 16 places in 34 ms of which 1 ms to minimize.
[2023-03-08 07:40:10] [INFO ] Deduced a trap composed of 20 places in 26 ms of which 0 ms to minimize.
[2023-03-08 07:40:10] [INFO ] Deduced a trap composed of 24 places in 31 ms of which 0 ms to minimize.
[2023-03-08 07:40:10] [INFO ] Deduced a trap composed of 21 places in 24 ms of which 0 ms to minimize.
[2023-03-08 07:40:10] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 250 ms
[2023-03-08 07:40:10] [INFO ] After 321ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 11 ms.
[2023-03-08 07:40:10] [INFO ] After 388ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 238 transition count 163
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 221 transition count 163
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 221 transition count 153
Deduced a syphon composed of 10 places in 0 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 211 transition count 153
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 207 place count 136 transition count 78
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 215 place count 132 transition count 87
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 132 transition count 86
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 131 transition count 86
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 218 place count 131 transition count 86
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 130 transition count 85
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 129 transition count 85
Applied a total of 220 rules in 23 ms. Remains 129 /243 variables (removed 114) and now considering 85/185 (removed 100) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 129/243 places, 85/185 transitions.
Finished random walk after 135 steps, including 3 resets, run visited all 1 properties in 1 ms. (steps per millisecond=135 )
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT p1)), (X p0), (X (NOT (AND p0 p1))), true, (X (X (NOT p1))), (X (X p0)), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : [(F (AND p0 p1)), (F (NOT p0)), (F p1)]
Knowledge based reduction with 8 factoid took 350 ms. Reduced automaton from 5 states, 11 edges and 2 AP (stutter sensitive) to 5 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 157 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
[2023-03-08 07:40:11] [INFO ] Invariant cache hit.
[2023-03-08 07:40:11] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2023-03-08 07:40:11] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 19 ms returned sat
[2023-03-08 07:40:11] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:11] [INFO ] [Real]Absence check using state equation in 310 ms returned sat
[2023-03-08 07:40:11] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:40:11] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2023-03-08 07:40:11] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 18 ms returned sat
[2023-03-08 07:40:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:11] [INFO ] [Nat]Absence check using state equation in 221 ms returned sat
[2023-03-08 07:40:11] [INFO ] Computed and/alt/rep : 183/311/183 causal constraints (skipped 1 transitions) in 10 ms.
[2023-03-08 07:40:12] [INFO ] Added : 166 causal constraints over 34 iterations in 689 ms. Result :sat
Could not prove EG (NOT p1)
Stuttering acceptance computed with spot in 161 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Product exploration explored 100000 steps with 33484 reset in 143 ms.
Product exploration explored 100000 steps with 33317 reset in 142 ms.
Applying partial POR strategy [false, true, true, true, true]
Stuttering acceptance computed with spot in 181 ms :[(OR (NOT p1) (NOT p0)), (NOT p1), true, (NOT p0), (NOT p1)]
Support contains 3 out of 243 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 243/243 places, 185/185 transitions.
Graph (complete) has 436 edges and 243 vertex of which 238 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.1 ms
Discarding 5 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 238 transition count 182
Performed 7 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 7 Pre rules applied. Total rules applied 16 place count 238 transition count 184
Deduced a syphon composed of 22 places in 0 ms
Iterating global reduction 1 with 7 rules applied. Total rules applied 23 place count 238 transition count 184
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 28 place count 233 transition count 179
Deduced a syphon composed of 17 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 33 place count 233 transition count 179
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 77 rules applied. Total rules applied 110 place count 233 transition count 182
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 223 transition count 172
Deduced a syphon composed of 84 places in 0 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 223 transition count 172
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 223 transition count 200
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 221 transition count 194
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 221 transition count 194
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 48 ms. Remains 221 /243 variables (removed 22) and now considering 194/185 (removed -9) transitions.
[2023-03-08 07:40:13] [INFO ] Redundant transitions in 5 ms returned []
// Phase 1: matrix 194 rows 221 cols
[2023-03-08 07:40:13] [INFO ] Computed 59 place invariants in 2 ms
[2023-03-08 07:40:13] [INFO ] Dead Transitions using invariants and state equation in 102 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 221/243 places, 194/185 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 173 ms. Remains : 221/243 places, 194/185 transitions.
Built C files in :
/tmp/ltsmin5692701109682885916
[2023-03-08 07:40:13] [INFO ] Built C files in 2ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5692701109682885916
Running compilation step : cd /tmp/ltsmin5692701109682885916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 279 ms.
Running link step : cd /tmp/ltsmin5692701109682885916;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 21 ms.
Running LTSmin : cd /tmp/ltsmin5692701109682885916;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased7946493427701316190.hoa' '--buchi-type=spotba'
LTSmin run took 178 ms.
FORMULA DES-PT-02b-LTLFireability-04 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02b-LTLFireability-04 finished in 8998 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((p0&&F(G(p1))))))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 249 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 245 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 245 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 245 transition count 189
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 38 place count 244 transition count 188
Iterating global reduction 2 with 1 rules applied. Total rules applied 39 place count 244 transition count 188
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 40 place count 244 transition count 187
Applied a total of 40 rules in 23 ms. Remains 244 /260 variables (removed 16) and now considering 187/211 (removed 24) transitions.
// Phase 1: matrix 187 rows 244 cols
[2023-03-08 07:40:13] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 07:40:14] [INFO ] Implicit Places using invariants in 99 ms returned []
[2023-03-08 07:40:14] [INFO ] Invariant cache hit.
[2023-03-08 07:40:14] [INFO ] Implicit Places using invariants and state equation in 329 ms returned []
Implicit Place search using SMT with State Equation took 443 ms to find 0 implicit places.
[2023-03-08 07:40:14] [INFO ] Invariant cache hit.
[2023-03-08 07:40:14] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/260 places, 187/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 602 ms. Remains : 244/260 places, 187/211 transitions.
Stuttering acceptance computed with spot in 248 ms :[(OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=p0, acceptance={} source=2 dest: 4}], [{ cond=true, acceptance={0} source=3 dest: 3}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(OR (EQ s78 0) (EQ s85 0)), p1:(AND (EQ s78 1) (EQ s85 1) (EQ s44 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 134 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-05 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-05 finished in 865 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G(p0)))'
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 248 transition count 199
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 248 transition count 199
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 28 place count 248 transition count 195
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 33 place count 243 transition count 190
Iterating global reduction 1 with 5 rules applied. Total rules applied 38 place count 243 transition count 190
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 43 place count 243 transition count 185
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 44 place count 242 transition count 184
Iterating global reduction 2 with 1 rules applied. Total rules applied 45 place count 242 transition count 184
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 46 place count 242 transition count 183
Applied a total of 46 rules in 13 ms. Remains 242 /260 variables (removed 18) and now considering 183/211 (removed 28) transitions.
// Phase 1: matrix 183 rows 242 cols
[2023-03-08 07:40:14] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 07:40:14] [INFO ] Implicit Places using invariants in 95 ms returned []
[2023-03-08 07:40:14] [INFO ] Invariant cache hit.
[2023-03-08 07:40:15] [INFO ] Implicit Places using invariants and state equation in 229 ms returned []
Implicit Place search using SMT with State Equation took 332 ms to find 0 implicit places.
[2023-03-08 07:40:15] [INFO ] Invariant cache hit.
[2023-03-08 07:40:15] [INFO ] Dead Transitions using invariants and state equation in 110 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 242/260 places, 183/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 456 ms. Remains : 242/260 places, 183/211 transitions.
Stuttering acceptance computed with spot in 65 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 0}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s210 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 DES-PT-02b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-07 finished in 532 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X((p0||F(G(p1))))&&(X(p1)||(p2 U (p3||G(p2))))))'
Support contains 5 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 249 transition count 197
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 29 place count 245 transition count 193
Iterating global reduction 1 with 4 rules applied. Total rules applied 33 place count 245 transition count 193
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 37 place count 245 transition count 189
Applied a total of 37 rules in 10 ms. Remains 245 /260 variables (removed 15) and now considering 189/211 (removed 22) transitions.
// Phase 1: matrix 189 rows 245 cols
[2023-03-08 07:40:15] [INFO ] Computed 61 place invariants in 2 ms
[2023-03-08 07:40:15] [INFO ] Implicit Places using invariants in 94 ms returned []
[2023-03-08 07:40:15] [INFO ] Invariant cache hit.
[2023-03-08 07:40:15] [INFO ] Implicit Places using invariants and state equation in 170 ms returned []
Implicit Place search using SMT with State Equation took 265 ms to find 0 implicit places.
[2023-03-08 07:40:15] [INFO ] Invariant cache hit.
[2023-03-08 07:40:15] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 245/260 places, 189/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 371 ms. Remains : 245/260 places, 189/211 transitions.
Stuttering acceptance computed with spot in 215 ms :[(OR (AND (NOT p1) (NOT p2) (NOT p3)) (AND (NOT p0) (NOT p1))), (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p3) (NOT p2) (NOT p1)), true, (NOT p1), (AND (NOT p3) (NOT p2))]
Running random walk in product with property : DES-PT-02b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}, { cond=(AND (NOT p3) p2), acceptance={} source=0 dest: 3}], [{ cond=(NOT p1), acceptance={} source=1 dest: 4}], [{ cond=(NOT p0), acceptance={} source=2 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2) (NOT p1)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p3) p2 (NOT p1)), acceptance={} source=3 dest: 6}], [{ cond=true, acceptance={0} source=4 dest: 4}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={0} source=5 dest: 5}], [{ cond=(AND (NOT p3) (NOT p2)), acceptance={} source=6 dest: 4}, { cond=(AND (NOT p3) p2), acceptance={} source=6 dest: 6}]], initial=0, aps=[p3:(AND (NEQ s34 1) (NEQ s51 1)), p2:(NEQ s51 1), p1:(EQ s29 1), p0:(AND (EQ s79 1) (EQ s86 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 192 steps with 0 reset in 2 ms.
FORMULA DES-PT-02b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-08 finished in 614 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0||G(p1))))'
Support contains 2 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 26 place count 249 transition count 196
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 30 place count 245 transition count 192
Iterating global reduction 1 with 4 rules applied. Total rules applied 34 place count 245 transition count 192
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 38 place count 245 transition count 188
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 39 place count 244 transition count 187
Iterating global reduction 2 with 1 rules applied. Total rules applied 40 place count 244 transition count 187
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 41 place count 244 transition count 186
Applied a total of 41 rules in 13 ms. Remains 244 /260 variables (removed 16) and now considering 186/211 (removed 25) transitions.
// Phase 1: matrix 186 rows 244 cols
[2023-03-08 07:40:15] [INFO ] Computed 61 place invariants in 3 ms
[2023-03-08 07:40:16] [INFO ] Implicit Places using invariants in 90 ms returned []
[2023-03-08 07:40:16] [INFO ] Invariant cache hit.
[2023-03-08 07:40:16] [INFO ] Implicit Places using invariants and state equation in 161 ms returned []
Implicit Place search using SMT with State Equation took 252 ms to find 0 implicit places.
[2023-03-08 07:40:16] [INFO ] Invariant cache hit.
[2023-03-08 07:40:16] [INFO ] Dead Transitions using invariants and state equation in 95 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 244/260 places, 186/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 361 ms. Remains : 244/260 places, 186/211 transitions.
Stuttering acceptance computed with spot in 97 ms :[true, (AND (NOT p1) (NOT p0)), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-02b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=(NOT p1), acceptance={} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}]], initial=1, aps=[p1:(EQ s23 1), p0:(EQ s84 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-09 finished in 480 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(p0))'
Support contains 1 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 17 rules applied. Total rules applied 18 place count 253 transition count 189
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 35 place count 236 transition count 189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 35 place count 236 transition count 179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 55 place count 226 transition count 179
Discarding 9 places :
Symmetric choice reduction at 2 with 9 rule applications. Total rules 64 place count 217 transition count 170
Iterating global reduction 2 with 9 rules applied. Total rules applied 73 place count 217 transition count 170
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 2 with 4 rules applied. Total rules applied 77 place count 217 transition count 166
Discarding 5 places :
Symmetric choice reduction at 3 with 5 rule applications. Total rules 82 place count 212 transition count 161
Iterating global reduction 3 with 5 rules applied. Total rules applied 87 place count 212 transition count 161
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 3 with 6 rules applied. Total rules applied 93 place count 212 transition count 155
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 95 place count 211 transition count 154
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 3 Pre rules applied. Total rules applied 95 place count 211 transition count 151
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 101 place count 208 transition count 151
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 5 with 150 rules applied. Total rules applied 251 place count 133 transition count 76
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 255 place count 131 transition count 78
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 257 place count 129 transition count 76
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 258 place count 128 transition count 76
Applied a total of 258 rules in 45 ms. Remains 128 /260 variables (removed 132) and now considering 76/211 (removed 135) transitions.
// Phase 1: matrix 76 rows 128 cols
[2023-03-08 07:40:16] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 07:40:16] [INFO ] Implicit Places using invariants in 85 ms returned []
[2023-03-08 07:40:16] [INFO ] Invariant cache hit.
[2023-03-08 07:40:16] [INFO ] Implicit Places using invariants and state equation in 99 ms returned []
Implicit Place search using SMT with State Equation took 194 ms to find 0 implicit places.
[2023-03-08 07:40:16] [INFO ] Redundant transitions in 9 ms returned []
[2023-03-08 07:40:16] [INFO ] Invariant cache hit.
[2023-03-08 07:40:16] [INFO ] Dead Transitions using invariants and state equation in 53 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 128/260 places, 76/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 317 ms. Remains : 128/260 places, 76/211 transitions.
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-02b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s45 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null][true]]
Product exploration explored 100000 steps with 22331 reset in 142 ms.
Product exploration explored 100000 steps with 22296 reset in 164 ms.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Detected a total of 25/128 stabilizing places and 20/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 135 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p0)]
Finished random walk after 6 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=6 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 180 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 38 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 24 ms :[(NOT p0)]
[2023-03-08 07:40:17] [INFO ] Invariant cache hit.
[2023-03-08 07:40:17] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 07:40:17] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 07:40:17] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:17] [INFO ] [Real]Absence check using state equation in 71 ms returned sat
[2023-03-08 07:40:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:40:17] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 07:40:17] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 9 ms returned sat
[2023-03-08 07:40:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:17] [INFO ] [Nat]Absence check using state equation in 51 ms returned sat
[2023-03-08 07:40:17] [INFO ] Deduced a trap composed of 8 places in 35 ms of which 0 ms to minimize.
[2023-03-08 07:40:17] [INFO ] Deduced a trap composed of 3 places in 41 ms of which 0 ms to minimize.
[2023-03-08 07:40:17] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 108 ms
[2023-03-08 07:40:17] [INFO ] Computed and/alt/rep : 65/187/65 causal constraints (skipped 7 transitions) in 3 ms.
[2023-03-08 07:40:17] [INFO ] Added : 32 causal constraints over 7 iterations in 69 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 1 out of 128 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 128/128 places, 76/76 transitions.
Applied a total of 0 rules in 2 ms. Remains 128 /128 variables (removed 0) and now considering 76/76 (removed 0) transitions.
[2023-03-08 07:40:17] [INFO ] Invariant cache hit.
[2023-03-08 07:40:17] [INFO ] Implicit Places using invariants in 68 ms returned []
[2023-03-08 07:40:17] [INFO ] Invariant cache hit.
[2023-03-08 07:40:18] [INFO ] Implicit Places using invariants and state equation in 104 ms returned []
Implicit Place search using SMT with State Equation took 185 ms to find 0 implicit places.
[2023-03-08 07:40:18] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 07:40:18] [INFO ] Invariant cache hit.
[2023-03-08 07:40:18] [INFO ] Dead Transitions using invariants and state equation in 47 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 242 ms. Remains : 128/128 places, 76/76 transitions.
Computed a total of 25 stabilizing places and 20 stable transitions
Computed a total of 25 stabilizing places and 20 stable transitions
Detected a total of 25/128 stabilizing places and 20/76 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 2 factoid took 126 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Knowledge obtained : [(NOT p0), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 2 factoid took 161 ms. Reduced automaton from 1 states, 1 edges and 1 AP (stutter insensitive) to 1 states, 1 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 40 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
[2023-03-08 07:40:18] [INFO ] Invariant cache hit.
[2023-03-08 07:40:18] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 07:40:18] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 10 ms returned sat
[2023-03-08 07:40:18] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:18] [INFO ] [Real]Absence check using state equation in 70 ms returned sat
[2023-03-08 07:40:18] [INFO ] Solution in real domain found non-integer solution.
[2023-03-08 07:40:18] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 07:40:18] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 6 ms returned sat
[2023-03-08 07:40:18] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-08 07:40:18] [INFO ] [Nat]Absence check using state equation in 52 ms returned sat
[2023-03-08 07:40:18] [INFO ] Deduced a trap composed of 8 places in 50 ms of which 3 ms to minimize.
[2023-03-08 07:40:18] [INFO ] Deduced a trap composed of 3 places in 34 ms of which 1 ms to minimize.
[2023-03-08 07:40:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 101 ms
[2023-03-08 07:40:18] [INFO ] Computed and/alt/rep : 65/187/65 causal constraints (skipped 7 transitions) in 5 ms.
[2023-03-08 07:40:18] [INFO ] Added : 32 causal constraints over 7 iterations in 75 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 33 ms :[(NOT p0)]
Product exploration explored 100000 steps with 22354 reset in 136 ms.
Product exploration explored 100000 steps with 22397 reset in 147 ms.
Built C files in :
/tmp/ltsmin3305270907556710388
[2023-03-08 07:40:19] [INFO ] Computing symmetric may disable matrix : 76 transitions.
[2023-03-08 07:40:19] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:40:19] [INFO ] Computing symmetric may enable matrix : 76 transitions.
[2023-03-08 07:40:19] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:40:19] [INFO ] Computing Do-Not-Accords matrix : 76 transitions.
[2023-03-08 07:40:19] [INFO ] Computation of Completed DNA matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:40:19] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3305270907556710388
Running compilation step : cd /tmp/ltsmin3305270907556710388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 178 ms.
Running link step : cd /tmp/ltsmin3305270907556710388;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin3305270907556710388;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14587666410124036315.hoa' '--buchi-type=spotba'
LTSmin run took 123 ms.
FORMULA DES-PT-02b-LTLFireability-10 TRUE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-02b-LTLFireability-10 finished in 3278 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0||(p1&&(p2 U p3)))))'
Support contains 6 out of 260 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Graph (complete) has 474 edges and 260 vertex of which 254 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 16 transitions
Trivial Post-agglo rules discarded 16 transitions
Performed 16 trivial Post agglomeration. Transition count delta: 16
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 253 transition count 190
Reduce places removed 16 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 17 rules applied. Total rules applied 34 place count 237 transition count 189
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 35 place count 236 transition count 189
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 10 Pre rules applied. Total rules applied 35 place count 236 transition count 179
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 3 with 20 rules applied. Total rules applied 55 place count 226 transition count 179
Discarding 8 places :
Symmetric choice reduction at 3 with 8 rule applications. Total rules 63 place count 218 transition count 171
Iterating global reduction 3 with 8 rules applied. Total rules applied 71 place count 218 transition count 171
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 218 transition count 168
Discarding 5 places :
Symmetric choice reduction at 4 with 5 rule applications. Total rules 79 place count 213 transition count 163
Iterating global reduction 4 with 5 rules applied. Total rules applied 84 place count 213 transition count 163
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 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 4 with 6 rules applied. Total rules applied 90 place count 213 transition count 157
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 92 place count 212 transition count 156
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 92 place count 212 transition count 154
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 96 place count 210 transition count 154
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 6 with 148 rules applied. Total rules applied 244 place count 136 transition count 80
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 6 with 2 rules applied. Total rules applied 246 place count 135 transition count 80
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 248 place count 133 transition count 78
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 249 place count 132 transition count 78
Applied a total of 249 rules in 22 ms. Remains 132 /260 variables (removed 128) and now considering 78/211 (removed 133) transitions.
// Phase 1: matrix 78 rows 132 cols
[2023-03-08 07:40:19] [INFO ] Computed 58 place invariants in 1 ms
[2023-03-08 07:40:19] [INFO ] Implicit Places using invariants in 74 ms returned []
[2023-03-08 07:40:19] [INFO ] Invariant cache hit.
[2023-03-08 07:40:19] [INFO ] Implicit Places using invariants and state equation in 101 ms returned []
Implicit Place search using SMT with State Equation took 197 ms to find 0 implicit places.
[2023-03-08 07:40:19] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 07:40:19] [INFO ] Invariant cache hit.
[2023-03-08 07:40:19] [INFO ] Dead Transitions using invariants and state equation in 57 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 132/260 places, 78/211 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 292 ms. Remains : 132/260 places, 78/211 transitions.
Stuttering acceptance computed with spot in 68 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3))), (AND (NOT p0) (NOT p3))]
Running random walk in product with property : DES-PT-02b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=(OR (AND (NOT p0) (NOT p1)) (AND (NOT p0) (NOT p3) (NOT p2))), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1 (NOT p3) p2), acceptance={0} source=0 dest: 1}], [{ cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={0} source=1 dest: 0}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s55 1) (EQ s72 1)), p1:(EQ s127 1), p3:(AND (EQ s32 1) (EQ s37 1)), p2:(EQ s12 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 15 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-11 finished in 373 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(G((F(p0)&&(p1||X(G(p2)))))))'
Support contains 4 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 247 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 247 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 247 transition count 194
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 242 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 242 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 45 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 241 transition count 182
Applied a total of 48 rules in 8 ms. Remains 241 /260 variables (removed 19) and now considering 182/211 (removed 29) transitions.
// Phase 1: matrix 182 rows 241 cols
[2023-03-08 07:40:20] [INFO ] Computed 61 place invariants in 1 ms
[2023-03-08 07:40:20] [INFO ] Implicit Places using invariants in 87 ms returned []
[2023-03-08 07:40:20] [INFO ] Invariant cache hit.
[2023-03-08 07:40:20] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 282 ms to find 0 implicit places.
[2023-03-08 07:40:20] [INFO ] Invariant cache hit.
[2023-03-08 07:40:20] [INFO ] Dead Transitions using invariants and state equation in 89 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/260 places, 182/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 380 ms. Remains : 241/260 places, 182/211 transitions.
Stuttering acceptance computed with spot in 164 ms :[(OR (NOT p0) (AND (NOT p1) (NOT p2))), (OR (NOT p0) (AND (NOT p1) (NOT p2))), (NOT p0), (NOT p2), true]
Running random walk in product with property : DES-PT-02b-LTLFireability-12 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={} source=1 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}], [{ cond=(AND p1 p2), acceptance={} source=3 dest: 3}, { cond=(NOT p2), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p0:(AND (EQ s63 1) (EQ s92 1)), p1:(EQ s15 1), p2:(NEQ s69 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 174 steps with 1 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-12 finished in 561 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((X((F(p1)||p0))||F(p2))))'
Support contains 6 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 11 place count 249 transition count 200
Iterating global reduction 0 with 11 rules applied. Total rules applied 22 place count 249 transition count 200
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 25 place count 249 transition count 197
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 30 place count 244 transition count 192
Iterating global reduction 1 with 5 rules applied. Total rules applied 35 place count 244 transition count 192
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 40 place count 244 transition count 187
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 41 place count 243 transition count 186
Iterating global reduction 2 with 1 rules applied. Total rules applied 42 place count 243 transition count 186
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 43 place count 243 transition count 185
Applied a total of 43 rules in 12 ms. Remains 243 /260 variables (removed 17) and now considering 185/211 (removed 26) transitions.
// Phase 1: matrix 185 rows 243 cols
[2023-03-08 07:40:20] [INFO ] Computed 61 place invariants in 4 ms
[2023-03-08 07:40:20] [INFO ] Implicit Places using invariants in 91 ms returned []
[2023-03-08 07:40:20] [INFO ] Invariant cache hit.
[2023-03-08 07:40:20] [INFO ] Implicit Places using invariants and state equation in 166 ms returned []
Implicit Place search using SMT with State Equation took 257 ms to find 0 implicit places.
[2023-03-08 07:40:20] [INFO ] Invariant cache hit.
[2023-03-08 07:40:20] [INFO ] Dead Transitions using invariants and state equation in 93 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 243/260 places, 185/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 365 ms. Remains : 243/260 places, 185/211 transitions.
Stuttering acceptance computed with spot in 131 ms :[(AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : DES-PT-02b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p2), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p2) (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p2) (NOT p1)), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p2:(AND (EQ s77 1) (EQ s84 1)), p0:(OR (AND (EQ s59 1) (EQ s167 1) (EQ s195 1)) (EQ s178 1)), p1:(EQ s178 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][false, false, false, false]]
Stuttering criterion allowed to conclude after 205 steps with 1 reset in 1 ms.
FORMULA DES-PT-02b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-13 finished in 517 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(X((X(p0)&&(X(X(p1)) U p1))))||(G(p1) U p1)))'
Support contains 3 out of 260 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 260/260 places, 211/211 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 247 transition count 198
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 247 transition count 198
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 30 place count 247 transition count 194
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 35 place count 242 transition count 189
Iterating global reduction 1 with 5 rules applied. Total rules applied 40 place count 242 transition count 189
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Iterating post reduction 1 with 5 rules applied. Total rules applied 45 place count 242 transition count 184
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 46 place count 241 transition count 183
Iterating global reduction 2 with 1 rules applied. Total rules applied 47 place count 241 transition count 183
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 48 place count 241 transition count 182
Applied a total of 48 rules in 14 ms. Remains 241 /260 variables (removed 19) and now considering 182/211 (removed 29) transitions.
// Phase 1: matrix 182 rows 241 cols
[2023-03-08 07:40:21] [INFO ] Computed 61 place invariants in 6 ms
[2023-03-08 07:40:21] [INFO ] Implicit Places using invariants in 97 ms returned []
[2023-03-08 07:40:21] [INFO ] Invariant cache hit.
[2023-03-08 07:40:21] [INFO ] Implicit Places using invariants and state equation in 158 ms returned []
Implicit Place search using SMT with State Equation took 258 ms to find 0 implicit places.
[2023-03-08 07:40:21] [INFO ] Invariant cache hit.
[2023-03-08 07:40:21] [INFO ] Dead Transitions using invariants and state equation in 90 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 241/260 places, 182/211 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 362 ms. Remains : 241/260 places, 182/211 transitions.
Stuttering acceptance computed with spot in 215 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), true, (NOT p1)]
Running random walk in product with property : DES-PT-02b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=true, acceptance={} source=2 dest: 3}, { cond=(NOT p1), acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 5}], [{ cond=(NOT p1), acceptance={} source=4 dest: 4}, { cond=true, acceptance={} source=4 dest: 6}], [{ cond=true, acceptance={} source=5 dest: 5}], [{ cond=(NOT p1), acceptance={} source=6 dest: 5}]], initial=0, aps=[p1:(AND (EQ s4 1) (EQ s97 1)), p0:(EQ s85 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 5 steps with 0 reset in 0 ms.
FORMULA DES-PT-02b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-02b-LTLFireability-15 finished in 591 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F((p0||G(p1)))))'
[2023-03-08 07:40:21] [INFO ] Flatten gal took : 13 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin12752632992321551285
[2023-03-08 07:40:21] [INFO ] Computing symmetric may disable matrix : 211 transitions.
[2023-03-08 07:40:21] [INFO ] Computation of Complete disable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:40:21] [INFO ] Applying decomposition
[2023-03-08 07:40:21] [INFO ] Computing symmetric may enable matrix : 211 transitions.
[2023-03-08 07:40:21] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:40:21] [INFO ] Flatten gal took : 6 ms
[2023-03-08 07:40:21] [INFO ] Computing Do-Not-Accords matrix : 211 transitions.
[2023-03-08 07:40:21] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 07:40:21] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12752632992321551285
Running compilation step : cd /tmp/ltsmin12752632992321551285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph4965006839460547418.txt' '-o' '/tmp/graph4965006839460547418.bin' '-w' '/tmp/graph4965006839460547418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph4965006839460547418.bin' '-l' '-1' '-v' '-w' '/tmp/graph4965006839460547418.weights' '-q' '0' '-e' '0.001'
[2023-03-08 07:40:21] [INFO ] Decomposing Gal with order
[2023-03-08 07:40:21] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 07:40:21] [INFO ] Removed a total of 32 redundant transitions.
[2023-03-08 07:40:21] [INFO ] Flatten gal took : 12 ms
[2023-03-08 07:40:21] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 6 ms.
[2023-03-08 07:40:21] [INFO ] Time to serialize gal into /tmp/LTLFireability15832623883603121417.gal : 4 ms
[2023-03-08 07:40:21] [INFO ] Time to serialize properties into /tmp/LTLFireability6253430617826525033.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15832623883603121417.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6253430617826525033.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i9.i1.u62.p207==1)&&(i9.i1.u71.p235==1))")||(G("(i11.i1.u16.p62==0)"))))))
Formula 0 simplified : G(F!"(i11.i1.u16.p62==0)" & FG!"((i9.i1.u62.p207==1)&&(i9.i1.u71.p235==1))")
Compilation finished in 362 ms.
Running link step : cd /tmp/ltsmin12752632992321551285;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin12752632992321551285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t54, t60, t136, t154, t168, i0.i2.u83.t17, i1.t141, i1.u9.t140, i1.u10.t138, i2.i1.t153, ...878
Computing Next relation with stutter on 955581 deadlock states
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.010: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.010: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.590: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.592: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.600: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.591: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.603: Initializing POR dependencies: labels 213, guards 211
pins2lts-mc-linux64( 3/ 8), 0.605: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.622: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.676: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.714: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.984: LTL layer: formula: [](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))
pins2lts-mc-linux64( 0/ 8), 0.984: "[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.984: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 1.156: buchi has 3 states
pins2lts-mc-linux64( 0/ 8), 1.226: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 1.248: There are 214 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.248: State length is 261, there are 217 groups
pins2lts-mc-linux64( 0/ 8), 1.248: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.248: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.248: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.248: Visible groups: 0 / 217, labels: 2 / 214
pins2lts-mc-linux64( 0/ 8), 1.248: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 1.248: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 2/ 8), 1.267: [Blue] ~93 levels ~960 states ~1408 transitions
pins2lts-mc-linux64( 2/ 8), 1.305: [Blue] ~94 levels ~1920 states ~2768 transitions
pins2lts-mc-linux64( 2/ 8), 1.391: [Blue] ~96 levels ~3840 states ~5488 transitions
pins2lts-mc-linux64( 2/ 8), 1.531: [Blue] ~96 levels ~7680 states ~11256 transitions
pins2lts-mc-linux64( 1/ 8), 1.854: [Blue] ~118 levels ~15360 states ~19896 transitions
pins2lts-mc-linux64( 2/ 8), 2.574: [Blue] ~119 levels ~30720 states ~46008 transitions
pins2lts-mc-linux64( 2/ 8), 3.867: [Blue] ~119 levels ~61440 states ~99552 transitions
pins2lts-mc-linux64( 5/ 8), 6.861: [Blue] ~131 levels ~122880 states ~177056 transitions
pins2lts-mc-linux64( 7/ 8), 10.295: [Blue] ~120 levels ~245760 states ~400856 transitions
pins2lts-mc-linux64( 7/ 8), 16.648: [Blue] ~208 levels ~491520 states ~760320 transitions
pins2lts-mc-linux64( 4/ 8), 25.311: [Blue] ~238 levels ~983040 states ~1349208 transitions
pins2lts-mc-linux64( 7/ 8), 39.383: [Blue] ~212 levels ~1966080 states ~2850344 transitions
pins2lts-mc-linux64( 6/ 8), 53.831: [Blue] ~229 levels ~3932160 states ~5562848 transitions
pins2lts-mc-linux64( 4/ 8), 79.617: [Blue] ~238 levels ~7864320 states ~10773976 transitions
pins2lts-mc-linux64( 4/ 8), 134.959: [Blue] ~242 levels ~15728640 states ~21963736 transitions
pins2lts-mc-linux64( 4/ 8), 239.137: [Blue] ~242 levels ~31457280 states ~43416928 transitions
pins2lts-mc-linux64( 4/ 8), 440.342: [Blue] ~242 levels ~62914560 states ~87246072 transitions
pins2lts-mc-linux64( 5/ 8), 798.469: [Blue] ~468 levels ~125829120 states ~185051792 transitions
pins2lts-mc-linux64( 4/ 8), 883.852: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 883.885:
pins2lts-mc-linux64( 0/ 8), 883.885: Explored 132881773 states 193345003 transitions, fanout: 1.455
pins2lts-mc-linux64( 0/ 8), 883.885: Total exploration time 882.620 sec (882.570 sec minimum, 882.594 sec on average)
pins2lts-mc-linux64( 0/ 8), 883.885: States per second: 150554, Transitions per second: 219058
pins2lts-mc-linux64( 0/ 8), 883.885:
pins2lts-mc-linux64( 0/ 8), 883.885: State space has 134217326 states, 33080622 are accepting
pins2lts-mc-linux64( 0/ 8), 883.885: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 883.885: blue states: 132881773 (99.00%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 883.885: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 883.885: all-red states: 91050394 (67.84%), bogus 27542 (0.02%)
pins2lts-mc-linux64( 0/ 8), 883.885:
pins2lts-mc-linux64( 0/ 8), 883.885: Total memory used for local state coloring: 21.5MB
pins2lts-mc-linux64( 0/ 8), 883.886:
pins2lts-mc-linux64( 0/ 8), 883.886: Queue width: 8B, total height: 1411691, memory: 10.77MB
pins2lts-mc-linux64( 0/ 8), 883.886: Tree memory: 1089.0MB, 8.5 B/state, compr.: 0.8%
pins2lts-mc-linux64( 0/ 8), 883.886: Tree fill ratio (roots/leafs): 99.0%/25.0%
pins2lts-mc-linux64( 0/ 8), 883.886: Stored 212 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 883.886: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 883.886: Est. total memory use: 1099.8MB (~1034.8MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12752632992321551285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin12752632992321551285;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>(((LTLAPp0==true)||[]((LTLAPp1==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2023-03-08 08:01:47] [INFO ] Applying decomposition
[2023-03-08 08:01:47] [INFO ] Flatten gal took : 7 ms
[2023-03-08 08:01:47] [INFO ] Decomposing Gal with order
[2023-03-08 08:01:47] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 08:01:47] [INFO ] Removed a total of 20 redundant transitions.
[2023-03-08 08:01:47] [INFO ] Flatten gal took : 13 ms
[2023-03-08 08:01:47] [INFO ] Fuse similar labels procedure discarded/fused a total of 99 labels/synchronizations in 9 ms.
[2023-03-08 08:01:47] [INFO ] Time to serialize gal into /tmp/LTLFireability11450489546642044981.gal : 4 ms
[2023-03-08 08:01:47] [INFO ] Time to serialize properties into /tmp/LTLFireability1320824487306647079.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11450489546642044981.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability1320824487306647079.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F(("((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.p207==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u93.p235==1))")||(G("(i1.i0.i0.i0.i0.u18.p62=...165
Formula 0 simplified : G(F!"(i1.i0.i0.i0.i0.u18.p62==0)" & FG!"((i1.i1.i0.i1.i0.i0.i1.i0.i0.i1.i0.u78.p207==1)&&(i1.i1.i0.i1.i0.i0.i1.i0.i1.i0.u93.p235==1)...158
Reverse transition relation is NOT exact ! Due to transitions t154, i0.t0, i1.i0.i0.i0.u19.t117, i1.i0.i0.i0.u19.t119, i1.i0.i0.i0.i0.u18.t123, i1.i0.i0.i0...1842
Detected timeout of ITS tools.
[2023-03-08 08:23:14] [INFO ] Flatten gal took : 143 ms
[2023-03-08 08:23:15] [INFO ] Input system was already deterministic with 211 transitions.
[2023-03-08 08:23:27] [INFO ] Transformed 260 places.
[2023-03-08 08:23:27] [INFO ] Transformed 211 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-08 08:23:27] [INFO ] Time to serialize gal into /tmp/LTLFireability17649842782964176075.gal : 15 ms
[2023-03-08 08:23:27] [INFO ] Time to serialize properties into /tmp/LTLFireability16109110876886305585.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability17649842782964176075.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability16109110876886305585.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((G(F(("((p207==1)&&(p235==1))")||(G("(p62==0)"))))))
Formula 0 simplified : G(F!"(p62==0)" & FG!"((p207==1)&&(p235==1))")
Reverse transition relation is NOT exact ! Due to transitions t0, t1, t17, t25, t31, t34, t36, t39, t50, t52, t53, t54, t55, t56, t57, t58, t59, t60, t61, ...458
Computing Next relation with stutter on 955581 deadlock states
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 9324164 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16058156 kB

BK_TIME_CONFINEMENT_REACHED

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is DES-PT-02b, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r101-tall-167814475300388"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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