About the Execution of ITS-Tools for ASLink-PT-06b
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 13697.531 | 3600000.00 | 13367082.00 | 68.20 | TFFFF?FTFFFFFFTF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2023-input.r005-oct2-167813592600100.qcow2', fmt=qcow2 cluster_size=65536 extended_l2=off compression_type=zlib size=4294967296 backing_file=/data/fkordon/mcc2023-input.qcow2 backing_fmt=qcow2 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5348
Executing tool itstools
Input is ASLink-PT-06b, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r005-oct2-167813592600100
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 1.4M
-rw-r--r-- 1 mcc users 7.5K Feb 26 13:12 CTLCardinality.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:12 CTLCardinality.xml
-rw-r--r-- 1 mcc users 5.8K Feb 26 13:12 CTLFireability.txt
-rw-r--r-- 1 mcc users 54K Feb 26 13:12 CTLFireability.xml
-rw-r--r-- 1 mcc users 4.2K Jan 29 11:40 GenericPropertiesDefinition.xml
-rw-r--r-- 1 mcc users 6.0K Jan 29 11:40 GenericPropertiesVerdict.xml
-rw-r--r-- 1 mcc users 3.8K Feb 25 15:29 LTLCardinality.txt
-rw-r--r-- 1 mcc users 26K Feb 25 15:29 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.1K Feb 25 15:29 LTLFireability.txt
-rw-r--r-- 1 mcc users 15K Feb 25 15:29 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K Feb 26 13:13 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 127K Feb 26 13:13 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 9.6K Feb 26 13:13 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 84K Feb 26 13:13 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K Feb 25 15:29 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.6K Feb 25 15:29 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 equiv_col
-rw-r--r-- 1 mcc users 4 Mar 5 18:22 instance
-rw-r--r-- 1 mcc users 6 Mar 5 18:22 iscolored
-rw-r--r-- 1 mcc users 921K Mar 5 18:22 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME ASLink-PT-06b-LTLFireability-00
FORMULA_NAME ASLink-PT-06b-LTLFireability-01
FORMULA_NAME ASLink-PT-06b-LTLFireability-02
FORMULA_NAME ASLink-PT-06b-LTLFireability-03
FORMULA_NAME ASLink-PT-06b-LTLFireability-04
FORMULA_NAME ASLink-PT-06b-LTLFireability-05
FORMULA_NAME ASLink-PT-06b-LTLFireability-06
FORMULA_NAME ASLink-PT-06b-LTLFireability-07
FORMULA_NAME ASLink-PT-06b-LTLFireability-08
FORMULA_NAME ASLink-PT-06b-LTLFireability-09
FORMULA_NAME ASLink-PT-06b-LTLFireability-10
FORMULA_NAME ASLink-PT-06b-LTLFireability-11
FORMULA_NAME ASLink-PT-06b-LTLFireability-12
FORMULA_NAME ASLink-PT-06b-LTLFireability-13
FORMULA_NAME ASLink-PT-06b-LTLFireability-14
FORMULA_NAME ASLink-PT-06b-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1678495418151
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=ASLink-PT-06b
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202303021504
[2023-03-11 00:43:40] [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-11 00:43:40] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2023-03-11 00:43:40] [INFO ] Load time of PNML (sax parser for PT used): 182 ms
[2023-03-11 00:43:40] [INFO ] Transformed 2826 places.
[2023-03-11 00:43:40] [INFO ] Transformed 3513 transitions.
[2023-03-11 00:43:40] [INFO ] Found NUPN structural information;
[2023-03-11 00:43:40] [INFO ] Parsed PT model containing 2826 places and 3513 transitions and 10709 arcs in 300 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 2 formulas.
FORMULA ASLink-PT-06b-LTLFireability-04 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-08 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 41 out of 2826 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2826/2826 places, 3513/3513 transitions.
Discarding 172 places :
Symmetric choice reduction at 0 with 172 rule applications. Total rules 172 place count 2654 transition count 3341
Iterating global reduction 0 with 172 rules applied. Total rules applied 344 place count 2654 transition count 3341
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 0 with 1 rules applied. Total rules applied 345 place count 2654 transition count 3340
Discarding 67 places :
Symmetric choice reduction at 1 with 67 rule applications. Total rules 412 place count 2587 transition count 3235
Iterating global reduction 1 with 67 rules applied. Total rules applied 479 place count 2587 transition count 3235
Ensure Unique test removed 21 transitions
Reduce isomorphic transitions removed 21 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 500 place count 2587 transition count 3214
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 510 place count 2577 transition count 3204
Iterating global reduction 2 with 10 rules applied. Total rules applied 520 place count 2577 transition count 3204
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 524 place count 2573 transition count 3193
Iterating global reduction 2 with 4 rules applied. Total rules applied 528 place count 2573 transition count 3193
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 531 place count 2570 transition count 3190
Iterating global reduction 2 with 3 rules applied. Total rules applied 534 place count 2570 transition count 3190
Discarding 3 places :
Symmetric choice reduction at 2 with 3 rule applications. Total rules 537 place count 2567 transition count 3180
Iterating global reduction 2 with 3 rules applied. Total rules applied 540 place count 2567 transition count 3180
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 541 place count 2566 transition count 3172
Iterating global reduction 2 with 1 rules applied. Total rules applied 542 place count 2566 transition count 3172
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 543 place count 2565 transition count 3171
Iterating global reduction 2 with 1 rules applied. Total rules applied 544 place count 2565 transition count 3171
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 545 place count 2564 transition count 3163
Iterating global reduction 2 with 1 rules applied. Total rules applied 546 place count 2564 transition count 3163
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 547 place count 2563 transition count 3155
Iterating global reduction 2 with 1 rules applied. Total rules applied 548 place count 2563 transition count 3155
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 549 place count 2562 transition count 3154
Iterating global reduction 2 with 1 rules applied. Total rules applied 550 place count 2562 transition count 3154
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 551 place count 2561 transition count 3146
Iterating global reduction 2 with 1 rules applied. Total rules applied 552 place count 2561 transition count 3146
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 553 place count 2560 transition count 3138
Iterating global reduction 2 with 1 rules applied. Total rules applied 554 place count 2560 transition count 3138
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 555 place count 2559 transition count 3137
Iterating global reduction 2 with 1 rules applied. Total rules applied 556 place count 2559 transition count 3137
Applied a total of 556 rules in 3053 ms. Remains 2559 /2826 variables (removed 267) and now considering 3137/3513 (removed 376) transitions.
// Phase 1: matrix 3137 rows 2559 cols
[2023-03-11 00:43:44] [INFO ] Computed 277 place invariants in 179 ms
[2023-03-11 00:43:46] [INFO ] Implicit Places using invariants in 2563 ms returned []
[2023-03-11 00:43:46] [INFO ] Invariant cache hit.
[2023-03-11 00:43:56] [INFO ] Implicit Places using invariants and state equation in 10130 ms returned [2393, 2404, 2415, 2423, 2431, 2439, 2447, 2458, 2466, 2474, 2485]
Discarding 11 places :
Implicit Place search using SMT with State Equation took 12805 ms to find 11 implicit places.
Starting structural reductions in LTL mode, iteration 1 : 2548/2826 places, 3137/3513 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 2535 transition count 3124
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 2535 transition count 3124
Discarding 11 places :
Symmetric choice reduction at 0 with 11 rule applications. Total rules 37 place count 2524 transition count 3113
Iterating global reduction 0 with 11 rules applied. Total rules applied 48 place count 2524 transition count 3113
Discarding 9 places :
Symmetric choice reduction at 0 with 9 rule applications. Total rules 57 place count 2515 transition count 3104
Iterating global reduction 0 with 9 rules applied. Total rules applied 66 place count 2515 transition count 3104
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 70 place count 2511 transition count 3100
Iterating global reduction 0 with 4 rules applied. Total rules applied 74 place count 2511 transition count 3100
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 76 place count 2509 transition count 3098
Iterating global reduction 0 with 2 rules applied. Total rules applied 78 place count 2509 transition count 3098
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 80 place count 2507 transition count 3096
Iterating global reduction 0 with 2 rules applied. Total rules applied 82 place count 2507 transition count 3096
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 84 place count 2505 transition count 3094
Iterating global reduction 0 with 2 rules applied. Total rules applied 86 place count 2505 transition count 3094
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 88 place count 2503 transition count 3092
Iterating global reduction 0 with 2 rules applied. Total rules applied 90 place count 2503 transition count 3092
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 91 place count 2502 transition count 3091
Iterating global reduction 0 with 1 rules applied. Total rules applied 92 place count 2502 transition count 3091
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 93 place count 2501 transition count 3090
Iterating global reduction 0 with 1 rules applied. Total rules applied 94 place count 2501 transition count 3090
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 95 place count 2500 transition count 3089
Iterating global reduction 0 with 1 rules applied. Total rules applied 96 place count 2500 transition count 3089
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 97 place count 2499 transition count 3088
Iterating global reduction 0 with 1 rules applied. Total rules applied 98 place count 2499 transition count 3088
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 99 place count 2498 transition count 3087
Iterating global reduction 0 with 1 rules applied. Total rules applied 100 place count 2498 transition count 3087
Applied a total of 100 rules in 1721 ms. Remains 2498 /2548 variables (removed 50) and now considering 3087/3137 (removed 50) transitions.
// Phase 1: matrix 3087 rows 2498 cols
[2023-03-11 00:43:58] [INFO ] Computed 266 place invariants in 112 ms
[2023-03-11 00:43:59] [INFO ] Implicit Places using invariants in 1441 ms returned []
[2023-03-11 00:43:59] [INFO ] Invariant cache hit.
[2023-03-11 00:44:00] [INFO ] Implicit Places using invariants and state equation in 952 ms returned []
Implicit Place search using SMT with State Equation took 2403 ms to find 0 implicit places.
Starting structural reductions in LTL mode, iteration 2 : 2498/2826 places, 3087/3513 transitions.
Finished structural reductions in LTL mode , in 2 iterations and 19984 ms. Remains : 2498/2826 places, 3087/3513 transitions.
Support contains 41 out of 2498 places after structural reductions.
[2023-03-11 00:44:01] [INFO ] Flatten gal took : 203 ms
[2023-03-11 00:44:01] [INFO ] Flatten gal took : 132 ms
[2023-03-11 00:44:01] [INFO ] Input system was already deterministic with 3087 transitions.
Incomplete random walk after 10000 steps, including 13 resets, run finished after 390 ms. (steps per millisecond=25 ) properties (out of 29) seen :18
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) 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 11) 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 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 11) 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 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 11) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 28 ms. (steps per millisecond=357 ) properties (out of 11) seen :0
Running SMT prover for 11 properties.
[2023-03-11 00:44:02] [INFO ] Invariant cache hit.
[2023-03-11 00:44:03] [INFO ] [Real]Absence check using 66 positive place invariants in 57 ms returned sat
[2023-03-11 00:44:03] [INFO ] [Real]Absence check using 66 positive and 200 generalized place invariants in 144 ms returned sat
[2023-03-11 00:44:08] [INFO ] After 5499ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:11
[2023-03-11 00:44:09] [INFO ] [Nat]Absence check using 66 positive place invariants in 99 ms returned sat
[2023-03-11 00:44:09] [INFO ] [Nat]Absence check using 66 positive and 200 generalized place invariants in 194 ms returned sat
[2023-03-11 00:44:33] [INFO ] After 23055ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :8
[2023-03-11 00:44:33] [INFO ] After 23061ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :8
Attempting to minimize the solution found.
Minimization took 2 ms.
[2023-03-11 00:44:33] [INFO ] After 25026ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :8
Fused 11 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 321 ms.
Support contains 18 out of 2498 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Drop transitions removed 457 transitions
Trivial Post-agglo rules discarded 457 transitions
Performed 457 trivial Post agglomeration. Transition count delta: 457
Iterating post reduction 0 with 457 rules applied. Total rules applied 457 place count 2498 transition count 2630
Reduce places removed 457 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 460 rules applied. Total rules applied 917 place count 2041 transition count 2627
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 920 place count 2039 transition count 2626
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 921 place count 2038 transition count 2626
Performed 667 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 667 Pre rules applied. Total rules applied 921 place count 2038 transition count 1959
Deduced a syphon composed of 667 places in 4 ms
Ensure Unique test removed 63 places
Reduce places removed 730 places and 0 transitions.
Iterating global reduction 4 with 1397 rules applied. Total rules applied 2318 place count 1308 transition count 1959
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 4 with 45 rules applied. Total rules applied 2363 place count 1302 transition count 1920
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 5 with 39 rules applied. Total rules applied 2402 place count 1263 transition count 1920
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2402 place count 1263 transition count 1895
Deduced a syphon composed of 25 places in 5 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 6 with 75 rules applied. Total rules applied 2477 place count 1213 transition count 1895
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 24 Pre rules applied. Total rules applied 2477 place count 1213 transition count 1871
Deduced a syphon composed of 24 places in 11 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 6 with 48 rules applied. Total rules applied 2525 place count 1189 transition count 1871
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2526 place count 1188 transition count 1870
Iterating global reduction 6 with 1 rules applied. Total rules applied 2527 place count 1188 transition count 1870
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2527 place count 1188 transition count 1869
Deduced a syphon composed of 1 places in 11 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2529 place count 1187 transition count 1869
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 7 ms
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 6 with 398 rules applied. Total rules applied 2927 place count 987 transition count 1671
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2931 place count 983 transition count 1667
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2936 place count 982 transition count 1667
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2937 place count 982 transition count 1666
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2938 place count 981 transition count 1666
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2938 place count 981 transition count 1665
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2940 place count 980 transition count 1665
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2942 place count 978 transition count 1663
Iterating global reduction 8 with 2 rules applied. Total rules applied 2944 place count 978 transition count 1663
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2946 place count 978 transition count 1661
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2947 place count 977 transition count 1661
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2949 place count 976 transition count 1666
Free-agglomeration rule applied 7 times.
Iterating global reduction 10 with 7 rules applied. Total rules applied 2956 place count 976 transition count 1659
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 10 with 7 rules applied. Total rules applied 2963 place count 969 transition count 1659
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 11 with 5 rules applied. Total rules applied 2968 place count 969 transition count 1654
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 11 with 5 rules applied. Total rules applied 2973 place count 964 transition count 1654
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 12 with 6 rules applied. Total rules applied 2979 place count 964 transition count 1654
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 12 with 1 rules applied. Total rules applied 2980 place count 963 transition count 1653
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 12 with 16 rules applied. Total rules applied 2996 place count 952 transition count 1648
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 13 with 5 rules applied. Total rules applied 3001 place count 947 transition count 1648
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 17 Pre rules applied. Total rules applied 3001 place count 947 transition count 1631
Deduced a syphon composed of 17 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 14 with 35 rules applied. Total rules applied 3036 place count 929 transition count 1631
Discarding 6 places :
Implicit places reduction removed 6 places
Iterating post reduction 14 with 6 rules applied. Total rules applied 3042 place count 923 transition count 1631
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 15 with 1 Pre rules applied. Total rules applied 3042 place count 923 transition count 1630
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 15 with 2 rules applied. Total rules applied 3044 place count 922 transition count 1630
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 15 with 24 rules applied. Total rules applied 3068 place count 910 transition count 1618
Discarding 5 places :
Symmetric choice reduction at 15 with 5 rule applications. Total rules 3073 place count 905 transition count 1613
Iterating global reduction 15 with 5 rules applied. Total rules applied 3078 place count 905 transition count 1613
Free-agglomeration rule applied 5 times.
Iterating global reduction 15 with 5 rules applied. Total rules applied 3083 place count 905 transition count 1608
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 15 with 5 rules applied. Total rules applied 3088 place count 900 transition count 1608
Applied a total of 3088 rules in 811 ms. Remains 900 /2498 variables (removed 1598) and now considering 1608/3087 (removed 1479) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 811 ms. Remains : 900/2498 places, 1608/3087 transitions.
Incomplete random walk after 10000 steps, including 94 resets, run finished after 327 ms. (steps per millisecond=30 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 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 18 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 10) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 64 ms. (steps per millisecond=156 ) properties (out of 10) seen :1
Incomplete Best-First random walk after 10000 steps, including 16 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 9) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 63 ms. (steps per millisecond=158 ) properties (out of 9) seen :1
Incomplete Best-First random walk after 10001 steps, including 18 resets, run finished after 61 ms. (steps per millisecond=163 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10001 steps, including 16 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 8) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 52 ms. (steps per millisecond=192 ) properties (out of 8) seen :0
Running SMT prover for 8 properties.
// Phase 1: matrix 1608 rows 900 cols
[2023-03-11 00:44:35] [INFO ] Computed 151 place invariants in 15 ms
[2023-03-11 00:44:35] [INFO ] [Real]Absence check using 45 positive place invariants in 23 ms returned sat
[2023-03-11 00:44:35] [INFO ] [Real]Absence check using 45 positive and 106 generalized place invariants in 46 ms returned sat
[2023-03-11 00:44:36] [INFO ] After 1678ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:8
[2023-03-11 00:44:37] [INFO ] [Nat]Absence check using 45 positive place invariants in 23 ms returned sat
[2023-03-11 00:44:37] [INFO ] [Nat]Absence check using 45 positive and 106 generalized place invariants in 66 ms returned sat
[2023-03-11 00:44:44] [INFO ] After 6578ms SMT Verify possible using state equation in natural domain returned unsat :5 sat :3
[2023-03-11 00:44:44] [INFO ] Deduced a trap composed of 43 places in 192 ms of which 7 ms to minimize.
[2023-03-11 00:44:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 348 ms
[2023-03-11 00:44:44] [INFO ] After 7326ms SMT Verify possible using trap constraints in natural domain returned unsat :5 sat :3
Attempting to minimize the solution found.
Minimization took 419 ms.
[2023-03-11 00:44:45] [INFO ] After 8357ms SMT Verify possible using all constraints in natural domain returned unsat :5 sat :3
Fused 8 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 52 ms.
Support contains 4 out of 900 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 900/900 places, 1608/1608 transitions.
Performed 9 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 0 with 9 Pre rules applied. Total rules applied 0 place count 900 transition count 1599
Deduced a syphon composed of 9 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 10 places and 0 transitions.
Iterating global reduction 0 with 19 rules applied. Total rules applied 19 place count 890 transition count 1599
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 20 place count 890 transition count 1598
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 1 with 2 rules applied. Total rules applied 22 place count 888 transition count 1598
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 1 Pre rules applied. Total rules applied 22 place count 888 transition count 1597
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 2 with 2 rules applied. Total rules applied 24 place count 887 transition count 1597
Discarding 1 places :
Implicit places reduction removed 1 places
Iterating post reduction 2 with 1 rules applied. Total rules applied 25 place count 886 transition count 1597
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 26 place count 885 transition count 1589
Iterating global reduction 3 with 1 rules applied. Total rules applied 27 place count 885 transition count 1589
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 28 place count 884 transition count 1581
Iterating global reduction 3 with 1 rules applied. Total rules applied 29 place count 884 transition count 1581
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 30 place count 883 transition count 1573
Iterating global reduction 3 with 1 rules applied. Total rules applied 31 place count 883 transition count 1573
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 32 place count 882 transition count 1565
Iterating global reduction 3 with 1 rules applied. Total rules applied 33 place count 882 transition count 1565
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 34 place count 881 transition count 1557
Iterating global reduction 3 with 1 rules applied. Total rules applied 35 place count 881 transition count 1557
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 36 place count 880 transition count 1549
Iterating global reduction 3 with 1 rules applied. Total rules applied 37 place count 880 transition count 1549
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 38 place count 879 transition count 1541
Iterating global reduction 3 with 1 rules applied. Total rules applied 39 place count 879 transition count 1541
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 40 place count 878 transition count 1533
Iterating global reduction 3 with 1 rules applied. Total rules applied 41 place count 878 transition count 1533
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 42 place count 877 transition count 1525
Iterating global reduction 3 with 1 rules applied. Total rules applied 43 place count 877 transition count 1525
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 2
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 3 with 4 rules applied. Total rules applied 47 place count 875 transition count 1523
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 48 place count 874 transition count 1522
Iterating global reduction 3 with 1 rules applied. Total rules applied 49 place count 874 transition count 1522
Free-agglomeration rule applied 1 times.
Iterating global reduction 3 with 1 rules applied. Total rules applied 50 place count 874 transition count 1521
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 51 place count 873 transition count 1521
Applied a total of 51 rules in 296 ms. Remains 873 /900 variables (removed 27) and now considering 1521/1608 (removed 87) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 297 ms. Remains : 873/900 places, 1521/1608 transitions.
Incomplete random walk after 10000 steps, including 116 resets, run finished after 147 ms. (steps per millisecond=68 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 17 resets, run finished after 31 ms. (steps per millisecond=322 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 20 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 262450 steps, run timeout after 3001 ms. (steps per millisecond=87 ) properties seen :{}
Probabilistic random walk after 262450 steps, saw 57049 distinct states, run finished after 3003 ms. (steps per millisecond=87 ) properties seen :0
Running SMT prover for 3 properties.
// Phase 1: matrix 1521 rows 873 cols
[2023-03-11 00:44:48] [INFO ] Computed 148 place invariants in 35 ms
[2023-03-11 00:44:49] [INFO ] [Real]Absence check using 43 positive place invariants in 11 ms returned sat
[2023-03-11 00:44:49] [INFO ] [Real]Absence check using 43 positive and 105 generalized place invariants in 28 ms returned sat
[2023-03-11 00:44:50] [INFO ] After 1171ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:44:50] [INFO ] [Nat]Absence check using 43 positive place invariants in 11 ms returned sat
[2023-03-11 00:44:50] [INFO ] [Nat]Absence check using 43 positive and 105 generalized place invariants in 52 ms returned sat
[2023-03-11 00:44:51] [INFO ] After 930ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:44:51] [INFO ] After 1441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 208 ms.
[2023-03-11 00:44:52] [INFO ] After 1953ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 68 ms.
Support contains 4 out of 873 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 1521/1521 transitions.
Applied a total of 0 rules in 24 ms. Remains 873 /873 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 24 ms. Remains : 873/873 places, 1521/1521 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 873/873 places, 1521/1521 transitions.
Applied a total of 0 rules in 23 ms. Remains 873 /873 variables (removed 0) and now considering 1521/1521 (removed 0) transitions.
[2023-03-11 00:44:52] [INFO ] Invariant cache hit.
[2023-03-11 00:44:52] [INFO ] Implicit Places using invariants in 734 ms returned [1, 19, 20, 32, 49, 67, 139, 143, 152, 153, 155, 172, 190, 260, 264, 265, 276, 277, 279, 296, 314, 383, 387, 388, 399, 400, 402, 419, 437, 506, 510, 511, 522, 523, 525, 542, 560, 629, 633, 634, 645, 646, 648, 665, 683, 752, 756, 757, 760, 771, 772, 773, 791, 812, 813, 814, 815]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 738 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 816/873 places, 1521/1521 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 816 transition count 1412
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 224 place count 707 transition count 1406
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 224 place count 707 transition count 1375
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 675 transition count 1375
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 299 place count 671 transition count 1367
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 307 place count 663 transition count 1367
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 310 place count 660 transition count 1364
Iterating global reduction 4 with 3 rules applied. Total rules applied 313 place count 660 transition count 1364
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 316 place count 660 transition count 1361
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 1 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 400 place count 618 transition count 1319
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 406 place count 612 transition count 1313
Iterating global reduction 5 with 6 rules applied. Total rules applied 412 place count 612 transition count 1313
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 418 place count 612 transition count 1307
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 1 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 422 place count 610 transition count 1308
Free-agglomeration rule (complex) applied 13 times.
Iterating global reduction 6 with 13 rules applied. Total rules applied 435 place count 610 transition count 1295
Ensure Unique test removed 1 places
Reduce places removed 14 places and 0 transitions.
Iterating post reduction 6 with 14 rules applied. Total rules applied 449 place count 596 transition count 1295
Partial Free-agglomeration rule applied 16 times.
Drop transitions removed 16 transitions
Iterating global reduction 7 with 16 rules applied. Total rules applied 465 place count 596 transition count 1295
Applied a total of 465 rules in 191 ms. Remains 596 /816 variables (removed 220) and now considering 1295/1521 (removed 226) transitions.
// Phase 1: matrix 1295 rows 596 cols
[2023-03-11 00:44:53] [INFO ] Computed 85 place invariants in 9 ms
[2023-03-11 00:44:53] [INFO ] Implicit Places using invariants in 387 ms returned [74, 91, 98, 101, 103, 106, 107, 160, 177, 183, 186, 188, 193, 194, 247, 263, 269, 272, 274, 279, 280, 333, 349, 355, 358, 360, 365, 366, 419, 435, 441, 444, 446, 451, 452, 505, 521, 527, 530, 532]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 392 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 556/873 places, 1295/1521 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 540 transition count 1279
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 540 transition count 1279
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 36 place count 536 transition count 1275
Iterating global reduction 0 with 4 rules applied. Total rules applied 40 place count 536 transition count 1275
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 64 place count 524 transition count 1263
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 82 place count 524 transition count 1245
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 100 place count 506 transition count 1245
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 106 place count 506 transition count 1239
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 112 place count 500 transition count 1239
Applied a total of 112 rules in 97 ms. Remains 500 /556 variables (removed 56) and now considering 1239/1295 (removed 56) transitions.
// Phase 1: matrix 1239 rows 500 cols
[2023-03-11 00:44:53] [INFO ] Computed 45 place invariants in 9 ms
[2023-03-11 00:44:53] [INFO ] Implicit Places using invariants in 408 ms returned []
[2023-03-11 00:44:53] [INFO ] Invariant cache hit.
[2023-03-11 00:44:55] [INFO ] Implicit Places using invariants and state equation in 1096 ms returned []
Implicit Place search using SMT with State Equation took 1512 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 500/873 places, 1239/1521 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2953 ms. Remains : 500/873 places, 1239/1521 transitions.
Incomplete random walk after 10000 steps, including 189 resets, run finished after 133 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 34 resets, run finished after 30 ms. (steps per millisecond=333 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 36 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 37 resets, run finished after 37 ms. (steps per millisecond=270 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 310725 steps, run timeout after 3001 ms. (steps per millisecond=103 ) properties seen :{}
Probabilistic random walk after 310725 steps, saw 92081 distinct states, run finished after 3001 ms. (steps per millisecond=103 ) properties seen :0
Running SMT prover for 3 properties.
[2023-03-11 00:44:58] [INFO ] Invariant cache hit.
[2023-03-11 00:44:58] [INFO ] [Real]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-11 00:44:58] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 14 ms returned sat
[2023-03-11 00:44:58] [INFO ] After 595ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:44:59] [INFO ] [Nat]Absence check using 10 positive place invariants in 6 ms returned sat
[2023-03-11 00:44:59] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 25 ms returned sat
[2023-03-11 00:44:59] [INFO ] After 726ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:45:00] [INFO ] After 994ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 176 ms.
[2023-03-11 00:45:00] [INFO ] After 1334ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Fused 3 Parikh solutions to 2 different solutions.
Parikh walk visited 0 properties in 80 ms.
Support contains 4 out of 500 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1239/1239 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 15 ms. Remains : 500/500 places, 1239/1239 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 500/500 places, 1239/1239 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
[2023-03-11 00:45:00] [INFO ] Invariant cache hit.
[2023-03-11 00:45:00] [INFO ] Implicit Places using invariants in 447 ms returned []
[2023-03-11 00:45:00] [INFO ] Invariant cache hit.
[2023-03-11 00:45:01] [INFO ] Implicit Places using invariants and state equation in 1152 ms returned []
Implicit Place search using SMT with State Equation took 1615 ms to find 0 implicit places.
[2023-03-11 00:45:02] [INFO ] Redundant transitions in 102 ms returned []
[2023-03-11 00:45:02] [INFO ] Invariant cache hit.
[2023-03-11 00:45:02] [INFO ] Dead Transitions using invariants and state equation in 467 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2212 ms. Remains : 500/500 places, 1239/1239 transitions.
Applied a total of 0 rules in 15 ms. Remains 500 /500 variables (removed 0) and now considering 1239/1239 (removed 0) transitions.
Running SMT prover for 3 properties.
[2023-03-11 00:45:02] [INFO ] Invariant cache hit.
[2023-03-11 00:45:02] [INFO ] [Real]Absence check using 10 positive place invariants in 2 ms returned sat
[2023-03-11 00:45:02] [INFO ] [Real]Absence check using 10 positive and 35 generalized place invariants in 29 ms returned sat
[2023-03-11 00:45:03] [INFO ] After 630ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2023-03-11 00:45:03] [INFO ] [Nat]Absence check using 10 positive place invariants in 4 ms returned sat
[2023-03-11 00:45:03] [INFO ] [Nat]Absence check using 10 positive and 35 generalized place invariants in 23 ms returned sat
[2023-03-11 00:45:04] [INFO ] After 693ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2023-03-11 00:45:04] [INFO ] After 1002ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 174 ms.
[2023-03-11 00:45:04] [INFO ] After 1332ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Successfully simplified 6 atomic propositions for a total of 14 simplifications.
FORMULA ASLink-PT-06b-LTLFireability-02 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA ASLink-PT-06b-LTLFireability-03 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Computed a total of 102 stabilizing places and 102 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' '!(X((G(p1)||X(X(X(X(F(p2)))))||p0)))'
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 1949 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
// Phase 1: matrix 3007 rows 2481 cols
[2023-03-11 00:45:07] [INFO ] Computed 266 place invariants in 57 ms
[2023-03-11 00:45:08] [INFO ] Implicit Places using invariants in 1321 ms returned []
[2023-03-11 00:45:08] [INFO ] Invariant cache hit.
[2023-03-11 00:45:13] [INFO ] Implicit Places using invariants and state equation in 4756 ms returned []
Implicit Place search using SMT with State Equation took 6081 ms to find 0 implicit places.
[2023-03-11 00:45:13] [INFO ] Invariant cache hit.
[2023-03-11 00:45:15] [INFO ] Dead Transitions using invariants and state equation in 1905 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9950 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 814 ms :[(NOT p2), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p0) (NOT p1)), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (AND (NOT p2) (NOT p1)), (AND (NOT p2) (NOT p1)), (NOT p2), (NOT p2)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=(NOT p2), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 6}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 8}], [{ cond=(NOT p1), acceptance={} source=3 dest: 0}, { cond=p1, acceptance={} source=3 dest: 4}], [{ cond=(AND (NOT p1) (NOT p2)), acceptance={} source=4 dest: 0}, { cond=(AND p1 (NOT p2)), acceptance={} source=4 dest: 4}], [{ cond=true, acceptance={} source=5 dest: 0}], [{ cond=p1, acceptance={} source=6 dest: 7}, { cond=(NOT p1), acceptance={} source=6 dest: 9}], [{ cond=p1, acceptance={} source=7 dest: 3}, { cond=(NOT p1), acceptance={} source=7 dest: 5}], [{ cond=true, acceptance={} source=8 dest: 9}], [{ cond=true, acceptance={} source=9 dest: 5}]], initial=1, aps=[p2:(OR (EQ s1352 0) (EQ s1514 0)), p0:(OR (EQ s1352 0) (EQ s1514 0)), p1:(OR (EQ s1940 0) (EQ s2193 0))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null, null, null, null][false, false, false, false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1469 ms.
Product exploration explored 100000 steps with 50000 reset in 1225 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND p2 p0 p1), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), true, (X (X p1))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (NOT (AND (NOT p0) p1)))
Knowledge based reduction with 5 factoid took 234 ms. Reduced automaton from 10 states, 15 edges and 3 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06b-LTLFireability-00 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06b-LTLFireability-00 finished in 13818 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(G(p0))))'
Support contains 2 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 1866 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
[2023-03-11 00:45:20] [INFO ] Invariant cache hit.
[2023-03-11 00:45:21] [INFO ] Implicit Places using invariants in 1244 ms returned []
[2023-03-11 00:45:21] [INFO ] Invariant cache hit.
[2023-03-11 00:45:26] [INFO ] Implicit Places using invariants and state equation in 4582 ms returned []
Implicit Place search using SMT with State Equation took 5841 ms to find 0 implicit places.
[2023-03-11 00:45:26] [INFO ] Invariant cache hit.
[2023-03-11 00:45:29] [INFO ] Dead Transitions using invariants and state equation in 2452 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10168 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 170 ms :[true, (NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-01 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 1}], [{ cond=true, acceptance={} source=3 dest: 2}]], initial=3, aps=[p0:(AND (EQ s1486 1) (EQ s1821 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Entered a terminal (fully accepting) state of product in 2 steps with 0 reset in 12 ms.
FORMULA ASLink-PT-06b-LTLFireability-01 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-01 finished in 10394 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(!p1)) U (G((p0&&G(!p1)))||(G(!p1)&&p2)))))'
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2495 transition count 3077
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2495 transition count 3077
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 7 place count 2494 transition count 3069
Iterating global reduction 0 with 1 rules applied. Total rules applied 8 place count 2494 transition count 3069
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 9 place count 2493 transition count 3068
Iterating global reduction 0 with 1 rules applied. Total rules applied 10 place count 2493 transition count 3068
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2492 transition count 3060
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2492 transition count 3060
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3052
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3052
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3051
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3051
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3043
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3043
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3035
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3035
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3034
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3034
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3026
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3026
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3018
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3018
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3017
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3017
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3009
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3009
Applied a total of 30 rules in 1719 ms. Remains 2483 /2498 variables (removed 15) and now considering 3009/3087 (removed 78) transitions.
// Phase 1: matrix 3009 rows 2483 cols
[2023-03-11 00:45:31] [INFO ] Computed 266 place invariants in 60 ms
[2023-03-11 00:45:32] [INFO ] Implicit Places using invariants in 1454 ms returned []
[2023-03-11 00:45:32] [INFO ] Invariant cache hit.
[2023-03-11 00:45:38] [INFO ] Implicit Places using invariants and state equation in 6296 ms returned []
Implicit Place search using SMT with State Equation took 7753 ms to find 0 implicit places.
[2023-03-11 00:45:38] [INFO ] Invariant cache hit.
[2023-03-11 00:45:40] [INFO ] Dead Transitions using invariants and state equation in 2195 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2483/2498 places, 3009/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11673 ms. Remains : 2483/2498 places, 3009/3087 transitions.
Stuttering acceptance computed with spot in 208 ms :[true, (OR p1 (AND (NOT p0) (NOT p2))), (OR p1 (AND (NOT p0) (NOT p2))), p1]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-05 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(OR p1 (AND (NOT p0) (NOT p2))), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p1) p0 (NOT p2)), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p1) p2), acceptance={} source=2 dest: 3}], [{ cond=p1, acceptance={} source=3 dest: 0}, { cond=(NOT p1), acceptance={} source=3 dest: 3}]], initial=1, aps=[p1:(AND (EQ s34 1) (EQ s171 1)), p0:(NEQ s370 1), p2:(AND (NOT (AND (EQ s370 1) (EQ s186 1))) (NEQ s370 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 176 reset in 455 ms.
Product exploration explored 100000 steps with 163 reset in 458 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR p1 (AND (NOT p0) (NOT p2))))), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR p1 (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 9 factoid took 620 ms. Reduced automaton from 4 states, 7 edges and 3 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 19 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 215058 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 215058 steps, saw 39469 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:45:45] [INFO ] Invariant cache hit.
[2023-03-11 00:45:46] [INFO ] [Real]Absence check using 63 positive place invariants in 22 ms returned sat
[2023-03-11 00:45:46] [INFO ] [Real]Absence check using 63 positive and 203 generalized place invariants in 168 ms returned sat
[2023-03-11 00:45:48] [INFO ] After 2231ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:45:48] [INFO ] [Nat]Absence check using 63 positive place invariants in 23 ms returned sat
[2023-03-11 00:45:48] [INFO ] [Nat]Absence check using 63 positive and 203 generalized place invariants in 110 ms returned sat
[2023-03-11 00:45:50] [INFO ] After 2004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:45:51] [INFO ] Deduced a trap composed of 18 places in 1153 ms of which 4 ms to minimize.
[2023-03-11 00:45:53] [INFO ] Deduced a trap composed of 92 places in 1005 ms of which 2 ms to minimize.
[2023-03-11 00:45:54] [INFO ] Deduced a trap composed of 68 places in 817 ms of which 2 ms to minimize.
[2023-03-11 00:45:55] [INFO ] Deduced a trap composed of 48 places in 944 ms of which 2 ms to minimize.
[2023-03-11 00:45:56] [INFO ] Deduced a trap composed of 95 places in 966 ms of which 2 ms to minimize.
[2023-03-11 00:45:57] [INFO ] Deduced a trap composed of 112 places in 840 ms of which 2 ms to minimize.
[2023-03-11 00:45:58] [INFO ] Deduced a trap composed of 364 places in 656 ms of which 1 ms to minimize.
[2023-03-11 00:45:58] [INFO ] Deduced a trap composed of 46 places in 647 ms of which 1 ms to minimize.
[2023-03-11 00:45:59] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8481 ms
[2023-03-11 00:45:59] [INFO ] After 10640ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 170 ms.
[2023-03-11 00:45:59] [INFO ] After 11293ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 73 ms.
Support contains 2 out of 2483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2483/2483 places, 3009/3009 transitions.
Drop transitions removed 460 transitions
Trivial Post-agglo rules discarded 460 transitions
Performed 460 trivial Post agglomeration. Transition count delta: 460
Iterating post reduction 0 with 460 rules applied. Total rules applied 460 place count 2483 transition count 2549
Reduce places removed 460 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 463 rules applied. Total rules applied 923 place count 2023 transition count 2546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 925 place count 2021 transition count 2546
Performed 670 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 670 Pre rules applied. Total rules applied 925 place count 2021 transition count 1876
Deduced a syphon composed of 670 places in 3 ms
Ensure Unique test removed 64 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 2329 place count 1287 transition count 1876
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 46 rules applied. Total rules applied 2375 place count 1281 transition count 1836
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2415 place count 1241 transition count 1836
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2415 place count 1241 transition count 1811
Deduced a syphon composed of 25 places in 3 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 75 rules applied. Total rules applied 2490 place count 1191 transition count 1811
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2490 place count 1191 transition count 1787
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2538 place count 1167 transition count 1787
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 5 with 404 rules applied. Total rules applied 2942 place count 964 transition count 1586
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2946 place count 960 transition count 1582
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2951 place count 959 transition count 1582
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2952 place count 959 transition count 1581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2953 place count 958 transition count 1581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2953 place count 958 transition count 1580
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2955 place count 957 transition count 1580
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2957 place count 955 transition count 1578
Iterating global reduction 7 with 2 rules applied. Total rules applied 2959 place count 955 transition count 1578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2961 place count 955 transition count 1576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2962 place count 954 transition count 1576
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2964 place count 953 transition count 1581
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 2971 place count 953 transition count 1574
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 2978 place count 946 transition count 1574
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 2983 place count 946 transition count 1569
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2988 place count 941 transition count 1569
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 2994 place count 941 transition count 1569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2995 place count 940 transition count 1568
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 18 rules applied. Total rules applied 3013 place count 928 transition count 1562
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3019 place count 922 transition count 1562
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 18 Pre rules applied. Total rules applied 3019 place count 922 transition count 1544
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 37 rules applied. Total rules applied 3056 place count 903 transition count 1544
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 13 with 7 rules applied. Total rules applied 3063 place count 896 transition count 1544
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3063 place count 896 transition count 1543
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3065 place count 895 transition count 1543
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 2 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 3091 place count 882 transition count 1530
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 3097 place count 876 transition count 1524
Iterating global reduction 14 with 6 rules applied. Total rules applied 3103 place count 876 transition count 1524
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3109 place count 876 transition count 1518
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3115 place count 870 transition count 1518
Applied a total of 3115 rules in 546 ms. Remains 870 /2483 variables (removed 1613) and now considering 1518/3009 (removed 1491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 546 ms. Remains : 870/2483 places, 1518/3009 transitions.
Incomplete random walk after 10000 steps, including 110 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 19 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 332952 steps, run timeout after 3001 ms. (steps per millisecond=110 ) properties seen :{}
Probabilistic random walk after 332952 steps, saw 69509 distinct states, run finished after 3001 ms. (steps per millisecond=110 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1518 rows 870 cols
[2023-03-11 00:46:03] [INFO ] Computed 148 place invariants in 34 ms
[2023-03-11 00:46:03] [INFO ] [Real]Absence check using 43 positive place invariants in 14 ms returned sat
[2023-03-11 00:46:03] [INFO ] [Real]Absence check using 43 positive and 105 generalized place invariants in 60 ms returned sat
[2023-03-11 00:46:04] [INFO ] After 1057ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:46:04] [INFO ] [Nat]Absence check using 43 positive place invariants in 9 ms returned sat
[2023-03-11 00:46:04] [INFO ] [Nat]Absence check using 43 positive and 105 generalized place invariants in 26 ms returned sat
[2023-03-11 00:46:05] [INFO ] After 828ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:46:05] [INFO ] After 993ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 82 ms.
[2023-03-11 00:46:05] [INFO ] After 1271ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1518/1518 transitions.
Applied a total of 0 rules in 53 ms. Remains 870 /870 variables (removed 0) and now considering 1518/1518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 53 ms. Remains : 870/870 places, 1518/1518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1518/1518 transitions.
Applied a total of 0 rules in 32 ms. Remains 870 /870 variables (removed 0) and now considering 1518/1518 (removed 0) transitions.
[2023-03-11 00:46:05] [INFO ] Invariant cache hit.
[2023-03-11 00:46:06] [INFO ] Implicit Places using invariants in 609 ms returned [1, 19, 20, 32, 49, 67, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 749, 753, 754, 757, 768, 769, 770, 788, 809, 810, 811, 812]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 614 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 813/870 places, 1518/1518 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 813 transition count 1409
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 224 place count 704 transition count 1403
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 224 place count 704 transition count 1372
Deduced a syphon composed of 31 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 672 transition count 1372
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 299 place count 668 transition count 1364
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 307 place count 660 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 310 place count 657 transition count 1361
Iterating global reduction 4 with 3 rules applied. Total rules applied 313 place count 657 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 316 place count 657 transition count 1358
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 400 place count 615 transition count 1316
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 406 place count 609 transition count 1310
Iterating global reduction 5 with 6 rules applied. Total rules applied 412 place count 609 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 418 place count 609 transition count 1304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 422 place count 607 transition count 1305
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 434 place count 607 transition count 1293
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 447 place count 594 transition count 1293
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 465 place count 594 transition count 1293
Applied a total of 465 rules in 164 ms. Remains 594 /813 variables (removed 219) and now considering 1293/1518 (removed 225) transitions.
// Phase 1: matrix 1293 rows 594 cols
[2023-03-11 00:46:06] [INFO ] Computed 85 place invariants in 36 ms
[2023-03-11 00:46:07] [INFO ] Implicit Places using invariants in 655 ms returned [74, 91, 97, 100, 102, 105, 106, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442, 444, 449, 450, 503, 519, 525, 528, 530]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 657 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 554/870 places, 1293/1518 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 536 transition count 1275
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 536 transition count 1275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 530 transition count 1269
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 530 transition count 1269
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 1 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 72 place count 518 transition count 1257
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 518 transition count 1239
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 108 place count 500 transition count 1239
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 500 transition count 1233
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 494 transition count 1233
Applied a total of 120 rules in 89 ms. Remains 494 /554 variables (removed 60) and now considering 1233/1293 (removed 60) transitions.
// Phase 1: matrix 1233 rows 494 cols
[2023-03-11 00:46:07] [INFO ] Computed 45 place invariants in 23 ms
[2023-03-11 00:46:07] [INFO ] Implicit Places using invariants in 389 ms returned []
[2023-03-11 00:46:07] [INFO ] Invariant cache hit.
[2023-03-11 00:46:08] [INFO ] Implicit Places using invariants and state equation in 1008 ms returned []
Implicit Place search using SMT with State Equation took 1418 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 494/870 places, 1233/1518 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 2974 ms. Remains : 494/870 places, 1233/1518 transitions.
Incomplete random walk after 10000 steps, including 174 resets, run finished after 44 ms. (steps per millisecond=227 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 39 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 386103 steps, run timeout after 3001 ms. (steps per millisecond=128 ) properties seen :{}
Probabilistic random walk after 386103 steps, saw 114141 distinct states, run finished after 3001 ms. (steps per millisecond=128 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:46:11] [INFO ] Invariant cache hit.
[2023-03-11 00:46:11] [INFO ] [Real]Absence check using 11 positive place invariants in 3 ms returned sat
[2023-03-11 00:46:11] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 38 ms returned sat
[2023-03-11 00:46:12] [INFO ] After 640ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:46:12] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-11 00:46:12] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 36 ms returned sat
[2023-03-11 00:46:13] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:46:13] [INFO ] After 795ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 00:46:13] [INFO ] After 986ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1233/1233 transitions.
Applied a total of 0 rules in 38 ms. Remains 494 /494 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 38 ms. Remains : 494/494 places, 1233/1233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1233/1233 transitions.
Applied a total of 0 rules in 31 ms. Remains 494 /494 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
[2023-03-11 00:46:13] [INFO ] Invariant cache hit.
[2023-03-11 00:46:13] [INFO ] Implicit Places using invariants in 449 ms returned []
[2023-03-11 00:46:13] [INFO ] Invariant cache hit.
[2023-03-11 00:46:14] [INFO ] Implicit Places using invariants and state equation in 959 ms returned []
Implicit Place search using SMT with State Equation took 1412 ms to find 0 implicit places.
[2023-03-11 00:46:14] [INFO ] Redundant transitions in 84 ms returned []
[2023-03-11 00:46:14] [INFO ] Invariant cache hit.
[2023-03-11 00:46:15] [INFO ] Dead Transitions using invariants and state equation in 496 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2030 ms. Remains : 494/494 places, 1233/1233 transitions.
Applied a total of 0 rules in 40 ms. Remains 494 /494 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 00:46:15] [INFO ] Invariant cache hit.
[2023-03-11 00:46:15] [INFO ] [Real]Absence check using 11 positive place invariants in 7 ms returned sat
[2023-03-11 00:46:15] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 00:46:16] [INFO ] After 590ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:46:16] [INFO ] [Nat]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-11 00:46:16] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 25 ms returned sat
[2023-03-11 00:46:16] [INFO ] After 727ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:46:16] [INFO ] After 810ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 45 ms.
[2023-03-11 00:46:16] [INFO ] After 982ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(AND (NOT p1) p0 p2), (X (NOT (AND (NOT p1) p0 (NOT p2)))), (X (NOT (OR p1 (AND (NOT p0) (NOT p2))))), (X (AND (NOT p1) p2)), true, (X (X (NOT (AND (NOT p1) p0 (NOT p2))))), (X (X (NOT (OR p1 (AND (NOT p0) (NOT p2)))))), (X (X (AND (NOT p1) p2))), (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 589 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 173 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 146 ms :[true, p1, p1]
Support contains 2 out of 2483 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3009/3009 transitions.
Applied a total of 0 rules in 172 ms. Remains 2483 /2483 variables (removed 0) and now considering 3009/3009 (removed 0) transitions.
// Phase 1: matrix 3009 rows 2483 cols
[2023-03-11 00:46:18] [INFO ] Computed 266 place invariants in 59 ms
[2023-03-11 00:46:19] [INFO ] Implicit Places using invariants in 1237 ms returned []
[2023-03-11 00:46:19] [INFO ] Invariant cache hit.
[2023-03-11 00:46:25] [INFO ] Implicit Places using invariants and state equation in 6314 ms returned []
Implicit Place search using SMT with State Equation took 7558 ms to find 0 implicit places.
[2023-03-11 00:46:25] [INFO ] Invariant cache hit.
[2023-03-11 00:46:27] [INFO ] Dead Transitions using invariants and state equation in 1984 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9715 ms. Remains : 2483/2483 places, 3009/3009 transitions.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 162 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 111 ms :[true, p1, p1]
Incomplete random walk after 10000 steps, including 21 resets, run finished after 43 ms. (steps per millisecond=232 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=909 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 224114 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 224114 steps, saw 40650 distinct states, run finished after 3001 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:46:31] [INFO ] Invariant cache hit.
[2023-03-11 00:46:31] [INFO ] [Real]Absence check using 63 positive place invariants in 23 ms returned sat
[2023-03-11 00:46:31] [INFO ] [Real]Absence check using 63 positive and 203 generalized place invariants in 167 ms returned sat
[2023-03-11 00:46:33] [INFO ] After 2218ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:46:33] [INFO ] [Nat]Absence check using 63 positive place invariants in 23 ms returned sat
[2023-03-11 00:46:33] [INFO ] [Nat]Absence check using 63 positive and 203 generalized place invariants in 138 ms returned sat
[2023-03-11 00:46:35] [INFO ] After 2004ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:46:37] [INFO ] Deduced a trap composed of 18 places in 1001 ms of which 2 ms to minimize.
[2023-03-11 00:46:38] [INFO ] Deduced a trap composed of 92 places in 928 ms of which 1 ms to minimize.
[2023-03-11 00:46:39] [INFO ] Deduced a trap composed of 68 places in 1004 ms of which 2 ms to minimize.
[2023-03-11 00:46:40] [INFO ] Deduced a trap composed of 48 places in 809 ms of which 2 ms to minimize.
[2023-03-11 00:46:41] [INFO ] Deduced a trap composed of 95 places in 882 ms of which 1 ms to minimize.
[2023-03-11 00:46:42] [INFO ] Deduced a trap composed of 112 places in 971 ms of which 4 ms to minimize.
[2023-03-11 00:46:43] [INFO ] Deduced a trap composed of 364 places in 620 ms of which 1 ms to minimize.
[2023-03-11 00:46:44] [INFO ] Deduced a trap composed of 46 places in 608 ms of which 1 ms to minimize.
[2023-03-11 00:46:44] [INFO ] Trap strengthening (SAT) tested/added 9/8 trap constraints in 8272 ms
[2023-03-11 00:46:44] [INFO ] After 10429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 156 ms.
[2023-03-11 00:46:44] [INFO ] After 11133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 44 ms.
Support contains 2 out of 2483 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 2483/2483 places, 3009/3009 transitions.
Drop transitions removed 460 transitions
Trivial Post-agglo rules discarded 460 transitions
Performed 460 trivial Post agglomeration. Transition count delta: 460
Iterating post reduction 0 with 460 rules applied. Total rules applied 460 place count 2483 transition count 2549
Reduce places removed 460 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 463 rules applied. Total rules applied 923 place count 2023 transition count 2546
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 925 place count 2021 transition count 2546
Performed 670 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 670 Pre rules applied. Total rules applied 925 place count 2021 transition count 1876
Deduced a syphon composed of 670 places in 4 ms
Ensure Unique test removed 64 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 3 with 1404 rules applied. Total rules applied 2329 place count 1287 transition count 1876
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 3 with 46 rules applied. Total rules applied 2375 place count 1281 transition count 1836
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 4 with 40 rules applied. Total rules applied 2415 place count 1241 transition count 1836
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2415 place count 1241 transition count 1811
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 75 rules applied. Total rules applied 2490 place count 1191 transition count 1811
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2490 place count 1191 transition count 1787
Deduced a syphon composed of 24 places in 3 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2538 place count 1167 transition count 1787
Performed 201 Post agglomeration using F-continuation condition.Transition count delta: 201
Deduced a syphon composed of 201 places in 5 ms
Ensure Unique test removed 2 places
Reduce places removed 203 places and 0 transitions.
Iterating global reduction 5 with 404 rules applied. Total rules applied 2942 place count 964 transition count 1586
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2946 place count 960 transition count 1582
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2951 place count 959 transition count 1582
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2952 place count 959 transition count 1581
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2953 place count 958 transition count 1581
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2953 place count 958 transition count 1580
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2955 place count 957 transition count 1580
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2957 place count 955 transition count 1578
Iterating global reduction 7 with 2 rules applied. Total rules applied 2959 place count 955 transition count 1578
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2961 place count 955 transition count 1576
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2962 place count 954 transition count 1576
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2964 place count 953 transition count 1581
Free-agglomeration rule applied 7 times.
Iterating global reduction 9 with 7 rules applied. Total rules applied 2971 place count 953 transition count 1574
Reduce places removed 7 places and 0 transitions.
Iterating post reduction 9 with 7 rules applied. Total rules applied 2978 place count 946 transition count 1574
Free-agglomeration rule (complex) applied 5 times.
Iterating global reduction 10 with 5 rules applied. Total rules applied 2983 place count 946 transition count 1569
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 2988 place count 941 transition count 1569
Partial Free-agglomeration rule applied 6 times.
Drop transitions removed 6 transitions
Iterating global reduction 11 with 6 rules applied. Total rules applied 2994 place count 941 transition count 1569
Reduce places removed 1 places and 1 transitions.
Iterating global reduction 11 with 1 rules applied. Total rules applied 2995 place count 940 transition count 1568
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 11 with 18 rules applied. Total rules applied 3013 place count 928 transition count 1562
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3019 place count 922 transition count 1562
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 18 Pre rules applied. Total rules applied 3019 place count 922 transition count 1544
Deduced a syphon composed of 18 places in 3 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 37 rules applied. Total rules applied 3056 place count 903 transition count 1544
Discarding 7 places :
Implicit places reduction removed 7 places
Iterating post reduction 13 with 7 rules applied. Total rules applied 3063 place count 896 transition count 1544
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 14 with 1 Pre rules applied. Total rules applied 3063 place count 896 transition count 1543
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 14 with 2 rules applied. Total rules applied 3065 place count 895 transition count 1543
Performed 13 Post agglomeration using F-continuation condition.Transition count delta: 13
Deduced a syphon composed of 13 places in 3 ms
Reduce places removed 13 places and 0 transitions.
Iterating global reduction 14 with 26 rules applied. Total rules applied 3091 place count 882 transition count 1530
Discarding 6 places :
Symmetric choice reduction at 14 with 6 rule applications. Total rules 3097 place count 876 transition count 1524
Iterating global reduction 14 with 6 rules applied. Total rules applied 3103 place count 876 transition count 1524
Free-agglomeration rule applied 6 times.
Iterating global reduction 14 with 6 rules applied. Total rules applied 3109 place count 876 transition count 1518
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 14 with 6 rules applied. Total rules applied 3115 place count 870 transition count 1518
Applied a total of 3115 rules in 599 ms. Remains 870 /2483 variables (removed 1613) and now considering 1518/3009 (removed 1491) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 599 ms. Remains : 870/2483 places, 1518/3009 transitions.
Incomplete random walk after 10000 steps, including 112 resets, run finished after 38 ms. (steps per millisecond=263 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 17 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 334223 steps, run timeout after 3001 ms. (steps per millisecond=111 ) properties seen :{}
Probabilistic random walk after 334223 steps, saw 69830 distinct states, run finished after 3001 ms. (steps per millisecond=111 ) properties seen :0
Running SMT prover for 1 properties.
// Phase 1: matrix 1518 rows 870 cols
[2023-03-11 00:46:48] [INFO ] Computed 148 place invariants in 34 ms
[2023-03-11 00:46:48] [INFO ] [Real]Absence check using 43 positive place invariants in 13 ms returned sat
[2023-03-11 00:46:48] [INFO ] [Real]Absence check using 43 positive and 105 generalized place invariants in 37 ms returned sat
[2023-03-11 00:46:49] [INFO ] After 871ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:46:49] [INFO ] [Nat]Absence check using 43 positive place invariants in 10 ms returned sat
[2023-03-11 00:46:49] [INFO ] [Nat]Absence check using 43 positive and 105 generalized place invariants in 31 ms returned sat
[2023-03-11 00:46:50] [INFO ] After 888ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:46:50] [INFO ] After 1000ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 74 ms.
[2023-03-11 00:46:50] [INFO ] After 1290ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 4 ms.
Support contains 2 out of 870 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1518/1518 transitions.
Applied a total of 0 rules in 50 ms. Remains 870 /870 variables (removed 0) and now considering 1518/1518 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 870/870 places, 1518/1518 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 870/870 places, 1518/1518 transitions.
Applied a total of 0 rules in 30 ms. Remains 870 /870 variables (removed 0) and now considering 1518/1518 (removed 0) transitions.
[2023-03-11 00:46:50] [INFO ] Invariant cache hit.
[2023-03-11 00:46:51] [INFO ] Implicit Places using invariants in 838 ms returned [1, 19, 20, 32, 49, 67, 137, 141, 150, 151, 153, 170, 188, 257, 261, 262, 273, 274, 276, 293, 311, 380, 384, 385, 396, 397, 399, 416, 434, 503, 507, 508, 519, 520, 522, 539, 557, 626, 630, 631, 642, 643, 645, 662, 680, 749, 753, 754, 757, 768, 769, 770, 788, 809, 810, 811, 812]
Discarding 57 places :
Implicit Place search using SMT only with invariants took 843 ms to find 57 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 1 : 813/870 places, 1518/1518 transitions.
Drop transitions removed 109 transitions
Trivial Post-agglo rules discarded 109 transitions
Performed 109 trivial Post agglomeration. Transition count delta: 109
Iterating post reduction 0 with 109 rules applied. Total rules applied 109 place count 813 transition count 1409
Reduce places removed 109 places and 0 transitions.
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 1 with 115 rules applied. Total rules applied 224 place count 704 transition count 1403
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 31 Pre rules applied. Total rules applied 224 place count 704 transition count 1372
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 2 with 63 rules applied. Total rules applied 287 place count 672 transition count 1372
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 2 with 12 rules applied. Total rules applied 299 place count 668 transition count 1364
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 3 with 8 rules applied. Total rules applied 307 place count 660 transition count 1364
Discarding 3 places :
Symmetric choice reduction at 4 with 3 rule applications. Total rules 310 place count 657 transition count 1361
Iterating global reduction 4 with 3 rules applied. Total rules applied 313 place count 657 transition count 1361
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 4 with 3 rules applied. Total rules applied 316 place count 657 transition count 1358
Performed 42 Post agglomeration using F-continuation condition.Transition count delta: 42
Deduced a syphon composed of 42 places in 2 ms
Reduce places removed 42 places and 0 transitions.
Iterating global reduction 5 with 84 rules applied. Total rules applied 400 place count 615 transition count 1316
Discarding 6 places :
Symmetric choice reduction at 5 with 6 rule applications. Total rules 406 place count 609 transition count 1310
Iterating global reduction 5 with 6 rules applied. Total rules applied 412 place count 609 transition count 1310
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 5 with 6 rules applied. Total rules applied 418 place count 609 transition count 1304
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 422 place count 607 transition count 1305
Free-agglomeration rule (complex) applied 12 times.
Iterating global reduction 6 with 12 rules applied. Total rules applied 434 place count 607 transition count 1293
Ensure Unique test removed 1 places
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 6 with 13 rules applied. Total rules applied 447 place count 594 transition count 1293
Partial Free-agglomeration rule applied 18 times.
Drop transitions removed 18 transitions
Iterating global reduction 7 with 18 rules applied. Total rules applied 465 place count 594 transition count 1293
Applied a total of 465 rules in 135 ms. Remains 594 /813 variables (removed 219) and now considering 1293/1518 (removed 225) transitions.
// Phase 1: matrix 1293 rows 594 cols
[2023-03-11 00:46:51] [INFO ] Computed 85 place invariants in 24 ms
[2023-03-11 00:46:51] [INFO ] Implicit Places using invariants in 484 ms returned [74, 91, 97, 100, 102, 105, 106, 159, 175, 181, 184, 186, 191, 192, 245, 261, 267, 270, 272, 277, 278, 331, 347, 353, 356, 358, 363, 364, 417, 433, 439, 442, 444, 449, 450, 503, 519, 525, 528, 530]
Discarding 40 places :
Implicit Place search using SMT only with invariants took 489 ms to find 40 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 2 : 554/870 places, 1293/1518 transitions.
Discarding 18 places :
Symmetric choice reduction at 0 with 18 rule applications. Total rules 18 place count 536 transition count 1275
Iterating global reduction 0 with 18 rules applied. Total rules applied 36 place count 536 transition count 1275
Discarding 6 places :
Symmetric choice reduction at 0 with 6 rule applications. Total rules 42 place count 530 transition count 1269
Iterating global reduction 0 with 6 rules applied. Total rules applied 48 place count 530 transition count 1269
Performed 12 Post agglomeration using F-continuation condition.Transition count delta: 12
Deduced a syphon composed of 12 places in 2 ms
Reduce places removed 12 places and 0 transitions.
Iterating global reduction 0 with 24 rules applied. Total rules applied 72 place count 518 transition count 1257
Free-agglomeration rule applied 18 times.
Iterating global reduction 0 with 18 rules applied. Total rules applied 90 place count 518 transition count 1239
Reduce places removed 18 places and 0 transitions.
Iterating post reduction 0 with 18 rules applied. Total rules applied 108 place count 500 transition count 1239
Free-agglomeration rule (complex) applied 6 times.
Iterating global reduction 1 with 6 rules applied. Total rules applied 114 place count 500 transition count 1233
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 1 with 6 rules applied. Total rules applied 120 place count 494 transition count 1233
Applied a total of 120 rules in 160 ms. Remains 494 /554 variables (removed 60) and now considering 1233/1293 (removed 60) transitions.
// Phase 1: matrix 1233 rows 494 cols
[2023-03-11 00:46:52] [INFO ] Computed 45 place invariants in 22 ms
[2023-03-11 00:46:52] [INFO ] Implicit Places using invariants in 463 ms returned []
[2023-03-11 00:46:52] [INFO ] Invariant cache hit.
[2023-03-11 00:46:53] [INFO ] Implicit Places using invariants and state equation in 1069 ms returned []
Implicit Place search using SMT with State Equation took 1534 ms to find 0 implicit places.
Starting structural reductions in REACHABILITY mode, iteration 3 : 494/870 places, 1233/1518 transitions.
Finished structural reductions in REACHABILITY mode , in 3 iterations and 3191 ms. Remains : 494/870 places, 1233/1518 transitions.
Incomplete random walk after 10000 steps, including 177 resets, run finished after 41 ms. (steps per millisecond=243 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 35 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 396423 steps, run timeout after 3001 ms. (steps per millisecond=132 ) properties seen :{}
Probabilistic random walk after 396423 steps, saw 117267 distinct states, run finished after 3001 ms. (steps per millisecond=132 ) properties seen :0
Running SMT prover for 1 properties.
[2023-03-11 00:46:56] [INFO ] Invariant cache hit.
[2023-03-11 00:46:56] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-11 00:46:56] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 00:46:57] [INFO ] After 530ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:46:57] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-11 00:46:57] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 33 ms returned sat
[2023-03-11 00:46:58] [INFO ] After 691ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:46:58] [INFO ] After 775ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 50 ms.
[2023-03-11 00:46:58] [INFO ] After 1027ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 5 ms.
Support contains 2 out of 494 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1233/1233 transitions.
Applied a total of 0 rules in 33 ms. Remains 494 /494 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 33 ms. Remains : 494/494 places, 1233/1233 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 494/494 places, 1233/1233 transitions.
Applied a total of 0 rules in 21 ms. Remains 494 /494 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
[2023-03-11 00:46:58] [INFO ] Invariant cache hit.
[2023-03-11 00:46:58] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-11 00:46:58] [INFO ] Invariant cache hit.
[2023-03-11 00:46:59] [INFO ] Implicit Places using invariants and state equation in 1011 ms returned []
Implicit Place search using SMT with State Equation took 1373 ms to find 0 implicit places.
[2023-03-11 00:46:59] [INFO ] Redundant transitions in 46 ms returned []
[2023-03-11 00:46:59] [INFO ] Invariant cache hit.
[2023-03-11 00:47:00] [INFO ] Dead Transitions using invariants and state equation in 626 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2095 ms. Remains : 494/494 places, 1233/1233 transitions.
Applied a total of 0 rules in 30 ms. Remains 494 /494 variables (removed 0) and now considering 1233/1233 (removed 0) transitions.
Running SMT prover for 1 properties.
[2023-03-11 00:47:00] [INFO ] Invariant cache hit.
[2023-03-11 00:47:00] [INFO ] [Real]Absence check using 11 positive place invariants in 4 ms returned sat
[2023-03-11 00:47:00] [INFO ] [Real]Absence check using 11 positive and 34 generalized place invariants in 20 ms returned sat
[2023-03-11 00:47:00] [INFO ] After 527ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2023-03-11 00:47:01] [INFO ] [Nat]Absence check using 11 positive place invariants in 5 ms returned sat
[2023-03-11 00:47:01] [INFO ] [Nat]Absence check using 11 positive and 34 generalized place invariants in 32 ms returned sat
[2023-03-11 00:47:01] [INFO ] After 723ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2023-03-11 00:47:01] [INFO ] After 807ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 46 ms.
[2023-03-11 00:47:01] [INFO ] After 1013ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [(NOT p1), (X (NOT p1)), true, (X (X (NOT p1)))]
False Knowledge obtained : []
Knowledge based reduction with 4 factoid took 283 ms. Reduced automaton from 3 states, 4 edges and 1 AP (stutter sensitive) to 3 states, 4 edges and 1 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 146 ms :[true, p1, p1]
Stuttering acceptance computed with spot in 150 ms :[true, p1, p1]
Product exploration explored 100000 steps with 181 reset in 400 ms.
Product exploration explored 100000 steps with 160 reset in 515 ms.
Applying partial POR strategy [true, false, true]
Stuttering acceptance computed with spot in 124 ms :[true, p1, p1]
Support contains 2 out of 2483 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2483/2483 places, 3009/3009 transitions.
Performed 448 Post agglomeration using F-continuation condition.Transition count delta: 0
Iterating post reduction 0 with 448 rules applied. Total rules applied 448 place count 2483 transition count 3009
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 449 place count 2483 transition count 3008
Performed 454 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 454 Pre rules applied. Total rules applied 449 place count 2483 transition count 3117
Deduced a syphon composed of 902 places in 7 ms
Iterating global reduction 2 with 454 rules applied. Total rules applied 903 place count 2483 transition count 3117
Discarding 249 places :
Symmetric choice reduction at 2 with 249 rule applications. Total rules 1152 place count 2234 transition count 2868
Deduced a syphon composed of 653 places in 6 ms
Iterating global reduction 2 with 249 rules applied. Total rules applied 1401 place count 2234 transition count 2868
Performed 6 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 6 Pre rules applied. Total rules applied 1401 place count 2234 transition count 2874
Deduced a syphon composed of 659 places in 5 ms
Iterating global reduction 2 with 6 rules applied. Total rules applied 1407 place count 2234 transition count 2874
Performed 427 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 1086 places in 6 ms
Iterating global reduction 2 with 427 rules applied. Total rules applied 1834 place count 2234 transition count 2875
Discarding 170 places :
Symmetric choice reduction at 2 with 170 rule applications. Total rules 2004 place count 2064 transition count 2703
Deduced a syphon composed of 920 places in 4 ms
Iterating global reduction 2 with 170 rules applied. Total rules applied 2174 place count 2064 transition count 2703
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 2176 place count 2062 transition count 2700
Deduced a syphon composed of 920 places in 3 ms
Iterating global reduction 2 with 2 rules applied. Total rules applied 2178 place count 2062 transition count 2700
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 2180 place count 2062 transition count 2698
Performed 36 Post agglomeration using F-continuation condition.Transition count delta: -123
Deduced a syphon composed of 956 places in 4 ms
Iterating global reduction 3 with 36 rules applied. Total rules applied 2216 place count 2062 transition count 2821
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 2226 place count 2052 transition count 2799
Deduced a syphon composed of 946 places in 4 ms
Iterating global reduction 3 with 10 rules applied. Total rules applied 2236 place count 2052 transition count 2799
Performed 1(complex) Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Deduced a syphon composed of 947 places in 4 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2237 place count 2052 transition count 2801
Discarding 1 places :
Symmetric choice reduction at 3 with 1 rule applications. Total rules 2238 place count 2051 transition count 2799
Deduced a syphon composed of 946 places in 3 ms
Iterating global reduction 3 with 1 rules applied. Total rules applied 2239 place count 2051 transition count 2799
Deduced a syphon composed of 946 places in 4 ms
Applied a total of 2239 rules in 1360 ms. Remains 2051 /2483 variables (removed 432) and now considering 2799/3009 (removed 210) transitions.
[2023-03-11 00:47:05] [INFO ] Redundant transitions in 77 ms returned []
// Phase 1: matrix 2799 rows 2051 cols
[2023-03-11 00:47:05] [INFO ] Computed 266 place invariants in 70 ms
[2023-03-11 00:47:07] [INFO ] Dead Transitions using invariants and state equation in 2037 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 2051/2483 places, 2799/3009 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3486 ms. Remains : 2051/2483 places, 2799/3009 transitions.
Built C files in :
/tmp/ltsmin14442609636437152354
[2023-03-11 00:47:07] [INFO ] Built C files in 54ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin14442609636437152354
Running compilation step : cd /tmp/ltsmin14442609636437152354;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14442609636437152354;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin14442609636437152354;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Support contains 2 out of 2483 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2483/2483 places, 3009/3009 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 2482 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 2482 transition count 3008
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 2481 transition count 3007
Applied a total of 4 rules in 405 ms. Remains 2481 /2483 variables (removed 2) and now considering 3007/3009 (removed 2) transitions.
// Phase 1: matrix 3007 rows 2481 cols
[2023-03-11 00:47:11] [INFO ] Computed 266 place invariants in 46 ms
[2023-03-11 00:47:12] [INFO ] Implicit Places using invariants in 1300 ms returned []
[2023-03-11 00:47:12] [INFO ] Invariant cache hit.
[2023-03-11 00:47:17] [INFO ] Implicit Places using invariants and state equation in 4770 ms returned []
Implicit Place search using SMT with State Equation took 6073 ms to find 0 implicit places.
[2023-03-11 00:47:17] [INFO ] Invariant cache hit.
[2023-03-11 00:47:19] [INFO ] Dead Transitions using invariants and state equation in 2123 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2483 places, 3007/3009 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 8603 ms. Remains : 2481/2483 places, 3007/3009 transitions.
Built C files in :
/tmp/ltsmin4725165327784394058
[2023-03-11 00:47:19] [INFO ] Built C files in 59ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4725165327784394058
Running compilation step : cd /tmp/ltsmin4725165327784394058;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4725165327784394058;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin4725165327784394058;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
[2023-03-11 00:47:22] [INFO ] Flatten gal took : 93 ms
[2023-03-11 00:47:22] [INFO ] Flatten gal took : 91 ms
[2023-03-11 00:47:22] [INFO ] Time to serialize gal into /tmp/LTL5285874547779137960.gal : 25 ms
[2023-03-11 00:47:22] [INFO ] Time to serialize properties into /tmp/LTL5055837245950111241.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/LTL5285874547779137960.gal' '-t' 'CGAL' '-hoa' '/tmp/aut8153664311588241482.hoa' '-atoms' '/tmp/LTL5055837245950111241.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL5055837245950111241.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut8153664311588241482.hoa
Detected timeout of ITS tools.
[2023-03-11 00:47:38] [INFO ] Flatten gal took : 84 ms
[2023-03-11 00:47:38] [INFO ] Flatten gal took : 87 ms
[2023-03-11 00:47:38] [INFO ] Time to serialize gal into /tmp/LTL4023289893491512506.gal : 14 ms
[2023-03-11 00:47:38] [INFO ] Time to serialize properties into /tmp/LTL6360701547345192776.ltl : 4 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL4023289893491512506.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL6360701547345192776.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...275
Read 1 LTL properties
Checking formula 0 : !((X((("(p398!=1)")&&(G(!("((p34==1)&&(p178==1))"))))U((G(("(p398!=1)")&&(G(!("((p34==1)&&(p178==1))")))))||(((G(!("((p34==1)&&(p178==...214
Formula 0 simplified : X((!"(p398!=1)" | F"((p34==1)&&(p178==1))") R (("((p398==1)&&(p197==1))" | !"(p398!=1)" | F"((p34==1)&&(p178==1))") & F("((p34==1)&&...184
Detected timeout of ITS tools.
[2023-03-11 00:47:53] [INFO ] Flatten gal took : 82 ms
[2023-03-11 00:47:53] [INFO ] Applying decomposition
[2023-03-11 00:47:53] [INFO ] Flatten gal took : 86 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/graph786140301736558129.txt' '-o' '/tmp/graph786140301736558129.bin' '-w' '/tmp/graph786140301736558129.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph786140301736558129.bin' '-l' '-1' '-v' '-w' '/tmp/graph786140301736558129.weights' '-q' '0' '-e' '0.001'
[2023-03-11 00:47:53] [INFO ] Decomposing Gal with order
[2023-03-11 00:47:53] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 00:47:54] [INFO ] Removed a total of 2218 redundant transitions.
[2023-03-11 00:47:54] [INFO ] Flatten gal took : 208 ms
[2023-03-11 00:47:54] [INFO ] Fuse similar labels procedure discarded/fused a total of 14 labels/synchronizations in 30 ms.
[2023-03-11 00:47:54] [INFO ] Time to serialize gal into /tmp/LTL6636856379979733117.gal : 34 ms
[2023-03-11 00:47:54] [INFO ] Time to serialize properties into /tmp/LTL18132711960245277623.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6636856379979733117.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18132711960245277623.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((X((("(i2.i0.u141.p398!=1)")&&(G(!("((i1.u13.p34==1)&&(i1.u58.p178==1))"))))U((G(("(i2.i0.u141.p398!=1)")&&(G(!("((i1.u13.p34==1)&&(...313
Formula 0 simplified : X((!"(i2.i0.u141.p398!=1)" | F"((i1.u13.p34==1)&&(i1.u58.p178==1))") R (("((i2.i0.u141.p398==1)&&(i6.i3.i1.u63.p197==1))" | !"(i2.i0...283
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin12951441349786380405
[2023-03-11 00:48:09] [INFO ] Built C files in 65ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12951441349786380405
Running compilation step : cd /tmp/ltsmin12951441349786380405;'/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'
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12951441349786380405;'/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' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12951441349786380405;'/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' killed by timeout after 3 SECONDS
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:92)
at java.base/java.lang.Thread.run(Thread.java:833)
Treatment of property ASLink-PT-06b-LTLFireability-05 finished in 163444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X((p0&&G(F(p1)))))'
Support contains 2 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 1953 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
[2023-03-11 00:48:14] [INFO ] Invariant cache hit.
[2023-03-11 00:48:16] [INFO ] Implicit Places using invariants in 1602 ms returned []
[2023-03-11 00:48:16] [INFO ] Invariant cache hit.
[2023-03-11 00:48:21] [INFO ] Implicit Places using invariants and state equation in 4849 ms returned []
Implicit Place search using SMT with State Equation took 6454 ms to find 0 implicit places.
[2023-03-11 00:48:21] [INFO ] Invariant cache hit.
[2023-03-11 00:48:23] [INFO ] Dead Transitions using invariants and state equation in 2277 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10689 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 324 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (NOT p1), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-06 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={0} source=2 dest: 2}], [{ cond=(NOT p1), acceptance={0} source=3 dest: 3}], [{ cond=(NOT p1), acceptance={} source=4 dest: 3}, { cond=true, acceptance={} source=4 dest: 4}]], initial=0, aps=[p0:(EQ s1328 1), p1:(EQ s616 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 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06b-LTLFireability-06 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-06 finished in 11072 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 2195 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
[2023-03-11 00:48:25] [INFO ] Invariant cache hit.
[2023-03-11 00:48:27] [INFO ] Implicit Places using invariants in 1321 ms returned []
[2023-03-11 00:48:27] [INFO ] Invariant cache hit.
[2023-03-11 00:48:32] [INFO ] Implicit Places using invariants and state equation in 5489 ms returned []
Implicit Place search using SMT with State Equation took 6815 ms to find 0 implicit places.
[2023-03-11 00:48:32] [INFO ] Invariant cache hit.
[2023-03-11 00:48:35] [INFO ] Dead Transitions using invariants and state equation in 2726 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11741 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 189 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-07 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(EQ s2066 0)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 33333 reset in 961 ms.
Product exploration explored 100000 steps with 33333 reset in 973 ms.
Computed a total of 101 stabilizing places and 101 stable transitions
Computed a total of 101 stabilizing places and 101 stable transitions
Knowledge obtained : [p0, (X (X p0))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X (X p0))
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 3 states, 3 edges and 1 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06b-LTLFireability-07 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06b-LTLFireability-07 finished in 14022 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(F(p0))))'
Support contains 5 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 1912 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
[2023-03-11 00:48:39] [INFO ] Invariant cache hit.
[2023-03-11 00:48:41] [INFO ] Implicit Places using invariants in 1491 ms returned []
[2023-03-11 00:48:41] [INFO ] Invariant cache hit.
[2023-03-11 00:48:46] [INFO ] Implicit Places using invariants and state equation in 5401 ms returned []
Implicit Place search using SMT with State Equation took 6914 ms to find 0 implicit places.
[2023-03-11 00:48:46] [INFO ] Invariant cache hit.
[2023-03-11 00:48:49] [INFO ] Dead Transitions using invariants and state equation in 2836 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 11668 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 204 ms :[(NOT p0), (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-09 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=true, acceptance={} source=1 dest: 0}], [{ cond=true, acceptance={} source=2 dest: 1}]], initial=2, aps=[p0:(AND (EQ s1783 1) (OR (NEQ s2237 1) (NEQ s2439 1) (AND (EQ s2189 1) (EQ s2193 1))))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 302 steps with 0 reset in 2 ms.
FORMULA ASLink-PT-06b-LTLFireability-09 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-09 finished in 11920 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(F(p0)))'
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 2017 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
[2023-03-11 00:48:51] [INFO ] Invariant cache hit.
[2023-03-11 00:48:53] [INFO ] Implicit Places using invariants in 1362 ms returned []
[2023-03-11 00:48:53] [INFO ] Invariant cache hit.
[2023-03-11 00:48:58] [INFO ] Implicit Places using invariants and state equation in 5156 ms returned []
Implicit Place search using SMT with State Equation took 6540 ms to find 0 implicit places.
[2023-03-11 00:48:58] [INFO ] Invariant cache hit.
[2023-03-11 00:49:00] [INFO ] Dead Transitions using invariants and state equation in 1804 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10362 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 87 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-10 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(EQ s1611 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null][false, false]]
Stuttering criterion allowed to conclude after 492 steps with 0 reset in 3 ms.
FORMULA ASLink-PT-06b-LTLFireability-10 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-10 finished in 10490 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)&&F(G(p1)))))'
Support contains 3 out of 2498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 463 transitions
Trivial Post-agglo rules discarded 463 transitions
Performed 463 trivial Post agglomeration. Transition count delta: 463
Iterating post reduction 0 with 463 rules applied. Total rules applied 463 place count 2497 transition count 2623
Reduce places removed 463 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 466 rules applied. Total rules applied 929 place count 2034 transition count 2620
Reduce places removed 2 places and 0 transitions.
Iterating post reduction 2 with 2 rules applied. Total rules applied 931 place count 2032 transition count 2620
Performed 671 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 671 Pre rules applied. Total rules applied 931 place count 2032 transition count 1949
Deduced a syphon composed of 671 places in 5 ms
Ensure Unique test removed 63 places
Reduce places removed 734 places and 0 transitions.
Iterating global reduction 3 with 1405 rules applied. Total rules applied 2336 place count 1298 transition count 1949
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 39 transitions
Trivial Post-agglo rules discarded 39 transitions
Performed 39 trivial Post agglomeration. Transition count delta: 39
Iterating post reduction 3 with 45 rules applied. Total rules applied 2381 place count 1292 transition count 1910
Reduce places removed 39 places and 0 transitions.
Iterating post reduction 4 with 39 rules applied. Total rules applied 2420 place count 1253 transition count 1910
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 25 Pre rules applied. Total rules applied 2420 place count 1253 transition count 1885
Deduced a syphon composed of 25 places in 4 ms
Ensure Unique test removed 25 places
Reduce places removed 50 places and 0 transitions.
Iterating global reduction 5 with 75 rules applied. Total rules applied 2495 place count 1203 transition count 1885
Performed 24 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 24 Pre rules applied. Total rules applied 2495 place count 1203 transition count 1861
Deduced a syphon composed of 24 places in 4 ms
Reduce places removed 24 places and 0 transitions.
Iterating global reduction 5 with 48 rules applied. Total rules applied 2543 place count 1179 transition count 1861
Discarding 2 places :
Symmetric choice reduction at 5 with 2 rule applications. Total rules 2545 place count 1177 transition count 1852
Iterating global reduction 5 with 2 rules applied. Total rules applied 2547 place count 1177 transition count 1852
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 2547 place count 1177 transition count 1851
Deduced a syphon composed of 1 places in 5 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 2549 place count 1176 transition count 1851
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2550 place count 1175 transition count 1843
Iterating global reduction 5 with 1 rules applied. Total rules applied 2551 place count 1175 transition count 1843
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2552 place count 1174 transition count 1835
Iterating global reduction 5 with 1 rules applied. Total rules applied 2553 place count 1174 transition count 1835
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2554 place count 1173 transition count 1827
Iterating global reduction 5 with 1 rules applied. Total rules applied 2555 place count 1173 transition count 1827
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2556 place count 1172 transition count 1819
Iterating global reduction 5 with 1 rules applied. Total rules applied 2557 place count 1172 transition count 1819
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2558 place count 1171 transition count 1811
Iterating global reduction 5 with 1 rules applied. Total rules applied 2559 place count 1171 transition count 1811
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2560 place count 1170 transition count 1803
Iterating global reduction 5 with 1 rules applied. Total rules applied 2561 place count 1170 transition count 1803
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2562 place count 1169 transition count 1795
Iterating global reduction 5 with 1 rules applied. Total rules applied 2563 place count 1169 transition count 1795
Discarding 1 places :
Symmetric choice reduction at 5 with 1 rule applications. Total rules 2564 place count 1168 transition count 1787
Iterating global reduction 5 with 1 rules applied. Total rules applied 2565 place count 1168 transition count 1787
Performed 198 Post agglomeration using F-continuation condition.Transition count delta: 198
Deduced a syphon composed of 198 places in 3 ms
Ensure Unique test removed 2 places
Reduce places removed 200 places and 0 transitions.
Iterating global reduction 5 with 398 rules applied. Total rules applied 2963 place count 968 transition count 1589
Discarding 4 places :
Symmetric choice reduction at 5 with 4 rule applications. Total rules 2967 place count 964 transition count 1585
Ensure Unique test removed 1 places
Iterating global reduction 5 with 5 rules applied. Total rules applied 2972 place count 963 transition count 1585
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 5 with 1 rules applied. Total rules applied 2973 place count 963 transition count 1584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 6 with 1 rules applied. Total rules applied 2974 place count 962 transition count 1584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 7 with 1 Pre rules applied. Total rules applied 2974 place count 962 transition count 1583
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 7 with 2 rules applied. Total rules applied 2976 place count 961 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 7 with 2 rule applications. Total rules 2978 place count 959 transition count 1581
Iterating global reduction 7 with 2 rules applied. Total rules applied 2980 place count 959 transition count 1581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 7 with 2 rules applied. Total rules applied 2982 place count 959 transition count 1579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 8 with 1 rules applied. Total rules applied 2983 place count 958 transition count 1579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2985 place count 957 transition count 1584
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 9 with 2 rules applied. Total rules applied 2987 place count 955 transition count 1582
Reduce places removed 11 places and 0 transitions.
Drop transitions removed 5 transitions
Trivial Post-agglo rules discarded 5 transitions
Performed 5 trivial Post agglomeration. Transition count delta: 5
Iterating post reduction 9 with 16 rules applied. Total rules applied 3003 place count 944 transition count 1577
Reduce places removed 5 places and 0 transitions.
Iterating post reduction 10 with 5 rules applied. Total rules applied 3008 place count 939 transition count 1577
Performed 17 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 11 with 17 Pre rules applied. Total rules applied 3008 place count 939 transition count 1560
Deduced a syphon composed of 17 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 11 with 35 rules applied. Total rules applied 3043 place count 921 transition count 1560
Discarding 12 places :
Implicit places reduction removed 12 places
Iterating post reduction 11 with 12 rules applied. Total rules applied 3055 place count 909 transition count 1560
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 1 Pre rules applied. Total rules applied 3055 place count 909 transition count 1559
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 12 with 2 rules applied. Total rules applied 3057 place count 908 transition count 1559
Performed 18 Post agglomeration using F-continuation condition.Transition count delta: 18
Deduced a syphon composed of 18 places in 3 ms
Reduce places removed 18 places and 0 transitions.
Iterating global reduction 12 with 36 rules applied. Total rules applied 3093 place count 890 transition count 1541
Discarding 11 places :
Symmetric choice reduction at 12 with 11 rule applications. Total rules 3104 place count 879 transition count 1530
Iterating global reduction 12 with 11 rules applied. Total rules applied 3115 place count 879 transition count 1530
Discarding 6 places :
Symmetric choice reduction at 12 with 6 rule applications. Total rules 3121 place count 873 transition count 1524
Iterating global reduction 12 with 6 rules applied. Total rules applied 3127 place count 873 transition count 1524
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 12 with 6 rules applied. Total rules applied 3133 place count 873 transition count 1518
Applied a total of 3133 rules in 843 ms. Remains 873 /2498 variables (removed 1625) and now considering 1518/3087 (removed 1569) transitions.
// Phase 1: matrix 1518 rows 873 cols
[2023-03-11 00:49:01] [INFO ] Computed 145 place invariants in 24 ms
[2023-03-11 00:49:01] [INFO ] Implicit Places using invariants in 591 ms returned [1, 18, 19, 31, 48, 66, 85, 137, 147, 148, 150, 167, 185, 205, 256, 257, 269, 270, 272, 289, 307, 327, 378, 379, 391, 392, 394, 411, 429, 449, 500, 501, 513, 514, 516, 533, 551, 571, 622, 623, 635, 636, 638, 655, 673, 696, 751, 752, 755, 767, 770, 771, 772, 790, 811, 812, 813, 814]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 594 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 815/2498 places, 1518/3087 transitions.
Drop transitions removed 105 transitions
Trivial Post-agglo rules discarded 105 transitions
Performed 105 trivial Post agglomeration. Transition count delta: 105
Iterating post reduction 0 with 105 rules applied. Total rules applied 105 place count 815 transition count 1413
Reduce places removed 105 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 106 rules applied. Total rules applied 211 place count 710 transition count 1412
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 212 place count 709 transition count 1412
Performed 32 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 32 Pre rules applied. Total rules applied 212 place count 709 transition count 1380
Deduced a syphon composed of 32 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 33 places and 0 transitions.
Iterating global reduction 3 with 65 rules applied. Total rules applied 277 place count 676 transition count 1380
Discarding 5 places :
Implicit places reduction removed 5 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 13 rules applied. Total rules applied 290 place count 671 transition count 1372
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 298 place count 663 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 301 place count 660 transition count 1369
Iterating global reduction 5 with 3 rules applied. Total rules applied 304 place count 660 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 307 place count 660 transition count 1366
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 2 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 403 place count 612 transition count 1318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 407 place count 610 transition count 1319
Applied a total of 407 rules in 82 ms. Remains 610 /815 variables (removed 205) and now considering 1319/1518 (removed 199) transitions.
// Phase 1: matrix 1319 rows 610 cols
[2023-03-11 00:49:01] [INFO ] Computed 81 place invariants in 20 ms
[2023-03-11 00:49:02] [INFO ] Implicit Places using invariants in 496 ms returned [88, 94, 99, 174, 180, 185, 262, 268, 273, 350, 356, 361, 438, 444, 449, 528, 534, 539, 607]
Discarding 19 places :
Implicit Place search using SMT only with invariants took 498 ms to find 19 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 591/2498 places, 1319/3087 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 591 transition count 1318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 590 transition count 1318
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 14 place count 578 transition count 1306
Iterating global reduction 2 with 12 rules applied. Total rules applied 26 place count 578 transition count 1306
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 38 place count 566 transition count 1294
Iterating global reduction 2 with 12 rules applied. Total rules applied 50 place count 566 transition count 1294
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 56 place count 560 transition count 1288
Iterating global reduction 2 with 6 rules applied. Total rules applied 62 place count 560 transition count 1288
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 2 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 74 place count 554 transition count 1282
Applied a total of 74 rules in 69 ms. Remains 554 /591 variables (removed 37) and now considering 1282/1319 (removed 37) transitions.
// Phase 1: matrix 1282 rows 554 cols
[2023-03-11 00:49:02] [INFO ] Computed 62 place invariants in 23 ms
[2023-03-11 00:49:02] [INFO ] Implicit Places using invariants in 354 ms returned []
[2023-03-11 00:49:02] [INFO ] Invariant cache hit.
[2023-03-11 00:49:03] [INFO ] Implicit Places using invariants and state equation in 1091 ms returned []
Implicit Place search using SMT with State Equation took 1449 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 554/2498 places, 1282/3087 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 3535 ms. Remains : 554/2498 places, 1282/3087 transitions.
Stuttering acceptance computed with spot in 130 ms :[(OR (NOT p0) (NOT p1)), (NOT p0), (NOT p1)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-11 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}, { cond=(NOT p1), acceptance={} source=0 dest: 2}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=p1, acceptance={} source=2 dest: 2}, { cond=(NOT p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (EQ s465 1) (EQ s499 1) (EQ s490 1)), p1:(EQ s490 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Stuttering criterion allowed to conclude after 19 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06b-LTLFireability-11 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-11 finished in 3701 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 X(G(p0))))'
Support contains 1 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 1846 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
// Phase 1: matrix 3007 rows 2481 cols
[2023-03-11 00:49:05] [INFO ] Computed 266 place invariants in 56 ms
[2023-03-11 00:49:06] [INFO ] Implicit Places using invariants in 1266 ms returned []
[2023-03-11 00:49:06] [INFO ] Invariant cache hit.
[2023-03-11 00:49:11] [INFO ] Implicit Places using invariants and state equation in 4923 ms returned []
Implicit Place search using SMT with State Equation took 6191 ms to find 0 implicit places.
[2023-03-11 00:49:11] [INFO ] Invariant cache hit.
[2023-03-11 00:49:13] [INFO ] Dead Transitions using invariants and state equation in 1883 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 9923 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 160 ms :[true, (NOT p0), (NOT p0)]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p0), acceptance={} source=1 dest: 0}, { cond=p0, acceptance={} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={} source=2 dest: 1}, { cond=p0, acceptance={} source=2 dest: 2}]], initial=2, aps=[p0:(EQ s1998 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, terminal, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Entered a terminal (fully accepting) state of product in 1 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06b-LTLFireability-12 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-12 finished in 10114 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(G(p0))||(p1 U p2))))'
Support contains 4 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 4 places :
Symmetric choice reduction at 0 with 4 rule applications. Total rules 4 place count 2494 transition count 3076
Iterating global reduction 0 with 4 rules applied. Total rules applied 8 place count 2494 transition count 3076
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 2492 transition count 3067
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3066
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3066
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3058
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3058
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3049
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3049
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3041
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3041
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3032
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3032
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3024
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3024
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3015
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3015
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 33 place count 2481 transition count 3007
Iterating global reduction 0 with 1 rules applied. Total rules applied 34 place count 2481 transition count 3007
Applied a total of 34 rules in 1951 ms. Remains 2481 /2498 variables (removed 17) and now considering 3007/3087 (removed 80) transitions.
[2023-03-11 00:49:15] [INFO ] Invariant cache hit.
[2023-03-11 00:49:17] [INFO ] Implicit Places using invariants in 1272 ms returned []
[2023-03-11 00:49:17] [INFO ] Invariant cache hit.
[2023-03-11 00:49:22] [INFO ] Implicit Places using invariants and state equation in 5137 ms returned []
Implicit Place search using SMT with State Equation took 6413 ms to find 0 implicit places.
[2023-03-11 00:49:22] [INFO ] Invariant cache hit.
[2023-03-11 00:49:24] [INFO ] Dead Transitions using invariants and state equation in 2158 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2481/2498 places, 3007/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10523 ms. Remains : 2481/2498 places, 3007/3087 transitions.
Stuttering acceptance computed with spot in 213 ms :[(AND (NOT p0) (NOT p2)), (NOT p0), (AND (NOT p0) (NOT p2))]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-13 automaton TGBA Formula[mat=[[{ cond=(AND (NOT p2) p1 p0), acceptance={} source=0 dest: 0}, { cond=(AND (NOT p2) p1 (NOT p0)), acceptance={0} source=0 dest: 0}, { cond=(AND (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}], [{ cond=p0, acceptance={} source=1 dest: 1}, { cond=(NOT p0), acceptance={0} source=1 dest: 1}], [{ cond=true, acceptance={} source=2 dest: 0}]], initial=2, aps=[p2:(EQ s1916 1), p1:(NEQ s1939 1), p0:(OR (AND (EQ s34 1) (EQ s171 1)) (EQ s1939 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Stuttering criterion allowed to conclude after 378 steps with 0 reset in 4 ms.
FORMULA ASLink-PT-06b-LTLFireability-13 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-13 finished in 10797 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((X(F(p0))||G(p1)))'
Support contains 2 out of 2498 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Discarding 3 places :
Symmetric choice reduction at 0 with 3 rule applications. Total rules 3 place count 2495 transition count 3077
Iterating global reduction 0 with 3 rules applied. Total rules applied 6 place count 2495 transition count 3077
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 8 place count 2493 transition count 3068
Iterating global reduction 0 with 2 rules applied. Total rules applied 10 place count 2493 transition count 3068
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 11 place count 2492 transition count 3067
Iterating global reduction 0 with 1 rules applied. Total rules applied 12 place count 2492 transition count 3067
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 13 place count 2491 transition count 3059
Iterating global reduction 0 with 1 rules applied. Total rules applied 14 place count 2491 transition count 3059
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 15 place count 2490 transition count 3051
Iterating global reduction 0 with 1 rules applied. Total rules applied 16 place count 2490 transition count 3051
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 17 place count 2489 transition count 3050
Iterating global reduction 0 with 1 rules applied. Total rules applied 18 place count 2489 transition count 3050
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 19 place count 2488 transition count 3042
Iterating global reduction 0 with 1 rules applied. Total rules applied 20 place count 2488 transition count 3042
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 21 place count 2487 transition count 3034
Iterating global reduction 0 with 1 rules applied. Total rules applied 22 place count 2487 transition count 3034
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 23 place count 2486 transition count 3033
Iterating global reduction 0 with 1 rules applied. Total rules applied 24 place count 2486 transition count 3033
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 25 place count 2485 transition count 3025
Iterating global reduction 0 with 1 rules applied. Total rules applied 26 place count 2485 transition count 3025
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 27 place count 2484 transition count 3017
Iterating global reduction 0 with 1 rules applied. Total rules applied 28 place count 2484 transition count 3017
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 29 place count 2483 transition count 3016
Iterating global reduction 0 with 1 rules applied. Total rules applied 30 place count 2483 transition count 3016
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 31 place count 2482 transition count 3008
Iterating global reduction 0 with 1 rules applied. Total rules applied 32 place count 2482 transition count 3008
Applied a total of 32 rules in 1965 ms. Remains 2482 /2498 variables (removed 16) and now considering 3008/3087 (removed 79) transitions.
// Phase 1: matrix 3008 rows 2482 cols
[2023-03-11 00:49:26] [INFO ] Computed 266 place invariants in 56 ms
[2023-03-11 00:49:28] [INFO ] Implicit Places using invariants in 1413 ms returned []
[2023-03-11 00:49:28] [INFO ] Invariant cache hit.
[2023-03-11 00:49:33] [INFO ] Implicit Places using invariants and state equation in 5521 ms returned []
Implicit Place search using SMT with State Equation took 6953 ms to find 0 implicit places.
[2023-03-11 00:49:33] [INFO ] Invariant cache hit.
[2023-03-11 00:49:35] [INFO ] Dead Transitions using invariants and state equation in 1862 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 2482/2498 places, 3008/3087 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 10787 ms. Remains : 2482/2498 places, 3008/3087 transitions.
Stuttering acceptance computed with spot in 166 ms :[(NOT p0), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1))]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=(NOT p0), acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p1) (NOT p0)), acceptance={} source=2 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(EQ s1643 0), p1:(EQ s790 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 50000 reset in 1350 ms.
Product exploration explored 100000 steps with 50000 reset in 1274 ms.
Computed a total of 102 stabilizing places and 102 stable transitions
Computed a total of 102 stabilizing places and 102 stable transitions
Detected a total of 102/2482 stabilizing places and 102/3008 transitions leading to convergence knowledge of the form 'F(Gp|G!p)' for 1/2 atomic propositions.
Knowledge obtained : [(AND p0 (NOT p1)), (X (NOT (AND p1 (NOT p0)))), (X (NOT (AND (NOT p1) (NOT p0)))), (X p0), (X (X (NOT (AND p1 (NOT p0))))), (X (X (NOT (AND (NOT p1) (NOT p0))))), (X (X p0)), (F (OR (G p1) (G (NOT p1))))]
False Knowledge obtained : []
Property proved to be true thanks to knowledge :(X p0)
Knowledge based reduction with 8 factoid took 290 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 1 states, 0 edges and 0 AP (stutter insensitive).
FORMULA ASLink-PT-06b-LTLFireability-14 TRUE TECHNIQUES KNOWLEDGE
Treatment of property ASLink-PT-06b-LTLFireability-14 finished in 13936 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||X(G(p1))) U !p1))'
Support contains 2 out of 2498 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 2498/2498 places, 3087/3087 transitions.
Reduce places removed 1 places and 1 transitions.
Drop transitions removed 460 transitions
Trivial Post-agglo rules discarded 460 transitions
Performed 460 trivial Post agglomeration. Transition count delta: 460
Iterating post reduction 0 with 460 rules applied. Total rules applied 460 place count 2497 transition count 2626
Reduce places removed 460 places and 0 transitions.
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 2 transitions
Trivial Post-agglo rules discarded 2 transitions
Performed 2 trivial Post agglomeration. Transition count delta: 2
Iterating post reduction 1 with 463 rules applied. Total rules applied 923 place count 2037 transition count 2623
Reduce places removed 2 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 2 with 3 rules applied. Total rules applied 926 place count 2035 transition count 2622
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 927 place count 2034 transition count 2622
Performed 674 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 674 Pre rules applied. Total rules applied 927 place count 2034 transition count 1948
Deduced a syphon composed of 674 places in 3 ms
Ensure Unique test removed 64 places
Reduce places removed 738 places and 0 transitions.
Iterating global reduction 4 with 1412 rules applied. Total rules applied 2339 place count 1296 transition count 1948
Discarding 6 places :
Implicit places reduction removed 6 places
Drop transitions removed 40 transitions
Trivial Post-agglo rules discarded 40 transitions
Performed 40 trivial Post agglomeration. Transition count delta: 40
Iterating post reduction 4 with 46 rules applied. Total rules applied 2385 place count 1290 transition count 1908
Reduce places removed 40 places and 0 transitions.
Iterating post reduction 5 with 40 rules applied. Total rules applied 2425 place count 1250 transition count 1908
Performed 25 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 25 Pre rules applied. Total rules applied 2425 place count 1250 transition count 1883
Deduced a syphon composed of 25 places in 3 ms
Ensure Unique test removed 24 places
Reduce places removed 49 places and 0 transitions.
Iterating global reduction 6 with 74 rules applied. Total rules applied 2499 place count 1201 transition count 1883
Performed 23 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 23 Pre rules applied. Total rules applied 2499 place count 1201 transition count 1860
Deduced a syphon composed of 23 places in 3 ms
Reduce places removed 23 places and 0 transitions.
Iterating global reduction 6 with 46 rules applied. Total rules applied 2545 place count 1178 transition count 1860
Discarding 2 places :
Symmetric choice reduction at 6 with 2 rule applications. Total rules 2547 place count 1176 transition count 1851
Iterating global reduction 6 with 2 rules applied. Total rules applied 2549 place count 1176 transition count 1851
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 6 with 1 Pre rules applied. Total rules applied 2549 place count 1176 transition count 1850
Deduced a syphon composed of 1 places in 4 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 6 with 2 rules applied. Total rules applied 2551 place count 1175 transition count 1850
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2552 place count 1174 transition count 1842
Iterating global reduction 6 with 1 rules applied. Total rules applied 2553 place count 1174 transition count 1842
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2554 place count 1173 transition count 1834
Iterating global reduction 6 with 1 rules applied. Total rules applied 2555 place count 1173 transition count 1834
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2556 place count 1172 transition count 1826
Iterating global reduction 6 with 1 rules applied. Total rules applied 2557 place count 1172 transition count 1826
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2558 place count 1171 transition count 1818
Iterating global reduction 6 with 1 rules applied. Total rules applied 2559 place count 1171 transition count 1818
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2560 place count 1170 transition count 1810
Iterating global reduction 6 with 1 rules applied. Total rules applied 2561 place count 1170 transition count 1810
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2562 place count 1169 transition count 1802
Iterating global reduction 6 with 1 rules applied. Total rules applied 2563 place count 1169 transition count 1802
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2564 place count 1168 transition count 1794
Iterating global reduction 6 with 1 rules applied. Total rules applied 2565 place count 1168 transition count 1794
Discarding 1 places :
Symmetric choice reduction at 6 with 1 rule applications. Total rules 2566 place count 1167 transition count 1786
Iterating global reduction 6 with 1 rules applied. Total rules applied 2567 place count 1167 transition count 1786
Performed 197 Post agglomeration using F-continuation condition.Transition count delta: 197
Deduced a syphon composed of 197 places in 2 ms
Ensure Unique test removed 2 places
Reduce places removed 199 places and 0 transitions.
Iterating global reduction 6 with 396 rules applied. Total rules applied 2963 place count 968 transition count 1589
Discarding 4 places :
Symmetric choice reduction at 6 with 4 rule applications. Total rules 2967 place count 964 transition count 1585
Ensure Unique test removed 1 places
Iterating global reduction 6 with 5 rules applied. Total rules applied 2972 place count 963 transition count 1585
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 6 with 1 rules applied. Total rules applied 2973 place count 963 transition count 1584
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 7 with 1 rules applied. Total rules applied 2974 place count 962 transition count 1584
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 8 with 1 Pre rules applied. Total rules applied 2974 place count 962 transition count 1583
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 8 with 2 rules applied. Total rules applied 2976 place count 961 transition count 1583
Discarding 2 places :
Symmetric choice reduction at 8 with 2 rule applications. Total rules 2978 place count 959 transition count 1581
Iterating global reduction 8 with 2 rules applied. Total rules applied 2980 place count 959 transition count 1581
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Drop transitions removed 1 transitions
Trivial Post-agglo rules discarded 1 transitions
Performed 1 trivial Post agglomeration. Transition count delta: 1
Iterating post reduction 8 with 2 rules applied. Total rules applied 2982 place count 959 transition count 1579
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 9 with 1 rules applied. Total rules applied 2983 place count 958 transition count 1579
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: -5
Deduced a syphon composed of 1 places in 3 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2985 place count 957 transition count 1584
Reduce places removed 2 places and 2 transitions.
Iterating global reduction 10 with 2 rules applied. Total rules applied 2987 place count 955 transition count 1582
Reduce places removed 12 places and 0 transitions.
Drop transitions removed 6 transitions
Trivial Post-agglo rules discarded 6 transitions
Performed 6 trivial Post agglomeration. Transition count delta: 6
Iterating post reduction 10 with 18 rules applied. Total rules applied 3005 place count 943 transition count 1576
Reduce places removed 6 places and 0 transitions.
Iterating post reduction 11 with 6 rules applied. Total rules applied 3011 place count 937 transition count 1576
Performed 18 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 12 with 18 Pre rules applied. Total rules applied 3011 place count 937 transition count 1558
Deduced a syphon composed of 18 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 12 with 37 rules applied. Total rules applied 3048 place count 918 transition count 1558
Discarding 13 places :
Implicit places reduction removed 13 places
Iterating post reduction 12 with 13 rules applied. Total rules applied 3061 place count 905 transition count 1558
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 13 with 1 Pre rules applied. Total rules applied 3061 place count 905 transition count 1557
Deduced a syphon composed of 1 places in 2 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 13 with 2 rules applied. Total rules applied 3063 place count 904 transition count 1557
Performed 19 Post agglomeration using F-continuation condition.Transition count delta: 19
Deduced a syphon composed of 19 places in 2 ms
Reduce places removed 19 places and 0 transitions.
Iterating global reduction 13 with 38 rules applied. Total rules applied 3101 place count 885 transition count 1538
Discarding 12 places :
Symmetric choice reduction at 13 with 12 rule applications. Total rules 3113 place count 873 transition count 1526
Iterating global reduction 13 with 12 rules applied. Total rules applied 3125 place count 873 transition count 1526
Discarding 6 places :
Symmetric choice reduction at 13 with 6 rule applications. Total rules 3131 place count 867 transition count 1520
Iterating global reduction 13 with 6 rules applied. Total rules applied 3137 place count 867 transition count 1520
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 13 with 6 rules applied. Total rules applied 3143 place count 867 transition count 1514
Applied a total of 3143 rules in 787 ms. Remains 867 /2498 variables (removed 1631) and now considering 1514/3087 (removed 1573) transitions.
// Phase 1: matrix 1514 rows 867 cols
[2023-03-11 00:49:39] [INFO ] Computed 143 place invariants in 30 ms
[2023-03-11 00:49:40] [INFO ] Implicit Places using invariants in 794 ms returned [1, 18, 19, 31, 48, 66, 85, 139, 149, 150, 152, 169, 187, 207, 258, 259, 271, 272, 274, 291, 309, 329, 370, 383, 384, 396, 397, 399, 416, 434, 454, 505, 506, 518, 519, 521, 538, 556, 576, 627, 628, 640, 641, 643, 660, 678, 698, 749, 750, 753, 764, 765, 766, 784, 805, 806, 807, 808]
Discarding 58 places :
Implicit Place search using SMT only with invariants took 795 ms to find 58 implicit places.
Starting structural reductions in SI_LTL mode, iteration 1 : 809/2498 places, 1514/3087 transitions.
Drop transitions removed 102 transitions
Trivial Post-agglo rules discarded 102 transitions
Performed 102 trivial Post agglomeration. Transition count delta: 102
Iterating post reduction 0 with 102 rules applied. Total rules applied 102 place count 809 transition count 1412
Reduce places removed 102 places and 0 transitions.
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Iterating post reduction 1 with 103 rules applied. Total rules applied 205 place count 707 transition count 1411
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 206 place count 706 transition count 1411
Performed 31 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 3 with 31 Pre rules applied. Total rules applied 206 place count 706 transition count 1380
Deduced a syphon composed of 31 places in 2 ms
Ensure Unique test removed 1 places
Reduce places removed 32 places and 0 transitions.
Iterating global reduction 3 with 63 rules applied. Total rules applied 269 place count 674 transition count 1380
Discarding 4 places :
Implicit places reduction removed 4 places
Drop transitions removed 8 transitions
Trivial Post-agglo rules discarded 8 transitions
Performed 8 trivial Post agglomeration. Transition count delta: 8
Iterating post reduction 3 with 12 rules applied. Total rules applied 281 place count 670 transition count 1372
Reduce places removed 8 places and 0 transitions.
Iterating post reduction 4 with 8 rules applied. Total rules applied 289 place count 662 transition count 1372
Discarding 3 places :
Symmetric choice reduction at 5 with 3 rule applications. Total rules 292 place count 659 transition count 1369
Iterating global reduction 5 with 3 rules applied. Total rules applied 295 place count 659 transition count 1369
Ensure Unique test removed 3 transitions
Reduce isomorphic transitions removed 3 transitions.
Iterating post reduction 5 with 3 rules applied. Total rules applied 298 place count 659 transition count 1366
Performed 48 Post agglomeration using F-continuation condition.Transition count delta: 48
Deduced a syphon composed of 48 places in 1 ms
Reduce places removed 48 places and 0 transitions.
Iterating global reduction 6 with 96 rules applied. Total rules applied 394 place count 611 transition count 1318
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 2 places in 2 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 6 with 4 rules applied. Total rules applied 398 place count 609 transition count 1319
Applied a total of 398 rules in 79 ms. Remains 609 /809 variables (removed 200) and now considering 1319/1514 (removed 195) transitions.
// Phase 1: matrix 1319 rows 609 cols
[2023-03-11 00:49:40] [INFO ] Computed 80 place invariants in 24 ms
[2023-03-11 00:49:41] [INFO ] Implicit Places using invariants in 626 ms returned [88, 96, 101, 176, 182, 187, 264, 277, 354, 360, 365, 442, 448, 453, 530, 536, 541, 606]
Discarding 18 places :
Implicit Place search using SMT only with invariants took 628 ms to find 18 implicit places.
Starting structural reductions in SI_LTL mode, iteration 2 : 591/2498 places, 1319/3087 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 591 transition count 1318
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 1 with 1 rules applied. Total rules applied 2 place count 590 transition count 1318
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 13 place count 579 transition count 1307
Iterating global reduction 2 with 11 rules applied. Total rules applied 24 place count 579 transition count 1307
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 34 place count 569 transition count 1297
Iterating global reduction 2 with 10 rules applied. Total rules applied 44 place count 569 transition count 1297
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 48 place count 565 transition count 1293
Iterating global reduction 2 with 4 rules applied. Total rules applied 52 place count 565 transition count 1293
Performed 6 Post agglomeration using F-continuation condition.Transition count delta: 6
Deduced a syphon composed of 6 places in 1 ms
Reduce places removed 6 places and 0 transitions.
Iterating global reduction 2 with 12 rules applied. Total rules applied 64 place count 559 transition count 1287
Applied a total of 64 rules in 81 ms. Remains 559 /591 variables (removed 32) and now considering 1287/1319 (removed 32) transitions.
// Phase 1: matrix 1287 rows 559 cols
[2023-03-11 00:49:41] [INFO ] Computed 62 place invariants in 16 ms
[2023-03-11 00:49:41] [INFO ] Implicit Places using invariants in 491 ms returned []
[2023-03-11 00:49:41] [INFO ] Invariant cache hit.
[2023-03-11 00:49:42] [INFO ] Implicit Places using invariants and state equation in 1146 ms returned []
Implicit Place search using SMT with State Equation took 1640 ms to find 0 implicit places.
Starting structural reductions in SI_LTL mode, iteration 3 : 559/2498 places, 1287/3087 transitions.
Finished structural reductions in SI_LTL mode , in 3 iterations and 4010 ms. Remains : 559/2498 places, 1287/3087 transitions.
Stuttering acceptance computed with spot in 66 ms :[p1, true]
Running random walk in product with property : ASLink-PT-06b-LTLFireability-15 automaton TGBA Formula[mat=[[{ cond=(AND p1 p0), acceptance={0} source=0 dest: 0}, { cond=(AND p1 (NOT p0)), acceptance={0} source=0 dest: 1}], [{ cond=true, acceptance={0} source=1 dest: 1}]], initial=0, aps=[p1:(NEQ s88 1), p0:(EQ s254 1)], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, colored, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Entered a terminal (fully accepting) state of product in 0 steps with 0 reset in 0 ms.
FORMULA ASLink-PT-06b-LTLFireability-15 FALSE TECHNIQUES STUTTER_TEST
Treatment of property ASLink-PT-06b-LTLFireability-15 finished in 4110 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202303021504/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(((p0&&G(!p1)) U (G((p0&&G(!p1)))||(G(!p1)&&p2)))))'
[2023-03-11 00:49:43] [INFO ] Flatten gal took : 127 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin13407434841068336057
[2023-03-11 00:49:43] [INFO ] Too many transitions (3087) to apply POR reductions. Disabling POR matrices.
[2023-03-11 00:49:43] [INFO ] Applying decomposition
[2023-03-11 00:49:43] [INFO ] Built C files in 66ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin13407434841068336057
Running compilation step : cd /tmp/ltsmin13407434841068336057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/limit_time.pl' '720' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2023-03-11 00:49:43] [INFO ] Flatten gal took : 76 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/graph13705978882497288069.txt' '-o' '/tmp/graph13705978882497288069.bin' '-w' '/tmp/graph13705978882497288069.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202303021504/bin/louvain-linux64' '/tmp/graph13705978882497288069.bin' '-l' '-1' '-v' '-w' '/tmp/graph13705978882497288069.weights' '-q' '0' '-e' '0.001'
[2023-03-11 00:49:43] [INFO ] Decomposing Gal with order
[2023-03-11 00:49:43] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 00:49:43] [INFO ] Removed a total of 2367 redundant transitions.
[2023-03-11 00:49:43] [INFO ] Flatten gal took : 129 ms
[2023-03-11 00:49:43] [INFO ] Fuse similar labels procedure discarded/fused a total of 10 labels/synchronizations in 25 ms.
[2023-03-11 00:49:43] [INFO ] Time to serialize gal into /tmp/LTLFireability5235248088613003467.gal : 23 ms
[2023-03-11 00:49:43] [INFO ] Time to serialize properties into /tmp/LTLFireability15084569676186393962.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability5235248088613003467.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability15084569676186393962.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((("(i7.i1.i1.u142.p398!=1)")&&(G(!("((i1.u13.p34==1)&&(i1.u59.p178==1))"))))U((G(("(i7.i1.i1.u142.p398!=1)")&&(G(!("((i1.u13.p34=...325
Formula 0 simplified : X((!"(i7.i1.i1.u142.p398!=1)" | F"((i1.u13.p34==1)&&(i1.u59.p178==1))") R (("((i7.i1.i1.u142.p398==1)&&(i4.i2.i3.u64.p197==1))" | !"...295
Compilation finished in 7701 ms.
Running link step : cd /tmp/ltsmin13407434841068336057;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 116 ms.
Running LTSmin : cd /tmp/ltsmin13407434841068336057;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202303021504/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' 'X((((LTLAPp0==true)&&[](!(LTLAPp1==true))) U ([](((LTLAPp0==true)&&[](!(LTLAPp1==true))))||([](!(LTLAPp1==true))&&(LTLAPp2==true)))))' '--buchi-type=spotba'
Detected timeout of ITS tools.
[2023-03-11 01:11:44] [INFO ] Applying decomposition
[2023-03-11 01:11:44] [INFO ] Flatten gal took : 253 ms
[2023-03-11 01:11:44] [INFO ] Decomposing Gal with order
[2023-03-11 01:11:44] [INFO ] Rewriting arrays to variables to allow decomposition.
[2023-03-11 01:11:45] [INFO ] Removed a total of 2175 redundant transitions.
[2023-03-11 01:11:45] [INFO ] Flatten gal took : 475 ms
[2023-03-11 01:11:46] [INFO ] Fuse similar labels procedure discarded/fused a total of 3437 labels/synchronizations in 272 ms.
[2023-03-11 01:11:46] [INFO ] Time to serialize gal into /tmp/LTLFireability4323773927245081944.gal : 42 ms
[2023-03-11 01:11:46] [INFO ] Time to serialize properties into /tmp/LTLFireability11991250286703108458.ltl : 5 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability4323773927245081944.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability11991250286703108458.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((X((("(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u48.p398!=1)")&&(G(!("((i0.i0.i0.i0.i0.i0.i0.i0.u9.p34==1)&&(i0.i0.i0.i0.i0.i0.i1.i0.i...640
Formula 0 simplified : X((!"(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0.i0.i0.i1.u48.p398!=1)" | F"((i0.i0.i0.i0.i0.i0.i0.i0.u9.p34==1)&&(i0.i0.i0.i0.i0.i0.i1.i0.i0.i0....610
Detected timeout of ITS tools.
[2023-03-11 01:33:47] [INFO ] Flatten gal took : 281 ms
[2023-03-11 01:33:47] [INFO ] Input system was already deterministic with 3087 transitions.
[2023-03-11 01:33:47] [INFO ] Transformed 2498 places.
[2023-03-11 01:33:47] [INFO ] Transformed 3087 transitions.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/pinvar' '/home/mcc/execution/gspn'
P-invariant computation with GreatSPN timed out. Skipping.
Running greatSPN : cd /home/mcc/execution;'/home/mcc/BenchKit/bin//../itstools/bin//..//greatspn//bin/RGMEDD2' '/home/mcc/execution/gspn' '-META' '-varord-only'
Run of greatSPN captured in /home/mcc/execution/outPut.txt
Using order generated by GreatSPN with heuristic : META
[2023-03-11 01:34:18] [INFO ] Time to serialize gal into /tmp/LTLFireability14120108125972934542.gal : 52 ms
[2023-03-11 01:34:18] [INFO ] Time to serialize properties into /tmp/LTLFireability17784249041953937635.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/LTLFireability14120108125972934542.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability17784249041953937635.ltl' '-c' '-stutter-deadlock' '--load-order' '/home/mcc/execution/model.ord' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202303021504/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...344
Read 1 LTL properties
Successfully loaded order from file /home/mcc/execution/model.ord
Checking formula 0 : !((X((("(p398!=1)")&&(G(!("((p34==1)&&(p178==1))"))))U((G(("(p398!=1)")&&(G(!("((p34==1)&&(p178==1))")))))||(((G(!("((p34==1)&&(p178==...214
Formula 0 simplified : X((!"(p398!=1)" | F"((p34==1)&&(p178==1))") R (("((p398==1)&&(p197==1))" | !"(p398!=1)" | F"((p34==1)&&(p178==1))") & F("((p34==1)&&...184
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393220 kB
MemFree: 7625072 kB
After kill :
MemTotal: 16393220 kB
MemFree: 16034108 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ perl -pe 's/.*\.//g'
++ sed s/.jar//
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202303021504.jar
+ VERSION=202303021504
+ echo 'Running Version 202303021504'
+ /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/its-tools -pnfolder /home/mcc/execution -examination LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
Sequence of Actions to be Executed by the VM
This is useful if one wants to reexecute the tool in the VM from the submitted image disk.
set -x
# this is for BenchKit: configuration of major elements for the test
export BK_INPUT="ASLink-PT-06b"
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 ASLink-PT-06b, 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 r005-oct2-167813592600100"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/ASLink-PT-06b.tgz
mv ASLink-PT-06b 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 '
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 ;