Execution Chart

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

Trace from the execution

Formatting '/mnt/tpsp/fkordon/mcc2023-input.r421-tajo-167905975100316.qcow2', fmt=qcow2 size=4294967296 backing_file='/mnt/tpsp/fkordon/mcc2023-input.qcow2' encryption=off cluster_size=65536 lazy_refcounts=off
Waiting for the VM to be ready (probing ssh)
............................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ShieldRVt-PT-040B, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r421-tajo-167905975100316
=====================================================================

--------------------
preparation of the directory to be used:
/home/mcc/execution
total 952K
-rw-r--r-- 1 mcc users 9.3K Feb 25 23:10 CTLCardinality.txt
-rw-r--r-- 1 mcc users 110K Feb 25 23:10 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.6K Feb 25 23:10 CTLFireability.txt
-rw-r--r-- 1 mcc users 51K Feb 25 23:10 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:41 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.6K Jan 29 11:41 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 17:04 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.3K Feb 25 17:04 LTLFireability.txt
-rw-r--r-- 1 mcc users 18K Feb 25 17:04 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 25 23:11 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 122K Feb 25 23:11 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 5.3K Feb 25 23:11 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 37K Feb 25 23:11 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 17:04 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.7K Feb 25 17:04 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 equiv_col
-rw-r--r-- 1 mcc users 5 Mar 5 18:23 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:23 iscolored
-rw-r--r-- 1 mcc users 489K Mar 5 18:23 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 ShieldRVt-PT-040B-LTLFireability-00
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-01
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-02
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-03
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-04
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-05
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-06
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-07
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-08
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-09
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-10
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-11
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-12
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-13
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-14
FORMULA_NAME ShieldRVt-PT-040B-LTLFireability-15

=== Now, execution of the tool begins

BK_START 1679174451732

bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=itstools
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=ShieldRVt-PT-040B
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-18 21:20:53] [INFO ] Running its-tools with arguments : [-pnfolder, /home/mcc/execution, -examination, LTLFireability, -its, -ltsmin, -greatspnpath, /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/, -order, META, -manyOrder, -smt, -timeout, 3600]
[2023-03-18 21:20:53] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-18 21:20:53] [INFO ] Load time of PNML (sax parser for PT used): 89 ms
[2023-03-18 21:20:53] [INFO ] Transformed 2003 places.
[2023-03-18 21:20:53] [INFO ] Transformed 2003 transitions.
[2023-03-18 21:20:53] [INFO ] Found NUPN structural information;
[2023-03-18 21:20:53] [INFO ] Parsed PT model containing 2003 places and 2003 transitions and 4726 arcs in 179 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 7 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
FORMULA ShieldRVt-PT-040B-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ShieldRVt-PT-040B-LTLFireability-05 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 35 out of 2003 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2003/2003 places, 2003/2003 transitions.
Discarding 425 places :
Symmetric choice reduction at 0 with 425 rule applications. Total rules 425 place count 1578 transition count 1578
Iterating global reduction 0 with 425 rules applied. Total rules applied 850 place count 1578 transition count 1578
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 851 place count 1577 transition count 1577
Iterating global reduction 0 with 1 rules applied. Total rules applied 852 place count 1577 transition count 1577
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 853 place count 1576 transition count 1576
Iterating global reduction 0 with 1 rules applied. Total rules applied 854 place count 1576 transition count 1576
Applied a total of 854 rules in 571 ms. Remains 1576 /2003 variables (removed 427) and now considering 1576/2003 (removed 427) transitions.
// Phase 1: matrix 1576 rows 1576 cols
[2023-03-18 21:20:54] [INFO ] Computed 161 place invariants in 44 ms
[2023-03-18 21:20:55] [INFO ] Implicit Places using invariants in 733 ms returned []
[2023-03-18 21:20:55] [INFO ] Invariant cache hit.
[2023-03-18 21:20:56] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1831 ms to find 0 implicit places.
[2023-03-18 21:20:56] [INFO ] Invariant cache hit.
[2023-03-18 21:20:57] [INFO ] Dead Transitions using invariants and state equation in 860 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1576/2003 places, 1576/2003 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 3272 ms. Remains : 1576/2003 places, 1576/2003 transitions.
Support contains 35 out of 1576 places after structural reductions.
[2023-03-18 21:20:57] [INFO ] Flatten gal took : 165 ms
[2023-03-18 21:20:57] [INFO ] Flatten gal took : 58 ms
[2023-03-18 21:20:57] [INFO ] Input system was already deterministic with 1576 transitions.
Support contains 34 out of 1576 places (down from 35) after GAL structural reductions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 629 ms. (steps per millisecond=15 ) properties (out of 29) seen :14
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 15) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 15) seen :0
Running SMT prover for 15 properties.
[2023-03-18 21:20:58] [INFO ] Invariant cache hit.
[2023-03-18 21:20:59] [INFO ] [Real]Absence check using 161 positive place invariants in 94 ms returned sat
[2023-03-18 21:20:59] [INFO ] After 859ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:15
[2023-03-18 21:21:00] [INFO ] [Nat]Absence check using 161 positive place invariants in 60 ms returned sat
[2023-03-18 21:21:03] [INFO ] After 2381ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :15
[2023-03-18 21:21:03] [INFO ] Deduced a trap composed of 22 places in 369 ms of which 6 ms to minimize.
[2023-03-18 21:21:03] [INFO ] Deduced a trap composed of 22 places in 326 ms of which 1 ms to minimize.
[2023-03-18 21:21:04] [INFO ] Deduced a trap composed of 28 places in 331 ms of which 1 ms to minimize.
[2023-03-18 21:21:04] [INFO ] Deduced a trap composed of 39 places in 287 ms of which 14 ms to minimize.
[2023-03-18 21:21:05] [INFO ] Deduced a trap composed of 25 places in 319 ms of which 1 ms to minimize.
[2023-03-18 21:21:05] [INFO ] Deduced a trap composed of 40 places in 279 ms of which 1 ms to minimize.
[2023-03-18 21:21:05] [INFO ] Deduced a trap composed of 24 places in 262 ms of which 14 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Deduced a trap composed of 27 places in 218 ms of which 0 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Deduced a trap composed of 41 places in 211 ms of which 1 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Deduced a trap composed of 30 places in 220 ms of which 1 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Deduced a trap composed of 31 places in 200 ms of which 1 ms to minimize.
[2023-03-18 21:21:06] [INFO ] Trap strengthening (SAT) tested/added 12/11 trap constraints in 3790 ms
[2023-03-18 21:21:07] [INFO ] Deduced a trap composed of 31 places in 206 ms of which 0 ms to minimize.
[2023-03-18 21:21:07] [INFO ] Deduced a trap composed of 37 places in 301 ms of which 0 ms to minimize.
[2023-03-18 21:21:07] [INFO ] Deduced a trap composed of 50 places in 222 ms of which 1 ms to minimize.
[2023-03-18 21:21:08] [INFO ] Deduced a trap composed of 30 places in 214 ms of which 3 ms to minimize.
[2023-03-18 21:21:08] [INFO ] Deduced a trap composed of 36 places in 183 ms of which 1 ms to minimize.
[2023-03-18 21:21:08] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1460 ms
[2023-03-18 21:21:08] [INFO ] Deduced a trap composed of 48 places in 247 ms of which 1 ms to minimize.
[2023-03-18 21:21:09] [INFO ] Deduced a trap composed of 54 places in 200 ms of which 1 ms to minimize.
[2023-03-18 21:21:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 652 ms
[2023-03-18 21:21:09] [INFO ] Deduced a trap composed of 57 places in 249 ms of which 2 ms to minimize.
[2023-03-18 21:21:09] [INFO ] Deduced a trap composed of 58 places in 213 ms of which 0 ms to minimize.
[2023-03-18 21:21:09] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 692 ms
[2023-03-18 21:21:10] [INFO ] Deduced a trap composed of 38 places in 255 ms of which 1 ms to minimize.
[2023-03-18 21:21:10] [INFO ] Deduced a trap composed of 42 places in 240 ms of which 2 ms to minimize.
[2023-03-18 21:21:10] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 697 ms
[2023-03-18 21:21:11] [INFO ] Deduced a trap composed of 38 places in 249 ms of which 1 ms to minimize.
[2023-03-18 21:21:11] [INFO ] Deduced a trap composed of 34 places in 227 ms of which 0 ms to minimize.
[2023-03-18 21:21:11] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 703 ms
[2023-03-18 21:21:12] [INFO ] Deduced a trap composed of 49 places in 262 ms of which 1 ms to minimize.
[2023-03-18 21:21:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 416 ms
[2023-03-18 21:21:12] [INFO ] Deduced a trap composed of 38 places in 242 ms of which 0 ms to minimize.
[2023-03-18 21:21:13] [INFO ] Deduced a trap composed of 36 places in 251 ms of which 1 ms to minimize.
[2023-03-18 21:21:13] [INFO ] Trap strengthening (SAT) tested/added 3/2 trap constraints in 689 ms
[2023-03-18 21:21:13] [INFO ] Deduced a trap composed of 61 places in 221 ms of which 1 ms to minimize.
[2023-03-18 21:21:14] [INFO ] Deduced a trap composed of 60 places in 227 ms of which 1 ms to minimize.
[2023-03-18 21:21:14] [INFO ] Deduced a trap composed of 58 places in 225 ms of which 1 ms to minimize.
[2023-03-18 21:21:14] [INFO ] Deduced a trap composed of 58 places in 248 ms of which 1 ms to minimize.
[2023-03-18 21:21:14] [INFO ] Trap strengthening (SAT) tested/added 5/4 trap constraints in 1264 ms
[2023-03-18 21:21:15] [INFO ] Deduced a trap composed of 34 places in 260 ms of which 1 ms to minimize.
[2023-03-18 21:21:15] [INFO ] Deduced a trap composed of 38 places in 228 ms of which 1 ms to minimize.
[2023-03-18 21:21:15] [INFO ] Deduced a trap composed of 33 places in 243 ms of which 5 ms to minimize.
[2023-03-18 21:21:16] [INFO ] Deduced a trap composed of 33 places in 238 ms of which 1 ms to minimize.
[2023-03-18 21:21:16] [INFO ] Deduced a trap composed of 35 places in 231 ms of which 1 ms to minimize.
[2023-03-18 21:21:16] [INFO ] Trap strengthening (SAT) tested/added 6/5 trap constraints in 1589 ms
[2023-03-18 21:21:16] [INFO ] After 15931ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :15
Attempting to minimize the solution found.
Minimization took 1642 ms.
[2023-03-18 21:21:18] [INFO ] After 18688ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :15
Parikh walk visited 0 properties in 912 ms.
Support contains 18 out of 1576 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Drop transitions removed 429 transitions
Trivial Post-agglo rules discarded 429 transitions
Performed 429 trivial Post agglomeration. Transition count delta: 429
Iterating post reduction 0 with 429 rules applied. Total rules applied 429 place count 1576 transition count 1147
Reduce places removed 429 places and 0 transitions.
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Iterating post reduction 1 with 435 rules applied. Total rules applied 864 place count 1147 transition count 1141
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 2 with 6 rules applied. Total rules applied 870 place count 1141 transition count 1141
Performed 303 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 303 Pre rules applied. Total rules applied 870 place count 1141 transition count 838
Deduced a syphon composed of 303 places in 3 ms
Reduce places removed 303 places and 0 transitions.
Iterating global reduction 3 with 606 rules applied. Total rules applied 1476 place count 838 transition count 838
Discarding 7 places :
Symmetric choice reduction at 3 with 7 rule applications. Total rules 1483 place count 831 transition count 831
Iterating global reduction 3 with 7 rules applied. Total rules applied 1490 place count 831 transition count 831
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 6 Pre rules applied. Total rules applied 1490 place count 831 transition count 825
Deduced a syphon composed of 6 places in 4 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 3 with 12 rules applied. Total rules applied 1502 place count 825 transition count 825
Performed 363 Post agglomeration using F-continuation condition.Transition count delta: 363
Deduced a syphon composed of 363 places in 1 ms
Reduce places removed 363 places and 0 transitions.
Iterating global reduction 3 with 726 rules applied. Total rules applied 2228 place count 462 transition count 462
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2229 place count 462 transition count 461
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2231 place count 461 transition count 460
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -92
Deduced a syphon composed of 101 places in 1 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2433 place count 360 transition count 552
Performed 9 Post agglomeration using F-continuation condition.Transition count delta: -9
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 4 with 18 rules applied. Total rules applied 2451 place count 351 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2452 place count 351 transition count 560
Free-agglomeration rule applied 2 times.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2454 place count 351 transition count 558
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 5 with 2 rules applied. Total rules applied 2456 place count 349 transition count 558
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 6 with 2 rules applied. Total rules applied 2458 place count 349 transition count 556
Partial Free-agglomeration rule applied 1 times.
Drop transitions removed 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2459 place count 349 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2460 place count 348 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2461 place count 347 transition count 555
Applied a total of 2461 rules in 591 ms. Remains 347 /1576 variables (removed 1229) and now considering 555/1576 (removed 1021) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 592 ms. Remains : 347/1576 places, 555/1576 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 383 ms. (steps per millisecond=26 ) properties (out of 15) seen :5
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 79 ms. (steps per millisecond=126 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 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 2 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 65 ms. (steps per millisecond=153 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 10) seen :0
Running SMT prover for 10 properties.
// Phase 1: matrix 555 rows 347 cols
[2023-03-18 21:21:20] [INFO ] Computed 160 place invariants in 3 ms
[2023-03-18 21:21:20] [INFO ] [Real]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-18 21:21:20] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:10
[2023-03-18 21:21:21] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-18 21:21:21] [INFO ] After 220ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :10
[2023-03-18 21:21:21] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:21:21] [INFO ] After 99ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :10
[2023-03-18 21:21:21] [INFO ] After 270ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :10
Attempting to minimize the solution found.
Minimization took 102 ms.
[2023-03-18 21:21:21] [INFO ] After 724ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :10
Fused 10 Parikh solutions to 4 different solutions.
Parikh walk visited 2 properties in 155 ms.
Support contains 10 out of 347 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 347/347 places, 555/555 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 0 with 1 rules applied. Total rules applied 1 place count 347 transition count 554
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 346 transition count 554
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 2 place count 346 transition count 548
Deduced a syphon composed of 6 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 14 place count 340 transition count 548
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 16 place count 339 transition count 547
Performed 4 Post agglomeration using F-continuation condition.Transition count delta: -8
Deduced a syphon composed of 4 places in 1 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 2 with 8 rules applied. Total rules applied 24 place count 335 transition count 555
Applied a total of 24 rules in 45 ms. Remains 335 /347 variables (removed 12) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 46 ms. Remains : 335/347 places, 555/555 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 393 ms. (steps per millisecond=25 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 56 ms. (steps per millisecond=178 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 57 ms. (steps per millisecond=175 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 8) seen :0
Interrupted probabilistic random walk after 145013 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 145013 steps, saw 95505 distinct states, run finished after 3005 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 555 rows 335 cols
[2023-03-18 21:21:25] [INFO ] Computed 160 place invariants in 6 ms
[2023-03-18 21:21:25] [INFO ] [Real]Absence check using 160 positive place invariants in 27 ms returned sat
[2023-03-18 21:21:25] [INFO ] After 122ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-18 21:21:25] [INFO ] [Nat]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-18 21:21:26] [INFO ] After 253ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :8
[2023-03-18 21:21:26] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:21:26] [INFO ] After 102ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :8
[2023-03-18 21:21:26] [INFO ] After 327ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :8
Attempting to minimize the solution found.
Minimization took 98 ms.
[2023-03-18 21:21:26] [INFO ] After 848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :8
Fused 8 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 146 ms.
Support contains 8 out of 335 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 335/335 places, 555/555 transitions.
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 1 Pre rules applied. Total rules applied 0 place count 335 transition count 554
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 334 transition count 554
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 333 transition count 553
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -2
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 6 place count 332 transition count 555
Applied a total of 6 rules in 39 ms. Remains 332 /335 variables (removed 3) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 39 ms. Remains : 332/335 places, 555/555 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 150 ms. (steps per millisecond=66 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 34 ms. (steps per millisecond=294 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 59 ms. (steps per millisecond=169 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 51 ms. (steps per millisecond=196 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 7) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 7) seen :0
Interrupted probabilistic random walk after 144972 steps, run timeout after 3001 ms. (steps per millisecond=48 ) properties seen :{}
Probabilistic random walk after 144972 steps, saw 95626 distinct states, run finished after 3001 ms. (steps per millisecond=48 ) properties seen :0
Running SMT prover for 7 properties.
// Phase 1: matrix 555 rows 332 cols
[2023-03-18 21:21:30] [INFO ] Computed 160 place invariants in 4 ms
[2023-03-18 21:21:30] [INFO ] [Real]Absence check using 160 positive place invariants in 19 ms returned sat
[2023-03-18 21:21:30] [INFO ] After 335ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:7
[2023-03-18 21:21:30] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-18 21:21:31] [INFO ] After 236ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :7
[2023-03-18 21:21:31] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:21:31] [INFO ] After 106ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :7
[2023-03-18 21:21:31] [INFO ] After 247ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :7
Attempting to minimize the solution found.
Minimization took 86 ms.
[2023-03-18 21:21:31] [INFO ] After 698ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :7
Fused 7 Parikh solutions to 4 different solutions.
Parikh walk visited 1 properties in 213 ms.
Support contains 7 out of 332 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 332/332 places, 555/555 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 331 transition count 554
Applied a total of 2 rules in 21 ms. Remains 331 /332 variables (removed 1) and now considering 554/555 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 331/332 places, 554/555 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 252 ms. (steps per millisecond=39 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 54 ms. (steps per millisecond=185 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 3 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 172197 steps, run timeout after 3001 ms. (steps per millisecond=57 ) properties seen :{}
Probabilistic random walk after 172197 steps, saw 113399 distinct states, run finished after 3001 ms. (steps per millisecond=57 ) properties seen :0
Running SMT prover for 6 properties.
// Phase 1: matrix 554 rows 331 cols
[2023-03-18 21:21:35] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:21:35] [INFO ] [Real]Absence check using 160 positive place invariants in 15 ms returned sat
[2023-03-18 21:21:35] [INFO ] After 296ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:21:35] [INFO ] [Nat]Absence check using 160 positive place invariants in 14 ms returned sat
[2023-03-18 21:21:35] [INFO ] After 157ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:21:35] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:21:35] [INFO ] After 96ms SMT Verify possible using 1 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2023-03-18 21:21:36] [INFO ] After 228ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 76 ms.
[2023-03-18 21:21:36] [INFO ] After 620ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 112 ms.
Support contains 7 out of 331 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 554/554 transitions.
Applied a total of 0 rules in 8 ms. Remains 331 /331 variables (removed 0) and now considering 554/554 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 8 ms. Remains : 331/331 places, 554/554 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 331/331 places, 554/554 transitions.
Applied a total of 0 rules in 19 ms. Remains 331 /331 variables (removed 0) and now considering 554/554 (removed 0) transitions.
[2023-03-18 21:21:36] [INFO ] Invariant cache hit.
[2023-03-18 21:21:36] [INFO ] Implicit Places using invariants in 262 ms returned []
[2023-03-18 21:21:36] [INFO ] Invariant cache hit.
[2023-03-18 21:21:36] [INFO ] State equation strengthened by 1 read => feed constraints.
[2023-03-18 21:21:36] [INFO ] Implicit Places using invariants and state equation in 404 ms returned []
Implicit Place search using SMT with State Equation took 669 ms to find 0 implicit places.
[2023-03-18 21:21:36] [INFO ] Redundant transitions in 23 ms returned []
[2023-03-18 21:21:36] [INFO ] Invariant cache hit.
[2023-03-18 21:21:37] [INFO ] Dead Transitions using invariants and state equation in 196 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 922 ms. Remains : 331/331 places, 554/554 transitions.
Graph (trivial) has 150 edges and 331 vertex of which 4 / 331 are part of one of the 2 SCC in 2 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1115 edges and 329 vertex of which 327 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 147 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 323 transition count 545
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 146 edges and 321 vertex of which 6 / 321 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 318 transition count 536
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 144 edges and 315 vertex of which 8 / 315 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 2 with 15 rules applied. Total rules applied 35 place count 311 transition count 525
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 307 vertex of which 8 / 307 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 19 rules applied. Total rules applied 54 place count 303 transition count 511
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 299 vertex of which 8 / 299 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 19 rules applied. Total rules applied 73 place count 295 transition count 497
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 291 vertex of which 8 / 291 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 92 place count 287 transition count 483
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 283 vertex of which 8 / 283 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 111 place count 279 transition count 469
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 275 vertex of which 8 / 275 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 130 place count 271 transition count 455
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 267 vertex of which 8 / 267 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 149 place count 263 transition count 441
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 259 vertex of which 8 / 259 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 168 place count 255 transition count 427
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 251 vertex of which 8 / 251 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 187 place count 247 transition count 413
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 243 vertex of which 8 / 243 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 206 place count 239 transition count 399
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 235 vertex of which 8 / 235 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 225 place count 231 transition count 385
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 100 edges and 227 vertex of which 8 / 227 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 244 place count 223 transition count 371
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 96 edges and 219 vertex of which 8 / 219 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 263 place count 215 transition count 357
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 92 edges and 211 vertex of which 8 / 211 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 19 rules applied. Total rules applied 282 place count 207 transition count 343
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 88 edges and 203 vertex of which 4 / 203 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 16 with 17 rules applied. Total rules applied 299 place count 201 transition count 331
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 87 edges and 199 vertex of which 6 / 199 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 12 rules applied. Total rules applied 311 place count 196 transition count 322
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 85 edges and 193 vertex of which 6 / 193 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 326 place count 190 transition count 311
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 83 edges and 187 vertex of which 8 / 187 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 341 place count 183 transition count 300
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 15 transitions.
Graph (trivial) has 79 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 20 with 20 rules applied. Total rules applied 361 place count 175 transition count 285
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 75 edges and 171 vertex of which 8 / 171 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 21 with 19 rules applied. Total rules applied 380 place count 167 transition count 271
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 71 edges and 163 vertex of which 8 / 163 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 22 with 19 rules applied. Total rules applied 399 place count 159 transition count 257
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 67 edges and 155 vertex of which 8 / 155 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 23 with 19 rules applied. Total rules applied 418 place count 151 transition count 243
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 63 edges and 147 vertex of which 8 / 147 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 24 with 19 rules applied. Total rules applied 437 place count 143 transition count 229
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 59 edges and 139 vertex of which 8 / 139 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 25 with 19 rules applied. Total rules applied 456 place count 135 transition count 215
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 55 edges and 131 vertex of which 6 / 131 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 26 with 19 rules applied. Total rules applied 475 place count 128 transition count 201
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 6 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 10 transitions.
Graph (trivial) has 51 edges and 125 vertex of which 4 / 125 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 27 with 14 rules applied. Total rules applied 489 place count 123 transition count 191
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 4 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 6 transitions.
Graph (trivial) has 48 edges and 121 vertex of which 2 / 121 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 28 with 9 rules applied. Total rules applied 498 place count 120 transition count 185
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 29 with 5 rules applied. Total rules applied 503 place count 119 transition count 181
Performed 3 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 30 with 3 Pre rules applied. Total rules applied 503 place count 119 transition count 178
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 30 with 9 rules applied. Total rules applied 512 place count 113 transition count 178
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 44 edges and 113 vertex of which 2 / 113 are part of one of the 1 SCC in 1 ms
Free SCC test removed 1 places
Iterating post reduction 30 with 2 rules applied. Total rules applied 514 place count 112 transition count 177
Reduce places removed 1 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 31 with 4 rules applied. Total rules applied 518 place count 111 transition count 174
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 32 with 1 Pre rules applied. Total rules applied 518 place count 111 transition count 173
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 32 with 2 rules applied. Total rules applied 520 place count 110 transition count 173
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 32 with 3 rules applied. Total rules applied 523 place count 108 transition count 172
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 32 with 2 rules applied. Total rules applied 525 place count 108 transition count 170
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 33 with 3 rules applied. Total rules applied 528 place count 108 transition count 167
Applied a total of 528 rules in 73 ms. Remains 108 /331 variables (removed 223) and now considering 167/554 (removed 387) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 167 rows 108 cols
[2023-03-18 21:21:37] [INFO ] Computed 49 place invariants in 1 ms
[2023-03-18 21:21:37] [INFO ] [Real]Absence check using 49 positive place invariants in 6 ms returned sat
[2023-03-18 21:21:37] [INFO ] After 68ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:4
[2023-03-18 21:21:37] [INFO ] After 87ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:21:37] [INFO ] After 155ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2023-03-18 21:21:37] [INFO ] [Nat]Absence check using 49 positive place invariants in 6 ms returned sat
[2023-03-18 21:21:37] [INFO ] After 75ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2023-03-18 21:21:37] [INFO ] After 134ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 32 ms.
[2023-03-18 21:21:37] [INFO ] After 222ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Computed a total of 483 stabilizing places and 483 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((X((X(p1)||p0))&&F(p2))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 12 places :
Symmetric choice reduction at 0 with 12 rule applications. Total rules 12 place count 1564 transition count 1564
Iterating global reduction 0 with 12 rules applied. Total rules applied 24 place count 1564 transition count 1564
Applied a total of 24 rules in 97 ms. Remains 1564 /1576 variables (removed 12) and now considering 1564/1576 (removed 12) transitions.
// Phase 1: matrix 1564 rows 1564 cols
[2023-03-18 21:21:38] [INFO ] Computed 161 place invariants in 14 ms
[2023-03-18 21:21:38] [INFO ] Implicit Places using invariants in 479 ms returned []
[2023-03-18 21:21:38] [INFO ] Invariant cache hit.
[2023-03-18 21:21:39] [INFO ] Implicit Places using invariants and state equation in 1041 ms returned []
Implicit Place search using SMT with State Equation took 1524 ms to find 0 implicit places.
[2023-03-18 21:21:39] [INFO ] Invariant cache hit.
[2023-03-18 21:21:40] [INFO ] Dead Transitions using invariants and state equation in 896 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1564/1576 places, 1564/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2523 ms. Remains : 1564/1576 places, 1564/1576 transitions.
Stuttering acceptance computed with spot in 244 ms :[(OR (NOT p2) (AND (NOT p0) (NOT p1))), (AND (NOT p0) (NOT p1)), (NOT p2), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p2), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={} source=1 dest: 3}], [{ cond=(NOT p2), acceptance={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 4}], [{ cond=true, acceptance={0} source=4 dest: 4}]], initial=0, aps=[p2:(EQ s215 1), p0:(OR (EQ s1213 1) (EQ s215 1)), p1:(EQ s1251 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 725 steps with 1 reset in 22 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-00 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-00 finished in 2879 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(G(p0))||((p1 U p0)&&F((G(F(!p1))||(!p0&&F(!p1)))))))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 105 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:21:40] [INFO ] Computed 161 place invariants in 5 ms
[2023-03-18 21:21:41] [INFO ] Implicit Places using invariants in 550 ms returned []
[2023-03-18 21:21:41] [INFO ] Invariant cache hit.
[2023-03-18 21:21:42] [INFO ] Implicit Places using invariants and state equation in 954 ms returned []
Implicit Place search using SMT with State Equation took 1519 ms to find 0 implicit places.
[2023-03-18 21:21:42] [INFO ] Invariant cache hit.
[2023-03-18 21:21:43] [INFO ] Dead Transitions using invariants and state equation in 687 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2315 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 191 ms :[(NOT p0), (NOT p0), (NOT p0), (AND (NOT p0) p1), (AND (NOT p0) p1), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}, { cond=p0, acceptance={} source=0 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 4}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}], [{ cond=p0, acceptance={} source=3 dest: 3}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 4}], [{ cond=(AND p0 p1), acceptance={} source=4 dest: 4}, { cond=(AND (NOT p0) p1), acceptance={0} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p0:(EQ s765 1), p1:(AND (EQ s1165 1) (EQ s1179 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Stuttering criterion allowed to conclude after 6797 steps with 0 reset in 33 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-02 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-02 finished in 2595 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(((F(p0) U p1)&&X(X(G(p2)))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1563 transition count 1563
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1563 transition count 1563
Applied a total of 26 rules in 96 ms. Remains 1563 /1576 variables (removed 13) and now considering 1563/1576 (removed 13) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2023-03-18 21:21:43] [INFO ] Computed 161 place invariants in 24 ms
[2023-03-18 21:21:43] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-18 21:21:43] [INFO ] Invariant cache hit.
[2023-03-18 21:21:44] [INFO ] Implicit Places using invariants and state equation in 873 ms returned []
Implicit Place search using SMT with State Equation took 1234 ms to find 0 implicit places.
[2023-03-18 21:21:44] [INFO ] Invariant cache hit.
[2023-03-18 21:21:45] [INFO ] Dead Transitions using invariants and state equation in 634 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1563/1576 places, 1563/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1981 ms. Remains : 1563/1576 places, 1563/1576 transitions.
Stuttering acceptance computed with spot in 197 ms :[(OR (NOT p1) (NOT p2)), (NOT p0), (NOT p1), (NOT p2), (NOT p2), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}, { cond=true, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={0} source=2 dest: 1}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}], [{ cond=true, acceptance={} source=3 dest: 4}], [{ cond=p2, acceptance={} source=4 dest: 4}, { cond=(NOT p2), acceptance={} source=4 dest: 5}], [{ cond=true, acceptance={0} source=5 dest: 5}]], initial=0, aps=[p1:(EQ s1060 1), p0:(EQ s1397 1), p2:(NEQ s1186 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 10845 steps with 10 reset in 70 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-04 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-04 finished in 2287 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0 U G(!p0))))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 93 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:21:45] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-18 21:21:46] [INFO ] Implicit Places using invariants in 380 ms returned []
[2023-03-18 21:21:46] [INFO ] Invariant cache hit.
[2023-03-18 21:21:47] [INFO ] Implicit Places using invariants and state equation in 945 ms returned []
Implicit Place search using SMT with State Equation took 1340 ms to find 0 implicit places.
[2023-03-18 21:21:47] [INFO ] Invariant cache hit.
[2023-03-18 21:21:47] [INFO ] Dead Transitions using invariants and state equation in 668 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2117 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 88 ms :[p0, p0, p0, true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={} source=0 dest: 0}, { cond=p0, acceptance={} source=0 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 0}, { cond=p0, acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=2, aps=[p0:(NEQ s224 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 678 steps with 0 reset in 3 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-06 finished in 2241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)&&X((p1&&G(p2))))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 92 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-18 21:21:48] [INFO ] Computed 161 place invariants in 11 ms
[2023-03-18 21:21:48] [INFO ] Implicit Places using invariants in 346 ms returned []
[2023-03-18 21:21:48] [INFO ] Invariant cache hit.
[2023-03-18 21:21:49] [INFO ] Implicit Places using invariants and state equation in 843 ms returned []
Implicit Place search using SMT with State Equation took 1204 ms to find 0 implicit places.
[2023-03-18 21:21:49] [INFO ] Invariant cache hit.
[2023-03-18 21:21:49] [INFO ] Dead Transitions using invariants and state equation in 662 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1960 ms. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 246 ms :[(OR (NOT p1) (NOT p2) (NOT p0)), (NOT p0), (OR (NOT p2) (NOT p1)), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=true, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1066 0), p1:(EQ s25 1), p2:(EQ s326 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][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-07 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-07 finished in 2241 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0||X(X(p1)))))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 105 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
[2023-03-18 21:21:50] [INFO ] Invariant cache hit.
[2023-03-18 21:21:50] [INFO ] Implicit Places using invariants in 374 ms returned []
[2023-03-18 21:21:50] [INFO ] Invariant cache hit.
[2023-03-18 21:21:51] [INFO ] Implicit Places using invariants and state equation in 948 ms returned []
Implicit Place search using SMT with State Equation took 1360 ms to find 0 implicit places.
[2023-03-18 21:21:51] [INFO ] Invariant cache hit.
[2023-03-18 21:21:52] [INFO ] Dead Transitions using invariants and state equation in 683 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2150 ms. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 91 ms :[(AND (NOT p0) (NOT p1)), (NOT p1), (NOT p1), true]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 3}], [{ cond=true, acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(EQ s1541 1), p1:(EQ s249 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 4 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-08 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-08 finished in 2274 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((!((p0 U p1)&&p0) U X((F(p2)||(G(p1)&&p1)))))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 94 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:21:52] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-18 21:21:52] [INFO ] Implicit Places using invariants in 352 ms returned []
[2023-03-18 21:21:52] [INFO ] Invariant cache hit.
[2023-03-18 21:21:53] [INFO ] Implicit Places using invariants and state equation in 912 ms returned []
Implicit Place search using SMT with State Equation took 1291 ms to find 0 implicit places.
[2023-03-18 21:21:53] [INFO ] Invariant cache hit.
[2023-03-18 21:21:54] [INFO ] Dead Transitions using invariants and state equation in 649 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2045 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 165 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(OR (NOT p0) (NOT p1)), acceptance={} source=0 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=0 dest: 3}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p1) (NOT p2)), acceptance={} source=1 dest: 4}], [{ cond=(AND p0 p1 (NOT p2)), acceptance={} source=2 dest: 1}, { cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=2 dest: 3}], [{ cond=(AND (NOT p0) p1 (NOT p2)), acceptance={} source=3 dest: 1}, { cond=(AND p0 (NOT p1) (NOT p2)), acceptance={} source=3 dest: 5}], [{ cond=(NOT p2), acceptance={0} source=4 dest: 4}], [{ cond=(AND p1 (NOT p2)), acceptance={} source=5 dest: 4}]], initial=0, aps=[p0:(EQ s923 1), p1:(EQ s1501 1), p2:(EQ s313 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null, null, null, null][false, false, false, false, false, false]]
Product exploration explored 100000 steps with 163 reset in 382 ms.
Product exploration explored 100000 steps with 159 reset in 507 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 14 factoid took 791 ms. Reduced automaton from 6 states, 13 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 242 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:21:56] [INFO ] Invariant cache hit.
[2023-03-18 21:21:57] [INFO ] [Real]Absence check using 161 positive place invariants in 41 ms returned sat
[2023-03-18 21:21:57] [INFO ] After 732ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:21:57] [INFO ] [Nat]Absence check using 161 positive place invariants in 37 ms returned sat
[2023-03-18 21:21:58] [INFO ] After 495ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:21:58] [INFO ] Deduced a trap composed of 26 places in 263 ms of which 14 ms to minimize.
[2023-03-18 21:21:58] [INFO ] Deduced a trap composed of 26 places in 259 ms of which 1 ms to minimize.
[2023-03-18 21:21:59] [INFO ] Deduced a trap composed of 31 places in 231 ms of which 1 ms to minimize.
[2023-03-18 21:21:59] [INFO ] Deduced a trap composed of 27 places in 237 ms of which 1 ms to minimize.
[2023-03-18 21:21:59] [INFO ] Deduced a trap composed of 32 places in 250 ms of which 1 ms to minimize.
[2023-03-18 21:21:59] [INFO ] Deduced a trap composed of 42 places in 218 ms of which 1 ms to minimize.
[2023-03-18 21:22:00] [INFO ] Deduced a trap composed of 33 places in 232 ms of which 1 ms to minimize.
[2023-03-18 21:22:00] [INFO ] Deduced a trap composed of 22 places in 214 ms of which 0 ms to minimize.
[2023-03-18 21:22:00] [INFO ] Deduced a trap composed of 37 places in 235 ms of which 1 ms to minimize.
[2023-03-18 21:22:01] [INFO ] Deduced a trap composed of 37 places in 232 ms of which 1 ms to minimize.
[2023-03-18 21:22:01] [INFO ] Deduced a trap composed of 27 places in 192 ms of which 0 ms to minimize.
[2023-03-18 21:22:01] [INFO ] Deduced a trap composed of 39 places in 200 ms of which 1 ms to minimize.
[2023-03-18 21:22:01] [INFO ] Deduced a trap composed of 42 places in 186 ms of which 1 ms to minimize.
[2023-03-18 21:22:01] [INFO ] Deduced a trap composed of 58 places in 187 ms of which 7 ms to minimize.
[2023-03-18 21:22:02] [INFO ] Deduced a trap composed of 52 places in 191 ms of which 1 ms to minimize.
[2023-03-18 21:22:02] [INFO ] Deduced a trap composed of 21 places in 250 ms of which 1 ms to minimize.
[2023-03-18 21:22:02] [INFO ] Deduced a trap composed of 31 places in 276 ms of which 1 ms to minimize.
[2023-03-18 21:22:03] [INFO ] Deduced a trap composed of 42 places in 220 ms of which 1 ms to minimize.
[2023-03-18 21:22:03] [INFO ] Deduced a trap composed of 51 places in 160 ms of which 1 ms to minimize.
[2023-03-18 21:22:03] [INFO ] Deduced a trap composed of 55 places in 170 ms of which 0 ms to minimize.
[2023-03-18 21:22:03] [INFO ] Deduced a trap composed of 26 places in 165 ms of which 1 ms to minimize.
[2023-03-18 21:22:03] [INFO ] Deduced a trap composed of 40 places in 228 ms of which 1 ms to minimize.
[2023-03-18 21:22:04] [INFO ] Deduced a trap composed of 31 places in 235 ms of which 1 ms to minimize.
[2023-03-18 21:22:04] [INFO ] Deduced a trap composed of 38 places in 215 ms of which 2 ms to minimize.
[2023-03-18 21:22:04] [INFO ] Deduced a trap composed of 52 places in 157 ms of which 2 ms to minimize.
[2023-03-18 21:22:05] [INFO ] Deduced a trap composed of 37 places in 205 ms of which 10 ms to minimize.
[2023-03-18 21:22:05] [INFO ] Deduced a trap composed of 57 places in 216 ms of which 1 ms to minimize.
[2023-03-18 21:22:05] [INFO ] Deduced a trap composed of 57 places in 161 ms of which 1 ms to minimize.
[2023-03-18 21:22:05] [INFO ] Deduced a trap composed of 59 places in 158 ms of which 0 ms to minimize.
[2023-03-18 21:22:05] [INFO ] Deduced a trap composed of 56 places in 192 ms of which 1 ms to minimize.
[2023-03-18 21:22:06] [INFO ] Deduced a trap composed of 58 places in 198 ms of which 1 ms to minimize.
[2023-03-18 21:22:06] [INFO ] Deduced a trap composed of 57 places in 190 ms of which 8 ms to minimize.
[2023-03-18 21:22:06] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 8264 ms
[2023-03-18 21:22:06] [INFO ] After 8961ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 165 ms.
[2023-03-18 21:22:06] [INFO ] After 9345ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 114 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1562 transition count 1125
Reduce places removed 437 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 439 rules applied. Total rules applied 876 place count 1125 transition count 1123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 878 place count 1123 transition count 1123
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 878 place count 1123 transition count 804
Deduced a syphon composed of 319 places in 3 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1516 place count 804 transition count 804
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2230 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 447 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2233 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2435 place count 345 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 1 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2469 place count 328 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2470 place count 328 transition count 560
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2471 place count 328 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2472 place count 327 transition count 559
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2473 place count 327 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2474 place count 326 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2475 place count 325 transition count 557
Applied a total of 2475 rules in 234 ms. Remains 325 /1562 variables (removed 1237) and now considering 557/1562 (removed 1005) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 234 ms. Remains : 325/1562 places, 557/1562 transitions.
Incomplete random walk after 10000 steps, including 5 resets, run finished after 164 ms. (steps per millisecond=60 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 309025 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 309025 steps, saw 216129 distinct states, run finished after 3001 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 557 rows 325 cols
[2023-03-18 21:22:10] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:22:10] [INFO ] [Real]Absence check using 160 positive place invariants in 16 ms returned sat
[2023-03-18 21:22:10] [INFO ] After 206ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:22:10] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-18 21:22:10] [INFO ] After 132ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:22:10] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:22:10] [INFO ] After 22ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:22:10] [INFO ] After 65ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 24 ms.
[2023-03-18 21:22:11] [INFO ] After 300ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 67 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 16 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 16 ms. Remains : 325/325 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2023-03-18 21:22:11] [INFO ] Invariant cache hit.
[2023-03-18 21:22:11] [INFO ] Implicit Places using invariants in 221 ms returned []
[2023-03-18 21:22:11] [INFO ] Invariant cache hit.
[2023-03-18 21:22:11] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:22:11] [INFO ] Implicit Places using invariants and state equation in 326 ms returned []
Implicit Place search using SMT with State Equation took 549 ms to find 0 implicit places.
[2023-03-18 21:22:11] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:22:11] [INFO ] Invariant cache hit.
[2023-03-18 21:22:11] [INFO ] Dead Transitions using invariants and state equation in 232 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 802 ms. Remains : 325/325 places, 557/557 transitions.
Graph (trivial) has 158 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1107 edges and 323 vertex of which 321 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.0 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 317 transition count 548
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 315 vertex of which 6 / 315 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 312 transition count 539
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 151 edges and 310 vertex of which 6 / 310 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 34 place count 307 transition count 528
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 149 edges and 304 vertex of which 8 / 304 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 49 place count 300 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1003 edges and 296 vertex of which 293 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 144 edges and 293 vertex of which 8 / 293 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 69 place count 289 transition count 500
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 285 vertex of which 8 / 285 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 88 place count 281 transition count 486
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 277 vertex of which 8 / 277 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 107 place count 273 transition count 472
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 269 vertex of which 8 / 269 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 126 place count 265 transition count 458
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 261 vertex of which 8 / 261 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 145 place count 257 transition count 444
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 253 vertex of which 8 / 253 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 164 place count 249 transition count 430
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 245 vertex of which 8 / 245 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 183 place count 241 transition count 416
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 237 vertex of which 8 / 237 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 202 place count 233 transition count 402
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 221 place count 225 transition count 388
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 221 vertex of which 8 / 221 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 240 place count 217 transition count 374
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 213 vertex of which 8 / 213 are part of one of the 4 SCC in 1 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 259 place count 209 transition count 360
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 101 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 18 rules applied. Total rules applied 277 place count 201 transition count 347
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 97 edges and 197 vertex of which 6 / 197 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 17 rules applied. Total rules applied 294 place count 194 transition count 335
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 94 edges and 191 vertex of which 6 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 310 place count 188 transition count 323
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 185 vertex of which 6 / 185 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 325 place count 182 transition count 312
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 90 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 340 place count 175 transition count 301
Discarding 160 places :
Also discarding 280 output transitions
Drop transitions removed 280 transitions
Remove reverse transitions (loop back) rule discarded transition t178.t175.t176 and 160 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 11 rules applied. Total rules applied 351 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 351 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 357 place count 7 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 2 rules applied. Total rules applied 359 place count 6 transition count 8
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 361 place count 6 transition count 6
Applied a total of 361 rules in 61 ms. Remains 6 /325 variables (removed 319) and now considering 6/557 (removed 551) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-18 21:22:11] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 21:22:12] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 21:22:12] [INFO ] After 2ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-18 21:22:12] [INFO ] After 4ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:22:12] [INFO ] After 78ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:22:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 21:22:12] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:22:12] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 21:22:12] [INFO ] After 27ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p0) (NOT p1) (NOT p2)), (X (NOT (AND p0 p1 (NOT p2)))), (X (NOT (AND p0 (NOT p1) (NOT p2)))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND p1 (NOT p2)))), (X (X (NOT (AND p0 p1 (NOT p2))))), (X (X (NOT (AND p0 (NOT p1) (NOT p2))))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT p2))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F p2), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 14 factoid took 674 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 143 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:22:13] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-18 21:22:13] [INFO ] [Real]Absence check using 161 positive place invariants in 115 ms returned sat
[2023-03-18 21:22:13] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:22:17] [INFO ] [Real]Absence check using state equation in 3469 ms returned sat
[2023-03-18 21:22:17] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:22:17] [INFO ] [Nat]Absence check using 161 positive place invariants in 138 ms returned sat
[2023-03-18 21:22:17] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:22:22] [INFO ] [Nat]Absence check using state equation in 4504 ms returned sat
[2023-03-18 21:22:22] [INFO ] Computed and/alt/rep : 1561/2283/1561 causal constraints (skipped 0 transitions) in 98 ms.
[2023-03-18 21:22:32] [INFO ] Deduced a trap composed of 14 places in 657 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:251)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:22:32] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 68 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
[2023-03-18 21:22:32] [INFO ] Invariant cache hit.
[2023-03-18 21:22:33] [INFO ] Implicit Places using invariants in 342 ms returned []
[2023-03-18 21:22:33] [INFO ] Invariant cache hit.
[2023-03-18 21:22:34] [INFO ] Implicit Places using invariants and state equation in 1038 ms returned []
Implicit Place search using SMT with State Equation took 1388 ms to find 0 implicit places.
[2023-03-18 21:22:34] [INFO ] Invariant cache hit.
[2023-03-18 21:22:34] [INFO ] Dead Transitions using invariants and state equation in 690 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2147 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Detected a total of 478/1562 stabilizing places and 478/1562 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 2/3 atomic propositions.
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : []
Knowledge based reduction with 12 factoid took 440 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 100 ms. (steps per millisecond=100 ) properties (out of 6) seen :4
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 2) seen :0
Running SMT prover for 2 properties.
[2023-03-18 21:22:35] [INFO ] Invariant cache hit.
[2023-03-18 21:22:35] [INFO ] [Real]Absence check using 161 positive place invariants in 40 ms returned sat
[2023-03-18 21:22:36] [INFO ] After 817ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:22:36] [INFO ] [Nat]Absence check using 161 positive place invariants in 39 ms returned sat
[2023-03-18 21:22:37] [INFO ] After 599ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:22:37] [INFO ] Deduced a trap composed of 26 places in 241 ms of which 1 ms to minimize.
[2023-03-18 21:22:37] [INFO ] Deduced a trap composed of 26 places in 232 ms of which 0 ms to minimize.
[2023-03-18 21:22:38] [INFO ] Deduced a trap composed of 31 places in 239 ms of which 1 ms to minimize.
[2023-03-18 21:22:38] [INFO ] Deduced a trap composed of 27 places in 255 ms of which 0 ms to minimize.
[2023-03-18 21:22:38] [INFO ] Deduced a trap composed of 32 places in 210 ms of which 1 ms to minimize.
[2023-03-18 21:22:38] [INFO ] Deduced a trap composed of 42 places in 227 ms of which 0 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 33 places in 220 ms of which 0 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 22 places in 205 ms of which 1 ms to minimize.
[2023-03-18 21:22:39] [INFO ] Deduced a trap composed of 37 places in 231 ms of which 1 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 37 places in 214 ms of which 1 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 27 places in 185 ms of which 1 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 39 places in 197 ms of which 0 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 42 places in 179 ms of which 0 ms to minimize.
[2023-03-18 21:22:40] [INFO ] Deduced a trap composed of 58 places in 191 ms of which 0 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 52 places in 185 ms of which 1 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 21 places in 179 ms of which 0 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 31 places in 178 ms of which 1 ms to minimize.
[2023-03-18 21:22:41] [INFO ] Deduced a trap composed of 42 places in 176 ms of which 1 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 51 places in 196 ms of which 0 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 55 places in 163 ms of which 0 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 26 places in 160 ms of which 1 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 40 places in 154 ms of which 1 ms to minimize.
[2023-03-18 21:22:42] [INFO ] Deduced a trap composed of 31 places in 160 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 38 places in 148 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 52 places in 204 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 37 places in 150 ms of which 1 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 57 places in 152 ms of which 0 ms to minimize.
[2023-03-18 21:22:43] [INFO ] Deduced a trap composed of 57 places in 144 ms of which 1 ms to minimize.
[2023-03-18 21:22:44] [INFO ] Deduced a trap composed of 59 places in 143 ms of which 0 ms to minimize.
[2023-03-18 21:22:44] [INFO ] Deduced a trap composed of 56 places in 140 ms of which 0 ms to minimize.
[2023-03-18 21:22:44] [INFO ] Deduced a trap composed of 58 places in 137 ms of which 0 ms to minimize.
[2023-03-18 21:22:44] [INFO ] Deduced a trap composed of 57 places in 137 ms of which 0 ms to minimize.
[2023-03-18 21:22:44] [INFO ] Trap strengthening (SAT) tested/added 33/32 trap constraints in 7283 ms
[2023-03-18 21:22:44] [INFO ] After 7988ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 73 ms.
[2023-03-18 21:22:44] [INFO ] After 8276ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 50 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 437 transitions
Trivial Post-agglo rules discarded 437 transitions
Performed 437 trivial Post agglomeration. Transition count delta: 437
Iterating post reduction 0 with 437 rules applied. Total rules applied 437 place count 1562 transition count 1125
Reduce places removed 437 places and 0 transitions.
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Iterating post reduction 1 with 439 rules applied. Total rules applied 876 place count 1125 transition count 1123
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 878 place count 1123 transition count 1123
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 878 place count 1123 transition count 804
Deduced a syphon composed of 319 places in 2 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1516 place count 804 transition count 804
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 1 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 3 with 714 rules applied. Total rules applied 2230 place count 447 transition count 447
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2231 place count 447 transition count 446
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2233 place count 446 transition count 445
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2435 place count 345 transition count 545
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2469 place count 328 transition count 561
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2470 place count 328 transition count 560
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2471 place count 328 transition count 559
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2472 place count 327 transition count 559
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 6 with 1 rules applied. Total rules applied 2473 place count 327 transition count 558
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 6 with 1 rules applied. Total rules applied 2474 place count 326 transition count 557
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2475 place count 325 transition count 557
Applied a total of 2475 rules in 212 ms. Remains 325 /1562 variables (removed 1237) and now considering 557/1562 (removed 1005) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 223 ms. Remains : 325/1562 places, 557/1562 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 196 ms. (steps per millisecond=51 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 301208 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301208 steps, saw 210244 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
// Phase 1: matrix 557 rows 325 cols
[2023-03-18 21:22:48] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:22:48] [INFO ] [Real]Absence check using 160 positive place invariants in 13 ms returned sat
[2023-03-18 21:22:48] [INFO ] After 182ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:22:48] [INFO ] [Nat]Absence check using 160 positive place invariants in 25 ms returned sat
[2023-03-18 21:22:48] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:22:48] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:22:48] [INFO ] After 29ms SMT Verify possible using 10 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2023-03-18 21:22:48] [INFO ] After 86ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 21 ms.
[2023-03-18 21:22:48] [INFO ] After 402ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 62 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 5 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 5 ms. Remains : 325/325 places, 557/557 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 557/557 transitions.
Applied a total of 0 rules in 10 ms. Remains 325 /325 variables (removed 0) and now considering 557/557 (removed 0) transitions.
[2023-03-18 21:22:49] [INFO ] Invariant cache hit.
[2023-03-18 21:22:49] [INFO ] Implicit Places using invariants in 203 ms returned []
[2023-03-18 21:22:49] [INFO ] Invariant cache hit.
[2023-03-18 21:22:49] [INFO ] State equation strengthened by 10 read => feed constraints.
[2023-03-18 21:22:49] [INFO ] Implicit Places using invariants and state equation in 303 ms returned []
Implicit Place search using SMT with State Equation took 532 ms to find 0 implicit places.
[2023-03-18 21:22:49] [INFO ] Redundant transitions in 2 ms returned []
[2023-03-18 21:22:49] [INFO ] Invariant cache hit.
[2023-03-18 21:22:49] [INFO ] Dead Transitions using invariants and state equation in 184 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 748 ms. Remains : 325/325 places, 557/557 transitions.
Graph (trivial) has 158 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Reduce isomorphic transitions removed 5 transitions.
Graph (complete) has 1107 edges and 323 vertex of which 321 are kept as prefixes of interest. Removing 2 places using SCC suffix rule.1 ms
Discarding 2 places :
Also discarding 1 output transitions
Drop transitions removed 1 transitions
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 2 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 3 transitions.
Graph (trivial) has 155 edges and 319 vertex of which 4 / 319 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Iterating post reduction 0 with 6 rules applied. Total rules applied 8 place count 317 transition count 548
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 5 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 9 transitions.
Graph (trivial) has 154 edges and 315 vertex of which 6 / 315 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 1 with 12 rules applied. Total rules applied 20 place count 312 transition count 539
Reduce places removed 2 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 151 edges and 310 vertex of which 6 / 310 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 2 with 14 rules applied. Total rules applied 34 place count 307 transition count 528
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 149 edges and 304 vertex of which 8 / 304 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 3 with 15 rules applied. Total rules applied 49 place count 300 transition count 517
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (complete) has 1003 edges and 296 vertex of which 293 are kept as prefixes of interest. Removing 3 places using SCC suffix rule.0 ms
Discarding 3 places :
Also discarding 3 output transitions
Drop transitions removed 3 transitions
Graph (trivial) has 144 edges and 293 vertex of which 8 / 293 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 4 with 20 rules applied. Total rules applied 69 place count 289 transition count 500
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 140 edges and 285 vertex of which 8 / 285 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 5 with 19 rules applied. Total rules applied 88 place count 281 transition count 486
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 136 edges and 277 vertex of which 8 / 277 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 6 with 19 rules applied. Total rules applied 107 place count 273 transition count 472
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 132 edges and 269 vertex of which 8 / 269 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 7 with 19 rules applied. Total rules applied 126 place count 265 transition count 458
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 128 edges and 261 vertex of which 8 / 261 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 8 with 19 rules applied. Total rules applied 145 place count 257 transition count 444
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 124 edges and 253 vertex of which 8 / 253 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 9 with 19 rules applied. Total rules applied 164 place count 249 transition count 430
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 120 edges and 245 vertex of which 8 / 245 are part of one of the 4 SCC in 13 ms
Free SCC test removed 4 places
Iterating post reduction 10 with 19 rules applied. Total rules applied 183 place count 241 transition count 416
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 116 edges and 237 vertex of which 8 / 237 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 11 with 19 rules applied. Total rules applied 202 place count 233 transition count 402
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 112 edges and 229 vertex of which 8 / 229 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 12 with 19 rules applied. Total rules applied 221 place count 225 transition count 388
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 108 edges and 221 vertex of which 8 / 221 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 13 with 19 rules applied. Total rules applied 240 place count 217 transition count 374
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 14 transitions.
Graph (trivial) has 104 edges and 213 vertex of which 8 / 213 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 14 with 19 rules applied. Total rules applied 259 place count 209 transition count 360
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 13 transitions.
Graph (trivial) has 101 edges and 205 vertex of which 8 / 205 are part of one of the 4 SCC in 0 ms
Free SCC test removed 4 places
Iterating post reduction 15 with 18 rules applied. Total rules applied 277 place count 201 transition count 347
Reduce places removed 4 places and 0 transitions.
Drop transitions removed 9 transitions
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 97 edges and 197 vertex of which 6 / 197 are part of one of the 3 SCC in 14 ms
Free SCC test removed 3 places
Iterating post reduction 16 with 17 rules applied. Total rules applied 294 place count 194 transition count 335
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 5 transitions
Reduce isomorphic transitions removed 12 transitions.
Graph (trivial) has 94 edges and 191 vertex of which 6 / 191 are part of one of the 3 SCC in 0 ms
Free SCC test removed 3 places
Iterating post reduction 17 with 16 rules applied. Total rules applied 310 place count 188 transition count 323
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 92 edges and 185 vertex of which 6 / 185 are part of one of the 3 SCC in 1 ms
Free SCC test removed 3 places
Iterating post reduction 18 with 15 rules applied. Total rules applied 325 place count 182 transition count 312
Reduce places removed 3 places and 0 transitions.
Drop transitions removed 7 transitions
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 11 transitions.
Graph (trivial) has 90 edges and 179 vertex of which 8 / 179 are part of one of the 4 SCC in 2 ms
Free SCC test removed 4 places
Iterating post reduction 19 with 15 rules applied. Total rules applied 340 place count 175 transition count 301
Discarding 160 places :
Also discarding 280 output transitions
Drop transitions removed 280 transitions
Remove reverse transitions (loop back) rule discarded transition t178.t175.t176 and 160 places that fell out of Prefix Of Interest.
Drop transitions removed 9 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 20 with 11 rules applied. Total rules applied 351 place count 11 transition count 11
Performed 2 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 21 with 2 Pre rules applied. Total rules applied 351 place count 11 transition count 9
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 4 places and 0 transitions.
Iterating global reduction 21 with 6 rules applied. Total rules applied 357 place count 7 transition count 9
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Graph (trivial) has 2 edges and 7 vertex of which 2 / 7 are part of one of the 1 SCC in 0 ms
Free SCC test removed 1 places
Iterating post reduction 21 with 2 rules applied. Total rules applied 359 place count 6 transition count 8
Drop transitions removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 22 with 2 rules applied. Total rules applied 361 place count 6 transition count 6
Applied a total of 361 rules in 66 ms. Remains 6 /325 variables (removed 319) and now considering 6/557 (removed 551) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 6 rows 6 cols
[2023-03-18 21:22:49] [INFO ] Computed 1 place invariants in 0 ms
[2023-03-18 21:22:49] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2023-03-18 21:22:49] [INFO ] After 4ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2023-03-18 21:22:49] [INFO ] After 6ms SMT Verify possible using trap constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:22:49] [INFO ] After 57ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2023-03-18 21:22:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 13 ms returned sat
[2023-03-18 21:22:50] [INFO ] After 3ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2023-03-18 21:22:50] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-18 21:22:50] [INFO ] After 137ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND (NOT p1) (NOT p2) (NOT p0)), (X (NOT (AND p1 (NOT p2) p0))), (X (AND (NOT p1) (NOT p2))), (X (NOT (AND (NOT p1) (NOT p2) p0))), (X (NOT (AND p1 (NOT p2) (NOT p0)))), (X (X (NOT (AND p1 (NOT p2) p0)))), (X (X (AND (NOT p1) (NOT p2)))), (X (X (NOT (AND (NOT p1) (NOT p2) p0)))), (X (X (NOT (AND p1 (NOT p2) (NOT p0))))), (X (X (NOT (AND p1 (NOT p2))))), (F (OR (G p1) (G (NOT p1)))), (F (OR (G p2) (G (NOT p2))))]
False Knowledge obtained : [(F (AND p1 (NOT p2) (NOT p0))), (F p2), (F (AND p1 (NOT p2))), (F (NOT (AND (NOT p1) (NOT p2))))]
Knowledge based reduction with 12 factoid took 538 ms. Reduced automaton from 6 states, 11 edges and 3 AP (stutter sensitive) to 6 states, 11 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 139 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:22:50] [INFO ] Computed 161 place invariants in 3 ms
[2023-03-18 21:22:51] [INFO ] [Real]Absence check using 161 positive place invariants in 92 ms returned sat
[2023-03-18 21:22:51] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2023-03-18 21:22:55] [INFO ] [Real]Absence check using state equation in 3852 ms returned sat
[2023-03-18 21:22:55] [INFO ] Solution in real domain found non-integer solution.
[2023-03-18 21:22:56] [INFO ] [Nat]Absence check using 161 positive place invariants in 132 ms returned sat
[2023-03-18 21:22:56] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2023-03-18 21:22:59] [INFO ] [Nat]Absence check using state equation in 3935 ms returned sat
[2023-03-18 21:23:00] [INFO ] Computed and/alt/rep : 1561/2283/1561 causal constraints (skipped 0 transitions) in 59 ms.
[2023-03-18 21:23:11] [INFO ] Deduced a trap composed of 14 places in 928 ms of which 2 ms to minimize.
java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close...
at fr.lip6.move.gal.structural.smt.SMTUtils.execAndCheckResult(SMTUtils.java:251)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithTraps(DeadlockTester.java:1255)
at fr.lip6.move.gal.structural.smt.DeadlockTester.refineWithCausalOrder(DeadlockTester.java:1177)
at fr.lip6.move.gal.structural.smt.DeadlockTester.verifyPossible(DeadlockTester.java:923)
at fr.lip6.move.gal.structural.smt.DeadlockTester.testEGap(DeadlockTester.java:520)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.computeEGknowledge(LTLPropertySolver.java:614)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.applyKnowledgeBasedReductions(LTLPropertySolver.java:580)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.checkLTLProperty(LTLPropertySolver.java:261)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStutteringLTLTest(LTLPropertySolver.java:225)
at fr.lip6.move.gal.application.solver.ltl.LTLPropertySolver.runStructuralLTLCheck(LTLPropertySolver.java:76)
at fr.lip6.move.gal.application.Application.startNoEx(Application.java:762)
at fr.lip6.move.gal.application.Application.start(Application.java:178)
at fr.lip6.move.gal.itscl.application.Application.start(Application.java:45)
at org.eclipse.equinox.internal.app.EclipseAppHandle.run(EclipseAppHandle.java:203)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.runApplication(EclipseAppLauncher.java:136)
at org.eclipse.core.runtime.internal.adaptor.EclipseAppLauncher.start(EclipseAppLauncher.java:104)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:402)
at org.eclipse.core.runtime.adaptor.EclipseStarter.run(EclipseStarter.java:255)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke0(Native Method)
at java.base/jdk.internal.reflect.NativeMethodAccessorImpl.invoke(NativeMethodAccessorImpl.java:77)
at java.base/jdk.internal.reflect.DelegatingMethodAccessorImpl.invoke(DelegatingMethodAccessorImpl.java:43)
at java.base/java.lang.reflect.Method.invoke(Method.java:568)
at org.eclipse.equinox.launcher.Main.invokeFramework(Main.java:659)
at org.eclipse.equinox.launcher.Main.basicRun(Main.java:596)
at org.eclipse.equinox.launcher.Main.run(Main.java:1467)
at org.eclipse.equinox.launcher.Main.main(Main.java:1440)
[2023-03-18 21:23:11] [WARNING] SMT solver failed with error :java.lang.RuntimeException: SMT solver raised an error when submitting script. Raised (error "Failed to assert expression: java.io.IOException: Stream close... while checking expression EG (AND (NOT p1) (NOT p2))
Could not prove EG (AND (NOT p1) (NOT p2))
Stuttering acceptance computed with spot in 195 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Product exploration explored 100000 steps with 165 reset in 370 ms.
Product exploration explored 100000 steps with 165 reset in 353 ms.
Applying partial POR strategy [false, true, false, true, true, true]
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p1) (NOT p2)), (AND (NOT p2) (NOT p1)), (AND (NOT p1) (NOT p2)), false, (NOT p2), (AND (NOT p2) p1)]
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Performed 439 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 439 rules applied. Total rules applied 439 place count 1562 transition count 1562
Performed 160 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 160 Pre rules applied. Total rules applied 439 place count 1562 transition count 1722
Deduced a syphon composed of 599 places in 2 ms
Iterating global reduction 1 with 160 rules applied. Total rules applied 599 place count 1562 transition count 1722
Performed 476 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1075 places in 14 ms
Iterating global reduction 1 with 476 rules applied. Total rules applied 1075 place count 1562 transition count 1722
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 1076 place count 1562 transition count 1721
Renaming transitions due to excessive name length > 1024 char.
Discarding 318 places :
Symmetric choice reduction at 2 with 318 rule applications. Total rules 1394 place count 1244 transition count 1403
Deduced a syphon composed of 757 places in 2 ms
Iterating global reduction 2 with 318 rules applied. Total rules applied 1712 place count 1244 transition count 1403
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 758 places in 1 ms
Iterating global reduction 2 with 1 rules applied. Total rules applied 1713 place count 1244 transition count 1403
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 1715 place count 1242 transition count 1401
Deduced a syphon composed of 756 places in 2 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 1717 place count 1242 transition count 1401
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -725
Deduced a syphon composed of 857 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 1818 place count 1242 transition count 2126
Discarding 101 places :
Symmetric choice reduction at 2 with 101 rule applications. Total rules 1919 place count 1141 transition count 1924
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 101 rules applied. Total rules applied 2020 place count 1141 transition count 1924
Performed 57 Post agglomeration using F-continuation condition.Transition count delta: -413
Deduced a syphon composed of 813 places in 0 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2077 place count 1141 transition count 2337
Discarding 57 places :
Symmetric choice reduction at 2 with 57 rule applications. Total rules 2134 place count 1084 transition count 2223
Deduced a syphon composed of 756 places in 1 ms
Iterating global reduction 2 with 57 rules applied. Total rules applied 2191 place count 1084 transition count 2223
Deduced a syphon composed of 756 places in 0 ms
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 2 with 3 rules applied. Total rules applied 2194 place count 1084 transition count 2220
Deduced a syphon composed of 756 places in 1 ms
Applied a total of 2194 rules in 1040 ms. Remains 1084 /1562 variables (removed 478) and now considering 2220/1562 (removed -658) transitions.
[2023-03-18 21:23:13] [INFO ] Redundant transitions in 61 ms returned []
// Phase 1: matrix 2220 rows 1084 cols
[2023-03-18 21:23:13] [INFO ] Computed 161 place invariants in 9 ms
[2023-03-18 21:23:14] [INFO ] Dead Transitions using invariants and state equation in 1116 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 1084/1562 places, 2220/1562 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2249 ms. Remains : 1084/1562 places, 2220/1562 transitions.
Built C files in :
/tmp/ltsmin13473913312715703779
[2023-03-18 21:23:14] [INFO ] Built C files in 32ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13473913312715703779
Running compilation step : cd /tmp/ltsmin13473913312715703779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2655 ms.
Running link step : cd /tmp/ltsmin13473913312715703779;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 69 ms.
Running LTSmin : cd /tmp/ltsmin13473913312715703779;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased10815963809185178082.hoa' '--buchi-type=spotba'
LTSmin run took 1535 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-09 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property ShieldRVt-PT-040B-LTLFireability-09 finished in 86710 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G(p0)))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 445 transitions
Trivial Post-agglo rules discarded 445 transitions
Performed 445 trivial Post agglomeration. Transition count delta: 445
Iterating post reduction 0 with 445 rules applied. Total rules applied 445 place count 1575 transition count 1130
Reduce places removed 445 places and 0 transitions.
Iterating post reduction 1 with 445 rules applied. Total rules applied 890 place count 1130 transition count 1130
Performed 308 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 308 Pre rules applied. Total rules applied 890 place count 1130 transition count 822
Deduced a syphon composed of 308 places in 1 ms
Reduce places removed 308 places and 0 transitions.
Iterating global reduction 2 with 616 rules applied. Total rules applied 1506 place count 822 transition count 822
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 1517 place count 811 transition count 811
Iterating global reduction 2 with 11 rules applied. Total rules applied 1528 place count 811 transition count 811
Performed 10 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 10 Pre rules applied. Total rules applied 1528 place count 811 transition count 801
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 1548 place count 801 transition count 801
Performed 357 Post agglomeration using F-continuation condition.Transition count delta: 357
Deduced a syphon composed of 357 places in 0 ms
Reduce places removed 357 places and 0 transitions.
Iterating global reduction 2 with 714 rules applied. Total rules applied 2262 place count 444 transition count 444
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 2263 place count 444 transition count 443
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2265 place count 443 transition count 442
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 3 with 202 rules applied. Total rules applied 2467 place count 342 transition count 542
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 3 with 34 rules applied. Total rules applied 2501 place count 325 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 3 with 2 rules applied. Total rules applied 2503 place count 323 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2504 place count 322 transition count 556
Applied a total of 2504 rules in 138 ms. Remains 322 /1576 variables (removed 1254) and now considering 556/1576 (removed 1020) transitions.
// Phase 1: matrix 556 rows 322 cols
[2023-03-18 21:23:19] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:23:20] [INFO ] Implicit Places using invariants in 840 ms returned []
[2023-03-18 21:23:20] [INFO ] Invariant cache hit.
[2023-03-18 21:23:20] [INFO ] Implicit Places using invariants and state equation in 295 ms returned []
Implicit Place search using SMT with State Equation took 1150 ms to find 0 implicit places.
[2023-03-18 21:23:20] [INFO ] Redundant transitions in 4 ms returned []
[2023-03-18 21:23:20] [INFO ] Invariant cache hit.
[2023-03-18 21:23:20] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 322/1576 places, 556/1576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1519 ms. Remains : 322/1576 places, 556/1576 transitions.
Stuttering acceptance computed with spot in 44 ms :[(NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={0} source=0 dest: 0}]], initial=0, aps=[p0:(EQ s97 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null][true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-10 finished in 1575 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1||X(p1)))||p0)))'
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 157 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:23:20] [INFO ] Computed 161 place invariants in 15 ms
[2023-03-18 21:23:21] [INFO ] Implicit Places using invariants in 496 ms returned []
[2023-03-18 21:23:21] [INFO ] Invariant cache hit.
[2023-03-18 21:23:22] [INFO ] Implicit Places using invariants and state equation in 1034 ms returned []
Implicit Place search using SMT with State Equation took 1565 ms to find 0 implicit places.
[2023-03-18 21:23:22] [INFO ] Invariant cache hit.
[2023-03-18 21:23:23] [INFO ] Dead Transitions using invariants and state equation in 856 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2580 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 71 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(EQ s753 0), p0:(OR (EQ s1545 1) (EQ s725 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 2 reset in 524 ms.
Product exploration explored 100000 steps with 3 reset in 648 ms.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 412 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 107 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 290 ms. (steps per millisecond=34 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 132446 steps, run timeout after 3001 ms. (steps per millisecond=44 ) properties seen :{}
Probabilistic random walk after 132446 steps, saw 72791 distinct states, run finished after 3001 ms. (steps per millisecond=44 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:23:28] [INFO ] Invariant cache hit.
[2023-03-18 21:23:28] [INFO ] After 237ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:23:28] [INFO ] [Nat]Absence check using 161 positive place invariants in 42 ms returned sat
[2023-03-18 21:23:29] [INFO ] After 646ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:23:30] [INFO ] Deduced a trap composed of 30 places in 307 ms of which 0 ms to minimize.
[2023-03-18 21:23:30] [INFO ] Deduced a trap composed of 21 places in 242 ms of which 1 ms to minimize.
[2023-03-18 21:23:30] [INFO ] Deduced a trap composed of 26 places in 246 ms of which 1 ms to minimize.
[2023-03-18 21:23:30] [INFO ] Deduced a trap composed of 26 places in 216 ms of which 1 ms to minimize.
[2023-03-18 21:23:31] [INFO ] Deduced a trap composed of 25 places in 230 ms of which 0 ms to minimize.
[2023-03-18 21:23:31] [INFO ] Deduced a trap composed of 37 places in 244 ms of which 1 ms to minimize.
[2023-03-18 21:23:31] [INFO ] Deduced a trap composed of 42 places in 213 ms of which 0 ms to minimize.
[2023-03-18 21:23:31] [INFO ] Deduced a trap composed of 38 places in 209 ms of which 1 ms to minimize.
[2023-03-18 21:23:32] [INFO ] Deduced a trap composed of 21 places in 243 ms of which 1 ms to minimize.
[2023-03-18 21:23:32] [INFO ] Deduced a trap composed of 33 places in 198 ms of which 1 ms to minimize.
[2023-03-18 21:23:32] [INFO ] Deduced a trap composed of 48 places in 192 ms of which 1 ms to minimize.
[2023-03-18 21:23:32] [INFO ] Deduced a trap composed of 36 places in 199 ms of which 1 ms to minimize.
[2023-03-18 21:23:33] [INFO ] Deduced a trap composed of 32 places in 190 ms of which 1 ms to minimize.
[2023-03-18 21:23:33] [INFO ] Deduced a trap composed of 34 places in 187 ms of which 1 ms to minimize.
[2023-03-18 21:23:33] [INFO ] Deduced a trap composed of 43 places in 164 ms of which 0 ms to minimize.
[2023-03-18 21:23:33] [INFO ] Deduced a trap composed of 50 places in 202 ms of which 0 ms to minimize.
[2023-03-18 21:23:34] [INFO ] Deduced a trap composed of 42 places in 208 ms of which 0 ms to minimize.
[2023-03-18 21:23:34] [INFO ] Deduced a trap composed of 38 places in 157 ms of which 0 ms to minimize.
[2023-03-18 21:23:34] [INFO ] Deduced a trap composed of 45 places in 152 ms of which 1 ms to minimize.
[2023-03-18 21:23:34] [INFO ] Deduced a trap composed of 45 places in 139 ms of which 0 ms to minimize.
[2023-03-18 21:23:34] [INFO ] Deduced a trap composed of 56 places in 133 ms of which 0 ms to minimize.
[2023-03-18 21:23:34] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5220 ms
[2023-03-18 21:23:35] [INFO ] After 6088ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 143 ms.
[2023-03-18 21:23:35] [INFO ] After 6553ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 76 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1562 transition count 1127
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1127 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1126 transition count 1126
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 872 place count 1126 transition count 807
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1510 place count 807 transition count 807
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2234 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2235 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2237 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2439 place count 343 transition count 541
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2471 place count 327 transition count 557
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2472 place count 327 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2473 place count 326 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2474 place count 325 transition count 555
Applied a total of 2474 rules in 111 ms. Remains 325 /1562 variables (removed 1237) and now considering 555/1562 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 111 ms. Remains : 325/1562 places, 555/1562 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 182 ms. (steps per millisecond=54 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 72 ms. (steps per millisecond=138 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 77 ms. (steps per millisecond=129 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 157709 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157709 steps, saw 104249 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 325 cols
[2023-03-18 21:23:38] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:23:39] [INFO ] After 94ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:23:39] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-18 21:23:39] [INFO ] After 153ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:23:39] [INFO ] After 226ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-18 21:23:39] [INFO ] After 376ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 74 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 20 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-18 21:23:39] [INFO ] Invariant cache hit.
[2023-03-18 21:23:39] [INFO ] Implicit Places using invariants in 278 ms returned []
[2023-03-18 21:23:39] [INFO ] Invariant cache hit.
[2023-03-18 21:23:40] [INFO ] Implicit Places using invariants and state equation in 414 ms returned []
Implicit Place search using SMT with State Equation took 695 ms to find 0 implicit places.
[2023-03-18 21:23:40] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:23:40] [INFO ] Invariant cache hit.
[2023-03-18 21:23:40] [INFO ] Dead Transitions using invariants and state equation in 384 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1120 ms. Remains : 325/325 places, 555/555 transitions.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 27 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 541 rows 318 cols
[2023-03-18 21:23:40] [INFO ] Computed 157 place invariants in 2 ms
[2023-03-18 21:23:40] [INFO ] After 79ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:23:40] [INFO ] [Nat]Absence check using 157 positive place invariants in 17 ms returned sat
[2023-03-18 21:23:40] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:23:41] [INFO ] After 218ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-18 21:23:41] [INFO ] After 355ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 310 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 174 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 154 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 61 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:23:41] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-18 21:23:42] [INFO ] Implicit Places using invariants in 398 ms returned []
[2023-03-18 21:23:42] [INFO ] Invariant cache hit.
[2023-03-18 21:23:43] [INFO ] Implicit Places using invariants and state equation in 1154 ms returned []
Implicit Place search using SMT with State Equation took 1553 ms to find 0 implicit places.
[2023-03-18 21:23:43] [INFO ] Invariant cache hit.
[2023-03-18 21:23:44] [INFO ] Dead Transitions using invariants and state equation in 745 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2360 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Computed a total of 478 stabilizing places and 478 stable transitions
Computed a total of 478 stabilizing places and 478 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 477 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 118 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 221 ms. (steps per millisecond=45 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 157508 steps, run timeout after 3001 ms. (steps per millisecond=52 ) properties seen :{}
Probabilistic random walk after 157508 steps, saw 82109 distinct states, run finished after 3001 ms. (steps per millisecond=52 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:23:48] [INFO ] Invariant cache hit.
[2023-03-18 21:23:48] [INFO ] After 236ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:23:48] [INFO ] [Nat]Absence check using 161 positive place invariants in 40 ms returned sat
[2023-03-18 21:23:49] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:23:49] [INFO ] Deduced a trap composed of 30 places in 246 ms of which 1 ms to minimize.
[2023-03-18 21:23:49] [INFO ] Deduced a trap composed of 21 places in 224 ms of which 0 ms to minimize.
[2023-03-18 21:23:50] [INFO ] Deduced a trap composed of 26 places in 266 ms of which 1 ms to minimize.
[2023-03-18 21:23:50] [INFO ] Deduced a trap composed of 26 places in 230 ms of which 1 ms to minimize.
[2023-03-18 21:23:50] [INFO ] Deduced a trap composed of 25 places in 204 ms of which 1 ms to minimize.
[2023-03-18 21:23:50] [INFO ] Deduced a trap composed of 37 places in 197 ms of which 1 ms to minimize.
[2023-03-18 21:23:51] [INFO ] Deduced a trap composed of 42 places in 224 ms of which 0 ms to minimize.
[2023-03-18 21:23:51] [INFO ] Deduced a trap composed of 38 places in 267 ms of which 1 ms to minimize.
[2023-03-18 21:23:51] [INFO ] Deduced a trap composed of 21 places in 204 ms of which 1 ms to minimize.
[2023-03-18 21:23:52] [INFO ] Deduced a trap composed of 33 places in 236 ms of which 1 ms to minimize.
[2023-03-18 21:23:52] [INFO ] Deduced a trap composed of 48 places in 191 ms of which 0 ms to minimize.
[2023-03-18 21:23:52] [INFO ] Deduced a trap composed of 36 places in 205 ms of which 1 ms to minimize.
[2023-03-18 21:23:52] [INFO ] Deduced a trap composed of 32 places in 192 ms of which 1 ms to minimize.
[2023-03-18 21:23:53] [INFO ] Deduced a trap composed of 34 places in 226 ms of which 1 ms to minimize.
[2023-03-18 21:23:53] [INFO ] Deduced a trap composed of 43 places in 244 ms of which 0 ms to minimize.
[2023-03-18 21:23:53] [INFO ] Deduced a trap composed of 50 places in 212 ms of which 1 ms to minimize.
[2023-03-18 21:23:53] [INFO ] Deduced a trap composed of 42 places in 205 ms of which 0 ms to minimize.
[2023-03-18 21:23:54] [INFO ] Deduced a trap composed of 38 places in 230 ms of which 1 ms to minimize.
[2023-03-18 21:23:54] [INFO ] Deduced a trap composed of 45 places in 165 ms of which 1 ms to minimize.
[2023-03-18 21:23:54] [INFO ] Deduced a trap composed of 45 places in 202 ms of which 1 ms to minimize.
[2023-03-18 21:23:54] [INFO ] Deduced a trap composed of 56 places in 151 ms of which 1 ms to minimize.
[2023-03-18 21:23:54] [INFO ] Trap strengthening (SAT) tested/added 22/21 trap constraints in 5662 ms
[2023-03-18 21:23:55] [INFO ] After 6793ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 346 ms.
[2023-03-18 21:23:55] [INFO ] After 7433ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 103 ms.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Drop transitions removed 435 transitions
Trivial Post-agglo rules discarded 435 transitions
Performed 435 trivial Post agglomeration. Transition count delta: 435
Iterating post reduction 0 with 435 rules applied. Total rules applied 435 place count 1562 transition count 1127
Reduce places removed 435 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 436 rules applied. Total rules applied 871 place count 1127 transition count 1126
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 872 place count 1126 transition count 1126
Performed 319 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 319 Pre rules applied. Total rules applied 872 place count 1126 transition count 807
Deduced a syphon composed of 319 places in 1 ms
Reduce places removed 319 places and 0 transitions.
Iterating global reduction 3 with 638 rules applied. Total rules applied 1510 place count 807 transition count 807
Performed 362 Post agglomeration using F-continuation condition.Transition count delta: 362
Deduced a syphon composed of 362 places in 0 ms
Reduce places removed 362 places and 0 transitions.
Iterating global reduction 3 with 724 rules applied. Total rules applied 2234 place count 445 transition count 445
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2235 place count 445 transition count 444
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2237 place count 444 transition count 443
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2439 place count 343 transition count 541
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2471 place count 327 transition count 557
Drop transitions removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2472 place count 327 transition count 556
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 5 with 1 rules applied. Total rules applied 2473 place count 326 transition count 555
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 2474 place count 325 transition count 555
Applied a total of 2474 rules in 170 ms. Remains 325 /1562 variables (removed 1237) and now considering 555/1562 (removed 1007) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 170 ms. Remains : 325/1562 places, 555/1562 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 146 ms. (steps per millisecond=68 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 48 ms. (steps per millisecond=208 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 3 resets, run finished after 53 ms. (steps per millisecond=188 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 198230 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 198230 steps, saw 132721 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 325 cols
[2023-03-18 21:23:59] [INFO ] Computed 160 place invariants in 3 ms
[2023-03-18 21:23:59] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:23:59] [INFO ] [Nat]Absence check using 160 positive place invariants in 16 ms returned sat
[2023-03-18 21:23:59] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:23:59] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 21:23:59] [INFO ] After 351ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 1 properties in 119 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-18 21:23:59] [INFO ] Invariant cache hit.
[2023-03-18 21:24:00] [INFO ] Implicit Places using invariants in 163 ms returned []
[2023-03-18 21:24:00] [INFO ] Invariant cache hit.
[2023-03-18 21:24:00] [INFO ] Implicit Places using invariants and state equation in 308 ms returned []
Implicit Place search using SMT with State Equation took 473 ms to find 0 implicit places.
[2023-03-18 21:24:00] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:24:00] [INFO ] Invariant cache hit.
[2023-03-18 21:24:00] [INFO ] Dead Transitions using invariants and state equation in 233 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 721 ms. Remains : 325/325 places, 555/555 transitions.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 23 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 541 rows 318 cols
[2023-03-18 21:24:00] [INFO ] Computed 157 place invariants in 1 ms
[2023-03-18 21:24:00] [INFO ] After 85ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:24:00] [INFO ] [Nat]Absence check using 157 positive place invariants in 15 ms returned sat
[2023-03-18 21:24:00] [INFO ] After 133ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:24:00] [INFO ] After 183ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 29 ms.
[2023-03-18 21:24:00] [INFO ] After 302ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 291 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 146 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 134 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 1 reset in 362 ms.
Product exploration explored 100000 steps with 1 reset in 472 ms.
Built C files in :
/tmp/ltsmin11549522466394355369
[2023-03-18 21:24:02] [INFO ] Built C files in 35ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11549522466394355369
Running compilation step : cd /tmp/ltsmin11549522466394355369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2536 ms.
Running link step : cd /tmp/ltsmin11549522466394355369;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin11549522466394355369;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased11805734171614328495.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 1562 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1562/1562 places, 1562/1562 transitions.
Applied a total of 0 rules in 72 ms. Remains 1562 /1562 variables (removed 0) and now considering 1562/1562 (removed 0) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:24:17] [INFO ] Computed 161 place invariants in 6 ms
[2023-03-18 21:24:18] [INFO ] Implicit Places using invariants in 353 ms returned []
[2023-03-18 21:24:18] [INFO ] Invariant cache hit.
[2023-03-18 21:24:19] [INFO ] Implicit Places using invariants and state equation in 1189 ms returned []
Implicit Place search using SMT with State Equation took 1545 ms to find 0 implicit places.
[2023-03-18 21:24:19] [INFO ] Invariant cache hit.
[2023-03-18 21:24:20] [INFO ] Dead Transitions using invariants and state equation in 694 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2311 ms. Remains : 1562/1562 places, 1562/1562 transitions.
Built C files in :
/tmp/ltsmin10876800234728080267
[2023-03-18 21:24:20] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10876800234728080267
Running compilation step : cd /tmp/ltsmin10876800234728080267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2671 ms.
Running link step : cd /tmp/ltsmin10876800234728080267;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 64 ms.
Running LTSmin : cd /tmp/ltsmin10876800234728080267;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased13605870219743358491.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2023-03-18 21:24:35] [INFO ] Flatten gal took : 64 ms
[2023-03-18 21:24:35] [INFO ] Flatten gal took : 47 ms
[2023-03-18 21:24:35] [INFO ] Time to serialize gal into /tmp/LTL15468805621766157977.gal : 10 ms
[2023-03-18 21:24:35] [INFO ] Time to serialize properties into /tmp/LTL8355862686218015890.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15468805621766157977.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10822296750005126990.hoa' '-atoms' '/tmp/LTL8355862686218015890.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL8355862686218015890.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10822296750005126990.hoa
Detected timeout of ITS tools.
[2023-03-18 21:24:50] [INFO ] Flatten gal took : 48 ms
[2023-03-18 21:24:50] [INFO ] Flatten gal took : 38 ms
[2023-03-18 21:24:50] [INFO ] Time to serialize gal into /tmp/LTL15743620334502466200.gal : 7 ms
[2023-03-18 21:24:50] [INFO ] Time to serialize properties into /tmp/LTL16929092215432929864.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15743620334502466200.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16929092215432929864.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(("((p1981==1)||(p921==0))")||(G(("(p957==0)")||(X("(p957==0)")))))))
Formula 0 simplified : F(!"((p1981==1)||(p921==0))" & F(!"(p957==0)" & X!"(p957==0)"))
Detected timeout of ITS tools.
[2023-03-18 21:25:05] [INFO ] Flatten gal took : 30 ms
[2023-03-18 21:25:05] [INFO ] Applying decomposition
[2023-03-18 21:25:05] [INFO ] Flatten gal took : 30 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/convert-linux64' '-i' '/tmp/graph9914862790304325380.txt' '-o' '/tmp/graph9914862790304325380.bin' '-w' '/tmp/graph9914862790304325380.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph9914862790304325380.bin' '-l' '-1' '-v' '-w' '/tmp/graph9914862790304325380.weights' '-q' '0' '-e' '0.001'
[2023-03-18 21:25:05] [INFO ] Decomposing Gal with order
[2023-03-18 21:25:06] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-18 21:25:06] [INFO ] Removed a total of 400 redundant transitions.
[2023-03-18 21:25:06] [INFO ] Flatten gal took : 154 ms
[2023-03-18 21:25:06] [INFO ] Fuse similar labels procedure discarded/fused a total of 0 labels/synchronizations in 12 ms.
[2023-03-18 21:25:06] [INFO ] Time to serialize gal into /tmp/LTL14738929665476125144.gal : 38 ms
[2023-03-18 21:25:06] [INFO ] Time to serialize properties into /tmp/LTL12447008104340002156.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14738929665476125144.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12447008104340002156.ltl' '-c' '-stutter-deadlock'

