Execution Chart

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

Trace from the execution

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

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 696K
-rw-r--r-- 1 mcc users 6.5K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 71K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.5K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K May 18 16:42 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K May 18 16:42 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.5K May 19 07:08 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:41 LTLCardinality.xml
-rw-r--r-- 1 mcc users 1.9K May 19 07:15 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:09 LTLFireability.xml
-rw-r--r-- 1 mcc users 18K Apr 12 08:06 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 204K Apr 12 08:06 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K Apr 12 08:05 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 96K Apr 12 08:05 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.5K Apr 22 14:37 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.5K Apr 22 14:37 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 4 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 127K May 18 16:42 model.pnml

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

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

The expected result is a vector of booleans
BOOL_VECTOR

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

=== Now, execution of the tool begins

BK_START 1716341052933

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLCardinality
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=DES-PT-50b
Not applying reductions.
Model is PT
LTLCardinality PT
Running Version 202304061127
[2024-05-22 01:24:14] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLCardinality, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2024-05-22 01:24:14] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-22 01:24:14] [INFO ] Load time of PNML (sax parser for PT used): 72 ms
[2024-05-22 01:24:14] [INFO ] Transformed 479 places.
[2024-05-22 01:24:14] [INFO ] Transformed 430 transitions.
[2024-05-22 01:24:14] [INFO ] Found NUPN structural information;
[2024-05-22 01:24:14] [INFO ] Parsed PT model containing 479 places and 430 transitions and 1463 arcs in 138 ms.
Parsed 16 properties from file /home/mcc/execution/LTLCardinality.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 1 formulas.
FORMULA DES-PT-50b-LTLCardinality-03 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-08 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-11 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-12 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA DES-PT-50b-LTLCardinality-14 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 479 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 479/479 places, 430/430 transitions.
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 2 place count 477 transition count 430
Discarding 20 places :
Symmetric choice reduction at 1 with 20 rule applications. Total rules 22 place count 457 transition count 410
Iterating global reduction 1 with 20 rules applied. Total rules applied 42 place count 457 transition count 410
Discarding 11 places :
Symmetric choice reduction at 1 with 11 rule applications. Total rules 53 place count 446 transition count 399
Iterating global reduction 1 with 11 rules applied. Total rules applied 64 place count 446 transition count 399
Ensure Unique test removed 9 transitions
Reduce isomorphic transitions removed 9 transitions.
Iterating post reduction 1 with 9 rules applied. Total rules applied 73 place count 446 transition count 390
Applied a total of 73 rules in 105 ms. Remains 446 /479 variables (removed 33) and now considering 390/430 (removed 40) transitions.
// Phase 1: matrix 390 rows 446 cols
[2024-05-22 01:24:14] [INFO ] Computed 63 invariants in 42 ms
[2024-05-22 01:24:15] [INFO ] Implicit Places using invariants in 570 ms returned []
[2024-05-22 01:24:15] [INFO ] Invariant cache hit.
[2024-05-22 01:24:15] [INFO ] Implicit Places using invariants and state equation in 594 ms returned []
Implicit Place search using SMT with State Equation took 1192 ms to find 0 implicit places.
[2024-05-22 01:24:15] [INFO ] Invariant cache hit.
[2024-05-22 01:24:16] [INFO ] Dead Transitions using invariants and state equation in 235 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 446/479 places, 390/430 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1538 ms. Remains : 446/479 places, 390/430 transitions.
Support contains 41 out of 446 places after structural reductions.
[2024-05-22 01:24:16] [INFO ] Flatten gal took : 76 ms
[2024-05-22 01:24:16] [INFO ] Flatten gal took : 38 ms
[2024-05-22 01:24:16] [INFO ] Input system was already deterministic with 390 transitions.
Incomplete random walk after 10000 steps, including 87 resets, run finished after 497 ms. (steps per millisecond=20 ) properties (out of 20) seen :10
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 15 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 42 ms. (steps per millisecond=238 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 13 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 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 25 ms. (steps per millisecond=400 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 11 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 12 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
[2024-05-22 01:24:17] [INFO ] Invariant cache hit.
[2024-05-22 01:24:17] [INFO ] After 181ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 01:24:17] [INFO ] [Nat]Absence check using 35 positive place invariants in 9 ms returned sat
[2024-05-22 01:24:17] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 31 ms returned sat
[2024-05-22 01:24:18] [INFO ] After 761ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-22 01:24:18] [INFO ] Deduced a trap composed of 26 places in 67 ms of which 16 ms to minimize.
[2024-05-22 01:24:18] [INFO ] Deduced a trap composed of 21 places in 38 ms of which 1 ms to minimize.
[2024-05-22 01:24:18] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 210 ms
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 18 places in 65 ms of which 1 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 30 places in 112 ms of which 1 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 34 places in 75 ms of which 1 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 33 places in 66 ms of which 0 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 35 places in 44 ms of which 1 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 18 places in 79 ms of which 1 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 20 places in 68 ms of which 1 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 20 places in 77 ms of which 1 ms to minimize.
[2024-05-22 01:24:19] [INFO ] Deduced a trap composed of 21 places in 85 ms of which 0 ms to minimize.
[2024-05-22 01:24:20] [INFO ] Deduced a trap composed of 24 places in 79 ms of which 0 ms to minimize.
[2024-05-22 01:24:20] [INFO ] Trap strengthening (SAT) tested/added 11/10 trap constraints in 1042 ms
[2024-05-22 01:24:20] [INFO ] Deduced a trap composed of 16 places in 77 ms of which 1 ms to minimize.
[2024-05-22 01:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 112 ms
[2024-05-22 01:24:20] [INFO ] Deduced a trap composed of 32 places in 75 ms of which 0 ms to minimize.
[2024-05-22 01:24:20] [INFO ] Deduced a trap composed of 32 places in 82 ms of which 1 ms to minimize.
[2024-05-22 01:24:20] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 224 ms
[2024-05-22 01:24:20] [INFO ] Deduced a trap composed of 28 places in 36 ms of which 1 ms to minimize.
[2024-05-22 01:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 80 ms
[2024-05-22 01:24:20] [INFO ] Deduced a trap composed of 19 places in 33 ms of which 0 ms to minimize.
[2024-05-22 01:24:20] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 71 ms
[2024-05-22 01:24:20] [INFO ] After 3021ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 418 ms.
[2024-05-22 01:24:21] [INFO ] After 3874ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 1163 ms.
Support contains 21 out of 446 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 444 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.4 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 18 rules applied. Total rules applied 19 place count 444 transition count 370
Reduce places removed 17 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 18 rules applied. Total rules applied 37 place count 427 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 37 place count 427 transition count 359
Deduced a syphon composed of 10 places in 2 ms
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 2 with 20 rules applied. Total rules applied 57 place count 417 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 61 place count 413 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 65 place count 413 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 66 place count 413 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 69 place count 410 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 72 place count 410 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 74 place count 410 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 74 place count 410 transition count 347
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 78 place count 408 transition count 347
Performed 72 Post agglomeration using F-continuation condition.Transition count delta: 72
Deduced a syphon composed of 72 places in 1 ms
Reduce places removed 72 places and 0 transitions.
Iterating global reduction 4 with 144 rules applied. Total rules applied 222 place count 336 transition count 275
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 230 place count 332 transition count 284
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 4 with 2 rules applied. Total rules applied 232 place count 332 transition count 282
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 4 with 2 rules applied. Total rules applied 234 place count 330 transition count 282
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 235 place count 329 transition count 281
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 236 place count 328 transition count 281
Applied a total of 236 rules in 166 ms. Remains 328 /446 variables (removed 118) and now considering 281/390 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 166 ms. Remains : 328/446 places, 281/390 transitions.
Incomplete random walk after 10000 steps, including 387 resets, run finished after 267 ms. (steps per millisecond=37 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 70 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 68 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 71 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 68 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 65 resets, run finished after 36 ms. (steps per millisecond=277 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 69 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 66 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 57 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 10) seen :0
Interrupted probabilistic random walk after 582571 steps, run timeout after 3001 ms. (steps per millisecond=194 ) properties seen :{}
Probabilistic random walk after 582571 steps, saw 122945 distinct states, run finished after 3002 ms. (steps per millisecond=194 ) properties seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 281 rows 328 cols
[2024-05-22 01:24:26] [INFO ] Computed 63 invariants in 9 ms
[2024-05-22 01:24:26] [INFO ] After 93ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 01:24:26] [INFO ] [Nat]Absence check using 35 positive place invariants in 5 ms returned sat
[2024-05-22 01:24:26] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 27 ms returned sat
[2024-05-22 01:24:27] [INFO ] After 361ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 9 places in 24 ms of which 1 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 48 ms
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 14 places in 59 ms of which 0 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 89 ms
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 15 places in 60 ms of which 0 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 87 ms
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 17 places in 42 ms of which 0 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 13 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 127 ms
[2024-05-22 01:24:27] [INFO ] Deduced a trap composed of 10 places in 37 ms of which 1 ms to minimize.
[2024-05-22 01:24:27] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 62 ms
[2024-05-22 01:24:27] [INFO ] After 1026ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 233 ms.
[2024-05-22 01:24:28] [INFO ] After 1472ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Parikh walk visited 0 properties in 520 ms.
Support contains 21 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 281/281 transitions.
Applied a total of 0 rules in 15 ms. Remains 328 /328 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 328/328 places, 281/281 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 281/281 transitions.
Applied a total of 0 rules in 11 ms. Remains 328 /328 variables (removed 0) and now considering 281/281 (removed 0) transitions.
[2024-05-22 01:24:28] [INFO ] Invariant cache hit.
[2024-05-22 01:24:28] [INFO ] Implicit Places using invariants in 265 ms returned []
[2024-05-22 01:24:28] [INFO ] Invariant cache hit.
[2024-05-22 01:24:29] [INFO ] Implicit Places using invariants and state equation in 366 ms returned []
Implicit Place search using SMT with State Equation took 635 ms to find 0 implicit places.
[2024-05-22 01:24:29] [INFO ] Redundant transitions in 13 ms returned []
[2024-05-22 01:24:29] [INFO ] Invariant cache hit.
[2024-05-22 01:24:29] [INFO ] Dead Transitions using invariants and state equation in 161 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 825 ms. Remains : 328/328 places, 281/281 transitions.
Applied a total of 0 rules in 9 ms. Remains 328 /328 variables (removed 0) and now considering 281/281 (removed 0) transitions.
Running SMT prover for 10 properties.
[2024-05-22 01:24:29] [INFO ] Invariant cache hit.
[2024-05-22 01:24:29] [INFO ] After 279ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2024-05-22 01:24:29] [INFO ] [Nat]Absence check using 35 positive place invariants in 6 ms returned sat
[2024-05-22 01:24:29] [INFO ] [Nat]Absence check using 35 positive and 28 generalized place invariants in 64 ms returned sat
[2024-05-22 01:24:30] [INFO ] After 369ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2024-05-22 01:24:30] [INFO ] Deduced a trap composed of 13 places in 60 ms of which 0 ms to minimize.
[2024-05-22 01:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 97 ms
[2024-05-22 01:24:30] [INFO ] Deduced a trap composed of 8 places in 53 ms of which 1 ms to minimize.
[2024-05-22 01:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 77 ms
[2024-05-22 01:24:30] [INFO ] Deduced a trap composed of 8 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:24:30] [INFO ] Deduced a trap composed of 7 places in 31 ms of which 0 ms to minimize.
[2024-05-22 01:24:30] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 97 ms
[2024-05-22 01:24:30] [INFO ] Deduced a trap composed of 20 places in 66 ms of which 0 ms to minimize.
[2024-05-22 01:24:30] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 92 ms
[2024-05-22 01:24:30] [INFO ] After 1027ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 254 ms.
[2024-05-22 01:24:31] [INFO ] After 1498ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Computed a total of 258 stabilizing places and 250 stable transitions
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.14 ms
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0 U X(p1))||X(X(X(G(p2)))))))'
Support contains 7 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 439 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 439 transition count 384
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 439 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 435 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 435 transition count 376
Applied a total of 25 rules in 47 ms. Remains 435 /446 variables (removed 11) and now considering 376/390 (removed 14) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 01:24:31] [INFO ] Computed 62 invariants in 15 ms
[2024-05-22 01:24:31] [INFO ] Implicit Places using invariants in 352 ms returned []
[2024-05-22 01:24:31] [INFO ] Invariant cache hit.
[2024-05-22 01:24:32] [INFO ] Implicit Places using invariants and state equation in 514 ms returned []
Implicit Place search using SMT with State Equation took 868 ms to find 0 implicit places.
[2024-05-22 01:24:32] [INFO ] Invariant cache hit.
[2024-05-22 01:24:32] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 376/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1097 ms. Remains : 435/446 places, 376/390 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 625 ms :[true, (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (NOT p1), (NOT p1), (AND (NOT p1) (NOT p2)), (AND (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2))]
Running random walk in product with property : DES-PT-50b-LTLCardinality-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p2), acceptance={} source=1 dest: 0}, { cond=p2, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1) p2), acceptance={} source=3 dest: 2}, { cond=(AND p0 (NOT p1) p2), acceptance={} source=3 dest: 3}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 4}, { cond=(AND (NOT p0) (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=4 dest: 4}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=4 dest: 5}], [{ cond=(NOT p1), acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 7}], [{ cond=(NOT p0), acceptance={} source=7 dest: 9}, { cond=p0, acceptance={} source=7 dest: 10}], [{ cond=true, acceptance={} source=8 dest: 1}], [{ cond=(NOT p1), acceptance={} source=9 dest: 8}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=10 dest: 11}, { cond=(AND p0 (NOT p1)), acceptance={} source=10 dest: 12}], [{ cond=(NOT p1), acceptance={} source=11 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=12 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=12 dest: 3}]], initial=6, aps=[p2:(OR (EQ s275 1) (EQ s278 0) (EQ s3 1)), p1:(OR (EQ s5 0) (EQ s355 1)), p0:(OR (EQ s417 0) (EQ s385 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 322 ms.
Product exploration explored 100000 steps with 33333 reset in 271 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [(AND p2 p1 p0), (X p0), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 5 factoid took 19 ms. Reduced automaton from 13 states, 22 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLCardinality-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLCardinality-00 finished in 2397 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 52 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 01:24:33] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 01:24:34] [INFO ] Implicit Places using invariants in 233 ms returned []
[2024-05-22 01:24:34] [INFO ] Invariant cache hit.
[2024-05-22 01:24:34] [INFO ] Implicit Places using invariants and state equation in 500 ms returned []
Implicit Place search using SMT with State Equation took 741 ms to find 0 implicit places.
[2024-05-22 01:24:34] [INFO ] Invariant cache hit.
[2024-05-22 01:24:34] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 973 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s327 0) (EQ s395 1) (OR (EQ s426 0) (EQ s335 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][false, false]]
Stuttering criterion allowed to conclude after 121 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLCardinality-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-01 finished in 1073 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!p0 U (F(G(p1))||((!p0||F(G(p1)))&&X(!p2))||G(!p0))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 6 places :
Symmetric choice reduction at 1 with 6 rule applications. Total rules 7 place count 439 transition count 384
Iterating global reduction 1 with 6 rules applied. Total rules applied 13 place count 439 transition count 384
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 439 transition count 382
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 19 place count 435 transition count 378
Iterating global reduction 2 with 4 rules applied. Total rules applied 23 place count 435 transition count 378
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 25 place count 435 transition count 376
Applied a total of 25 rules in 28 ms. Remains 435 /446 variables (removed 11) and now considering 376/390 (removed 14) transitions.
// Phase 1: matrix 376 rows 435 cols
[2024-05-22 01:24:34] [INFO ] Computed 62 invariants in 16 ms
[2024-05-22 01:24:35] [INFO ] Implicit Places using invariants in 201 ms returned []
[2024-05-22 01:24:35] [INFO ] Invariant cache hit.
[2024-05-22 01:24:35] [INFO ] Implicit Places using invariants and state equation in 487 ms returned []
Implicit Place search using SMT with State Equation took 712 ms to find 0 implicit places.
[2024-05-22 01:24:35] [INFO ] Invariant cache hit.
[2024-05-22 01:24:35] [INFO ] Dead Transitions using invariants and state equation in 181 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 435/446 places, 376/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 923 ms. Remains : 435/446 places, 376/390 transitions.
Stuttering acceptance computed with spot in 109 ms :[(AND p0 (NOT p1)), (NOT p1), (AND (NOT p1) p0 p2)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-02 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 p2), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p2), acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (EQ s375 0) (EQ s234 1)), p1:(OR (EQ s40 0) (EQ s45 1)), p2:(OR (EQ s14 0) (EQ s177 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 886 reset in 256 ms.
Product exploration explored 100000 steps with 884 reset in 202 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.5 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/435 stabilizing places and 248/376 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p1), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 176 ms. Reduced automaton from 3 states, 6 edges and 3 AP (stutter sensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 43 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 87 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 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1282292 steps, run timeout after 3001 ms. (steps per millisecond=427 ) properties seen :{}
Probabilistic random walk after 1282292 steps, saw 206321 distinct states, run finished after 3001 ms. (steps per millisecond=427 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:24:39] [INFO ] Invariant cache hit.
[2024-05-22 01:24:39] [INFO ] After 61ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:24:39] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:24:39] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 28 ms returned sat
[2024-05-22 01:24:39] [INFO ] After 211ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:24:40] [INFO ] After 242ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 01:24:40] [INFO ] After 369ms 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 435 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 435/435 places, 376/376 transitions.
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 429 transition count 354
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 412 transition count 354
Performed 11 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 11 Pre rules applied. Total rules applied 37 place count 412 transition count 343
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 59 place count 401 transition count 343
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 60 place count 400 transition count 342
Iterating global reduction 2 with 1 rules applied. Total rules applied 61 place count 400 transition count 342
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 62 place count 399 transition count 341
Iterating global reduction 2 with 1 rules applied. Total rules applied 63 place count 399 transition count 341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 64 place count 399 transition count 340
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 1 Pre rules applied. Total rules applied 64 place count 399 transition count 339
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 66 place count 398 transition count 339
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 3 with 154 rules applied. Total rules applied 220 place count 321 transition count 262
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 3 with 4 rules applied. Total rules applied 224 place count 319 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 225 place count 319 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 226 place count 318 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 4 with 1 rules applied. Total rules applied 227 place count 318 transition count 263
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 4 with 1 rules applied. Total rules applied 228 place count 317 transition count 262
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 229 place count 316 transition count 262
Applied a total of 229 rules in 79 ms. Remains 316 /435 variables (removed 119) and now considering 262/376 (removed 114) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 316/435 places, 262/376 transitions.
Incomplete random walk after 10000 steps, including 472 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 88 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1576909 steps, run timeout after 3001 ms. (steps per millisecond=525 ) properties seen :{}
Probabilistic random walk after 1576909 steps, saw 218002 distinct states, run finished after 3001 ms. (steps per millisecond=525 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 316 cols
[2024-05-22 01:24:43] [INFO ] Computed 60 invariants in 5 ms
[2024-05-22 01:24:43] [INFO ] After 47ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:24:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 5 ms returned sat
[2024-05-22 01:24:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 182 ms returned sat
[2024-05-22 01:24:43] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:24:43] [INFO ] Deduced a trap composed of 13 places in 56 ms of which 0 ms to minimize.
[2024-05-22 01:24:43] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 76 ms
[2024-05-22 01:24:43] [INFO ] After 418ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 01:24:43] [INFO ] After 673ms 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 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 9 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 316/316 places, 262/262 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 262/262 transitions.
Applied a total of 0 rules in 7 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
[2024-05-22 01:24:43] [INFO ] Invariant cache hit.
[2024-05-22 01:24:44] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 01:24:44] [INFO ] Invariant cache hit.
[2024-05-22 01:24:44] [INFO ] Implicit Places using invariants and state equation in 336 ms returned []
Implicit Place search using SMT with State Equation took 506 ms to find 0 implicit places.
[2024-05-22 01:24:44] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:24:44] [INFO ] Invariant cache hit.
[2024-05-22 01:24:44] [INFO ] Dead Transitions using invariants and state equation in 126 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 654 ms. Remains : 316/316 places, 262/262 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 316 transition count 262
Applied a total of 1 rules in 12 ms. Remains 316 /316 variables (removed 0) and now considering 262/262 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 262 rows 316 cols
[2024-05-22 01:24:44] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:24:44] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:24:44] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:24:44] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 177 ms returned sat
[2024-05-22 01:24:45] [INFO ] After 356ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:24:45] [INFO ] Deduced a trap composed of 14 places in 48 ms of which 4 ms to minimize.
[2024-05-22 01:24:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 69 ms
[2024-05-22 01:24:45] [INFO ] After 437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 01:24:45] [INFO ] After 692ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND p0 p1 p2), (X (AND p0 p2)), (X (NOT (AND (NOT p0) p2))), (X p1), (X (X (AND p0 p2))), (X (X (NOT (AND (NOT p0) p2)))), (X (X p1)), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 192 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 31 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 116 ms :[(NOT p1)]
Support contains 2 out of 435 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 : 435/435 places, 376/376 transitions.
Graph (complete) has 1011 edges and 435 vertex of which 429 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 428 transition count 357
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 413 transition count 357
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 413 transition count 346
Deduced a syphon composed of 11 places in 1 ms
Reduce places removed 11 places and 0 transitions.
Iterating global reduction 2 with 22 rules applied. Total rules applied 53 place count 402 transition count 346
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 203 place count 327 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 211 place count 323 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 213 place count 321 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 214 place count 320 transition count 278
Applied a total of 214 rules in 52 ms. Remains 320 /435 variables (removed 115) and now considering 278/376 (removed 98) transitions.
// Phase 1: matrix 278 rows 320 cols
[2024-05-22 01:24:45] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:24:45] [INFO ] Implicit Places using invariants in 158 ms returned []
[2024-05-22 01:24:45] [INFO ] Invariant cache hit.
[2024-05-22 01:24:46] [INFO ] Implicit Places using invariants and state equation in 384 ms returned []
Implicit Place search using SMT with State Equation took 546 ms to find 0 implicit places.
[2024-05-22 01:24:46] [INFO ] Redundant transitions in 6 ms returned []
[2024-05-22 01:24:46] [INFO ] Invariant cache hit.
[2024-05-22 01:24:46] [INFO ] Dead Transitions using invariants and state equation in 129 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 320/435 places, 278/376 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 741 ms. Remains : 320/435 places, 278/376 transitions.
Computed a total of 214 stabilizing places and 209 stable transitions
Computed a total of 214 stabilizing places and 209 stable transitions
Detected a total of 214/320 stabilizing places and 209/278 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/1 atomic propositions.
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 76 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 34 ms :[(NOT p1)]
Incomplete random walk after 10000 steps, including 509 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 77 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1514624 steps, run timeout after 3001 ms. (steps per millisecond=504 ) properties seen :{}
Probabilistic random walk after 1514624 steps, saw 210850 distinct states, run finished after 3001 ms. (steps per millisecond=504 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:24:49] [INFO ] Invariant cache hit.
[2024-05-22 01:24:49] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:24:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 4 ms returned sat
[2024-05-22 01:24:49] [INFO ] [Nat]Absence check using 33 positive and 25 generalized place invariants in 91 ms returned sat
[2024-05-22 01:24:50] [INFO ] After 582ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:24:50] [INFO ] After 617ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-22 01:24:50] [INFO ] After 821ms 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 320 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 320/320 places, 278/278 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 320 transition count 277
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 4 rules applied. Total rules applied 5 place count 318 transition count 275
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 6 place count 317 transition count 272
Iterating global reduction 1 with 1 rules applied. Total rules applied 7 place count 317 transition count 272
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 1 with 8 rules applied. Total rules applied 15 place count 317 transition count 264
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 317 transition count 263
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 17 place count 316 transition count 263
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 3 with 1 rules applied. Total rules applied 18 place count 316 transition count 263
Applied a total of 18 rules in 32 ms. Remains 316 /320 variables (removed 4) and now considering 263/278 (removed 15) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 32 ms. Remains : 316/320 places, 263/278 transitions.
Incomplete random walk after 10000 steps, including 513 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 96 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1572169 steps, run timeout after 3001 ms. (steps per millisecond=523 ) properties seen :{}
Probabilistic random walk after 1572169 steps, saw 217482 distinct states, run finished after 3001 ms. (steps per millisecond=523 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 316 cols
[2024-05-22 01:24:53] [INFO ] Computed 59 invariants in 8 ms
[2024-05-22 01:24:53] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:24:53] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:24:53] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 28 ms returned sat
[2024-05-22 01:24:54] [INFO ] After 333ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:24:54] [INFO ] Deduced a trap composed of 13 places in 69 ms of which 0 ms to minimize.
[2024-05-22 01:24:54] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 95 ms
[2024-05-22 01:24:54] [INFO ] After 439ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 01:24:54] [INFO ] After 622ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 316 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 6 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 316/316 places, 263/263 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 316/316 places, 263/263 transitions.
Applied a total of 0 rules in 5 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
[2024-05-22 01:24:54] [INFO ] Invariant cache hit.
[2024-05-22 01:24:54] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:24:54] [INFO ] Invariant cache hit.
[2024-05-22 01:24:54] [INFO ] Implicit Places using invariants and state equation in 340 ms returned []
Implicit Place search using SMT with State Equation took 519 ms to find 0 implicit places.
[2024-05-22 01:24:54] [INFO ] Redundant transitions in 8 ms returned []
[2024-05-22 01:24:54] [INFO ] Invariant cache hit.
[2024-05-22 01:24:54] [INFO ] Dead Transitions using invariants and state equation in 124 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 316/316 places, 263/263 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 316 transition count 263
Applied a total of 1 rules in 13 ms. Remains 316 /316 variables (removed 0) and now considering 263/263 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 263 rows 316 cols
[2024-05-22 01:24:54] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 01:24:54] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:24:55] [INFO ] [Nat]Absence check using 35 positive place invariants in 4 ms returned sat
[2024-05-22 01:24:55] [INFO ] [Nat]Absence check using 35 positive and 24 generalized place invariants in 27 ms returned sat
[2024-05-22 01:24:55] [INFO ] After 330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:24:55] [INFO ] Deduced a trap composed of 5 places in 58 ms of which 0 ms to minimize.
[2024-05-22 01:24:55] [INFO ] Deduced a trap composed of 14 places in 58 ms of which 1 ms to minimize.
[2024-05-22 01:24:55] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 150 ms
[2024-05-22 01:24:55] [INFO ] After 490ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-22 01:24:55] [INFO ] After 671ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p1, (X p1), (X (X p1)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 73 ms. Reduced automaton from 1 states, 2 edges and 1 AP (stutter insensitive) to 1 states, 2 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 28 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 37 ms :[(NOT p1)]
Stuttering acceptance computed with spot in 35 ms :[(NOT p1)]
Product exploration explored 100000 steps with 5160 reset in 220 ms.
Product exploration explored 100000 steps with 5203 reset in 239 ms.
Built C files in :
/tmp/ltsmin18422166749136415517
[2024-05-22 01:24:56] [INFO ] Computing symmetric may disable matrix : 278 transitions.
[2024-05-22 01:24:56] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:24:56] [INFO ] Computing symmetric may enable matrix : 278 transitions.
[2024-05-22 01:24:56] [INFO ] Computation of Complete enable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:24:56] [INFO ] Computing Do-Not-Accords matrix : 278 transitions.
[2024-05-22 01:24:56] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:24:56] [INFO ] Built C files in 45ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18422166749136415517
Running compilation step : cd /tmp/ltsmin18422166749136415517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 664 ms.
Running link step : cd /tmp/ltsmin18422166749136415517;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin18422166749136415517;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3592983196656064893.hoa' '--buchi-type=spotba'
LTSmin run took 6350 ms.
FORMULA DES-PT-50b-LTLCardinality-02 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLCardinality-02 finished in 28601 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 441 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 440 transition count 370
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 425 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 425 transition count 359
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 52 place count 415 transition count 359
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 57 place count 410 transition count 354
Iterating global reduction 2 with 5 rules applied. Total rules applied 62 place count 410 transition count 354
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 63 place count 410 transition count 353
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 67 place count 406 transition count 349
Iterating global reduction 3 with 4 rules applied. Total rules applied 71 place count 406 transition count 349
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 74 place count 406 transition count 346
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 74 place count 406 transition count 343
Deduced a syphon composed of 3 places in 1 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 80 place count 403 transition count 343
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 232 place count 327 transition count 267
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 236 place count 325 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 238 place count 323 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 239 place count 322 transition count 267
Applied a total of 239 rules in 55 ms. Remains 322 /446 variables (removed 124) and now considering 267/390 (removed 123) transitions.
// Phase 1: matrix 267 rows 322 cols
[2024-05-22 01:25:03] [INFO ] Computed 61 invariants in 9 ms
[2024-05-22 01:25:03] [INFO ] Implicit Places using invariants in 176 ms returned []
[2024-05-22 01:25:03] [INFO ] Invariant cache hit.
[2024-05-22 01:25:04] [INFO ] Implicit Places using invariants and state equation in 387 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-22 01:25:04] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:25:04] [INFO ] Invariant cache hit.
[2024-05-22 01:25:04] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/446 places, 267/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 775 ms. Remains : 322/446 places, 267/390 transitions.
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (EQ s153 0) (EQ s244 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 11356 reset in 222 ms.
Product exploration explored 100000 steps with 11374 reset in 294 ms.
Computed a total of 218 stabilizing places and 210 stable transitions
Graph (complete) has 1105 edges and 322 vertex of which 318 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.2 ms
Computed a total of 218 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 151 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 67 ms :[(NOT p0), (NOT p0)]
Finished random walk after 3 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=3 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 165 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 74 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 69 ms :[(NOT p0), (NOT p0)]
[2024-05-22 01:25:05] [INFO ] Invariant cache hit.
[2024-05-22 01:25:05] [INFO ] [Real]Absence check using 32 positive place invariants in 26 ms returned sat
[2024-05-22 01:25:05] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-22 01:25:05] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:25:06] [INFO ] [Real]Absence check using state equation in 1172 ms returned sat
[2024-05-22 01:25:06] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:25:06] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2024-05-22 01:25:06] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 69 ms returned sat
[2024-05-22 01:25:06] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:25:08] [INFO ] [Nat]Absence check using state equation in 1120 ms returned sat
[2024-05-22 01:25:08] [INFO ] Computed and/alt/rep : 252/451/252 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-22 01:25:08] [INFO ] Added : 83 causal constraints over 17 iterations in 824 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 11 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 01:25:08] [INFO ] Invariant cache hit.
[2024-05-22 01:25:09] [INFO ] Implicit Places using invariants in 177 ms returned []
[2024-05-22 01:25:09] [INFO ] Invariant cache hit.
[2024-05-22 01:25:09] [INFO ] Implicit Places using invariants and state equation in 390 ms returned []
Implicit Place search using SMT with State Equation took 568 ms to find 0 implicit places.
[2024-05-22 01:25:09] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:25:09] [INFO ] Invariant cache hit.
[2024-05-22 01:25:09] [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 719 ms. Remains : 322/322 places, 267/267 transitions.
Computed a total of 218 stabilizing places and 210 stable transitions
Graph (complete) has 1105 edges and 322 vertex of which 318 are kept as prefixes of interest. Removing 4 places using SCC suffix rule.1 ms
Computed a total of 218 stabilizing places and 210 stable transitions
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0))]
Knowledge based reduction with 1 factoid took 156 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Finished random walk after 7 steps, including 0 resets, run visited all 1 properties in 1 ms. (steps per millisecond=7 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(NOT p0)]
False Knowledge obtained : [(X (NOT p0)), (X p0), (X (X (NOT p0))), (X (X p0)), (F p0)]
Knowledge based reduction with 1 factoid took 182 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
[2024-05-22 01:25:10] [INFO ] Invariant cache hit.
[2024-05-22 01:25:10] [INFO ] [Real]Absence check using 32 positive place invariants in 7 ms returned sat
[2024-05-22 01:25:10] [INFO ] [Real]Absence check using 32 positive and 29 generalized place invariants in 32 ms returned sat
[2024-05-22 01:25:10] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-22 01:25:11] [INFO ] [Real]Absence check using state equation in 1183 ms returned sat
[2024-05-22 01:25:11] [INFO ] Solution in real domain found non-integer solution.
[2024-05-22 01:25:11] [INFO ] [Nat]Absence check using 32 positive place invariants in 8 ms returned sat
[2024-05-22 01:25:11] [INFO ] [Nat]Absence check using 32 positive and 29 generalized place invariants in 71 ms returned sat
[2024-05-22 01:25:11] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-22 01:25:12] [INFO ] [Nat]Absence check using state equation in 1131 ms returned sat
[2024-05-22 01:25:12] [INFO ] Computed and/alt/rep : 252/451/252 causal constraints (skipped 11 transitions) in 15 ms.
[2024-05-22 01:25:13] [INFO ] Added : 83 causal constraints over 17 iterations in 767 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 71 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 11105 reset in 225 ms.
Product exploration explored 100000 steps with 11336 reset in 253 ms.
Built C files in :
/tmp/ltsmin4270389469714084806
[2024-05-22 01:25:14] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-05-22 01:25:14] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:25:14] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-05-22 01:25:14] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:25:14] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-05-22 01:25:14] [INFO ] Computation of Completed DNA matrix. took 5 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:25:14] [INFO ] Built C files in 29ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4270389469714084806
Running compilation step : cd /tmp/ltsmin4270389469714084806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 573 ms.
Running link step : cd /tmp/ltsmin4270389469714084806;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 32 ms.
Running LTSmin : cd /tmp/ltsmin4270389469714084806;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased1339714522094730771.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 322 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 322/322 places, 267/267 transitions.
Applied a total of 0 rules in 12 ms. Remains 322 /322 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 01:25:29] [INFO ] Invariant cache hit.
[2024-05-22 01:25:29] [INFO ] Implicit Places using invariants in 156 ms returned []
[2024-05-22 01:25:29] [INFO ] Invariant cache hit.
[2024-05-22 01:25:29] [INFO ] Implicit Places using invariants and state equation in 385 ms returned []
Implicit Place search using SMT with State Equation took 543 ms to find 0 implicit places.
[2024-05-22 01:25:29] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:25:29] [INFO ] Invariant cache hit.
[2024-05-22 01:25:30] [INFO ] Dead Transitions using invariants and state equation in 139 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 707 ms. Remains : 322/322 places, 267/267 transitions.
Built C files in :
/tmp/ltsmin13331470363926454707
[2024-05-22 01:25:30] [INFO ] Computing symmetric may disable matrix : 267 transitions.
[2024-05-22 01:25:30] [INFO ] Computation of Complete disable matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:25:30] [INFO ] Computing symmetric may enable matrix : 267 transitions.
[2024-05-22 01:25:30] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:25:30] [INFO ] Computing Do-Not-Accords matrix : 267 transitions.
[2024-05-22 01:25:30] [INFO ] Computation of Completed DNA matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:25:30] [INFO ] Built C files in 28ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13331470363926454707
Running compilation step : cd /tmp/ltsmin13331470363926454707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 549 ms.
Running link step : cd /tmp/ltsmin13331470363926454707;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin13331470363926454707;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased566666533704396654.hoa' '--buchi-type=spotba'
LTSmin run took 1324 ms.
FORMULA DES-PT-50b-LTLCardinality-04 FALSE TECHNIQUES PARTIAL_ORDER EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLCardinality-04 finished in 28599 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 437 are kept as prefixes of interest. Removing 9 places using SCC suffix rule.2 ms
Discarding 9 places :
Also discarding 5 output transitions
Drop transitions removed 5 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 436 transition count 369
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 421 transition count 368
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 421 transition count 358
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 52 place count 411 transition count 358
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 55 place count 408 transition count 355
Iterating global reduction 2 with 3 rules applied. Total rules applied 58 place count 408 transition count 355
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 61 place count 405 transition count 352
Iterating global reduction 2 with 3 rules applied. Total rules applied 64 place count 405 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 67 place count 405 transition count 349
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 3 Pre rules applied. Total rules applied 67 place count 405 transition count 346
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 3 with 6 rules applied. Total rules applied 73 place count 402 transition count 346
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 3 with 154 rules applied. Total rules applied 227 place count 325 transition count 269
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 229 place count 324 transition count 269
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 231 place count 322 transition count 267
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 232 place count 321 transition count 267
Applied a total of 232 rules in 51 ms. Remains 321 /446 variables (removed 125) and now considering 267/390 (removed 123) transitions.
// Phase 1: matrix 267 rows 321 cols
[2024-05-22 01:25:32] [INFO ] Computed 58 invariants in 4 ms
[2024-05-22 01:25:32] [INFO ] Implicit Places using invariants in 162 ms returned []
[2024-05-22 01:25:32] [INFO ] Invariant cache hit.
[2024-05-22 01:25:32] [INFO ] Implicit Places using invariants and state equation in 352 ms returned []
Implicit Place search using SMT with State Equation took 520 ms to find 0 implicit places.
[2024-05-22 01:25:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:25:32] [INFO ] Invariant cache hit.
[2024-05-22 01:25:32] [INFO ] Dead Transitions using invariants and state equation in 122 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 321/446 places, 267/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 705 ms. Remains : 321/446 places, 267/390 transitions.
Stuttering acceptance computed with spot in 83 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-06 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(AND (NEQ s202 0) (NEQ s313 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 75 steps with 4 reset in 1 ms.
FORMULA DES-PT-50b-LTLCardinality-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-06 finished in 802 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F(p0)&&G(p1))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 441 are kept as prefixes of interest. Removing 5 places using SCC suffix rule.2 ms
Discarding 5 places :
Also discarding 4 output transitions
Drop transitions removed 4 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 440 transition count 370
Reduce places removed 15 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 16 rules applied. Total rules applied 32 place count 425 transition count 369
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 32 place count 425 transition count 359
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 52 place count 415 transition count 359
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 56 place count 411 transition count 355
Iterating global reduction 2 with 4 rules applied. Total rules applied 60 place count 411 transition count 355
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 61 place count 411 transition count 354
Discarding 3 places :
Symmetric choice reduction at 3 with 3 rule applications. Total rules 64 place count 408 transition count 351
Iterating global reduction 3 with 3 rules applied. Total rules applied 67 place count 408 transition count 351
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 69 place count 408 transition count 349
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 2 Pre rules applied. Total rules applied 69 place count 408 transition count 347
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 73 place count 406 transition count 347
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: 76
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 4 with 152 rules applied. Total rules applied 225 place count 330 transition count 271
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 4 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 4 with 8 rules applied. Total rules applied 233 place count 326 transition count 280
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 235 place count 324 transition count 278
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 236 place count 323 transition count 278
Applied a total of 236 rules in 50 ms. Remains 323 /446 variables (removed 123) and now considering 278/390 (removed 112) transitions.
// Phase 1: matrix 278 rows 323 cols
[2024-05-22 01:25:32] [INFO ] Computed 61 invariants in 10 ms
[2024-05-22 01:25:33] [INFO ] Implicit Places using invariants in 190 ms returned []
[2024-05-22 01:25:33] [INFO ] Invariant cache hit.
[2024-05-22 01:25:33] [INFO ] Implicit Places using invariants and state equation in 348 ms returned []
Implicit Place search using SMT with State Equation took 540 ms to find 0 implicit places.
[2024-05-22 01:25:33] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:25:33] [INFO ] Invariant cache hit.
[2024-05-22 01:25:33] [INFO ] Dead Transitions using invariants and state equation in 134 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 323/446 places, 278/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 739 ms. Remains : 323/446 places, 278/390 transitions.
Stuttering acceptance computed with spot in 249 ms :[(OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-07 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={0} source=2 dest: 0}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p1:(AND (NEQ s187 0) (NEQ s212 1)), p0:(OR (EQ s102 0) (EQ s10 1) (AND (EQ s133 0) (EQ s159 1)))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 10 steps with 0 reset in 0 ms.
FORMULA DES-PT-50b-LTLCardinality-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-07 finished in 1010 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F((X(p0) U p0))))))'
Support contains 2 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 21 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 01:25:33] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 01:25:34] [INFO ] Implicit Places using invariants in 182 ms returned []
[2024-05-22 01:25:34] [INFO ] Invariant cache hit.
[2024-05-22 01:25:34] [INFO ] Implicit Places using invariants and state equation in 547 ms returned []
Implicit Place search using SMT with State Equation took 731 ms to find 0 implicit places.
[2024-05-22 01:25:34] [INFO ] Invariant cache hit.
[2024-05-22 01:25:34] [INFO ] Dead Transitions using invariants and state equation in 179 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 932 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 145 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-09 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: 3}], [{ cond=true, acceptance={} source=3 dest: 1}]], initial=2, aps=[p0:(OR (EQ s64 0) (EQ s247 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 25000 reset in 208 ms.
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 76 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 147 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 14 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1344349 steps, run timeout after 3001 ms. (steps per millisecond=447 ) properties seen :{}
Probabilistic random walk after 1344349 steps, saw 215692 distinct states, run finished after 3001 ms. (steps per millisecond=447 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:25:38] [INFO ] Invariant cache hit.
[2024-05-22 01:25:38] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:25:38] [INFO ] [Nat]Absence check using 33 positive place invariants in 6 ms returned sat
[2024-05-22 01:25:38] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 28 ms returned sat
[2024-05-22 01:25:39] [INFO ] After 243ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:25:39] [INFO ] After 275ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 22 ms.
[2024-05-22 01:25:39] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 23 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.1 ms
Discarding 6 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Drop transitions removed 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 410 transition count 339
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 61 place count 398 transition count 339
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 211 place count 323 transition count 264
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 321 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 321 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 320 transition count 265
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 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 318 transition count 264
Applied a total of 220 rules in 41 ms. Remains 318 /433 variables (removed 115) and now considering 264/373 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 41 ms. Remains : 318/433 places, 264/373 transitions.
Incomplete random walk after 10000 steps, including 456 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 82 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1662847 steps, run timeout after 3001 ms. (steps per millisecond=554 ) properties seen :{}
Probabilistic random walk after 1662847 steps, saw 213948 distinct states, run finished after 3001 ms. (steps per millisecond=554 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 01:25:42] [INFO ] Computed 60 invariants in 9 ms
[2024-05-22 01:25:42] [INFO ] After 50ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:25:42] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:25:42] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 134 ms returned sat
[2024-05-22 01:25:42] [INFO ] After 358ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:25:42] [INFO ] Deduced a trap composed of 5 places in 41 ms of which 0 ms to minimize.
[2024-05-22 01:25:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 67 ms
[2024-05-22 01:25:42] [INFO ] After 444ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-22 01:25:42] [INFO ] After 655ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 10 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 6 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 318/318 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 01:25:42] [INFO ] Invariant cache hit.
[2024-05-22 01:25:43] [INFO ] Implicit Places using invariants in 154 ms returned []
[2024-05-22 01:25:43] [INFO ] Invariant cache hit.
[2024-05-22 01:25:43] [INFO ] Implicit Places using invariants and state equation in 358 ms returned []
Implicit Place search using SMT with State Equation took 513 ms to find 0 implicit places.
[2024-05-22 01:25:43] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:25:43] [INFO ] Invariant cache hit.
[2024-05-22 01:25:43] [INFO ] Dead Transitions using invariants and state equation in 128 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 653 ms. Remains : 318/318 places, 264/264 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 318 transition count 264
Applied a total of 1 rules in 9 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 01:25:43] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:25:43] [INFO ] After 42ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:25:43] [INFO ] [Nat]Absence check using 36 positive place invariants in 9 ms returned sat
[2024-05-22 01:25:43] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 138 ms returned sat
[2024-05-22 01:25:44] [INFO ] After 375ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:25:44] [INFO ] Deduced a trap composed of 5 places in 31 ms of which 1 ms to minimize.
[2024-05-22 01:25:44] [INFO ] Deduced a trap composed of 7 places in 37 ms of which 0 ms to minimize.
[2024-05-22 01:25:44] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 109 ms
[2024-05-22 01:25:44] [INFO ] After 505ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 19 ms.
[2024-05-22 01:25:44] [INFO ] After 720ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 58 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 133 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 142 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Applied a total of 0 rules in 11 ms. Remains 433 /433 variables (removed 0) and now considering 373/373 (removed 0) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 01:25:44] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 01:25:44] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 01:25:44] [INFO ] Invariant cache hit.
[2024-05-22 01:25:45] [INFO ] Implicit Places using invariants and state equation in 501 ms returned []
Implicit Place search using SMT with State Equation took 690 ms to find 0 implicit places.
[2024-05-22 01:25:45] [INFO ] Invariant cache hit.
[2024-05-22 01:25:45] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 881 ms. Remains : 433/433 places, 373/373 transitions.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 130 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 84 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 13 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1359912 steps, run timeout after 3001 ms. (steps per millisecond=453 ) properties seen :{}
Probabilistic random walk after 1359912 steps, saw 217995 distinct states, run finished after 3002 ms. (steps per millisecond=453 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-22 01:25:48] [INFO ] Invariant cache hit.
[2024-05-22 01:25:48] [INFO ] After 76ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:25:49] [INFO ] [Nat]Absence check using 33 positive place invariants in 7 ms returned sat
[2024-05-22 01:25:49] [INFO ] [Nat]Absence check using 33 positive and 29 generalized place invariants in 30 ms returned sat
[2024-05-22 01:25:49] [INFO ] After 242ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:25:49] [INFO ] After 278ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-22 01:25:49] [INFO ] After 409ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 26 ms.
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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 17 transitions
Trivial Post-agglo rules discarded 17 transitions
Performed 17 trivial Post agglomeration. Transition count delta: 17
Iterating post reduction 0 with 19 rules applied. Total rules applied 20 place count 427 transition count 351
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 1 with 17 rules applied. Total rules applied 37 place count 410 transition count 351
Performed 12 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 12 Pre rules applied. Total rules applied 37 place count 410 transition count 339
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 61 place count 398 transition count 339
Performed 75 Post agglomeration using F-continuation condition.Transition count delta: 75
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 211 place count 323 transition count 264
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 2 with 4 rules applied. Total rules applied 215 place count 321 transition count 266
Free-agglomeration rule (complex) applied 1 times.
Iterating global reduction 2 with 1 rules applied. Total rules applied 216 place count 321 transition count 265
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 217 place count 320 transition count 265
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 320 transition count 265
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 3 with 1 rules applied. Total rules applied 219 place count 319 transition count 264
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 220 place count 318 transition count 264
Applied a total of 220 rules in 36 ms. Remains 318 /433 variables (removed 115) and now considering 264/373 (removed 109) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 37 ms. Remains : 318/433 places, 264/373 transitions.
Incomplete random walk after 10000 steps, including 453 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 96 resets, run finished after 10 ms. (steps per millisecond=1000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 1639504 steps, run timeout after 3001 ms. (steps per millisecond=546 ) properties seen :{}
Probabilistic random walk after 1639504 steps, saw 211393 distinct states, run finished after 3001 ms. (steps per millisecond=546 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 01:25:52] [INFO ] Computed 60 invariants in 8 ms
[2024-05-22 01:25:52] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:25:52] [INFO ] [Nat]Absence check using 36 positive place invariants in 6 ms returned sat
[2024-05-22 01:25:52] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 137 ms returned sat
[2024-05-22 01:25:53] [INFO ] After 367ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:25:53] [INFO ] Deduced a trap composed of 5 places in 33 ms of which 1 ms to minimize.
[2024-05-22 01:25:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 66 ms
[2024-05-22 01:25:53] [INFO ] After 454ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 15 ms.
[2024-05-22 01:25:53] [INFO ] After 673ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 13 ms.
Support contains 2 out of 318 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 318/318 places, 264/264 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 318/318 places, 264/264 transitions.
Applied a total of 0 rules in 5 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
[2024-05-22 01:25:53] [INFO ] Invariant cache hit.
[2024-05-22 01:25:53] [INFO ] Implicit Places using invariants in 153 ms returned []
[2024-05-22 01:25:53] [INFO ] Invariant cache hit.
[2024-05-22 01:25:53] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 481 ms to find 0 implicit places.
[2024-05-22 01:25:53] [INFO ] Redundant transitions in 1 ms returned []
[2024-05-22 01:25:53] [INFO ] Invariant cache hit.
[2024-05-22 01:25:53] [INFO ] Dead Transitions using invariants and state equation in 127 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 619 ms. Remains : 318/318 places, 264/264 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 318 transition count 264
Applied a total of 1 rules in 8 ms. Remains 318 /318 variables (removed 0) and now considering 264/264 (removed 0) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 264 rows 318 cols
[2024-05-22 01:25:53] [INFO ] Computed 60 invariants in 3 ms
[2024-05-22 01:25:53] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-22 01:25:53] [INFO ] [Nat]Absence check using 36 positive place invariants in 4 ms returned sat
[2024-05-22 01:25:54] [INFO ] [Nat]Absence check using 36 positive and 24 generalized place invariants in 141 ms returned sat
[2024-05-22 01:25:54] [INFO ] After 372ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-22 01:25:54] [INFO ] Deduced a trap composed of 5 places in 49 ms of which 1 ms to minimize.
[2024-05-22 01:25:54] [INFO ] Deduced a trap composed of 7 places in 39 ms of which 0 ms to minimize.
[2024-05-22 01:25:54] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 145 ms
[2024-05-22 01:25:54] [INFO ] After 535ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 14 ms.
[2024-05-22 01:25:54] [INFO ] After 748ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 72 ms. Reduced automaton from 4 states, 4 edges and 1 AP (stutter sensitive) to 4 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 146 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 153 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 25000 reset in 205 ms.
Product exploration explored 100000 steps with 25000 reset in 211 ms.
Applying partial POR strategy [true, false, false, false]
Stuttering acceptance computed with spot in 283 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Support contains 2 out of 433 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 433/433 places, 373/373 transitions.
Graph (complete) has 1006 edges and 433 vertex of which 427 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
Performed 15 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 427 transition count 370
Performed 8 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 8 Pre rules applied. Total rules applied 16 place count 427 transition count 372
Deduced a syphon composed of 23 places in 1 ms
Iterating global reduction 1 with 8 rules applied. Total rules applied 24 place count 427 transition count 372
Discarding 5 places :
Symmetric choice reduction at 1 with 5 rule applications. Total rules 29 place count 422 transition count 367
Deduced a syphon composed of 18 places in 0 ms
Iterating global reduction 1 with 5 rules applied. Total rules applied 34 place count 422 transition count 367
Performed 76 Post agglomeration using F-continuation condition.Transition count delta: -3
Deduced a syphon composed of 94 places in 0 ms
Iterating global reduction 1 with 76 rules applied. Total rules applied 110 place count 422 transition count 370
Discarding 10 places :
Symmetric choice reduction at 1 with 10 rule applications. Total rules 120 place count 412 transition count 360
Deduced a syphon composed of 84 places in 1 ms
Iterating global reduction 1 with 10 rules applied. Total rules applied 130 place count 412 transition count 360
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: -28
Deduced a syphon composed of 90 places in 0 ms
Iterating global reduction 1 with 6 rules applied. Total rules applied 136 place count 412 transition count 388
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 138 place count 410 transition count 382
Deduced a syphon composed of 88 places in 0 ms
Iterating global reduction 1 with 2 rules applied. Total rules applied 140 place count 410 transition count 382
Deduced a syphon composed of 88 places in 0 ms
Applied a total of 140 rules in 112 ms. Remains 410 /433 variables (removed 23) and now considering 382/373 (removed -9) transitions.
[2024-05-22 01:25:56] [INFO ] Redundant transitions in 2 ms returned []
// Phase 1: matrix 382 rows 410 cols
[2024-05-22 01:25:56] [INFO ] Computed 59 invariants in 3 ms
[2024-05-22 01:25:56] [INFO ] Dead Transitions using invariants and state equation in 166 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 410/433 places, 382/373 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 294 ms. Remains : 410/433 places, 382/373 transitions.
Built C files in :
/tmp/ltsmin10333272821543620
[2024-05-22 01:25:56] [INFO ] Built C files in 6ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10333272821543620
Running compilation step : cd /tmp/ltsmin10333272821543620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 570 ms.
Running link step : cd /tmp/ltsmin10333272821543620;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin10333272821543620;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1104667663955644582.hoa' '--buchi-type=spotba'
LTSmin run took 263 ms.
FORMULA DES-PT-50b-LTLCardinality-09 TRUE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property DES-PT-50b-LTLCardinality-09 finished in 23423 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((p0 U p1))&&X(p0)))'
Support contains 4 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 31 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
// Phase 1: matrix 373 rows 433 cols
[2024-05-22 01:25:57] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 01:25:57] [INFO ] Implicit Places using invariants in 188 ms returned []
[2024-05-22 01:25:57] [INFO ] Invariant cache hit.
[2024-05-22 01:25:57] [INFO ] Implicit Places using invariants and state equation in 515 ms returned []
Implicit Place search using SMT with State Equation took 704 ms to find 0 implicit places.
[2024-05-22 01:25:57] [INFO ] Invariant cache hit.
[2024-05-22 01:25:58] [INFO ] Dead Transitions using invariants and state equation in 178 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 914 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 177 ms :[(OR (NOT p1) (NOT p0)), true, (AND p1 (NOT p0)), (NOT p1), (NOT p1)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-10 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(OR p1 p0), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p1) p0), acceptance={} source=0 dest: 3}, { cond=(OR p1 p0), acceptance={} source=0 dest: 4}], [{ cond=true, acceptance={0} source=1 dest: 1}], [{ cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=3 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={0} source=3 dest: 3}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=4 dest: 1}, { cond=(AND (NOT p1) p0), acceptance={} source=4 dest: 3}, { cond=(OR p1 p0), acceptance={} source=4 dest: 4}]], initial=0, aps=[p1:(OR (EQ s200 0) (EQ s20 1)), p0:(OR (EQ s1 0) (EQ s128 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 108 steps with 1 reset in 1 ms.
FORMULA DES-PT-50b-LTLCardinality-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property DES-PT-50b-LTLCardinality-10 finished in 1109 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G(p0)||X(p1)))'
Support contains 3 out of 446 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 445 transition count 390
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 8 place count 438 transition count 383
Iterating global reduction 1 with 7 rules applied. Total rules applied 15 place count 438 transition count 383
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 17 place count 438 transition count 381
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 22 place count 433 transition count 376
Iterating global reduction 2 with 5 rules applied. Total rules applied 27 place count 433 transition count 376
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 2 with 3 rules applied. Total rules applied 30 place count 433 transition count 373
Applied a total of 30 rules in 36 ms. Remains 433 /446 variables (removed 13) and now considering 373/390 (removed 17) transitions.
[2024-05-22 01:25:58] [INFO ] Invariant cache hit.
[2024-05-22 01:25:58] [INFO ] Implicit Places using invariants in 193 ms returned []
[2024-05-22 01:25:58] [INFO ] Invariant cache hit.
[2024-05-22 01:25:59] [INFO ] Implicit Places using invariants and state equation in 516 ms returned []
Implicit Place search using SMT with State Equation took 711 ms to find 0 implicit places.
[2024-05-22 01:25:59] [INFO ] Invariant cache hit.
[2024-05-22 01:25:59] [INFO ] Dead Transitions using invariants and state equation in 183 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 433/446 places, 373/390 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 930 ms. Remains : 433/446 places, 373/390 transitions.
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : DES-PT-50b-LTLCardinality-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=3 dest: 4}], [{ cond=(NOT p0), acceptance={} source=4 dest: 0}, { cond=p0, acceptance={} source=4 dest: 4}]], initial=2, aps=[p1:(OR (EQ s44 0) (EQ s362 1)), p0:(EQ s413 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 336 ms.
Product exploration explored 100000 steps with 50000 reset in 342 ms.
Computed a total of 256 stabilizing places and 248 stable transitions
Graph (complete) has 1006 edges and 433 vertex of which 427 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 256 stabilizing places and 248 stable transitions
Detected a total of 256/433 stabilizing places and 248/373 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p1 (NOT p0)), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), true, (X (X (NOT p0))), (F (OR (G p0) (G (NOT p0))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge (Minato strategy)
Knowledge based reduction with 7 factoid took 20 ms. Reduced automaton from 5 states, 8 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA DES-PT-50b-LTLCardinality-13 TRUE TECHNIQUES KNOWLEDGE
Treatment of property DES-PT-50b-LTLCardinality-13 finished in 1805 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G((F(p1)&&(!p2 U (p3||G(!p2))))))))'
Support contains 6 out of 446 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 446/446 places, 390/390 transitions.
Graph (complete) has 1032 edges and 446 vertex of which 444 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 2 output transitions
Drop transitions removed 2 transitions
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 15 rules applied. Total rules applied 16 place count 443 transition count 372
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 31 place count 428 transition count 372
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 31 place count 428 transition count 362
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 51 place count 418 transition count 362
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 56 place count 413 transition count 357
Iterating global reduction 2 with 5 rules applied. Total rules applied 61 place count 413 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 62 place count 413 transition count 356
Discarding 4 places :
Symmetric choice reduction at 3 with 4 rule applications. Total rules 66 place count 409 transition count 352
Iterating global reduction 3 with 4 rules applied. Total rules applied 70 place count 409 transition count 352
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 3 with 3 rules applied. Total rules applied 73 place count 409 transition count 349
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 3 Pre rules applied. Total rules applied 73 place count 409 transition count 346
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 4 with 6 rules applied. Total rules applied 79 place count 406 transition count 346
Performed 74 Post agglomeration using F-continuation condition.Transition count delta: 74
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 4 with 148 rules applied. Total rules applied 227 place count 332 transition count 272
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 229 place count 331 transition count 272
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 231 place count 329 transition count 270
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 232 place count 328 transition count 270
Applied a total of 232 rules in 47 ms. Remains 328 /446 variables (removed 118) and now considering 270/390 (removed 120) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-22 01:26:00] [INFO ] Computed 62 invariants in 12 ms
[2024-05-22 01:26:00] [INFO ] Implicit Places using invariants in 180 ms returned []
[2024-05-22 01:26:00] [INFO ] Invariant cache hit.
[2024-05-22 01:26:00] [INFO ] Implicit Places using invariants and state equation in 495 ms returned []
Implicit Place search using SMT with State Equation took 677 ms to find 0 implicit places.
[2024-05-22 01:26:00] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:26:00] [INFO ] Invariant cache hit.
[2024-05-22 01:26:01] [INFO ] Dead Transitions using invariants and state equation in 140 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 328/446 places, 270/390 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 873 ms. Remains : 328/446 places, 270/390 transitions.
Stuttering acceptance computed with spot in 184 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
Running random walk in product with property : DES-PT-50b-LTLCardinality-15 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=0 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={} source=0 dest: 3}], [{ cond=(OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=1 dest: 1}, { cond=(OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=1 dest: 3}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={0, 1} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p3) p2), acceptance={0, 1} source=3 dest: 1}, { cond=(AND (NOT p0) (NOT p3) (NOT p2)), acceptance={1} source=3 dest: 3}]], initial=0, aps=[p0:(OR (EQ s210 0) (EQ s163 1)), p1:(AND (EQ s163 0) (EQ s210 1)), p3:(AND (NOT (OR (EQ s234 0) (EQ s223 1))) (NOT (OR (EQ s63 0) (EQ s51 1)))), p2:(OR (E...], nbAcceptance=2, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Product exploration explored 100000 steps with 5236 reset in 261 ms.
Product exploration explored 100000 steps with 5287 reset in 264 ms.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 1118 edges and 328 vertex of which 322 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 219 stabilizing places and 211 stable transitions
Detected a total of 219/328 stabilizing places and 211/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/4 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 132 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 4 states, 11 edges and 4 AP (stutter insensitive).
Stuttering acceptance computed with spot in 192 ms :[(OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (OR (AND (NOT p0) p2 (NOT p3)) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (AND (NOT p0) p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 443 resets, run finished after 241 ms. (steps per millisecond=41 ) properties (out of 6) seen :2
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 91 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 84 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-22 01:26:02] [INFO ] Invariant cache hit.
[2024-05-22 01:26:02] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-22 01:26:02] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 01:26:02] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 25 ms returned sat
[2024-05-22 01:26:02] [INFO ] After 218ms SMT Verify possible using state equation in natural domain returned unsat :2 sat :2
[2024-05-22 01:26:02] [INFO ] After 303ms SMT Verify possible using trap constraints in natural domain returned unsat :2 sat :2
Attempting to minimize the solution found.
Minimization took 58 ms.
[2024-05-22 01:26:03] [INFO ] After 495ms SMT Verify possible using all constraints in natural domain returned unsat :2 sat :2
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 58 ms.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 270/270 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 328 transition count 269
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 328 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 326 transition count 267
Applied a total of 5 rules in 15 ms. Remains 326 /328 variables (removed 2) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 326/328 places, 267/270 transitions.
Incomplete random walk after 10000 steps, including 422 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 86 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 81 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1141629 steps, run timeout after 3001 ms. (steps per millisecond=380 ) properties seen :{}
Probabilistic random walk after 1141629 steps, saw 144550 distinct states, run finished after 3001 ms. (steps per millisecond=380 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 267 rows 326 cols
[2024-05-22 01:26:06] [INFO ] Computed 62 invariants in 11 ms
[2024-05-22 01:26:06] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:26:06] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 01:26:06] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 30 ms returned sat
[2024-05-22 01:26:06] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:26:06] [INFO ] After 269ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 33 ms.
[2024-05-22 01:26:06] [INFO ] After 407ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 54 ms.
Support contains 6 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 326/326 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 01:26:06] [INFO ] Invariant cache hit.
[2024-05-22 01:26:06] [INFO ] Implicit Places using invariants in 157 ms returned []
[2024-05-22 01:26:06] [INFO ] Invariant cache hit.
[2024-05-22 01:26:07] [INFO ] Implicit Places using invariants and state equation in 403 ms returned []
Implicit Place search using SMT with State Equation took 560 ms to find 0 implicit places.
[2024-05-22 01:26:07] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:26:07] [INFO ] Invariant cache hit.
[2024-05-22 01:26:07] [INFO ] Dead Transitions using invariants and state equation in 132 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 706 ms. Remains : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 01:26:07] [INFO ] Invariant cache hit.
[2024-05-22 01:26:07] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:26:07] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 01:26:07] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 31 ms returned sat
[2024-05-22 01:26:07] [INFO ] After 158ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:26:07] [INFO ] After 222ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 40 ms.
[2024-05-22 01:26:07] [INFO ] After 368ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Found 2 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) (NOT p3) p2), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (OR (AND (NOT p0) (NOT p1) p3) (AND (NOT p0) (NOT p1) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (F (OR (G p2) (G (NOT p2)))), (G (NOT (AND (NOT p0) (NOT p1)))), (G (NOT (OR (AND (NOT p0) p3 (NOT p1)) (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : [(F (AND (NOT p0) (NOT p3) p2)), (F (NOT p0))]
Knowledge based reduction with 14 factoid took 185 ms. Reduced automaton from 4 states, 11 edges and 4 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 98 ms :[(AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2)]
Stuttering acceptance computed with spot in 110 ms :[(AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2), (AND (NOT p0) (NOT p3) p2)]
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 270/270 transitions.
Applied a total of 0 rules in 11 ms. Remains 328 /328 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-22 01:26:08] [INFO ] Computed 62 invariants in 7 ms
[2024-05-22 01:26:08] [INFO ] Implicit Places using invariants in 166 ms returned []
[2024-05-22 01:26:08] [INFO ] Invariant cache hit.
[2024-05-22 01:26:09] [INFO ] Implicit Places using invariants and state equation in 506 ms returned []
Implicit Place search using SMT with State Equation took 673 ms to find 0 implicit places.
[2024-05-22 01:26:09] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:26:09] [INFO ] Invariant cache hit.
[2024-05-22 01:26:09] [INFO ] Dead Transitions using invariants and state equation in 151 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 845 ms. Remains : 328/328 places, 270/270 transitions.
Computed a total of 219 stabilizing places and 211 stable transitions
Graph (complete) has 1118 edges and 328 vertex of which 322 are kept as prefixes of interest. Removing 6 places using SCC suffix rule.2 ms
Computed a total of 219 stabilizing places and 211 stable transitions
Detected a total of 219/328 stabilizing places and 211/270 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/3 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 8 factoid took 122 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Incomplete random walk after 10000 steps, including 431 resets, run finished after 144 ms. (steps per millisecond=69 ) properties (out of 4) seen :2
Incomplete Best-First random walk after 10001 steps, including 75 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 75 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2024-05-22 01:26:09] [INFO ] Invariant cache hit.
[2024-05-22 01:26:09] [INFO ] After 54ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:26:09] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 01:26:09] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 31 ms returned sat
[2024-05-22 01:26:10] [INFO ] After 188ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:26:10] [INFO ] After 240ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 52 ms.
[2024-05-22 01:26:10] [INFO ] After 391ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 103 ms.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 328/328 places, 270/270 transitions.
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 0 with 1 rules applied. Total rules applied 1 place count 328 transition count 269
Free-agglomeration rule (complex) applied 2 times.
Iterating global reduction 0 with 2 rules applied. Total rules applied 3 place count 328 transition count 267
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 5 place count 326 transition count 267
Applied a total of 5 rules in 17 ms. Remains 326 /328 variables (removed 2) and now considering 267/270 (removed 3) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 19 ms. Remains : 326/328 places, 267/270 transitions.
Incomplete random walk after 10000 steps, including 417 resets, run finished after 105 ms. (steps per millisecond=95 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 72 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 82 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 1152543 steps, run timeout after 3001 ms. (steps per millisecond=384 ) properties seen :{}
Probabilistic random walk after 1152543 steps, saw 145986 distinct states, run finished after 3001 ms. (steps per millisecond=384 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 267 rows 326 cols
[2024-05-22 01:26:13] [INFO ] Computed 62 invariants in 13 ms
[2024-05-22 01:26:13] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:26:13] [INFO ] [Nat]Absence check using 34 positive place invariants in 4 ms returned sat
[2024-05-22 01:26:13] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 29 ms returned sat
[2024-05-22 01:26:13] [INFO ] After 291ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:26:13] [INFO ] After 374ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 51 ms.
[2024-05-22 01:26:14] [INFO ] After 551ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 57 ms.
Support contains 6 out of 326 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 326/326 places, 267/267 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 4 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
[2024-05-22 01:26:14] [INFO ] Invariant cache hit.
[2024-05-22 01:26:14] [INFO ] Implicit Places using invariants in 160 ms returned []
[2024-05-22 01:26:14] [INFO ] Invariant cache hit.
[2024-05-22 01:26:14] [INFO ] Implicit Places using invariants and state equation in 437 ms returned []
Implicit Place search using SMT with State Equation took 599 ms to find 0 implicit places.
[2024-05-22 01:26:14] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:26:14] [INFO ] Invariant cache hit.
[2024-05-22 01:26:14] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 746 ms. Remains : 326/326 places, 267/267 transitions.
Applied a total of 0 rules in 5 ms. Remains 326 /326 variables (removed 0) and now considering 267/267 (removed 0) transitions.
Running SMT prover for 2 properties.
[2024-05-22 01:26:14] [INFO ] Invariant cache hit.
[2024-05-22 01:26:14] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-22 01:26:14] [INFO ] [Nat]Absence check using 34 positive place invariants in 5 ms returned sat
[2024-05-22 01:26:14] [INFO ] [Nat]Absence check using 34 positive and 28 generalized place invariants in 24 ms returned sat
[2024-05-22 01:26:15] [INFO ] After 169ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-22 01:26:15] [INFO ] After 238ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 56 ms.
[2024-05-22 01:26:15] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p3) p2), (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2))))), (X (NOT (AND (NOT p0) (NOT p3) p2))), (X (NOT (AND (NOT p0) (NOT p3) (NOT p2)))), (X (X (NOT (OR (AND (NOT p0) p3) (AND (NOT p0) (NOT p2)))))), (X (X (NOT (AND (NOT p0) (NOT p3) p2)))), (X (X (NOT (AND (NOT p0) (NOT p3) (NOT p2))))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p2 (NOT p0) (NOT p3))), (F (NOT p0))]
Knowledge based reduction with 8 factoid took 241 ms. Reduced automaton from 3 states, 8 edges and 3 AP (stutter insensitive) to 3 states, 8 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 142 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 150 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3)), (AND (NOT p0) p2 (NOT p3))]
Product exploration explored 100000 steps with 5276 reset in 231 ms.
Product exploration explored 100000 steps with 5212 reset in 262 ms.
Built C files in :
/tmp/ltsmin15920163175316741121
[2024-05-22 01:26:16] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-22 01:26:16] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:26:16] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-22 01:26:16] [INFO ] Computation of Complete enable matrix. took 0 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:26:16] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-22 01:26:16] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:26:16] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15920163175316741121
Running compilation step : cd /tmp/ltsmin15920163175316741121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 586 ms.
Running link step : cd /tmp/ltsmin15920163175316741121;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin15920163175316741121;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased9944289795592125214.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 6 out of 328 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 328/328 places, 270/270 transitions.
Applied a total of 0 rules in 14 ms. Remains 328 /328 variables (removed 0) and now considering 270/270 (removed 0) transitions.
// Phase 1: matrix 270 rows 328 cols
[2024-05-22 01:26:31] [INFO ] Computed 62 invariants in 6 ms
[2024-05-22 01:26:31] [INFO ] Implicit Places using invariants in 164 ms returned []
[2024-05-22 01:26:31] [INFO ] Invariant cache hit.
[2024-05-22 01:26:32] [INFO ] Implicit Places using invariants and state equation in 496 ms returned []
Implicit Place search using SMT with State Equation took 661 ms to find 0 implicit places.
[2024-05-22 01:26:32] [INFO ] Redundant transitions in 2 ms returned []
[2024-05-22 01:26:32] [INFO ] Invariant cache hit.
[2024-05-22 01:26:32] [INFO ] Dead Transitions using invariants and state equation in 135 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 818 ms. Remains : 328/328 places, 270/270 transitions.
Built C files in :
/tmp/ltsmin18171111947864361371
[2024-05-22 01:26:32] [INFO ] Computing symmetric may disable matrix : 270 transitions.
[2024-05-22 01:26:32] [INFO ] Computation of Complete disable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:26:32] [INFO ] Computing symmetric may enable matrix : 270 transitions.
[2024-05-22 01:26:32] [INFO ] Computation of Complete enable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:26:32] [INFO ] Computing Do-Not-Accords matrix : 270 transitions.
[2024-05-22 01:26:32] [INFO ] Computation of Completed DNA matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:26:32] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin18171111947864361371
Running compilation step : cd /tmp/ltsmin18171111947864361371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 586 ms.
Running link step : cd /tmp/ltsmin18171111947864361371;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin18171111947864361371;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased17263627646298843312.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-22 01:26:47] [INFO ] Flatten gal took : 20 ms
[2024-05-22 01:26:47] [INFO ] Flatten gal took : 19 ms
[2024-05-22 01:26:47] [INFO ] Time to serialize gal into /tmp/LTL7522254588672441652.gal : 4 ms
[2024-05-22 01:26:47] [INFO ] Time to serialize properties into /tmp/LTL2091481749858121696.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7522254588672441652.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10636995076798781670.hoa' '-atoms' '/tmp/LTL2091481749858121696.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL2091481749858121696.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10636995076798781670.hoa
Detected timeout of ITS tools.
[2024-05-22 01:27:02] [INFO ] Flatten gal took : 18 ms
[2024-05-22 01:27:02] [INFO ] Flatten gal took : 16 ms
[2024-05-22 01:27:02] [INFO ] Time to serialize gal into /tmp/LTL8078850724063797514.gal : 3 ms
[2024-05-22 01:27:02] [INFO ] Time to serialize properties into /tmp/LTL6104735821623128224.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8078850724063797514.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6104735821623128224.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((p241==0)||(p168==1))")))||(G((F("((p168==0)&&(p241==1))"))&&((!("((p68==0)||(p56==1))"))U(("((!((p305==0)||(p290==1)))&&(...219
Formula 0 simplified : G(FG!"((p241==0)||(p168==1))" & F(G!"((p168==0)&&(p241==1))" | ("((p68==0)||(p56==1))" M !"((!((p305==0)||(p290==1)))&&(!((p68==0)||...170
Detected timeout of ITS tools.
[2024-05-22 01:27:17] [INFO ] Flatten gal took : 21 ms
[2024-05-22 01:27:17] [INFO ] Applying decomposition
[2024-05-22 01:27:17] [INFO ] Flatten gal took : 16 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7017144762558889792.txt' '-o' '/tmp/graph7017144762558889792.bin' '-w' '/tmp/graph7017144762558889792.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7017144762558889792.bin' '-l' '-1' '-v' '-w' '/tmp/graph7017144762558889792.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:27:17] [INFO ] Decomposing Gal with order
[2024-05-22 01:27:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:27:17] [INFO ] Removed a total of 73 redundant transitions.
[2024-05-22 01:27:18] [INFO ] Flatten gal took : 54 ms
[2024-05-22 01:27:18] [INFO ] Fuse similar labels procedure discarded/fused a total of 57 labels/synchronizations in 7 ms.
[2024-05-22 01:27:18] [INFO ] Time to serialize gal into /tmp/LTL12467537553228352618.gal : 4 ms
[2024-05-22 01:27:18] [INFO ] Time to serialize properties into /tmp/LTL14099781198559029999.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12467537553228352618.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL14099781198559029999.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i12.i1.u3.p241==0)||(u2.p168==1))")))||(G((F("((u2.p168==0)&&(i12.i1.u3.p241==1))"))&&((!("((u49.p68==0)||(u49.p56==1))")...282
Formula 0 simplified : G(FG!"((i12.i1.u3.p241==0)||(u2.p168==1))" & F(G!"((u2.p168==0)&&(i12.i1.u3.p241==1))" | ("((u49.p68==0)||(u49.p56==1))" M !"((!((i1...225
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2363580916625529945
[2024-05-22 01:27:33] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2363580916625529945
Running compilation step : cd /tmp/ltsmin2363580916625529945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 446 ms.
Running link step : cd /tmp/ltsmin2363580916625529945;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 37 ms.
Running LTSmin : cd /tmp/ltsmin2363580916625529945;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property DES-PT-50b-LTLCardinality-15 finished in 108024 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((G(F(p0))||G((F(p1)&&(!p2 U (p3||G(!p2))))))))'
[2024-05-22 01:27:48] [INFO ] Flatten gal took : 20 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin981809300369092172
[2024-05-22 01:27:48] [INFO ] Computing symmetric may disable matrix : 390 transitions.
[2024-05-22 01:27:48] [INFO ] Computation of Complete disable matrix. took 1 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:27:48] [INFO ] Computing symmetric may enable matrix : 390 transitions.
[2024-05-22 01:27:48] [INFO ] Applying decomposition
[2024-05-22 01:27:48] [INFO ] Computation of Complete enable matrix. took 3 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:27:48] [INFO ] Flatten gal took : 17 ms
[2024-05-22 01:27:48] [INFO ] Computing Do-Not-Accords matrix : 390 transitions.
[2024-05-22 01:27:48] [INFO ] Computation of Completed DNA matrix. took 2 ms. Total solver calls (SAT/UNSAT): 0(0/0)
[2024-05-22 01:27:48] [INFO ] Built C files in 52ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin981809300369092172
Running compilation step : cd /tmp/ltsmin981809300369092172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph10237751151830869896.txt' '-o' '/tmp/graph10237751151830869896.bin' '-w' '/tmp/graph10237751151830869896.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph10237751151830869896.bin' '-l' '-1' '-v' '-w' '/tmp/graph10237751151830869896.weights' '-q' '0' '-e' '0.001'
[2024-05-22 01:27:48] [INFO ] Decomposing Gal with order
[2024-05-22 01:27:48] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:27:48] [INFO ] Removed a total of 18 redundant transitions.
[2024-05-22 01:27:48] [INFO ] Flatten gal took : 31 ms
[2024-05-22 01:27:48] [INFO ] Fuse similar labels procedure discarded/fused a total of 4 labels/synchronizations in 3 ms.
[2024-05-22 01:27:48] [INFO ] Time to serialize gal into /tmp/LTLCardinality5579397385893042451.gal : 5 ms
[2024-05-22 01:27:48] [INFO ] Time to serialize properties into /tmp/LTLCardinality10480272186336230275.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality5579397385893042451.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality10480272186336230275.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i2.u9.p241==0)||(u8.p168==1))")))||(G((F("((u8.p168==0)&&(i2.u9.p241==1))"))&&((!("((i11.u81.p68==0)||(i11.u81.p56==1))")...302
Formula 0 simplified : G(FG!"((i2.u9.p241==0)||(u8.p168==1))" & F(G!"((u8.p168==0)&&(i2.u9.p241==1))" | ("((i11.u81.p68==0)||(i11.u81.p56==1))" M !"((!((i2...237
Compilation finished in 793 ms.
Running link step : cd /tmp/ltsmin981809300369092172;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin981809300369092172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))' '--buchi-type=spotba'
Reverse transition relation is NOT exact ! Due to transitions t0, t57, t123, t129, t288, t348, t349, t382, u34.t80, u8.t243, u8.t244, u8.t245, u8.t246, u8....1202
Computing Next relation with stutter on 9.05564e+08 deadlock states
Detected timeout of ITS tools.
[2024-05-22 01:48:59] [INFO ] Applying decomposition
[2024-05-22 01:48:59] [INFO ] Flatten gal took : 48 ms
[2024-05-22 01:48:59] [INFO ] Decomposing Gal with order
[2024-05-22 01:48:59] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-22 01:48:59] [INFO ] Removed a total of 208 redundant transitions.
[2024-05-22 01:48:59] [INFO ] Flatten gal took : 98 ms
[2024-05-22 01:49:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 700 labels/synchronizations in 45 ms.
[2024-05-22 01:49:00] [INFO ] Time to serialize gal into /tmp/LTLCardinality11597499448194206561.gal : 5 ms
[2024-05-22 01:49:00] [INFO ] Time to serialize properties into /tmp/LTLCardinality17086057937632533216.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality11597499448194206561.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality17086057937632533216.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...278
Read 1 LTL properties
Checking formula 0 : !((F((G(F("((i1.i0.i0.i0.i0.i0.u17.p241==0)||(i0.u7.p168==1))")))||(G((F("((i0.u7.p168==0)&&(i1.i0.i0.i0.i0.i0.u17.p241==1))"))&&((!("...396
Formula 0 simplified : G(FG!"((i1.i0.i0.i0.i0.i0.u17.p241==0)||(i0.u7.p168==1))" & F(G!"((i0.u7.p168==0)&&(i1.i0.i0.i0.i0.i0.u17.p241==1))" | ("((i0.i0.i0....323
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.002: Loading model from ./gal.so
pins2lts-mc-linux64( 1/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.000: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.001: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.002: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.000: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.002: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.003: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.003: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.005: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.005: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.013: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.017: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.020: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.029: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.032: Initializing POR dependencies: labels 394, guards 390
pins2lts-mc-linux64( 4/ 8), 0.040: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.051: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 1.969: LTL layer: formula: <>(([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))
pins2lts-mc-linux64( 2/ 8), 1.969: "<>(([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 2/ 8), 1.969: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 2.141: Forcing use of the an ignoring proviso (cndfs)
pins2lts-mc-linux64( 0/ 8), 2.161: There are 395 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 2.161: State length is 447, there are 403 groups
pins2lts-mc-linux64( 0/ 8), 2.161: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 2.161: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 2.161: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 2.161: Visible groups: 0 / 403, labels: 4 / 395
pins2lts-mc-linux64( 0/ 8), 2.161: POR cycle proviso: cndfs (ltl)
pins2lts-mc-linux64( 0/ 8), 2.161: Global bits: 2, count bits: 2, local bits: 0
pins2lts-mc-linux64( 5/ 8), 2.180: [Blue] ~92 levels ~960 states ~1288 transitions
pins2lts-mc-linux64( 2/ 8), 2.199: [Blue] ~88 levels ~1920 states ~2440 transitions
pins2lts-mc-linux64( 3/ 8), 2.236: [Blue] ~118 levels ~3840 states ~5688 transitions
pins2lts-mc-linux64( 2/ 8), 2.302: [Blue] ~91 levels ~7680 states ~9608 transitions
pins2lts-mc-linux64( 3/ 8), 2.451: [Blue] ~228 levels ~15360 states ~21632 transitions
pins2lts-mc-linux64( 3/ 8), 2.734: [Blue] ~230 levels ~30720 states ~43960 transitions
pins2lts-mc-linux64( 3/ 8), 3.266: [Blue] ~230 levels ~61440 states ~83328 transitions
pins2lts-mc-linux64( 3/ 8), 4.208: [Blue] ~230 levels ~122880 states ~159272 transitions
pins2lts-mc-linux64( 3/ 8), 5.965: [Blue] ~230 levels ~245760 states ~316968 transitions
pins2lts-mc-linux64( 3/ 8), 9.201: [Blue] ~230 levels ~491520 states ~631504 transitions
pins2lts-mc-linux64( 3/ 8), 14.947: [Blue] ~373 levels ~983040 states ~1269808 transitions
pins2lts-mc-linux64( 4/ 8), 25.764: [Blue] ~619 levels ~1966080 states ~2153504 transitions
pins2lts-mc-linux64( 4/ 8), 47.207: [Blue] ~1048 levels ~3932160 states ~4309832 transitions
pins2lts-mc-linux64( 4/ 8), 90.240: [Blue] ~2049 levels ~7864320 states ~8648960 transitions
pins2lts-mc-linux64( 4/ 8), 175.669: [Blue] ~4051 levels ~15728640 states ~17283808 transitions
pins2lts-mc-linux64( 4/ 8), 346.476: [Blue] ~7227 levels ~31457280 states ~35716928 transitions
pins2lts-mc-linux64( 0/ 8), 709.722: [Blue] ~46648 levels ~62914560 states ~87604008 transitions
pins2lts-mc-linux64( 0/ 8), 1425.886: [Blue] ~66551 levels ~125829120 states ~176347336 transitions
pins2lts-mc-linux64( 1/ 8), 1779.100: Error: tree roots table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 1779.127:
pins2lts-mc-linux64( 0/ 8), 1779.127: Explored 133195714 states 185333831 transitions, fanout: 1.391
pins2lts-mc-linux64( 0/ 8), 1779.127: Total exploration time 1776.960 sec (1776.930 sec minimum, 1776.939 sec on average)
pins2lts-mc-linux64( 0/ 8), 1779.127: States per second: 74957, Transitions per second: 104298
pins2lts-mc-linux64( 0/ 8), 1779.127:
pins2lts-mc-linux64( 0/ 8), 1779.127: State space has 134216946 states, 21317901 are accepting
pins2lts-mc-linux64( 0/ 8), 1779.127: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 1779.127: blue states: 133195714 (99.24%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 1779.127: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 1779.127: all-red states: 21380590 (15.93%), bogus 184 (0.00%)
pins2lts-mc-linux64( 0/ 8), 1779.127:
pins2lts-mc-linux64( 0/ 8), 1779.127: Total memory used for local state coloring: 56.9MB
pins2lts-mc-linux64( 0/ 8), 1779.127:
pins2lts-mc-linux64( 0/ 8), 1779.127: Queue width: 8B, total height: 3726531, memory: 28.43MB
pins2lts-mc-linux64( 0/ 8), 1779.127: Tree memory: 1134.9MB, 8.9 B/state, compr.: 0.5%
pins2lts-mc-linux64( 0/ 8), 1779.127: Tree fill ratio (roots/leafs): 99.0%/43.0%
pins2lts-mc-linux64( 0/ 8), 1779.127: Stored 406 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 1779.128: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 1779.128: Est. total memory use: 1163.4MB (~1052.4MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin981809300369092172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==true))))))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin981809300369092172;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '<>(([](<>((LTLAPp0==true)))||[]((<>((LTLAPp1==true))&&(!(LTLAPp2==true) U ((LTLAPp3==true)||[](!(LTLAPp2==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.
[2024-05-22 02:10:11] [INFO ] Flatten gal took : 12 ms
[2024-05-22 02:10:11] [INFO ] Input system was already deterministic with 390 transitions.
[2024-05-22 02:10:11] [INFO ] Transformed 446 places.
[2024-05-22 02:10:11] [INFO ] Transformed 390 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
[2024-05-22 02:10:11] [INFO ] Time to serialize gal into /tmp/LTLCardinality1282735918593829684.gal : 2 ms
[2024-05-22 02:10:11] [INFO ] Time to serialize properties into /tmp/LTLCardinality9726797270274583764.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLCardinality1282735918593829684.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLCardinality9726797270274583764.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.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...342
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((F((G(F("((p241==0)||(p168==1))")))||(G((F("((p168==0)&&(p241==1))"))&&((!("((p68==0)||(p56==1))"))U(("((!((p305==0)||(p290==1)))&&(...219
Formula 0 simplified : G(FG!"((p241==0)||(p168==1))" & F(G!"((p168==0)&&(p241==1))" | ("((p68==0)||(p56==1))" M !"((!((p305==0)||(p290==1)))&&(!((p68==0)||...170
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393232 kB
MemFree: 10027028 kB
After kill :
MemTotal: 16393232 kB
MemFree: 16039564 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
+ [[ LTLCardinality = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLCardinality -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLCardinality -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-50b"
export BK_EXAMINATION="LTLCardinality"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is DES-PT-50b, examination is LTLCardinality"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r109-tall-171624208600462"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/DES-PT-50b.tgz
mv DES-PT-50b execution
cd execution
if [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "UpperBounds" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] || [ "LTLCardinality" = "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 [ "LTLCardinality" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLCardinality" != "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 "LTLCardinality.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLCardinality.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLCardinality.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 '' LTLCardinality.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLCardinality" = "ReachabilityDeadlock" ] || [ "LTLCardinality" = "QuasiLiveness" ] || [ "LTLCardinality" = "StableMarking" ] || [ "LTLCardinality" = "Liveness" ] || [ "LTLCardinality" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLCardinality"
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 ;