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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 484K
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:36 CTLCardinality.txt
-rw-r--r-- 1 mcc users 62K Feb 26 15:36 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.5K Feb 26 15:36 CTLFireability.txt
-rw-r--r-- 1 mcc users 67K 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.7K Feb 25 15:51 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K Feb 25 15:51 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:51 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K Feb 25 15:51 LTLFireability.xml
-rw-r--r-- 1 mcc users 6.8K Feb 26 15:37 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 64K Feb 26 15:37 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 15:37 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 46K Feb 26 15:37 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Feb 25 15:51 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Feb 25 15:51 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 115K 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-40b-LTLFireability-00
FORMULA_NAME DES-PT-40b-LTLFireability-01
FORMULA_NAME DES-PT-40b-LTLFireability-02
FORMULA_NAME DES-PT-40b-LTLFireability-03
FORMULA_NAME DES-PT-40b-LTLFireability-04
FORMULA_NAME DES-PT-40b-LTLFireability-05
FORMULA_NAME DES-PT-40b-LTLFireability-06
FORMULA_NAME DES-PT-40b-LTLFireability-07
FORMULA_NAME DES-PT-40b-LTLFireability-08
FORMULA_NAME DES-PT-40b-LTLFireability-09
FORMULA_NAME DES-PT-40b-LTLFireability-10
FORMULA_NAME DES-PT-40b-LTLFireability-11
FORMULA_NAME DES-PT-40b-LTLFireability-12
FORMULA_NAME DES-PT-40b-LTLFireability-13
FORMULA_NAME DES-PT-40b-LTLFireability-14
FORMULA_NAME DES-PT-40b-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1678275111010

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-40b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-08 11:31:52] [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 11:31:52] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-08 11:31:52] [INFO ] Load time of PNML (sax parser for PT used): 65 ms
[2023-03-08 11:31:52] [INFO ] Transformed 439 places.
[2023-03-08 11:31:52] [INFO ] Transformed 390 transitions.
[2023-03-08 11:31:52] [INFO ] Found NUPN structural information;
[2023-03-08 11:31:52] [INFO ] Parsed PT model containing 439 places and 390 transitions and 1303 arcs in 345 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 6 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 2 formulas.
FORMULA DES-PT-40b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-40b-LTLFireability-12 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 40 out of 439 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 439/439 places, 390/390 transitions.
Reduce places removed 3 places and 0 transitions.
Iterating post reduction 0 with 3 rules applied. Total rules applied 3 place count 436 transition count 390
Discarding 21 places :
Symmetric choice reduction at 1 with 21 rule applications. Total rules 24 place count 415 transition count 369
Iterating global reduction 1 with 21 rules applied. Total rules applied 45 place count 415 transition count 369
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 58 place count 402 transition count 356
Iterating global reduction 1 with 13 rules applied. Total rules applied 71 place count 402 transition count 356
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 80 place count 402 transition count 347
Applied a total of 80 rules in 86 ms. Remains 402 /439 variables (removed 37) and now considering 347/390 (removed 43) transitions.
// Phase 1: matrix 347 rows 402 cols
[2023-03-08 11:31:53] [INFO ] Computed 62 place invariants in 42 ms
[2023-03-08 11:31:53] [INFO ] Implicit Places using invariants in 378 ms returned []
[2023-03-08 11:31:53] [INFO ] Invariant cache hit.
[2023-03-08 11:31:53] [INFO ] Implicit Places using invariants and state equation in 428 ms returned []
Implicit Place search using SMT with State Equation took 831 ms to find 0 implicit places.
[2023-03-08 11:31:53] [INFO ] Invariant cache hit.
[2023-03-08 11:31:54] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 402/439 places, 347/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1225 ms. Remains : 402/439 places, 347/390 transitions.
Support contains 40 out of 402 places after structural reductions.
[2023-03-08 11:31:54] [INFO ] Flatten gal took : 67 ms
[2023-03-08 11:31:54] [INFO ] Flatten gal took : 29 ms
[2023-03-08 11:31:54] [INFO ] Input system was already deterministic with 347 transitions.
Support contains 38 out of 402 places (down from 40) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 89 resets, run finished after 404 ms. (steps per millisecond=24 ) properties (out of 25) seen :15
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 14 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2023-03-08 11:31:55] [INFO ] Invariant cache hit.
[2023-03-08 11:31:55] [INFO ] [Real]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 11:31:55] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2023-03-08 11:31:55] [INFO ] After 209ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-08 11:31:55] [INFO ] [Nat]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 11:31:55] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 34 ms returned sat
[2023-03-08 11:31:56] [INFO ] After 555ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-08 11:31:56] [INFO ] Deduced a trap composed of 16 places in 89 ms of which 4 ms to minimize.
[2023-03-08 11:31:56] [INFO ] Deduced a trap composed of 9 places in 78 ms of which 0 ms to minimize.
[2023-03-08 11:31:56] [INFO ] Deduced a trap composed of 19 places in 58 ms of which 1 ms to minimize.
[2023-03-08 11:31:56] [INFO ] Deduced a trap composed of 30 places in 60 ms of which 2 ms to minimize.
[2023-03-08 11:31:56] [INFO ] Deduced a trap composed of 32 places in 74 ms of which 0 ms to minimize.
[2023-03-08 11:31:56] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 509 ms
[2023-03-08 11:31:56] [INFO ] Deduced a trap composed of 17 places in 57 ms of which 0 ms to minimize.
[2023-03-08 11:31:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2023-03-08 11:31:57] [INFO ] Deduced a trap composed of 15 places in 85 ms of which 1 ms to minimize.
[2023-03-08 11:31:57] [INFO ] Deduced a trap composed of 35 places in 96 ms of which 2 ms to minimize.
[2023-03-08 11:31:57] [INFO ] Deduced a trap composed of 39 places in 80 ms of which 0 ms to minimize.
[2023-03-08 11:31:57] [INFO ] Deduced a trap composed of 44 places in 82 ms of which 0 ms to minimize.
[2023-03-08 11:31:57] [INFO ] Deduced a trap composed of 23 places in 43 ms of which 0 ms to minimize.
[2023-03-08 11:31:57] [INFO ] Deduced a trap composed of 24 places in 45 ms of which 0 ms to minimize.
[2023-03-08 11:31:57] [INFO ] Trap strengthening (SAT) tested/added 7/6 trap constraints in 579 ms
[2023-03-08 11:31:58] [INFO ] Deduced a trap composed of 31 places in 129 ms of which 0 ms to minimize.
[2023-03-08 11:31:58] [INFO ] Deduced a trap composed of 14 places in 82 ms of which 1 ms to minimize.
[2023-03-08 11:31:58] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 318 ms
[2023-03-08 11:31:58] [INFO ] After 2507ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-08 11:31:58] [INFO ] After 3194ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 2 properties in 611 ms.
Support contains 12 out of 402 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 16 rules applied. Total rules applied 17 place count 396 transition count 328
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 31 place count 382 transition count 328
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 382 transition count 317
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 371 transition count 317
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 57 place count 367 transition count 313
Iterating global reduction 2 with 4 rules applied. Total rules applied 61 place count 367 transition count 313
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 63 place count 367 transition count 311
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 64 place count 366 transition count 311
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 67 place count 363 transition count 308
Iterating global reduction 4 with 3 rules applied. Total rules applied 70 place count 363 transition count 308
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 74 place count 363 transition count 304
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 76 place count 362 transition count 303
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 76 place count 362 transition count 301
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 80 place count 360 transition count 301
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 6 with 146 rules applied. Total rules applied 226 place count 287 transition count 228
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 6 with 4 rules applied. Total rules applied 230 place count 285 transition count 230
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 6 with 1 rules applied. Total rules applied 231 place count 285 transition count 229
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 232 place count 284 transition count 229
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 7 with 1 rules applied. Total rules applied 233 place count 283 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 234 place count 282 transition count 228
Applied a total of 234 rules in 127 ms. Remains 282 /402 variables (removed 120) and now considering 228/347 (removed 119) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 141 ms. Remains : 282/402 places, 228/347 transitions.
Incomplete random walk after 10000 steps, including 393 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 74 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 80 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 79 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 62 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 78 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 495424 steps, run timeout after 3001 ms. (steps per millisecond=165 ) properties seen :{}
Probabilistic random walk after 495424 steps, saw 79066 distinct states, run finished after 3003 ms. (steps per millisecond=164 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 228 rows 282 cols
[2023-03-08 11:32:02] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 11:32:02] [INFO ] [Real]Absence check using 36 positive place invariants in 7 ms returned sat
[2023-03-08 11:32:02] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 15 ms returned sat
[2023-03-08 11:32:02] [INFO ] After 169ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 11:32:03] [INFO ] [Nat]Absence check using 36 positive place invariants in 32 ms returned sat
[2023-03-08 11:32:03] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 105 ms returned sat
[2023-03-08 11:32:03] [INFO ] After 305ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 11:32:03] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 11:32:03] [INFO ] After 180ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-08 11:32:03] [INFO ] Deduced a trap composed of 7 places in 49 ms of which 0 ms to minimize.
[2023-03-08 11:32:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 72 ms
[2023-03-08 11:32:04] [INFO ] After 495ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 197 ms.
[2023-03-08 11:32:04] [INFO ] After 1352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Parikh walk visited 0 properties in 323 ms.
Support contains 12 out of 282 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 10 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 282/282 places, 228/228 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
[2023-03-08 11:32:04] [INFO ] Invariant cache hit.
[2023-03-08 11:32:04] [INFO ] Implicit Places using invariants in 137 ms returned []
[2023-03-08 11:32:04] [INFO ] Invariant cache hit.
[2023-03-08 11:32:04] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 11:32:05] [INFO ] Implicit Places using invariants and state equation in 344 ms returned []
Implicit Place search using SMT with State Equation took 493 ms to find 0 implicit places.
[2023-03-08 11:32:05] [INFO ] Redundant transitions in 11 ms returned []
[2023-03-08 11:32:05] [INFO ] Invariant cache hit.
[2023-03-08 11:32:05] [INFO ] Dead Transitions using invariants and state equation in 136 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 664 ms. Remains : 282/282 places, 228/228 transitions.
Applied a total of 0 rules in 11 ms. Remains 282 /282 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Running SMT prover for 8 properties.
[2023-03-08 11:32:05] [INFO ] Invariant cache hit.
[2023-03-08 11:32:05] [INFO ] [Real]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:32:05] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 13 ms returned sat
[2023-03-08 11:32:05] [INFO ] After 105ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-08 11:32:05] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:32:05] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 144 ms returned sat
[2023-03-08 11:32:06] [INFO ] After 338ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-08 11:32:06] [INFO ] Deduced a trap composed of 7 places in 47 ms of which 0 ms to minimize.
[2023-03-08 11:32:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 96 ms
[2023-03-08 11:32:06] [INFO ] After 947ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 181 ms.
[2023-03-08 11:32:06] [INFO ] After 1589ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.15 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((G(p0) U X(X(G(p1)))))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 24 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 11:32:07] [INFO ] Computed 62 place invariants in 13 ms
[2023-03-08 11:32:07] [INFO ] Implicit Places using invariants in 400 ms returned []
[2023-03-08 11:32:07] [INFO ] Invariant cache hit.
[2023-03-08 11:32:08] [INFO ] Implicit Places using invariants and state equation in 427 ms returned []
Implicit Place search using SMT with State Equation took 832 ms to find 0 implicit places.
[2023-03-08 11:32:08] [INFO ] Invariant cache hit.
[2023-03-08 11:32:08] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1048 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 486 ms :[(NOT p1), (NOT p1), (NOT p1), (AND (NOT p0) (NOT p1)), (NOT p1), true, (NOT p1), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p1)]
Running random walk in product with property : DES-PT-40b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 6}], [{ cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={} source=3 dest: 4}, { cond=p0, acceptance={} source=3 dest: 7}], [{ cond=p1, acceptance={} source=4 dest: 4}, { cond=(NOT p1), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}], [{ cond=(NOT p0), acceptance={} source=6 dest: 2}, { cond=p0, acceptance={} source=6 dest: 3}, { cond=(AND p0 p1), acceptance={} source=6 dest: 6}, { cond=(AND p0 (NOT p1)), acceptance={0} source=6 dest: 6}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=7 dest: 5}, { cond=(AND p0 (NOT p1)), acceptance={} source=7 dest: 8}], [{ cond=(AND (NOT p0) p1), acceptance={} source=8 dest: 5}, { cond=(AND p0 p1), acceptance={} source=8 dest: 8}]], initial=0, aps=[p0:(AND (EQ s146 1) (EQ s182 1)), p1:(EQ s169 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 11 steps with 0 reset in 4 ms.
FORMULA DES-PT-40b-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-00 finished in 1600 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 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 398 transition count 343
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 398 transition count 343
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 9 place count 398 transition count 342
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 11 place count 396 transition count 340
Iterating global reduction 1 with 2 rules applied. Total rules applied 13 place count 396 transition count 340
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 15 place count 396 transition count 338
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 16 place count 395 transition count 337
Iterating global reduction 2 with 1 rules applied. Total rules applied 17 place count 395 transition count 337
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 18 place count 395 transition count 336
Applied a total of 18 rules in 22 ms. Remains 395 /402 variables (removed 7) and now considering 336/347 (removed 11) transitions.
// Phase 1: matrix 336 rows 395 cols
[2023-03-08 11:32:08] [INFO ] Computed 62 place invariants in 11 ms
[2023-03-08 11:32:09] [INFO ] Implicit Places using invariants in 332 ms returned []
[2023-03-08 11:32:09] [INFO ] Invariant cache hit.
[2023-03-08 11:32:09] [INFO ] Implicit Places using invariants and state equation in 439 ms returned []
Implicit Place search using SMT with State Equation took 794 ms to find 0 implicit places.
[2023-03-08 11:32:09] [INFO ] Invariant cache hit.
[2023-03-08 11:32:09] [INFO ] Dead Transitions using invariants and state equation in 174 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 395/402 places, 336/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 992 ms. Remains : 395/402 places, 336/347 transitions.
Stuttering acceptance computed with spot in 80 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-01 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 s196 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-40b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-01 finished in 1096 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(p0))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 25 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 11:32:09] [INFO ] Computed 62 place invariants in 14 ms
[2023-03-08 11:32:10] [INFO ] Implicit Places using invariants in 193 ms returned []
[2023-03-08 11:32:10] [INFO ] Invariant cache hit.
[2023-03-08 11:32:10] [INFO ] Implicit Places using invariants and state equation in 446 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-08 11:32:10] [INFO ] Invariant cache hit.
[2023-03-08 11:32:10] [INFO ] Dead Transitions using invariants and state equation in 180 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 853 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 110 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s305 1) (EQ s337 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][false, false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 2 ms.
FORMULA DES-PT-40b-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-02 finished in 988 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(F((p0&&F(p1)))))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 19 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
[2023-03-08 11:32:10] [INFO ] Invariant cache hit.
[2023-03-08 11:32:11] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 11:32:11] [INFO ] Invariant cache hit.
[2023-03-08 11:32:11] [INFO ] Implicit Places using invariants and state equation in 408 ms returned []
Implicit Place search using SMT with State Equation took 593 ms to find 0 implicit places.
[2023-03-08 11:32:11] [INFO ] Invariant cache hit.
[2023-03-08 11:32:11] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 775 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 217 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={} source=4 dest: 2}]], initial=3, aps=[p1:(AND (EQ s113 1) (EQ s242 1)), p0:(OR (EQ s76 0) (EQ s385 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Stuttering criterion allowed to conclude after 109 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-04 finished in 1013 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) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 40 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
[2023-03-08 11:32:11] [INFO ] Invariant cache hit.
[2023-03-08 11:32:12] [INFO ] Implicit Places using invariants in 192 ms returned []
[2023-03-08 11:32:12] [INFO ] Invariant cache hit.
[2023-03-08 11:32:12] [INFO ] Implicit Places using invariants and state equation in 424 ms returned []
Implicit Place search using SMT with State Equation took 619 ms to find 0 implicit places.
[2023-03-08 11:32:12] [INFO ] Invariant cache hit.
[2023-03-08 11:32:12] [INFO ] Dead Transitions using invariants and state equation in 182 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 843 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, p1, p0, p0, (AND p0 p1), p0, p0]
Running random walk in product with property : DES-PT-40b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=p1, acceptance={} source=1 dest: 0}, { cond=(AND (NOT p1) p0), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 4}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 3}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 5}, { cond=p1, acceptance={} source=2 dest: 6}], [{ cond=p0, acceptance={} source=3 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=3 dest: 4}, { cond=(AND p1 (NOT p0)), acceptance={} source=3 dest: 5}], [{ cond=p0, acceptance={} source=4 dest: 1}, { cond=(NOT p0), acceptance={} source=4 dest: 4}], [{ cond=p0, acceptance={} source=5 dest: 0}, { cond=(NOT p0), acceptance={} source=5 dest: 4}], [{ cond=p0, acceptance={} source=6 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=6 dest: 5}, { cond=(AND p1 (NOT p0)), acceptance={} source=6 dest: 6}]], initial=2, aps=[p1:(AND (EQ s157 1) (EQ s182 1)), p0:(AND (EQ s84 1) (EQ s385 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 881 reset in 297 ms.
Product exploration explored 100000 steps with 880 reset in 247 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 347 ms. Reduced automaton from 7 states, 17 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 142 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 87 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:32:14] [INFO ] Invariant cache hit.
[2023-03-08 11:32:14] [INFO ] [Real]Absence check using 33 positive place invariants in 6 ms returned sat
[2023-03-08 11:32:14] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 21 ms returned sat
[2023-03-08 11:32:14] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:32:14] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 11:32:14] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 26 ms returned sat
[2023-03-08 11:32:14] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:14] [INFO ] Deduced a trap composed of 9 places in 101 ms of which 0 ms to minimize.
[2023-03-08 11:32:14] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 126 ms
[2023-03-08 11:32:14] [INFO ] After 328ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-08 11:32:14] [INFO ] After 462ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 0 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
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 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
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 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
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 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 53 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 429 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1682897 steps, run timeout after 3001 ms. (steps per millisecond=560 ) properties seen :{}
Probabilistic random walk after 1682897 steps, saw 230424 distinct states, run finished after 3001 ms. (steps per millisecond=560 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 11:32:17] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 11:32:17] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:32:17] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 11:32:17] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:32:17] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:32:18] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 81 ms returned sat
[2023-03-08 11:32:18] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 11:32:18] [INFO ] After 17ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:18] [INFO ] After 37ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 11:32:18] [INFO ] After 327ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 7 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-08 11:32:18] [INFO ] Invariant cache hit.
[2023-03-08 11:32:18] [INFO ] Implicit Places using invariants in 131 ms returned []
[2023-03-08 11:32:18] [INFO ] Invariant cache hit.
[2023-03-08 11:32:18] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 11:32:18] [INFO ] Implicit Places using invariants and state equation in 349 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2023-03-08 11:32:18] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 11:32:18] [INFO ] Invariant cache hit.
[2023-03-08 11:32:18] [INFO ] Dead Transitions using invariants and state equation in 130 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 643 ms. Remains : 278/278 places, 224/224 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 12 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 11:32:18] [INFO ] Computed 60 place invariants in 2 ms
[2023-03-08 11:32:19] [INFO ] [Real]Absence check using 36 positive place invariants in 13 ms returned sat
[2023-03-08 11:32:19] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 11:32:19] [INFO ] After 111ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:32:19] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:32:19] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-08 11:32:19] [INFO ] After 136ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:19] [INFO ] After 168ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:32:19] [INFO ] After 326ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (AND (NOT p1) (NOT p0))), (X (NOT (AND p1 (NOT p0)))), (X (NOT p0)), true, (X (X (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 9 factoid took 380 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 155 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 474 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 12 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 11:32:20] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-08 11:32:20] [INFO ] Implicit Places using invariants in 231 ms returned []
[2023-03-08 11:32:20] [INFO ] Invariant cache hit.
[2023-03-08 11:32:21] [INFO ] Implicit Places using invariants and state equation in 413 ms returned []
Implicit Place search using SMT with State Equation took 646 ms to find 0 implicit places.
[2023-03-08 11:32:21] [INFO ] Invariant cache hit.
[2023-03-08 11:32:21] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 838 ms. Remains : 393/393 places, 333/333 transitions.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Detected a total of 216/393 stabilizing places and 208/333 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 162 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 145 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Incomplete random walk after 10000 steps, including 89 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:32:21] [INFO ] Invariant cache hit.
[2023-03-08 11:32:21] [INFO ] [Real]Absence check using 33 positive place invariants in 8 ms returned sat
[2023-03-08 11:32:21] [INFO ] [Real]Absence check using 33 positive and 29 generalized place invariants in 22 ms returned sat
[2023-03-08 11:32:21] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:32:21] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2023-03-08 11:32:21] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 27 ms returned sat
[2023-03-08 11:32:21] [INFO ] After 189ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:22] [INFO ] Deduced a trap composed of 9 places in 102 ms of which 1 ms to minimize.
[2023-03-08 11:32:22] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 134 ms
[2023-03-08 11:32:22] [INFO ] After 345ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 30 ms.
[2023-03-08 11:32:22] [INFO ] After 474ms 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 393 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 393/393 places, 333/333 transitions.
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.0 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 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 18 rules applied. Total rules applied 19 place count 387 transition count 312
Reduce places removed 16 places and 0 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 35 place count 371 transition count 312
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 35 place count 371 transition count 300
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 59 place count 359 transition count 300
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 1 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 211 place count 283 transition count 224
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 2 with 4 rules applied. Total rules applied 215 place count 281 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 281 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 280 transition count 225
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 280 transition count 225
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 279 transition count 224
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 278 transition count 224
Applied a total of 220 rules in 42 ms. Remains 278 /393 variables (removed 115) and now considering 224/333 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 42 ms. Remains : 278/393 places, 224/333 transitions.
Incomplete random walk after 10000 steps, including 452 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1700032 steps, run timeout after 3001 ms. (steps per millisecond=566 ) properties seen :{}
Probabilistic random walk after 1700032 steps, saw 232681 distinct states, run finished after 3002 ms. (steps per millisecond=566 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 11:32:25] [INFO ] Computed 60 place invariants in 7 ms
[2023-03-08 11:32:25] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:32:25] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 11:32:25] [INFO ] After 74ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:32:25] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2023-03-08 11:32:25] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-08 11:32:25] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:25] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 11:32:25] [INFO ] After 19ms SMT Verify possible using 6 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:25] [INFO ] After 38ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2023-03-08 11:32:25] [INFO ] After 322ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 2 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 278/278 places, 224/224 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 224/224 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
[2023-03-08 11:32:25] [INFO ] Invariant cache hit.
[2023-03-08 11:32:25] [INFO ] Implicit Places using invariants in 154 ms returned []
[2023-03-08 11:32:25] [INFO ] Invariant cache hit.
[2023-03-08 11:32:26] [INFO ] State equation strengthened by 6 read => feed constraints.
[2023-03-08 11:32:26] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 488 ms to find 0 implicit places.
[2023-03-08 11:32:26] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-08 11:32:26] [INFO ] Invariant cache hit.
[2023-03-08 11:32:26] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 621 ms. Remains : 278/278 places, 224/224 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 278 transition count 224
Applied a total of 1 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 224/224 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 224 rows 278 cols
[2023-03-08 11:32:26] [INFO ] Computed 60 place invariants in 3 ms
[2023-03-08 11:32:26] [INFO ] [Real]Absence check using 36 positive place invariants in 5 ms returned sat
[2023-03-08 11:32:26] [INFO ] [Real]Absence check using 36 positive and 24 generalized place invariants in 12 ms returned sat
[2023-03-08 11:32:26] [INFO ] After 69ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:32:26] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2023-03-08 11:32:26] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 79 ms returned sat
[2023-03-08 11:32:26] [INFO ] After 125ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:32:26] [INFO ] After 153ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2023-03-08 11:32:26] [INFO ] After 313ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) (NOT p0)), (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F p0), (F (NOT (AND (NOT p1) (NOT p0)))), (F (AND (NOT p1) p0))]
Knowledge based reduction with 3 factoid took 196 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 5 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 167 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 146 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Stuttering acceptance computed with spot in 166 ms :[true, p1, (AND p0 p1), (AND p1 p0), (AND p1 p0)]
Product exploration explored 100000 steps with 888 reset in 165 ms.
Product exploration explored 100000 steps with 885 reset in 188 ms.
Built C files in :
/tmp/ltsmin15211791618946013793
[2023-03-08 11:32:27] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15211791618946013793
Running compilation step : cd /tmp/ltsmin15211791618946013793;'/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 615 ms.
Running link step : cd /tmp/ltsmin15211791618946013793;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin15211791618946013793;'/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/stateBased5897847962689272589.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 393 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 393/393 places, 333/333 transitions.
Applied a total of 0 rules in 4 ms. Remains 393 /393 variables (removed 0) and now considering 333/333 (removed 0) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 11:32:43] [INFO ] Computed 62 place invariants in 12 ms
[2023-03-08 11:32:43] [INFO ] Implicit Places using invariants in 182 ms returned []
[2023-03-08 11:32:43] [INFO ] Invariant cache hit.
[2023-03-08 11:32:43] [INFO ] Implicit Places using invariants and state equation in 415 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2023-03-08 11:32:43] [INFO ] Invariant cache hit.
[2023-03-08 11:32:43] [INFO ] Dead Transitions using invariants and state equation in 172 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 781 ms. Remains : 393/393 places, 333/333 transitions.
Built C files in :
/tmp/ltsmin17522010575897671156
[2023-03-08 11:32:43] [INFO ] Built C files in 5ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17522010575897671156
Running compilation step : cd /tmp/ltsmin17522010575897671156;'/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 517 ms.
Running link step : cd /tmp/ltsmin17522010575897671156;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin17522010575897671156;'/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/stateBased2089243446150930264.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 11:32:59] [INFO ] Flatten gal took : 23 ms
[2023-03-08 11:32:59] [INFO ] Flatten gal took : 24 ms
[2023-03-08 11:32:59] [INFO ] Time to serialize gal into /tmp/LTL16155774550325228251.gal : 5 ms
[2023-03-08 11:32:59] [INFO ] Time to serialize properties into /tmp/LTL17915668860714890138.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/LTL16155774550325228251.gal' '-t' 'CGAL' '-hoa' '/tmp/aut7276992151569405251.hoa' '-atoms' '/tmp/LTL17915668860714890138.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...319
Loading property file /tmp/LTL17915668860714890138.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut7276992151569405251.hoa
Detected timeout of ITS tools.
[2023-03-08 11:33:14] [INFO ] Flatten gal took : 18 ms
[2023-03-08 11:33:14] [INFO ] Flatten gal took : 26 ms
[2023-03-08 11:33:14] [INFO ] Time to serialize gal into /tmp/LTL13399684024973172965.gal : 3 ms
[2023-03-08 11:33:14] [INFO ] Time to serialize properties into /tmp/LTL16151720348208085595.ltl : 2 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13399684024973172965.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16151720348208085595.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...277
Read 1 LTL properties
Checking formula 0 : !((((X(!("((p85==1)&&(p431==1))")))U((X(G(!("((p85==1)&&(p431==1))"))))||((X(!("((p85==1)&&(p431==1))")))&&(G((!("((p85==1)&&(p431==1)...589
Formula 0 simplified : "((p158==1)&&(p189==1))" U (X"((p85==1)&&(p431==1))" R (XF"((p85==1)&&(p431==1))" & (X"((p85==1)&&(p431==1))" | F("((p85==1)&&(p431=...192
Detected timeout of ITS tools.
[2023-03-08 11:33:29] [INFO ] Flatten gal took : 31 ms
[2023-03-08 11:33:29] [INFO ] Applying decomposition
[2023-03-08 11:33:29] [INFO ] Flatten gal took : 14 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/graph2588062050740127108.txt' '-o' '/tmp/graph2588062050740127108.bin' '-w' '/tmp/graph2588062050740127108.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph2588062050740127108.bin' '-l' '-1' '-v' '-w' '/tmp/graph2588062050740127108.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:33:29] [INFO ] Decomposing Gal with order
[2023-03-08 11:33:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:33:29] [INFO ] Removed a total of 10 redundant transitions.
[2023-03-08 11:33:29] [INFO ] Flatten gal took : 112 ms
[2023-03-08 11:33:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 2 labels/synchronizations in 37 ms.
[2023-03-08 11:33:29] [INFO ] Time to serialize gal into /tmp/LTL18037498797805779018.gal : 7 ms
[2023-03-08 11:33:29] [INFO ] Time to serialize properties into /tmp/LTL17157984182078087881.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/LTL18037498797805779018.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17157984182078087881.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 : !((((X(!("((i9.u73.p85==1)&&(i9.u73.p431==1))")))U((X(G(!("((i9.u73.p85==1)&&(i9.u73.p431==1))"))))||((X(!("((i9.u73.p85==1)&&(i9.u73....805
Formula 0 simplified : "((i2.u9.p158==1)&&(i2.u9.p189==1))" U (X"((i9.u73.p85==1)&&(i9.u73.p431==1))" R (XF"((i9.u73.p85==1)&&(i9.u73.p431==1))" & (X"((i9....272
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7311973315027367625
[2023-03-08 11:33:44] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7311973315027367625
Running compilation step : cd /tmp/ltsmin7311973315027367625;'/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 495 ms.
Running link step : cd /tmp/ltsmin7311973315027367625;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 28 ms.
Running LTSmin : cd /tmp/ltsmin7311973315027367625;'/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' '((X(!(LTLAPp0==true)) U (X([](!(LTLAPp0==true)))||(X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true))))))) U ([]((X(!(LTLAPp0==true)) U (X([](!(LTLAPp0==true)))||(X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true))))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U (X([](!(LTLAPp0==true)))||(X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true))))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-05 finished in 107977 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((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
Support contains 9 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 381 transition count 319
Deduced a syphon composed of 10 places in 1 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 70 place count 363 transition count 306
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 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
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 76 place count 360 transition count 303
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 6 with 152 rules applied. Total rules applied 228 place count 284 transition count 227
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 6 with 4 rules applied. Total rules applied 232 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 279 transition count 227
Applied a total of 235 rules in 64 ms. Remains 279 /402 variables (removed 123) and now considering 227/347 (removed 120) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 11:33:59] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 11:34:00] [INFO ] Implicit Places using invariants in 377 ms returned []
[2023-03-08 11:34:00] [INFO ] Invariant cache hit.
[2023-03-08 11:34:00] [INFO ] Implicit Places using invariants and state equation in 331 ms returned []
Implicit Place search using SMT with State Equation took 722 ms to find 0 implicit places.
[2023-03-08 11:34:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-08 11:34:00] [INFO ] Invariant cache hit.
[2023-03-08 11:34:00] [INFO ] Dead Transitions using invariants and state equation in 120 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/402 places, 227/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 931 ms. Remains : 279/402 places, 227/347 transitions.
Stuttering acceptance computed with spot in 118 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 2}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) p0), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p1:(AND (EQ s202 1) (EQ s204 1) (EQ s206 1) (EQ s208 1) (EQ s210 1) (EQ s212 1) (EQ s214 1) (EQ s216 1)), p0:(OR (EQ s202 0) (EQ s204 0) (EQ s206 0) (EQ s...], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 33496 reset in 338 ms.
Product exploration explored 100000 steps with 33337 reset in 384 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 326 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 3 states, 6 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 104 ms :[(OR (AND (NOT p0) (NOT p1)) (AND (NOT p1) (NOT p2))), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 519 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :3
Incomplete Best-First random walk after 10001 steps, including 101 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:34:02] [INFO ] Invariant cache hit.
[2023-03-08 11:34:02] [INFO ] After 108ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:34:02] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:34:02] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 50 ms returned sat
[2023-03-08 11:34:02] [INFO ] After 120ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :0
Fused 1 Parikh solutions to 0 different solutions.
Parikh walk visited 0 properties in 0 ms.
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (AND (NOT p1) p0)), (X (NOT (AND (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (AND (NOT p1) p0))), (X (X (NOT (AND (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p1) (NOT p0))))]
False Knowledge obtained : [(F (NOT (AND (NOT p1) p0))), (F p1), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 9 factoid took 408 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 73 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 84 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 12 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 11:34:03] [INFO ] Invariant cache hit.
[2023-03-08 11:34:03] [INFO ] Implicit Places using invariants in 144 ms returned []
[2023-03-08 11:34:03] [INFO ] Invariant cache hit.
[2023-03-08 11:34:03] [INFO ] Implicit Places using invariants and state equation in 298 ms returned []
Implicit Place search using SMT with State Equation took 444 ms to find 0 implicit places.
[2023-03-08 11:34:03] [INFO ] Redundant transitions in 7 ms returned []
[2023-03-08 11:34:03] [INFO ] Invariant cache hit.
[2023-03-08 11:34:03] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 590 ms. Remains : 279/279 places, 227/227 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/279 stabilizing places and 170/227 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 137 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 59 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Finished random walk after 69 steps, including 1 resets, run visited all 2 properties in 1 ms. (steps per millisecond=69 )
Knowledge obtained : [(AND (NOT p1) p2), (X (NOT (AND (NOT p2) (NOT p1)))), (X (X (NOT (AND (NOT p2) (NOT p1))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F p1), (F (AND (NOT p1) (NOT p2)))]
Knowledge based reduction with 4 factoid took 169 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 70 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 77 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Stuttering acceptance computed with spot in 64 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2))]
Product exploration explored 100000 steps with 33248 reset in 284 ms.
Product exploration explored 100000 steps with 33422 reset in 299 ms.
Built C files in :
/tmp/ltsmin9297290100115885438
[2023-03-08 11:34:04] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2023-03-08 11:34:04] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:34:04] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2023-03-08 11:34:04] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:34:04] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2023-03-08 11:34:04] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:34:04] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9297290100115885438
Running compilation step : cd /tmp/ltsmin9297290100115885438;'/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 478 ms.
Running link step : cd /tmp/ltsmin9297290100115885438;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin9297290100115885438;'/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/stateBased12993667393963462836.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 9 out of 279 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 16 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 11:34:19] [INFO ] Invariant cache hit.
[2023-03-08 11:34:20] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 11:34:20] [INFO ] Invariant cache hit.
[2023-03-08 11:34:20] [INFO ] Implicit Places using invariants and state equation in 290 ms returned []
Implicit Place search using SMT with State Equation took 438 ms to find 0 implicit places.
[2023-03-08 11:34:20] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:34:20] [INFO ] Invariant cache hit.
[2023-03-08 11:34:20] [INFO ] Dead Transitions using invariants and state equation in 123 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 584 ms. Remains : 279/279 places, 227/227 transitions.
Built C files in :
/tmp/ltsmin5744888397604458930
[2023-03-08 11:34:20] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2023-03-08 11:34:20] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:34:20] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2023-03-08 11:34:20] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:34:20] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2023-03-08 11:34:20] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:34:20] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5744888397604458930
Running compilation step : cd /tmp/ltsmin5744888397604458930;'/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 481 ms.
Running link step : cd /tmp/ltsmin5744888397604458930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin5744888397604458930;'/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/stateBased14790289435697576487.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 11:34:35] [INFO ] Flatten gal took : 27 ms
[2023-03-08 11:34:35] [INFO ] Flatten gal took : 33 ms
[2023-03-08 11:34:35] [INFO ] Time to serialize gal into /tmp/LTL16684854180961991073.gal : 3 ms
[2023-03-08 11:34:35] [INFO ] Time to serialize properties into /tmp/LTL17156644499893278580.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/LTL16684854180961991073.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13809097092764703223.hoa' '-atoms' '/tmp/LTL17156644499893278580.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/LTL17156644499893278580.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13809097092764703223.hoa
Detected timeout of ITS tools.
[2023-03-08 11:34:50] [INFO ] Flatten gal took : 14 ms
[2023-03-08 11:34:50] [INFO ] Flatten gal took : 12 ms
[2023-03-08 11:34:50] [INFO ] Time to serialize gal into /tmp/LTL9958199050850549509.gal : 2 ms
[2023-03-08 11:34:50] [INFO ] Time to serialize properties into /tmp/LTL12916796757506665973.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/LTL9958199050850549509.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12916796757506665973.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(G(("((((p318==0)||(p320==0))||((p322==0)||(p324==0)))||(((p326==0)||(p328==0))||((p330==0)||(p332==0))))")||(F("((((p318==1)&&...382
Formula 0 simplified : F((G!"((((p318==1)&&(p320==1))&&((p322==1)&&(p324==1)))&&(((p326==1)&&(p328==1))&&((p330==1)&&(p332==1))))" & XG!"(p284==0)") | G(F!...367
Detected timeout of ITS tools.
[2023-03-08 11:35:05] [INFO ] Flatten gal took : 16 ms
[2023-03-08 11:35:05] [INFO ] Applying decomposition
[2023-03-08 11:35:05] [INFO ] Flatten gal took : 11 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/graph5230544920955386471.txt' '-o' '/tmp/graph5230544920955386471.bin' '-w' '/tmp/graph5230544920955386471.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph5230544920955386471.bin' '-l' '-1' '-v' '-w' '/tmp/graph5230544920955386471.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:35:05] [INFO ] Decomposing Gal with order
[2023-03-08 11:35:05] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:35:05] [INFO ] Removed a total of 45 redundant transitions.
[2023-03-08 11:35:05] [INFO ] Flatten gal took : 17 ms
[2023-03-08 11:35:05] [INFO ] Fuse similar labels procedure discarded/fused a total of 12 labels/synchronizations in 3 ms.
[2023-03-08 11:35:05] [INFO ] Time to serialize gal into /tmp/LTL12304757205267843306.gal : 3 ms
[2023-03-08 11:35:05] [INFO ] Time to serialize properties into /tmp/LTL15250445509571969712.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/LTL12304757205267843306.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL15250445509571969712.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(G(("((((i9.i3.u13.p318==0)||(i5.u14.p320==0))||((i6.u15.p322==0)||(i9.i0.u16.p324==0)))||(((i7.u17.p326==0)||(i9.i2.u18.p328==...589
Formula 0 simplified : F((G!"((((i9.i3.u13.p318==1)&&(i5.u14.p320==1))&&((i6.u15.p322==1)&&(i9.i0.u16.p324==1)))&&(((i7.u17.p326==1)&&(i9.i2.u18.p328==1))&...574
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2771390404886295261
[2023-03-08 11:35:21] [INFO ] Built C files in 3ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2771390404886295261
Running compilation step : cd /tmp/ltsmin2771390404886295261;'/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 381 ms.
Running link step : cd /tmp/ltsmin2771390404886295261;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 26 ms.
Running LTSmin : cd /tmp/ltsmin2771390404886295261;'/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' '[]((<>([]((<>((LTLAPp1==true))||(LTLAPp0==true))))&&(<>((LTLAPp1==true))||X(<>((LTLAPp2==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-06 finished in 96306 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 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 27 place count 382 transition count 320
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 47 place count 372 transition count 320
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 51 place count 368 transition count 316
Iterating global reduction 2 with 4 rules applied. Total rules applied 55 place count 368 transition count 316
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 57 place count 368 transition count 314
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 58 place count 367 transition count 314
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 61 place count 364 transition count 311
Iterating global reduction 4 with 3 rules applied. Total rules applied 64 place count 364 transition count 311
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 68 place count 364 transition count 307
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 70 place count 363 transition count 306
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 70 place count 363 transition count 304
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 74 place count 361 transition count 304
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 228 place count 284 transition count 227
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 6 with 4 rules applied. Total rules applied 232 place count 282 transition count 229
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 234 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 235 place count 279 transition count 227
Applied a total of 235 rules in 87 ms. Remains 279 /402 variables (removed 123) and now considering 227/347 (removed 120) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 11:35:36] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 11:35:36] [INFO ] Implicit Places using invariants in 288 ms returned []
[2023-03-08 11:35:36] [INFO ] Invariant cache hit.
[2023-03-08 11:35:36] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 633 ms to find 0 implicit places.
[2023-03-08 11:35:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:35:36] [INFO ] Invariant cache hit.
[2023-03-08 11:35:37] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/402 places, 227/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 849 ms. Remains : 279/402 places, 227/347 transitions.
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-07 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:(EQ s258 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]]
Stuttering criterion allowed to conclude after 5814 steps with 530 reset in 16 ms.
FORMULA DES-PT-40b-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-07 finished in 965 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p0)&&G(p1))))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 25 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 11:35:37] [INFO ] Computed 62 place invariants in 6 ms
[2023-03-08 11:35:37] [INFO ] Implicit Places using invariants in 170 ms returned []
[2023-03-08 11:35:37] [INFO ] Invariant cache hit.
[2023-03-08 11:35:37] [INFO ] Implicit Places using invariants and state equation in 423 ms returned []
Implicit Place search using SMT with State Equation took 605 ms to find 0 implicit places.
[2023-03-08 11:35:37] [INFO ] Invariant cache hit.
[2023-03-08 11:35:37] [INFO ] Dead Transitions using invariants and state equation in 175 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 806 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 122 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), true, (OR (NOT p1) (NOT p0))]
Running random walk in product with property : DES-PT-40b-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=p1, acceptance={} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=true, acceptance={} source=1 dest: 3}], [{ cond=true, acceptance={0} source=2 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=3 dest: 0}, { cond=(NOT p1), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=3 dest: 3}]], initial=1, aps=[p1:(EQ s387 0), p0:(OR (EQ s60 0) (EQ s385 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 22 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-08 finished in 950 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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
Support contains 5 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 9 Pre rules applied. Total rules applied 29 place count 381 transition count 320
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 2 with 18 rules applied. Total rules applied 47 place count 372 transition count 320
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 50 place count 369 transition count 317
Iterating global reduction 2 with 3 rules applied. Total rules applied 53 place count 369 transition count 317
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 55 place count 369 transition count 315
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 56 place count 368 transition count 315
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 58 place count 366 transition count 313
Iterating global reduction 4 with 2 rules applied. Total rules applied 60 place count 366 transition count 313
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 62 place count 366 transition count 311
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 2 Pre rules applied. Total rules applied 62 place count 366 transition count 309
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 66 place count 364 transition count 309
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 218 place count 288 transition count 233
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 219 place count 288 transition count 232
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 223 place count 286 transition count 237
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 225 place count 284 transition count 235
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 226 place count 283 transition count 235
Applied a total of 226 rules in 61 ms. Remains 283 /402 variables (removed 119) and now considering 235/347 (removed 112) transitions.
// Phase 1: matrix 235 rows 283 cols
[2023-03-08 11:35:38] [INFO ] Computed 58 place invariants in 4 ms
[2023-03-08 11:35:38] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 11:35:38] [INFO ] Invariant cache hit.
[2023-03-08 11:35:38] [INFO ] Implicit Places using invariants and state equation in 292 ms returned []
Implicit Place search using SMT with State Equation took 448 ms to find 0 implicit places.
[2023-03-08 11:35:38] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:35:38] [INFO ] Invariant cache hit.
[2023-03-08 11:35:38] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 283/402 places, 235/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 645 ms. Remains : 283/402 places, 235/347 transitions.
Stuttering acceptance computed with spot in 121 ms :[(OR p2 p1), p2, p1]
Running random walk in product with property : DES-PT-40b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(OR p2 (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p2), acceptance={} source=1 dest: 1}, { cond=p2, acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s164 1) (AND (EQ s84 1) (EQ s192 1))), p2:(AND (EQ s84 1) (EQ s192 1)), p1:(AND (EQ s200 1) (EQ s204 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 4660 reset in 289 ms.
Product exploration explored 100000 steps with 4731 reset in 283 ms.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/283 stabilizing places and 171/235 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 452 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p2]
Incomplete random walk after 10000 steps, including 484 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1616381 steps, run timeout after 3001 ms. (steps per millisecond=538 ) properties seen :{}
Probabilistic random walk after 1616381 steps, saw 205707 distinct states, run finished after 3001 ms. (steps per millisecond=538 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:35:43] [INFO ] Invariant cache hit.
[2023-03-08 11:35:43] [INFO ] [Real]Absence check using 33 positive place invariants in 5 ms returned sat
[2023-03-08 11:35:43] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 13 ms returned sat
[2023-03-08 11:35:43] [INFO ] After 90ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:35:43] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:43] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 11:35:43] [INFO ] After 345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:35:43] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:35:43] [INFO ] After 488ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 12 ms.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 235/235 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 283 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 282 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 280 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 280 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 280 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 278 transition count 225
Applied a total of 15 rules in 20 ms. Remains 278 /283 variables (removed 5) and now considering 225/235 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 20 ms. Remains : 278/283 places, 225/235 transitions.
Incomplete random walk after 10000 steps, including 513 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 98 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1599890 steps, run timeout after 3001 ms. (steps per millisecond=533 ) properties seen :{}
Probabilistic random walk after 1599890 steps, saw 215317 distinct states, run finished after 3002 ms. (steps per millisecond=532 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2023-03-08 11:35:46] [INFO ] Computed 59 place invariants in 6 ms
[2023-03-08 11:35:46] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:46] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 10 ms returned sat
[2023-03-08 11:35:46] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:35:46] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 11:35:46] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 35 ms returned sat
[2023-03-08 11:35:47] [INFO ] After 190ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:35:47] [INFO ] After 214ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 18 ms.
[2023-03-08 11:35:47] [INFO ] After 338ms 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 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 8 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-08 11:35:47] [INFO ] Invariant cache hit.
[2023-03-08 11:35:47] [INFO ] Implicit Places using invariants in 249 ms returned []
[2023-03-08 11:35:47] [INFO ] Invariant cache hit.
[2023-03-08 11:35:47] [INFO ] Implicit Places using invariants and state equation in 350 ms returned []
Implicit Place search using SMT with State Equation took 617 ms to find 0 implicit places.
[2023-03-08 11:35:47] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:35:47] [INFO ] Invariant cache hit.
[2023-03-08 11:35:47] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 771 ms. Remains : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 11:35:47] [INFO ] Invariant cache hit.
[2023-03-08 11:35:47] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:47] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 11:35:47] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:35:48] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:48] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 61 ms returned sat
[2023-03-08 11:35:48] [INFO ] After 154ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:35:48] [INFO ] After 176ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:35:48] [INFO ] After 339ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p0) (NOT p2) (NOT p1)), (X (OR p2 (NOT p0))), (X (NOT p2)), (X (NOT p0)), (X (NOT p1)), (X (X (OR p2 (NOT p0)))), (X (X (NOT p2))), (X (X (NOT p0))), (X (X (NOT p1))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 343 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 30 ms :[p2]
Stuttering acceptance computed with spot in 48 ms :[p2]
Support contains 2 out of 283 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 235/235 transitions.
Applied a total of 0 rules in 4 ms. Remains 283 /283 variables (removed 0) and now considering 235/235 (removed 0) transitions.
// Phase 1: matrix 235 rows 283 cols
[2023-03-08 11:35:48] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 11:35:48] [INFO ] Implicit Places using invariants in 165 ms returned []
[2023-03-08 11:35:48] [INFO ] Invariant cache hit.
[2023-03-08 11:35:49] [INFO ] Implicit Places using invariants and state equation in 300 ms returned []
Implicit Place search using SMT with State Equation took 505 ms to find 0 implicit places.
[2023-03-08 11:35:49] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:35:49] [INFO ] Invariant cache hit.
[2023-03-08 11:35:49] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 643 ms. Remains : 283/283 places, 235/235 transitions.
Computed a total of 176 stabilizing places and 171 stable transitions
Computed a total of 176 stabilizing places and 171 stable transitions
Detected a total of 176/283 stabilizing places and 171/235 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 246 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 39 ms :[p2]
Incomplete random walk after 10000 steps, including 465 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 74 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1617545 steps, run timeout after 3001 ms. (steps per millisecond=539 ) properties seen :{}
Probabilistic random walk after 1617545 steps, saw 205839 distinct states, run finished after 3003 ms. (steps per millisecond=538 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:35:52] [INFO ] Invariant cache hit.
[2023-03-08 11:35:52] [INFO ] [Real]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:52] [INFO ] [Real]Absence check using 33 positive and 25 generalized place invariants in 11 ms returned sat
[2023-03-08 11:35:52] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:35:52] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:52] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 47 ms returned sat
[2023-03-08 11:35:53] [INFO ] After 344ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:35:53] [INFO ] After 368ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 16 ms.
[2023-03-08 11:35:53] [INFO ] After 513ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 7 ms.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 283/283 places, 235/235 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 283 transition count 234
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 1 place count 283 transition count 233
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 3 place count 282 transition count 233
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 5 place count 281 transition count 232
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 280 transition count 231
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 280 transition count 231
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 11 place count 280 transition count 227
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 13 place count 279 transition count 226
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 279 transition count 225
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 15 place count 278 transition count 225
Applied a total of 15 rules in 19 ms. Remains 278 /283 variables (removed 5) and now considering 225/235 (removed 10) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 278/283 places, 225/235 transitions.
Incomplete random walk after 10000 steps, including 501 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1659891 steps, run timeout after 3001 ms. (steps per millisecond=553 ) properties seen :{}
Probabilistic random walk after 1659891 steps, saw 222534 distinct states, run finished after 3002 ms. (steps per millisecond=552 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 225 rows 278 cols
[2023-03-08 11:35:56] [INFO ] Computed 59 place invariants in 4 ms
[2023-03-08 11:35:56] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:56] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 11:35:56] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:35:56] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:56] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 43 ms returned sat
[2023-03-08 11:35:56] [INFO ] After 195ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:35:56] [INFO ] After 220ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:35:56] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 9 ms.
Support contains 2 out of 278 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 10 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 278/278 places, 225/225 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 5 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
[2023-03-08 11:35:56] [INFO ] Invariant cache hit.
[2023-03-08 11:35:56] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 11:35:56] [INFO ] Invariant cache hit.
[2023-03-08 11:35:57] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 457 ms to find 0 implicit places.
[2023-03-08 11:35:57] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:35:57] [INFO ] Invariant cache hit.
[2023-03-08 11:35:57] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 599 ms. Remains : 278/278 places, 225/225 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 225/225 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-08 11:35:57] [INFO ] Invariant cache hit.
[2023-03-08 11:35:57] [INFO ] [Real]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:57] [INFO ] [Real]Absence check using 35 positive and 24 generalized place invariants in 11 ms returned sat
[2023-03-08 11:35:57] [INFO ] After 70ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:35:57] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:35:57] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 61 ms returned sat
[2023-03-08 11:35:57] [INFO ] After 159ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:35:57] [INFO ] After 182ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 11:35:57] [INFO ] After 335ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p2), (X (NOT p2)), (X (X (NOT p2))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 139 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 26 ms :[p2]
Stuttering acceptance computed with spot in 40 ms :[p2]
Stuttering acceptance computed with spot in 26 ms :[p2]
Product exploration explored 100000 steps with 4720 reset in 226 ms.
Product exploration explored 100000 steps with 4747 reset in 247 ms.
Built C files in :
/tmp/ltsmin9943937810012350902
[2023-03-08 11:35:58] [INFO ] Computing symmetric may disable matrix : 235 transitions.
[2023-03-08 11:35:58] [INFO ] Computation of Complete disable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:35:58] [INFO ] Computing symmetric may enable matrix : 235 transitions.
[2023-03-08 11:35:58] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:35:58] [INFO ] Computing Do-Not-Accords matrix : 235 transitions.
[2023-03-08 11:35:58] [INFO ] Computation of Completed DNA matrix. took 4 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:35:58] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9943937810012350902
Running compilation step : cd /tmp/ltsmin9943937810012350902;'/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 492 ms.
Running link step : cd /tmp/ltsmin9943937810012350902;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 25 ms.
Running LTSmin : cd /tmp/ltsmin9943937810012350902;'/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/stateBased15711119251481137161.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 283 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 283/283 places, 235/235 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 283 transition count 234
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 282 transition count 234
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 281 transition count 233
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 5 place count 280 transition count 232
Iterating global reduction 0 with 1 rules applied. Total rules applied 6 place count 280 transition count 232
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 0 with 4 rules applied. Total rules applied 10 place count 280 transition count 228
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 1 with 2 rules applied. Total rules applied 12 place count 279 transition count 227
Applied a total of 12 rules in 31 ms. Remains 279 /283 variables (removed 4) and now considering 227/235 (removed 8) transitions.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 11:36:13] [INFO ] Computed 58 place invariants in 5 ms
[2023-03-08 11:36:13] [INFO ] Implicit Places using invariants in 152 ms returned []
[2023-03-08 11:36:13] [INFO ] Invariant cache hit.
[2023-03-08 11:36:14] [INFO ] Implicit Places using invariants and state equation in 286 ms returned []
Implicit Place search using SMT with State Equation took 439 ms to find 0 implicit places.
[2023-03-08 11:36:14] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:36:14] [INFO ] Invariant cache hit.
[2023-03-08 11:36:14] [INFO ] Dead Transitions using invariants and state equation in 121 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 279/283 places, 227/235 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 607 ms. Remains : 279/283 places, 227/235 transitions.
Built C files in :
/tmp/ltsmin311669263811999274
[2023-03-08 11:36:14] [INFO ] Computing symmetric may disable matrix : 227 transitions.
[2023-03-08 11:36:14] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:36:14] [INFO ] Computing symmetric may enable matrix : 227 transitions.
[2023-03-08 11:36:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:36:14] [INFO ] Computing Do-Not-Accords matrix : 227 transitions.
[2023-03-08 11:36:14] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:36:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin311669263811999274
Running compilation step : cd /tmp/ltsmin311669263811999274;'/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 473 ms.
Running link step : cd /tmp/ltsmin311669263811999274;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin311669263811999274;'/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/stateBased17932786632776569160.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 11:36:29] [INFO ] Flatten gal took : 10 ms
[2023-03-08 11:36:29] [INFO ] Flatten gal took : 9 ms
[2023-03-08 11:36:29] [INFO ] Time to serialize gal into /tmp/LTL9414526231844333448.gal : 3 ms
[2023-03-08 11:36:29] [INFO ] Time to serialize properties into /tmp/LTL5399920967801297976.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/LTL9414526231844333448.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14243893073999527486.hoa' '-atoms' '/tmp/LTL5399920967801297976.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/LTL5399920967801297976.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14243893073999527486.hoa
Detected timeout of ITS tools.
[2023-03-08 11:36:44] [INFO ] Flatten gal took : 10 ms
[2023-03-08 11:36:44] [INFO ] Flatten gal took : 9 ms
[2023-03-08 11:36:44] [INFO ] Time to serialize gal into /tmp/LTL11868522389436162492.gal : 4 ms
[2023-03-08 11:36:44] [INFO ] Time to serialize properties into /tmp/LTL9939466409873232111.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/LTL11868522389436162492.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9939466409873232111.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 : !((F((G((F(G("((p92!=1)||(p283!=1))")))&&(F("((p301!=1)||(p310!=1))"))))||((("(p190!=1)")&&(F(("((p301!=1)||(p310!=1))")&&(F(G("((p92!...208
Formula 0 simplified : G(F(GF!"((p92!=1)||(p283!=1))" | G!"((p301!=1)||(p310!=1))") & (!"((p92!=1)||(p283!=1))" | !"(p190!=1)" | GF!"((p92!=1)||(p283!=1))"...186
Detected timeout of ITS tools.
[2023-03-08 11:36:59] [INFO ] Flatten gal took : 19 ms
[2023-03-08 11:36:59] [INFO ] Applying decomposition
[2023-03-08 11:36:59] [INFO ] Flatten gal took : 9 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/graph15187898233398497769.txt' '-o' '/tmp/graph15187898233398497769.bin' '-w' '/tmp/graph15187898233398497769.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph15187898233398497769.bin' '-l' '-1' '-v' '-w' '/tmp/graph15187898233398497769.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:36:59] [INFO ] Decomposing Gal with order
[2023-03-08 11:36:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:36:59] [INFO ] Removed a total of 77 redundant transitions.
[2023-03-08 11:36:59] [INFO ] Flatten gal took : 33 ms
[2023-03-08 11:36:59] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 4 ms.
[2023-03-08 11:36:59] [INFO ] Time to serialize gal into /tmp/LTL5042816847180595711.gal : 19 ms
[2023-03-08 11:36:59] [INFO ] Time to serialize properties into /tmp/LTL1393073282890590963.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/LTL5042816847180595711.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1393073282890590963.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 : !((F((G((F(G("((u7.p92!=1)||(u7.p283!=1))")))&&(F("((i2.u10.p301!=1)||(i7.i2.u11.p310!=1))"))))||((("(u1.p190!=1)")&&(F(("((i2.u10.p30...263
Formula 0 simplified : G(F(GF!"((u7.p92!=1)||(u7.p283!=1))" | G!"((i2.u10.p301!=1)||(i7.i2.u11.p310!=1))") & (!"((u7.p92!=1)||(u7.p283!=1))" | !"(u1.p190!=...241
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin483570462880178432
[2023-03-08 11:37:14] [INFO ] Built C files in 4ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin483570462880178432
Running compilation step : cd /tmp/ltsmin483570462880178432;'/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 408 ms.
Running link step : cd /tmp/ltsmin483570462880178432;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 29 ms.
Running LTSmin : cd /tmp/ltsmin483570462880178432;'/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))))||(<>(((LTLAPp1==true)&&<>([]((LTLAPp0==true)))))&&(LTLAPp2==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-09 finished in 111982 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
Support contains 4 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.3 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 27 place count 382 transition count 318
Deduced a syphon composed of 12 places in 3 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 2 with 24 rules applied. Total rules applied 51 place count 370 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 367 transition count 315
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 367 transition count 315
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 60 place count 364 transition count 312
Iterating global reduction 2 with 3 rules applied. Total rules applied 63 place count 364 transition count 312
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 2 with 4 rules applied. Total rules applied 67 place count 364 transition count 308
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 68 place count 363 transition count 308
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 68 place count 363 transition count 306
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 72 place count 361 transition count 306
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 1 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 4 with 150 rules applied. Total rules applied 222 place count 286 transition count 231
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 226 place count 284 transition count 236
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 4 with 4 rules applied. Total rules applied 230 place count 284 transition count 232
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 282 transition count 230
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 233 place count 281 transition count 230
Applied a total of 233 rules in 51 ms. Remains 281 /402 variables (removed 121) and now considering 230/347 (removed 117) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 11:37:30] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 11:37:30] [INFO ] Implicit Places using invariants in 162 ms returned []
[2023-03-08 11:37:30] [INFO ] Invariant cache hit.
[2023-03-08 11:37:30] [INFO ] Implicit Places using invariants and state equation in 343 ms returned []
Implicit Place search using SMT with State Equation took 527 ms to find 0 implicit places.
[2023-03-08 11:37:30] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:37:30] [INFO ] Invariant cache hit.
[2023-03-08 11:37:30] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 281/402 places, 230/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 723 ms. Remains : 281/402 places, 230/347 transitions.
Stuttering acceptance computed with spot in 65 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (EQ s71 0) (EQ s276 0)), p1:(OR (EQ s166 0) (EQ s190 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 4626 reset in 232 ms.
Product exploration explored 100000 steps with 4635 reset in 241 ms.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 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 73 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 458 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10000 steps, including 89 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Running SMT prover for 1 properties.
[2023-03-08 11:37:31] [INFO ] Invariant cache hit.
[2023-03-08 11:37:31] [INFO ] After 83ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:37:31] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:37:31] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 11:37:32] [INFO ] After 145ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:37:32] [INFO ] After 192ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-08 11:37:32] [INFO ] After 342ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 23 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 23 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 458 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 77 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1666138 steps, run timeout after 3001 ms. (steps per millisecond=555 ) properties seen :{}
Probabilistic random walk after 1666138 steps, saw 214009 distinct states, run finished after 3001 ms. (steps per millisecond=555 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 11:37:35] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 11:37:35] [INFO ] After 64ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:37:35] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:37:35] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 46 ms returned sat
[2023-03-08 11:37:35] [INFO ] After 172ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:37:35] [INFO ] Deduced a trap composed of 6 places in 38 ms of which 0 ms to minimize.
[2023-03-08 11:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 60 ms
[2023-03-08 11:37:35] [INFO ] After 258ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 11:37:35] [INFO ] After 367ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 8 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 11:37:35] [INFO ] Invariant cache hit.
[2023-03-08 11:37:35] [INFO ] Implicit Places using invariants in 147 ms returned []
[2023-03-08 11:37:35] [INFO ] Invariant cache hit.
[2023-03-08 11:37:36] [INFO ] Implicit Places using invariants and state equation in 318 ms returned []
Implicit Place search using SMT with State Equation took 490 ms to find 0 implicit places.
[2023-03-08 11:37:36] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:37:36] [INFO ] Invariant cache hit.
[2023-03-08 11:37:36] [INFO ] Dead Transitions using invariants and state equation in 116 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 618 ms. Remains : 279/279 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 9 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 11:37:36] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 11:37:36] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:37:36] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2023-03-08 11:37:36] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 47 ms returned sat
[2023-03-08 11:37:36] [INFO ] After 207ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:37:36] [INFO ] After 246ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 17 ms.
[2023-03-08 11:37:36] [INFO ] After 382ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND p0 (NOT p1)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND p0 (NOT p1))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 6 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 70 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 57 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 11:37:37] [INFO ] Computed 58 place invariants in 2 ms
[2023-03-08 11:37:37] [INFO ] Implicit Places using invariants in 156 ms returned []
[2023-03-08 11:37:37] [INFO ] Invariant cache hit.
[2023-03-08 11:37:37] [INFO ] Implicit Places using invariants and state equation in 299 ms returned []
Implicit Place search using SMT with State Equation took 456 ms to find 0 implicit places.
[2023-03-08 11:37:37] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:37:37] [INFO ] Invariant cache hit.
[2023-03-08 11:37:37] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 604 ms. Remains : 281/281 places, 230/230 transitions.
Computed a total of 175 stabilizing places and 170 stable transitions
Computed a total of 175 stabilizing places and 170 stable transitions
Detected a total of 175/281 stabilizing places and 170/230 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 367 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 94 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 455 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 2) seen :1
Incomplete Best-First random walk after 10001 steps, including 81 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 11:37:38] [INFO ] Invariant cache hit.
[2023-03-08 11:37:38] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:37:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2023-03-08 11:37:38] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 33 ms returned sat
[2023-03-08 11:37:38] [INFO ] After 123ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:37:38] [INFO ] After 159ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 20 ms.
[2023-03-08 11:37:38] [INFO ] After 289ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 281/281 places, 230/230 transitions.
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 281 transition count 229
Free-agglomeration rule applied 1 times.
Iterating global reduction 1 with 1 rules applied. Total rules applied 2 place count 281 transition count 228
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 3 place count 280 transition count 228
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 4 place count 280 transition count 227
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 5 place count 279 transition count 227
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 6 place count 279 transition count 227
Applied a total of 6 rules in 15 ms. Remains 279 /281 variables (removed 2) and now considering 227/230 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 279/281 places, 227/230 transitions.
Incomplete random walk after 10000 steps, including 465 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 83 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1676524 steps, run timeout after 3001 ms. (steps per millisecond=558 ) properties seen :{}
Probabilistic random walk after 1676524 steps, saw 215217 distinct states, run finished after 3001 ms. (steps per millisecond=558 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 11:37:41] [INFO ] Computed 59 place invariants in 7 ms
[2023-03-08 11:37:41] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:37:41] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:37:41] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 48 ms returned sat
[2023-03-08 11:37:41] [INFO ] After 176ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:37:41] [INFO ] Deduced a trap composed of 6 places in 40 ms of which 1 ms to minimize.
[2023-03-08 11:37:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2023-03-08 11:37:42] [INFO ] After 264ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2023-03-08 11:37:42] [INFO ] After 384ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 279 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 3 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 4 ms. Remains : 279/279 places, 227/227 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 279/279 places, 227/227 transitions.
Applied a total of 0 rules in 4 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
[2023-03-08 11:37:42] [INFO ] Invariant cache hit.
[2023-03-08 11:37:42] [INFO ] Implicit Places using invariants in 138 ms returned []
[2023-03-08 11:37:42] [INFO ] Invariant cache hit.
[2023-03-08 11:37:42] [INFO ] Implicit Places using invariants and state equation in 327 ms returned []
Implicit Place search using SMT with State Equation took 467 ms to find 0 implicit places.
[2023-03-08 11:37:42] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:37:42] [INFO ] Invariant cache hit.
[2023-03-08 11:37:42] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 610 ms. Remains : 279/279 places, 227/227 transitions.
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 279 transition count 227
Applied a total of 1 rules in 7 ms. Remains 279 /279 variables (removed 0) and now considering 227/227 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 227 rows 279 cols
[2023-03-08 11:37:42] [INFO ] Computed 59 place invariants in 3 ms
[2023-03-08 11:37:42] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-08 11:37:42] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2023-03-08 11:37:42] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 45 ms returned sat
[2023-03-08 11:37:42] [INFO ] After 184ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-08 11:37:43] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2023-03-08 11:37:43] [INFO ] After 352ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p1) p0))), (X (NOT (AND (NOT p1) (NOT p0)))), (X (X (NOT (AND (NOT p1) p0)))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : [(F (AND (NOT p1) p0))]
Knowledge based reduction with 6 factoid took 352 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 68 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 71 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 76 ms :[(AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 4599 reset in 214 ms.
Product exploration explored 100000 steps with 4621 reset in 230 ms.
Built C files in :
/tmp/ltsmin15184089968472940244
[2023-03-08 11:37:44] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2023-03-08 11:37:44] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:37:44] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2023-03-08 11:37:44] [INFO ] Computation of Complete enable matrix. took 6 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:37:44] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2023-03-08 11:37:44] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:37:44] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15184089968472940244
Running compilation step : cd /tmp/ltsmin15184089968472940244;'/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 507 ms.
Running link step : cd /tmp/ltsmin15184089968472940244;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15184089968472940244;'/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/stateBased16384187892236836853.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 281 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 281/281 places, 230/230 transitions.
Applied a total of 0 rules in 5 ms. Remains 281 /281 variables (removed 0) and now considering 230/230 (removed 0) transitions.
// Phase 1: matrix 230 rows 281 cols
[2023-03-08 11:37:59] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 11:37:59] [INFO ] Implicit Places using invariants in 149 ms returned []
[2023-03-08 11:37:59] [INFO ] Invariant cache hit.
[2023-03-08 11:37:59] [INFO ] Implicit Places using invariants and state equation in 305 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-08 11:37:59] [INFO ] Redundant transitions in 0 ms returned []
[2023-03-08 11:37:59] [INFO ] Invariant cache hit.
[2023-03-08 11:37:59] [INFO ] Dead Transitions using invariants and state equation in 125 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 600 ms. Remains : 281/281 places, 230/230 transitions.
Built C files in :
/tmp/ltsmin5568141603446187739
[2023-03-08 11:37:59] [INFO ] Computing symmetric may disable matrix : 230 transitions.
[2023-03-08 11:37:59] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:37:59] [INFO ] Computing symmetric may enable matrix : 230 transitions.
[2023-03-08 11:37:59] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:37:59] [INFO ] Computing Do-Not-Accords matrix : 230 transitions.
[2023-03-08 11:37:59] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:37:59] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5568141603446187739
Running compilation step : cd /tmp/ltsmin5568141603446187739;'/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 499 ms.
Running link step : cd /tmp/ltsmin5568141603446187739;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin5568141603446187739;'/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/stateBased7698010368026250165.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-08 11:38:14] [INFO ] Flatten gal took : 9 ms
[2023-03-08 11:38:14] [INFO ] Flatten gal took : 8 ms
[2023-03-08 11:38:14] [INFO ] Time to serialize gal into /tmp/LTL918495456514610455.gal : 16 ms
[2023-03-08 11:38:14] [INFO ] Time to serialize properties into /tmp/LTL17386004473623205743.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/LTL918495456514610455.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12400612790542577485.hoa' '-atoms' '/tmp/LTL17386004473623205743.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/LTL17386004473623205743.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12400612790542577485.hoa
Detected timeout of ITS tools.
[2023-03-08 11:38:30] [INFO ] Flatten gal took : 11 ms
[2023-03-08 11:38:30] [INFO ] Flatten gal took : 14 ms
[2023-03-08 11:38:30] [INFO ] Time to serialize gal into /tmp/LTL2150604716695295802.gal : 1 ms
[2023-03-08 11:38:30] [INFO ] Time to serialize properties into /tmp/LTL3216215400217567779.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/LTL2150604716695295802.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL3216215400217567779.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 : !((F(G(("((p78==0)||(p431==0))")||(X(X(F("((p198==0)||(p281==0))"))))))))
Formula 0 simplified : G(F!"((p78==0)||(p431==0))" & FG!"((p198==0)||(p281==0))")
Detected timeout of ITS tools.
[2023-03-08 11:38:45] [INFO ] Flatten gal took : 14 ms
[2023-03-08 11:38:45] [INFO ] Applying decomposition
[2023-03-08 11:38:45] [INFO ] Flatten gal took : 8 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/graph1226169706688647590.txt' '-o' '/tmp/graph1226169706688647590.bin' '-w' '/tmp/graph1226169706688647590.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph1226169706688647590.bin' '-l' '-1' '-v' '-w' '/tmp/graph1226169706688647590.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:38:45] [INFO ] Decomposing Gal with order
[2023-03-08 11:38:45] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:38:45] [INFO ] Removed a total of 82 redundant transitions.
[2023-03-08 11:38:45] [INFO ] Flatten gal took : 32 ms
[2023-03-08 11:38:45] [INFO ] Fuse similar labels procedure discarded/fused a total of 52 labels/synchronizations in 20 ms.
[2023-03-08 11:38:45] [INFO ] Time to serialize gal into /tmp/LTL8432421488971789257.gal : 2 ms
[2023-03-08 11:38:45] [INFO ] Time to serialize properties into /tmp/LTL17266809680017476103.ltl : 3 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/LTL8432421488971789257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17266809680017476103.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 : !((F(G(("((u44.p78==0)||(u44.p431==0))")||(X(X(F("((i1.i1.u3.p198==0)||(i1.i1.u8.p281==0))"))))))))
Formula 0 simplified : G(F!"((u44.p78==0)||(u44.p431==0))" & FG!"((i1.i1.u3.p198==0)||(i1.i1.u8.p281==0))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin4157429460985385358
[2023-03-08 11:39:00] [INFO ] Built C files in 9ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4157429460985385358
Running compilation step : cd /tmp/ltsmin4157429460985385358;'/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 413 ms.
Running link step : cd /tmp/ltsmin4157429460985385358;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4157429460985385358;'/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' '<>([]((X(X(<>((LTLAPp1==true))))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-40b-LTLFireability-10 finished in 105316 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 395 transition count 330
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 382 transition count 330
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 27 place count 382 transition count 319
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 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 70 place count 363 transition count 306
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 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 76 place count 360 transition count 303
Performed 77 Post agglomeration using F-continuation condition.Transition count delta: 77
Deduced a syphon composed of 77 places in 0 ms
Reduce places removed 77 places and 0 transitions.
Iterating global reduction 6 with 154 rules applied. Total rules applied 230 place count 283 transition count 226
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 6 with 4 rules applied. Total rules applied 234 place count 281 transition count 228
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 236 place count 279 transition count 226
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 237 place count 278 transition count 226
Applied a total of 237 rules in 42 ms. Remains 278 /402 variables (removed 124) and now considering 226/347 (removed 121) transitions.
// Phase 1: matrix 226 rows 278 cols
[2023-03-08 11:39:15] [INFO ] Computed 58 place invariants in 3 ms
[2023-03-08 11:39:15] [INFO ] Implicit Places using invariants in 158 ms returned []
[2023-03-08 11:39:15] [INFO ] Invariant cache hit.
[2023-03-08 11:39:15] [INFO ] Implicit Places using invariants and state equation in 306 ms returned []
Implicit Place search using SMT with State Equation took 464 ms to find 0 implicit places.
[2023-03-08 11:39:15] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:39:15] [INFO ] Invariant cache hit.
[2023-03-08 11:39:16] [INFO ] Dead Transitions using invariants and state equation in 118 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 278/402 places, 226/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 631 ms. Remains : 278/402 places, 226/347 transitions.
Stuttering acceptance computed with spot in 36 ms :[(NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s176 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Product exploration explored 100000 steps with 5444 reset in 209 ms.
Product exploration explored 100000 steps with 5439 reset in 221 ms.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 109 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 32 ms :[(NOT p0)]
Finished random walk after 9926 steps, including 535 resets, run visited all 1 properties in 27 ms. (steps per millisecond=367 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 113 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 27 ms :[(NOT p0)]
Support contains 1 out of 278 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 278/278 places, 226/226 transitions.
Applied a total of 0 rules in 4 ms. Remains 278 /278 variables (removed 0) and now considering 226/226 (removed 0) transitions.
[2023-03-08 11:39:16] [INFO ] Invariant cache hit.
[2023-03-08 11:39:17] [INFO ] Implicit Places using invariants in 146 ms returned []
[2023-03-08 11:39:17] [INFO ] Invariant cache hit.
[2023-03-08 11:39:17] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 442 ms to find 0 implicit places.
[2023-03-08 11:39:17] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:39:17] [INFO ] Invariant cache hit.
[2023-03-08 11:39:17] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 571 ms. Remains : 278/278 places, 226/226 transitions.
Computed a total of 174 stabilizing places and 169 stable transitions
Computed a total of 174 stabilizing places and 169 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 80 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 25 ms :[(NOT p0)]
Finished random walk after 956 steps, including 49 resets, run visited all 1 properties in 4 ms. (steps per millisecond=239 )
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : [(F (NOT p0))]
Knowledge based reduction with 3 factoid took 129 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 37 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 42 ms :[(NOT p0)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p0)]
Product exploration explored 100000 steps with 5413 reset in 213 ms.
Product exploration explored 100000 steps with 5495 reset in 234 ms.
Built C files in :
/tmp/ltsmin15040508723876590637
[2023-03-08 11:39:18] [INFO ] Computing symmetric may disable matrix : 226 transitions.
[2023-03-08 11:39:18] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:39:18] [INFO ] Computing symmetric may enable matrix : 226 transitions.
[2023-03-08 11:39:18] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:39:18] [INFO ] Computing Do-Not-Accords matrix : 226 transitions.
[2023-03-08 11:39:18] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:39:18] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15040508723876590637
Running compilation step : cd /tmp/ltsmin15040508723876590637;'/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 493 ms.
Running link step : cd /tmp/ltsmin15040508723876590637;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin15040508723876590637;'/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/stateBased9034067323164779471.hoa' '--buchi-type=spotba'
LTSmin run took 849 ms.
FORMULA DES-PT-40b-LTLFireability-11 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-40b-LTLFireability-11 finished in 4337 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(p0))))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Discarding 5 places :
Symmetric choice reduction at 0 with 5 rule applications. Total rules 5 place count 397 transition count 342
Iterating global reduction 0 with 5 rules applied. Total rules applied 10 place count 397 transition count 342
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 11 place count 397 transition count 341
Discarding 3 places :
Symmetric choice reduction at 1 with 3 rule applications. Total rules 14 place count 394 transition count 338
Iterating global reduction 1 with 3 rules applied. Total rules applied 17 place count 394 transition count 338
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 1 with 3 rules applied. Total rules applied 20 place count 394 transition count 335
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 393 transition count 334
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 393 transition count 334
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 23 place count 393 transition count 333
Applied a total of 23 rules in 23 ms. Remains 393 /402 variables (removed 9) and now considering 333/347 (removed 14) transitions.
// Phase 1: matrix 333 rows 393 cols
[2023-03-08 11:39:19] [INFO ] Computed 62 place invariants in 10 ms
[2023-03-08 11:39:19] [INFO ] Implicit Places using invariants in 184 ms returned []
[2023-03-08 11:39:19] [INFO ] Invariant cache hit.
[2023-03-08 11:39:20] [INFO ] Implicit Places using invariants and state equation in 418 ms returned []
Implicit Place search using SMT with State Equation took 603 ms to find 0 implicit places.
[2023-03-08 11:39:20] [INFO ] Invariant cache hit.
[2023-03-08 11:39:20] [INFO ] Dead Transitions using invariants and state equation in 165 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 393/402 places, 333/347 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 792 ms. Remains : 393/402 places, 333/347 transitions.
Stuttering acceptance computed with spot in 114 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(OR (NEQ s163 1) (NEQ s182 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][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 237 ms.
Product exploration explored 100000 steps with 33333 reset in 244 ms.
Computed a total of 216 stabilizing places and 208 stable transitions
Graph (complete) has 886 edges and 393 vertex of which 387 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 216 stabilizing places and 208 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 62 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-40b-LTLFireability-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-40b-LTLFireability-13 finished in 1471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(G(p0)) U p1))'
Support contains 2 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 29 place count 381 transition count 318
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 51 place count 370 transition count 318
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 54 place count 367 transition count 315
Iterating global reduction 2 with 3 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 2 places :
Symmetric choice reduction at 4 with 2 rule applications. Total rules 62 place count 364 transition count 311
Iterating global reduction 4 with 2 rules applied. Total rules applied 64 place count 364 transition count 311
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 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 3 rules applied. Total rules applied 67 place count 364 transition count 308
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 69 place count 363 transition count 307
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 69 place count 363 transition count 306
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 71 place count 362 transition count 306
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 6 with 150 rules applied. Total rules applied 221 place count 287 transition count 231
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 6 with 4 rules applied. Total rules applied 225 place count 285 transition count 233
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 227 place count 283 transition count 231
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 228 place count 282 transition count 231
Applied a total of 228 rules in 44 ms. Remains 282 /402 variables (removed 120) and now considering 231/347 (removed 116) transitions.
// Phase 1: matrix 231 rows 282 cols
[2023-03-08 11:39:21] [INFO ] Computed 58 place invariants in 6 ms
[2023-03-08 11:39:21] [INFO ] Implicit Places using invariants in 157 ms returned []
[2023-03-08 11:39:21] [INFO ] Invariant cache hit.
[2023-03-08 11:39:21] [INFO ] Implicit Places using invariants and state equation in 297 ms returned []
Implicit Place search using SMT with State Equation took 455 ms to find 0 implicit places.
[2023-03-08 11:39:21] [INFO ] Redundant transitions in 1 ms returned []
[2023-03-08 11:39:21] [INFO ] Invariant cache hit.
[2023-03-08 11:39:21] [INFO ] Dead Transitions using invariants and state equation in 119 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 282/402 places, 231/347 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 627 ms. Remains : 282/402 places, 231/347 transitions.
Stuttering acceptance computed with spot in 78 ms :[(NOT p1), (NOT p0)]
Running random walk in product with property : DES-PT-40b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(NOT p1), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(EQ s171 1), p0:(EQ s188 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 62 steps with 0 reset in 1 ms.
FORMULA DES-PT-40b-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-14 finished in 725 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(p0) U G(p1))||F(p0)))'
Support contains 3 out of 402 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 402/402 places, 347/347 transitions.
Graph (complete) has 907 edges and 402 vertex of which 396 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 14 transitions
Trivial Post-agglo rules discarded 14 transitions
Performed 14 trivial Post agglomeration. Transition count delta: 14
Iterating post reduction 0 with 14 rules applied. Total rules applied 15 place count 395 transition count 329
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 1 with 14 rules applied. Total rules applied 29 place count 381 transition count 329
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 29 place count 381 transition count 319
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 49 place count 371 transition count 319
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 53 place count 367 transition count 315
Iterating global reduction 2 with 4 rules applied. Total rules applied 57 place count 367 transition count 315
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 2 with 2 rules applied. Total rules applied 59 place count 367 transition count 313
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 60 place count 366 transition count 313
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 63 place count 363 transition count 310
Iterating global reduction 4 with 3 rules applied. Total rules applied 66 place count 363 transition count 310
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 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 4 rules applied. Total rules applied 70 place count 363 transition count 306
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 72 place count 362 transition count 305
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 2 Pre rules applied. Total rules applied 72 place count 362 transition count 303
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 76 place count 360 transition count 303
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 6 with 150 rules applied. Total rules applied 226 place count 285 transition count 228
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 6 with 4 rules applied. Total rules applied 230 place count 283 transition count 230
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 232 place count 281 transition count 228
Applied a total of 232 rules in 42 ms. Remains 281 /402 variables (removed 121) and now considering 228/347 (removed 119) transitions.
// Phase 1: matrix 228 rows 281 cols
[2023-03-08 11:39:21] [INFO ] Computed 59 place invariants in 9 ms
[2023-03-08 11:39:22] [INFO ] Implicit Places using invariants in 148 ms returned [171]
Discarding 1 places :
Implicit Place search using SMT only with invariants took 150 ms to find 1 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 280/402 places, 228/347 transitions.
Applied a total of 0 rules in 4 ms. Remains 280 /280 variables (removed 0) and now considering 228/228 (removed 0) transitions.
Finished structural reductions in SI_LTL mode , in 2 iterations and 198 ms. Remains : 280/402 places, 228/347 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : DES-PT-40b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=1 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=1 dest: 1}]], initial=1, aps=[p0:(AND (EQ s20 1) (EQ s193 1)), p1:(EQ s171 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Stuttering criterion allowed to conclude after 21 steps with 0 reset in 0 ms.
FORMULA DES-PT-40b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-40b-LTLFireability-15 finished in 300 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) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))) U (G((X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0)))))||(!p1&&(X(!p0) U ((X(!p0)&&G((!p0||X(!p1))))||X(G(!p0))))))))'
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((F(p1)||p0)))&&(F(p1)||X(F(p2))))))'
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&&F((!p1&&F(G(!p2)))))||G((F(G(!p2))&&F(!p1))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X(X(F(p1)))||p0))))'
[2023-03-08 11:39:22] [INFO ] Flatten gal took : 14 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin14776479984832563972
[2023-03-08 11:39:22] [INFO ] Computing symmetric may disable matrix : 347 transitions.
[2023-03-08 11:39:22] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:39:22] [INFO ] Computing symmetric may enable matrix : 347 transitions.
[2023-03-08 11:39:22] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:39:22] [INFO ] Applying decomposition
[2023-03-08 11:39:22] [INFO ] Flatten gal took : 9 ms
[2023-03-08 11:39:22] [INFO ] Computing Do-Not-Accords matrix : 347 transitions.
[2023-03-08 11:39:22] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2023-03-08 11:39:22] [INFO ] Built C files in 37ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14776479984832563972
Running compilation step : cd /tmp/ltsmin14776479984832563972;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '180' '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/graph7985253462780333530.txt' '-o' '/tmp/graph7985253462780333530.bin' '-w' '/tmp/graph7985253462780333530.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph7985253462780333530.bin' '-l' '-1' '-v' '-w' '/tmp/graph7985253462780333530.weights' '-q' '0' '-e' '0.001'
[2023-03-08 11:39:22] [INFO ] Decomposing Gal with order
[2023-03-08 11:39:22] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 11:39:22] [INFO ] Removed a total of 18 redundant transitions.
[2023-03-08 11:39:22] [INFO ] Flatten gal took : 17 ms
[2023-03-08 11:39:22] [INFO ] Fuse similar labels procedure discarded/fused a total of 6 labels/synchronizations in 2 ms.
[2023-03-08 11:39:22] [INFO ] Time to serialize gal into /tmp/LTLFireability12790746419975258847.gal : 3 ms
[2023-03-08 11:39:22] [INFO ] Time to serialize properties into /tmp/LTLFireability9753172693211840566.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/LTLFireability12790746419975258847.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability9753172693211840566.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 4 LTL properties
Checking formula 0 : !((((X(!("((i11.u78.p85==1)&&(i11.u78.p431==1))")))U(((X(!("((i11.u78.p85==1)&&(i11.u78.p431==1))")))&&(G((!("((i11.u78.p85==1)&&(i11....829
Formula 0 simplified : "((i1.u7.p158==1)&&(i1.u7.p189==1))" U (X"((i11.u78.p85==1)&&(i11.u78.p431==1))" R (XF"((i11.u78.p85==1)&&(i11.u78.p431==1))" & (X"(...280
Compilation finished in 718 ms.
Running link step : cd /tmp/ltsmin14776479984832563972;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin14776479984832563972;'/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' '((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))) U ([]((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t58, t89, t120, t257, t307, t308, t340, u34.t79, u37.t76, i1.u7.t222, i1.u7.t223, i1.u7.t...1202
Computing Next relation with stutter on 4.21057e+08 deadlock states
WARNING : LTSmin timed out (>900 s) on command cd /tmp/ltsmin14776479984832563972;'/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' '((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))) U ([]((X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))||(!(LTLAPp1==true)&&(X(!(LTLAPp0==true)) U ((X(!(LTLAPp0==true))&&[]((!(LTLAPp0==true)||X(!(LTLAPp1==true)))))||X([](!(LTLAPp0==true))))))))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin14776479984832563972;'/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' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.001: Loading model from ./gal.so
pins2lts-mc-linux64( 2/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.011: LTL layer: formula: []((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))
pins2lts-mc-linux64( 0/ 8), 0.012: "[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 0/ 8), 0.012: Using Spin LTL semantics
pins2lts-mc-linux64( 5/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.015: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.015: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.016: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.023: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.015: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.028: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.030: buchi has 4 states
pins2lts-mc-linux64( 7/ 8), 0.031: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.036: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.086: There are 358 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 0.086: State length is 403, there are 355 groups
pins2lts-mc-linux64( 0/ 8), 0.086: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 0.086: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 0.086: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 0.086: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 0/ 8), 0.136: [Blue] ~71 levels ~960 states ~5352 transitions
pins2lts-mc-linux64( 0/ 8), 0.191: [Blue] ~158 levels ~1920 states ~10576 transitions
pins2lts-mc-linux64( 0/ 8), 0.213: [Blue] ~165 levels ~3840 states ~14088 transitions
pins2lts-mc-linux64( 0/ 8), 0.295: [Blue] ~165 levels ~7680 states ~23312 transitions
pins2lts-mc-linux64( 2/ 8), 0.406: [Blue] ~105 levels ~15360 states ~37576 transitions
pins2lts-mc-linux64( 7/ 8), 0.685: [Blue] ~134 levels ~30720 states ~71688 transitions
pins2lts-mc-linux64( 2/ 8), 1.120: [Blue] ~105 levels ~61440 states ~165592 transitions
pins2lts-mc-linux64( 0/ 8), 1.979: [Blue] ~165 levels ~122880 states ~389512 transitions
pins2lts-mc-linux64( 0/ 8), 3.450: [Blue] ~165 levels ~245760 states ~832816 transitions
pins2lts-mc-linux64( 0/ 8), 5.844: [Blue] ~165 levels ~491520 states ~1716224 transitions
pins2lts-mc-linux64( 0/ 8), 10.572: [Blue] ~165 levels ~983040 states ~3614904 transitions
pins2lts-mc-linux64( 0/ 8), 19.291: [Blue] ~165 levels ~1966080 states ~7564264 transitions
pins2lts-mc-linux64( 2/ 8), 37.562: [Blue] ~176 levels ~3932160 states ~21427416 transitions
pins2lts-mc-linux64( 0/ 8), 82.100: [Blue] ~165 levels ~7864320 states ~33229264 transitions
pins2lts-mc-linux64( 2/ 8), 156.034: [Blue] ~176 levels ~15728640 states ~70291872 transitions
pins2lts-mc-linux64( 2/ 8), 301.460: [Blue] ~176 levels ~31457280 states ~140577792 transitions
pins2lts-mc-linux64( 2/ 8), 331.788: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 331.843:
pins2lts-mc-linux64( 0/ 8), 331.843: Explored 32075766 states 154176095 transitions, fanout: 4.807
pins2lts-mc-linux64( 0/ 8), 331.843: Total exploration time 331.730 sec (331.680 sec minimum, 331.712 sec on average)
pins2lts-mc-linux64( 0/ 8), 331.844: States per second: 96692, Transitions per second: 464764
pins2lts-mc-linux64( 0/ 8), 331.844:
pins2lts-mc-linux64( 0/ 8), 331.844: State space has 31799738 states, 29378187 are accepting
pins2lts-mc-linux64( 0/ 8), 331.844: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 331.844: blue states: 32075766 (100.87%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 331.844: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 331.844: all-red states: 29378187 (92.38%), bogus 257528 (0.81%)
pins2lts-mc-linux64( 0/ 8), 331.844:
pins2lts-mc-linux64( 0/ 8), 331.844: Total memory used for local state coloring: 0.0MB
pins2lts-mc-linux64( 0/ 8), 331.844:
pins2lts-mc-linux64( 0/ 8), 331.844: Queue width: 8B, total height: 1291, memory: 0.01MB
pins2lts-mc-linux64( 0/ 8), 331.844: Tree memory: 498.6MB, 16.4 B/state, compr.: 1.0%
pins2lts-mc-linux64( 0/ 8), 331.844: Tree fill ratio (roots/leafs): 23.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 331.844: Stored 349 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 331.844: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 331.844: Est. total memory use: 498.6MB (~1024.0MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14776479984832563972;'/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' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==true))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin14776479984832563972;'/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' '[]((<>([]((<>((LTLAPp3==true))||(LTLAPp2==true))))&&(<>((LTLAPp3==true))||X(<>((LTLAPp4==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 12:01:52] [INFO ] Applying decomposition
[2023-03-08 12:01:52] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:01:52] [INFO ] Decomposing Gal with order
[2023-03-08 12:01:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-08 12:01:52] [INFO ] Removed a total of 167 redundant transitions.
[2023-03-08 12:01:52] [INFO ] Flatten gal took : 23 ms
[2023-03-08 12:01:52] [INFO ] Fuse similar labels procedure discarded/fused a total of 561 labels/synchronizations in 13 ms.
[2023-03-08 12:01:52] [INFO ] Time to serialize gal into /tmp/LTLFireability9896095559141907878.gal : 3 ms
[2023-03-08 12:01:52] [INFO ] Time to serialize properties into /tmp/LTLFireability3924887619554295600.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/LTLFireability9896095559141907878.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability3924887619554295600.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...276
Read 4 LTL properties
Checking formula 0 : !((((X(!("((i0.i0.i0.u5.p85==1)&&(i1.i1.i1.u118.p431==1))")))U(((X(!("((i0.i0.i0.u5.p85==1)&&(i1.i1.i1.u118.p431==1))")))&&(G((!("((i0...1013
Formula 0 simplified : "((i0.u7.p158==1)&&(i1.i0.i0.i0.i0.i0.u17.p189==1))" U (X"((i0.i0.i0.u5.p85==1)&&(i1.i1.i1.u118.p431==1))" R (XF"((i0.i0.i0.u5.p85==...352
Detected timeout of ITS tools.
[2023-03-08 12:24:23] [INFO ] Flatten gal took : 10 ms
[2023-03-08 12:24:23] [INFO ] Input system was already deterministic with 347 transitions.
[2023-03-08 12:24:23] [INFO ] Transformed 402 places.
[2023-03-08 12:24:23] [INFO ] Transformed 347 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 12:24:23] [INFO ] Time to serialize gal into /tmp/LTLFireability6745752830934970865.gal : 3 ms
[2023-03-08 12:24:23] [INFO ] Time to serialize properties into /tmp/LTLFireability14775285207333014300.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/LTLFireability6745752830934970865.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability14775285207333014300.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...343
Read 4 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((((X(!("((p85==1)&&(p431==1))")))U(((X(!("((p85==1)&&(p431==1))")))&&(G((!("((p85==1)&&(p431==1))"))||(X(!("((p158==1)&&(p189==1))")...589
Formula 0 simplified : "((p158==1)&&(p189==1))" U (X"((p85==1)&&(p431==1))" R (XF"((p85==1)&&(p431==1))" & (X"((p85==1)&&(p431==1))" | F("((p85==1)&&(p431=...192
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 11657228 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16034604 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:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ 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-40b"
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-40b, 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-167814475400468"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

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