its-ltl command run as :

/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(("((i37.i3.u612.p1981==1)||(i18.i4.u286.p921==0))")||(G(("(i19.i3.u299.p957==0)")||(X("(i19.i3.u299.p957==0)")))))))
Formula 0 simplified : F(!"((i37.i3.u612.p1981==1)||(i18.i4.u286.p921==0))" & F(!"(i19.i3.u299.p957==0)" & X!"(i19.i3.u299.p957==0)"))
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin15770746674937389065
[2023-03-18 21:25:21] [INFO ] Built C files in 38ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15770746674937389065
Running compilation step : cd /tmp/ltsmin15770746674937389065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2835 ms.
Running link step : cd /tmp/ltsmin15770746674937389065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 63 ms.
Running LTSmin : cd /tmp/ltsmin15770746674937389065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](([](((LTLAPp1==true)||X((LTLAPp1==true))))||(LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 135867 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((p0&&X(X(p1)))))'
Support contains 2 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 1561 transition count 1561
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 1561 transition count 1561
Applied a total of 30 rules in 108 ms. Remains 1561 /1576 variables (removed 15) and now considering 1561/1576 (removed 15) transitions.
// Phase 1: matrix 1561 rows 1561 cols
[2023-03-18 21:25:36] [INFO ] Computed 161 place invariants in 4 ms
[2023-03-18 21:25:37] [INFO ] Implicit Places using invariants in 391 ms returned []
[2023-03-18 21:25:37] [INFO ] Invariant cache hit.
[2023-03-18 21:25:37] [INFO ] Implicit Places using invariants and state equation in 855 ms returned []
Implicit Place search using SMT with State Equation took 1262 ms to find 0 implicit places.
[2023-03-18 21:25:37] [INFO ] Invariant cache hit.
[2023-03-18 21:25:38] [INFO ] Dead Transitions using invariants and state equation in 650 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1561/1576 places, 1561/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2034 ms. Remains : 1561/1576 places, 1561/1576 transitions.
Stuttering acceptance computed with spot in 142 ms :[(NOT p1), (OR (NOT p0) (NOT p1)), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={0} source=0 dest: 2}, { cond=(NOT p0), acceptance={0} source=0 dest: 3}], [{ cond=p0, acceptance={0} source=1 dest: 0}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=2 dest: 3}], [{ cond=(AND p0 (NOT p1)), acceptance={0} source=3 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={0} source=3 dest: 1}]], initial=1, aps=[p0:(NEQ s1028 1), p1:(EQ s344 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 3720 steps with 0 reset in 15 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-12 finished in 2217 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((F(p1)&&X(p2)&&p0)))'
Support contains 4 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 1563 transition count 1563
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 1563 transition count 1563
Applied a total of 26 rules in 115 ms. Remains 1563 /1576 variables (removed 13) and now considering 1563/1576 (removed 13) transitions.
// Phase 1: matrix 1563 rows 1563 cols
[2023-03-18 21:25:38] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-18 21:25:39] [INFO ] Implicit Places using invariants in 324 ms returned []
[2023-03-18 21:25:39] [INFO ] Invariant cache hit.
[2023-03-18 21:25:40] [INFO ] Implicit Places using invariants and state equation in 837 ms returned []
Implicit Place search using SMT with State Equation took 1163 ms to find 0 implicit places.
[2023-03-18 21:25:40] [INFO ] Invariant cache hit.
[2023-03-18 21:25:40] [INFO ] Dead Transitions using invariants and state equation in 625 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1563/1576 places, 1563/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 1918 ms. Remains : 1563/1576 places, 1563/1576 transitions.
Stuttering acceptance computed with spot in 114 ms :[(OR (NOT p0) (NOT p1) (NOT p2)), (OR (NOT p0) (NOT p1) (NOT p2)), true, (NOT p1), (NOT p2)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 3}, { cond=p0, acceptance={} source=1 dest: 4}], [{ cond=true, acceptance={} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={} source=3 dest: 3}], [{ cond=(NOT p2), acceptance={} source=4 dest: 2}]], initial=0, aps=[p0:(AND (EQ s962 1) (EQ s488 1)), p1:(AND (EQ s962 0) (EQ s1077 1)), p2:(EQ s137 1)], nbAcceptance=0, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null][false, false, false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-13 finished in 2054 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X(F(p0)))))'
Support contains 1 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 1562 transition count 1562
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 1562 transition count 1562
Applied a total of 28 rules in 100 ms. Remains 1562 /1576 variables (removed 14) and now considering 1562/1576 (removed 14) transitions.
// Phase 1: matrix 1562 rows 1562 cols
[2023-03-18 21:25:40] [INFO ] Computed 161 place invariants in 8 ms
[2023-03-18 21:25:41] [INFO ] Implicit Places using invariants in 325 ms returned []
[2023-03-18 21:25:41] [INFO ] Invariant cache hit.
[2023-03-18 21:25:42] [INFO ] Implicit Places using invariants and state equation in 1085 ms returned []
Implicit Place search using SMT with State Equation took 1424 ms to find 0 implicit places.
[2023-03-18 21:25:42] [INFO ] Invariant cache hit.
[2023-03-18 21:25:43] [INFO ] Dead Transitions using invariants and state equation in 681 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 1562/1576 places, 1562/1576 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2206 ms. Remains : 1562/1576 places, 1562/1576 transitions.
Stuttering acceptance computed with spot in 109 ms :[(NOT p0), (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-14 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:(EQ s1501 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Stuttering criterion allowed to conclude after 43345 steps with 53 reset in 140 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-14 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-14 finished in 2471 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((F(p0) U (p1&&F(G((p2 U p1))))))'
Support contains 5 out of 1576 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 443 rules applied. Total rules applied 443 place count 1575 transition count 1132
Reduce places removed 443 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 444 rules applied. Total rules applied 887 place count 1132 transition count 1131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 888 place count 1131 transition count 1131
Performed 306 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 306 Pre rules applied. Total rules applied 888 place count 1131 transition count 825
Deduced a syphon composed of 306 places in 2 ms
Reduce places removed 306 places and 0 transitions.
Iterating global reduction 3 with 612 rules applied. Total rules applied 1500 place count 825 transition count 825
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1510 place count 815 transition count 815
Iterating global reduction 3 with 10 rules applied. Total rules applied 1520 place count 815 transition count 815
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1520 place count 815 transition count 806
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1538 place count 806 transition count 806
Performed 358 Post agglomeration using F-continuation condition.Transition count delta: 358
Deduced a syphon composed of 358 places in 0 ms
Reduce places removed 358 places and 0 transitions.
Iterating global reduction 3 with 716 rules applied. Total rules applied 2254 place count 448 transition count 448
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2255 place count 448 transition count 447
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 1 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2257 place count 447 transition count 446
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -100
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2459 place count 346 transition count 546
Performed 17 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 17 places in 0 ms
Reduce places removed 17 places and 0 transitions.
Iterating global reduction 4 with 34 rules applied. Total rules applied 2493 place count 329 transition count 562
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2495 place count 327 transition count 560
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2496 place count 326 transition count 560
Applied a total of 2496 rules in 172 ms. Remains 326 /1576 variables (removed 1250) and now considering 560/1576 (removed 1016) transitions.
// Phase 1: matrix 560 rows 326 cols
[2023-03-18 21:25:43] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:25:43] [INFO ] Implicit Places using invariants in 271 ms returned []
[2023-03-18 21:25:43] [INFO ] Invariant cache hit.
[2023-03-18 21:25:44] [INFO ] Implicit Places using invariants and state equation in 257 ms returned []
Implicit Place search using SMT with State Equation took 535 ms to find 0 implicit places.
[2023-03-18 21:25:44] [INFO ] Redundant transitions in 8 ms returned []
[2023-03-18 21:25:44] [INFO ] Invariant cache hit.
[2023-03-18 21:25:44] [INFO ] Dead Transitions using invariants and state equation in 270 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 326/1576 places, 560/1576 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1018 ms. Remains : 326/1576 places, 560/1576 transitions.
Stuttering acceptance computed with spot in 242 ms :[(NOT p1), (NOT p0), (NOT p1), (NOT p1)]
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(NOT p1), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p1) (NOT p0)), acceptance={} source=0 dest: 1}, { cond=p1, acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=(OR p1 p2), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=2 dest: 3}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={0} source=3 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p1:(EQ s228 1), p0:(AND (EQ s255 1) (EQ s257 1) (EQ s261 1)), p2:(EQ s154 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null, null][true, true, true, true]]
Stuttering criterion allowed to conclude after 0 steps with 0 reset in 1 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ShieldRVt-PT-040B-LTLFireability-15 finished in 1301 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((G((p1||X(p1)))||p0)))'
Found a Lengthening insensitive property : ShieldRVt-PT-040B-LTLFireability-11
Stuttering acceptance computed with spot in 148 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 1576 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 1576/1576 places, 1576/1576 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 443 transitions
Trivial Post-agglo rules discarded 443 transitions
Performed 443 trivial Post agglomeration. Transition count delta: 443
Iterating post reduction 0 with 443 rules applied. Total rules applied 443 place count 1575 transition count 1132
Reduce places removed 443 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 444 rules applied. Total rules applied 887 place count 1132 transition count 1131
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 888 place count 1131 transition count 1131
Performed 307 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 307 Pre rules applied. Total rules applied 888 place count 1131 transition count 824
Deduced a syphon composed of 307 places in 1 ms
Reduce places removed 307 places and 0 transitions.
Iterating global reduction 3 with 614 rules applied. Total rules applied 1502 place count 824 transition count 824
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1512 place count 814 transition count 814
Iterating global reduction 3 with 10 rules applied. Total rules applied 1522 place count 814 transition count 814
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 9 Pre rules applied. Total rules applied 1522 place count 814 transition count 805
Deduced a syphon composed of 9 places in 1 ms
Reduce places removed 9 places and 0 transitions.
Iterating global reduction 3 with 18 rules applied. Total rules applied 1540 place count 805 transition count 805
Performed 359 Post agglomeration using F-continuation condition.Transition count delta: 359
Deduced a syphon composed of 359 places in 1 ms
Reduce places removed 359 places and 0 transitions.
Iterating global reduction 3 with 718 rules applied. Total rules applied 2258 place count 446 transition count 446
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 2259 place count 446 transition count 445
Renaming transitions due to excessive name length > 1024 char.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2261 place count 445 transition count 444
Performed 101 Post agglomeration using F-continuation condition.Transition count delta: -98
Deduced a syphon composed of 101 places in 0 ms
Reduce places removed 101 places and 0 transitions.
Iterating global reduction 4 with 202 rules applied. Total rules applied 2463 place count 344 transition count 542
Performed 16 Post agglomeration using F-continuation condition.Transition count delta: -16
Deduced a syphon composed of 16 places in 0 ms
Reduce places removed 16 places and 0 transitions.
Iterating global reduction 4 with 32 rules applied. Total rules applied 2495 place count 328 transition count 558
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 2497 place count 326 transition count 556
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 4 with 1 rules applied. Total rules applied 2498 place count 325 transition count 556
Applied a total of 2498 rules in 206 ms. Remains 325 /1576 variables (removed 1251) and now considering 556/1576 (removed 1020) transitions.
// Phase 1: matrix 556 rows 325 cols
[2023-03-18 21:25:45] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:25:45] [INFO ] Implicit Places using invariants in 223 ms returned []
[2023-03-18 21:25:45] [INFO ] Invariant cache hit.
[2023-03-18 21:25:45] [INFO ] Implicit Places using invariants and state equation in 362 ms returned []
Implicit Place search using SMT with State Equation took 611 ms to find 0 implicit places.
[2023-03-18 21:25:45] [INFO ] Invariant cache hit.
[2023-03-18 21:25:45] [INFO ] Dead Transitions using invariants and state equation in 222 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 325/1576 places, 556/1576 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 1052 ms. Remains : 325/1576 places, 556/1576 transitions.
Running random walk in product with property : ShieldRVt-PT-040B-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=3 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=3 dest: 2}, { cond=p0, acceptance={} source=3 dest: 3}]], initial=3, aps=[p1:(EQ s155 0), p0:(OR (EQ s320 1) (EQ s147 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 21 reset in 459 ms.
Product exploration explored 100000 steps with 23 reset in 438 ms.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 398 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 144 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 3 resets, run finished after 371 ms. (steps per millisecond=26 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 47 ms. (steps per millisecond=212 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 58 ms. (steps per millisecond=172 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 252657 steps, run timeout after 3001 ms. (steps per millisecond=84 ) properties seen :{}
Probabilistic random walk after 252657 steps, saw 172368 distinct states, run finished after 3001 ms. (steps per millisecond=84 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:25:50] [INFO ] Invariant cache hit.
[2023-03-18 21:25:50] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:25:51] [INFO ] [Nat]Absence check using 160 positive place invariants in 13 ms returned sat
[2023-03-18 21:25:51] [INFO ] After 137ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:25:51] [INFO ] After 202ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 39 ms.
[2023-03-18 21:25:51] [INFO ] After 341ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 44 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 556/556 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 325 transition count 555
Applied a total of 1 rules in 10 ms. Remains 325 /325 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 10 ms. Remains : 325/325 places, 555/556 transitions.
Incomplete random walk after 10000 steps, including 3 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 60 ms. (steps per millisecond=166 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 39 ms. (steps per millisecond=256 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 224353 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224353 steps, saw 148641 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 325 cols
[2023-03-18 21:25:54] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:25:54] [INFO ] After 62ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:25:54] [INFO ] [Nat]Absence check using 160 positive place invariants in 17 ms returned sat
[2023-03-18 21:25:55] [INFO ] After 146ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:25:55] [INFO ] After 211ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 40 ms.
[2023-03-18 21:25:55] [INFO ] After 354ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 1 properties in 54 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 6 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 6 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-18 21:25:55] [INFO ] Invariant cache hit.
[2023-03-18 21:25:55] [INFO ] Implicit Places using invariants in 142 ms returned []
[2023-03-18 21:25:55] [INFO ] Invariant cache hit.
[2023-03-18 21:25:55] [INFO ] Implicit Places using invariants and state equation in 282 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-18 21:25:55] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:25:55] [INFO ] Invariant cache hit.
[2023-03-18 21:25:55] [INFO ] Dead Transitions using invariants and state equation in 219 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 696 ms. Remains : 325/325 places, 555/555 transitions.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 1 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 20 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 541 rows 318 cols
[2023-03-18 21:25:55] [INFO ] Computed 157 place invariants in 1 ms
[2023-03-18 21:25:56] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-18 21:25:56] [INFO ] [Nat]Absence check using 157 positive place invariants in 26 ms returned sat
[2023-03-18 21:25:56] [INFO ] After 192ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-18 21:25:56] [INFO ] After 256ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 44 ms.
[2023-03-18 21:25:56] [INFO ] After 417ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND p1 p0), (X (NOT (AND (NOT p0) (NOT p1)))), (X p1), (X (NOT (AND (NOT p0) p1))), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1))))), true, (X (X p1)), (X (X (NOT (AND (NOT p0) p1)))), (X (X p0))]
False Knowledge obtained : [(F (NOT p1))]
Knowledge based reduction with 10 factoid took 527 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 181 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 156 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 325/325 places, 556/556 transitions.
Applied a total of 0 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 556/556 (removed 0) transitions.
// Phase 1: matrix 556 rows 325 cols
[2023-03-18 21:25:57] [INFO ] Computed 160 place invariants in 2 ms
[2023-03-18 21:25:57] [INFO ] Implicit Places using invariants in 229 ms returned []
[2023-03-18 21:25:57] [INFO ] Invariant cache hit.
[2023-03-18 21:25:57] [INFO ] Implicit Places using invariants and state equation in 380 ms returned []
Implicit Place search using SMT with State Equation took 637 ms to find 0 implicit places.
[2023-03-18 21:25:57] [INFO ] Invariant cache hit.
[2023-03-18 21:25:58] [INFO ] Dead Transitions using invariants and state equation in 305 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 949 ms. Remains : 325/325 places, 556/556 transitions.
Computed a total of 0 stabilizing places and 0 stable transitions
Computed a total of 0 stabilizing places and 0 stable transitions
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 443 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 4 resets, run finished after 297 ms. (steps per millisecond=33 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 49 ms. (steps per millisecond=204 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 234632 steps, run timeout after 3001 ms. (steps per millisecond=78 ) properties seen :{}
Probabilistic random walk after 234632 steps, saw 158754 distinct states, run finished after 3001 ms. (steps per millisecond=78 ) properties seen :0
Running SMT prover for 4 properties.
[2023-03-18 21:26:02] [INFO ] Invariant cache hit.
[2023-03-18 21:26:02] [INFO ] After 73ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:26:02] [INFO ] [Nat]Absence check using 160 positive place invariants in 18 ms returned sat
[2023-03-18 21:26:02] [INFO ] After 156ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:26:02] [INFO ] After 224ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 42 ms.
[2023-03-18 21:26:02] [INFO ] After 364ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 59 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 556/556 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 325 transition count 555
Applied a total of 1 rules in 7 ms. Remains 325 /325 variables (removed 0) and now considering 555/556 (removed 1) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 7 ms. Remains : 325/325 places, 555/556 transitions.
Incomplete random walk after 10000 steps, including 4 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 33 ms. (steps per millisecond=303 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 35 ms. (steps per millisecond=285 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 238916 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 238916 steps, saw 157624 distinct states, run finished after 3003 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 4 properties.
// Phase 1: matrix 555 rows 325 cols
[2023-03-18 21:26:06] [INFO ] Computed 160 place invariants in 1 ms
[2023-03-18 21:26:06] [INFO ] After 53ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:26:06] [INFO ] [Nat]Absence check using 160 positive place invariants in 16 ms returned sat
[2023-03-18 21:26:06] [INFO ] After 149ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:26:06] [INFO ] After 249ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 53 ms.
[2023-03-18 21:26:06] [INFO ] After 398ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 60 ms.
Support contains 3 out of 325 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 9 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 9 ms. Remains : 325/325 places, 555/555 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 325/325 places, 555/555 transitions.
Applied a total of 0 rules in 9 ms. Remains 325 /325 variables (removed 0) and now considering 555/555 (removed 0) transitions.
[2023-03-18 21:26:06] [INFO ] Invariant cache hit.
[2023-03-18 21:26:06] [INFO ] Implicit Places using invariants in 164 ms returned []
[2023-03-18 21:26:06] [INFO ] Invariant cache hit.
[2023-03-18 21:26:07] [INFO ] Implicit Places using invariants and state equation in 285 ms returned []
Implicit Place search using SMT with State Equation took 451 ms to find 0 implicit places.
[2023-03-18 21:26:07] [INFO ] Redundant transitions in 3 ms returned []
[2023-03-18 21:26:07] [INFO ] Invariant cache hit.
[2023-03-18 21:26:07] [INFO ] Dead Transitions using invariants and state equation in 176 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 668 ms. Remains : 325/325 places, 555/555 transitions.
Graph (trivial) has 156 edges and 325 vertex of which 4 / 325 are part of one of the 2 SCC in 0 ms
Free SCC test removed 2 places
Drop transitions removed 5 transitions
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 6 transitions.
Reduce places removed 1 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 3 place count 322 transition count 548
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 1 with 1 Pre rules applied. Total rules applied 3 place count 322 transition count 547
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 6 place count 320 transition count 547
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 1 with 3 rules applied. Total rules applied 9 place count 318 transition count 546
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 13 place count 318 transition count 542
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 318 transition count 541
Applied a total of 14 rules in 18 ms. Remains 318 /325 variables (removed 7) and now considering 541/555 (removed 14) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 541 rows 318 cols
[2023-03-18 21:26:07] [INFO ] Computed 157 place invariants in 1 ms
[2023-03-18 21:26:07] [INFO ] After 75ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2023-03-18 21:26:07] [INFO ] [Nat]Absence check using 157 positive place invariants in 16 ms returned sat
[2023-03-18 21:26:07] [INFO ] After 164ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2023-03-18 21:26:07] [INFO ] After 245ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 47 ms.
[2023-03-18 21:26:07] [INFO ] After 397ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 p0), (X p1), (X (NOT (AND (NOT p1) (NOT p0)))), (X (NOT (AND p1 (NOT p0)))), (X p0), true, (X (X p1)), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X (NOT (AND p1 (NOT p0))))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 10 factoid took 299 ms. Reduced automaton from 4 states, 8 edges and 2 AP (stutter sensitive) to 4 states, 8 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 102 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 135 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 166 ms :[true, (NOT p1), (NOT p1), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 17 reset in 531 ms.
Stuttering criterion allowed to conclude after 89095 steps with 18 reset in 500 ms.
Treatment of property ShieldRVt-PT-040B-LTLFireability-11 finished in 24983 ms.
FORMULA ShieldRVt-PT-040B-LTLFireability-11 FALSE TECHNIQUES LENGTHENING_INSENSITIVE
[2023-03-18 21:26:09] [INFO ] Flatten gal took : 27 ms
All properties solved without resorting to exhaustive model-checking.
Total runtime 316008 ms.

BK_STOP 1679174770230

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

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

Sequence of Actions to be Executed by the VM

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

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

# this is specific to your benchmark or test

export BIN_DIR="$HOME/BenchKit/bin"

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

# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5348"
echo " Executing tool itstools"
echo " Input is ShieldRVt-PT-040B, examination is LTLFireability"
echo " Time confinement is $BK_TIME_CONFINEMENT seconds"
echo " Memory confinement is 16384 MBytes"
echo " Number of cores is 4"
echo " Run identifier is r421-tajo-167905975100316"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"

tar xzf /home/mcc/BenchKit/INPUTS/ShieldRVt-PT-040B.tgz
mv ShieldRVt-PT-040B execution
cd execution
if [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "UpperBounds" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] || [ "LTLFireability" = "StateSpace" ]; then
rm -f GenericPropertiesVerdict.xml
fi
pwd
ls -lh

echo
echo "--------------------"
echo "content from stdout:"
echo
echo "=== Data for post analysis generated by BenchKit (invocation template)"
echo
if [ "LTLFireability" = "UpperBounds" ] ; then
echo "The expected result is a vector of positive values"
echo NUM_VECTOR
elif [ "LTLFireability" != "StateSpace" ] ; then
echo "The expected result is a vector of booleans"
echo BOOL_VECTOR
else
echo "no data necessary for post analysis"
fi
echo
if [ -f "LTLFireability.txt" ] ; then
echo "here is the order used to build the result vector(from text file)"
for x in $(grep Property LTLFireability.txt | cut -d ' ' -f 2 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ -f "LTLFireability.xml" ] ; then # for cunf (txt files deleted;-)
echo echo "here is the order used to build the result vector(from xml file)"
for x in $(grep '' LTLFireability.xml | cut -d '>' -f 2 | cut -d '<' -f 1 | sort -u) ; do
echo "FORMULA_NAME $x"
done
elif [ "LTLFireability" = "ReachabilityDeadlock" ] || [ "LTLFireability" = "QuasiLiveness" ] || [ "LTLFireability" = "StableMarking" ] || [ "LTLFireability" = "Liveness" ] || [ "LTLFireability" = "OneSafe" ] ; then
echo "FORMULA_NAME LTLFireability"
fi
echo
echo "=== Now, execution of the tool begins"
echo
echo -n "BK_START "
date -u +%s%3N
echo
timeout -s 9 $BK_TIME_CONFINEMENT bash -c "/home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n \"BK_STOP \" ; date -u +%s%3N"
if [ $? -eq 137 ] ; then
echo
echo "BK_TIME_CONFINEMENT_REACHED"
fi
echo
echo "--------------------"
echo "content from stderr:"
echo
cat STDERR ;