About the Execution of 2023-gold for FunctionPointer-PT-c004
| Execution Summary | |||||
| Max Memory Used (MB) |
Time wait (ms) | CPU Usage (ms) | I/O Wait (ms) | Computed Result | Execution Status |
| 15344.464 | 3600000.00 | 8022560.00 | 15811.40 | ?T?F?F?F?FFFF?FF | normal |
Execution Chart
We display below the execution chart for this examination (boot time has been removed).
Trace from the execution
Formatting '/data/fkordon/mcc2024-input.r197-tall-171640625000178.qcow2', fmt=qcow2 size=4294967296 backing_file=/data/fkordon/mcc2024-input.qcow2 backing_fmt=qcow2 cluster_size=65536 lazy_refcounts=off refcount_bits=16
Waiting for the VM to be ready (probing ssh)
.........................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................................
=====================================================================
Generated by BenchKit 2-5568
Executing tool gold2023
Input is FunctionPointer-PT-c004, examination is LTLFireability
Time confinement is 3600 seconds
Memory confinement is 16384 MBytes
Number of cores is 4
Run identifier is r197-tall-171640625000178
=====================================================================
--------------------
preparation of the directory to be used:
/home/mcc/execution
total 4.6M
-rw-r--r-- 1 mcc users 5.6K May 14 13:22 CTLCardinality.txt
-rw-r--r-- 1 mcc users 53K May 14 13:22 CTLCardinality.xml
-rw-r--r-- 1 mcc users 6.6K May 14 13:22 CTLFireability.txt
-rw-r--r-- 1 mcc users 62K May 14 13:22 CTLFireability.xml
-rw-r--r-- 1 mcc users 3.9K May 19 07:09 LTLCardinality.txt
-rw-r--r-- 1 mcc users 27K May 19 15:55 LTLCardinality.xml
-rw-r--r-- 1 mcc users 2.2K May 19 07:18 LTLFireability.txt
-rw-r--r-- 1 mcc users 17K May 19 18:24 LTLFireability.xml
-rw-r--r-- 1 mcc users 12K May 14 13:22 ReachabilityCardinality.txt
-rw-r--r-- 1 mcc users 119K May 14 13:22 ReachabilityCardinality.xml
-rw-r--r-- 1 mcc users 11K May 14 13:22 ReachabilityFireability.txt
-rw-r--r-- 1 mcc users 98K May 14 13:22 ReachabilityFireability.xml
-rw-r--r-- 1 mcc users 1.6K May 19 07:12 UpperBounds.txt
-rw-r--r-- 1 mcc users 3.8K May 19 15:27 UpperBounds.xml
-rw-r--r-- 1 mcc users 6 May 18 16:42 equiv_col
-rw-r--r-- 1 mcc users 5 May 18 16:42 instance
-rw-r--r-- 1 mcc users 6 May 18 16:42 iscolored
-rw-r--r-- 1 mcc users 4.2M May 18 16:42 model.pnml
--------------------
content from stdout:
=== Data for post analysis generated by BenchKit (invocation template)
The expected result is a vector of booleans
BOOL_VECTOR
here is the order used to build the result vector(from text file)
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-00
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-01
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-02
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-03
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-04
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-05
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-06
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-07
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-08
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-09
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-10
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-11
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-12
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-13
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-14
FORMULA_NAME FunctionPointer-PT-c004-LTLFireability-15
=== Now, execution of the tool begins
BK_START 1716528833545
bash -c /home/mcc/BenchKit/BenchKit_head.sh 2> STDERR ; echo ; echo -n "BK_STOP " ; date -u +%s%3N
Invoking MCC driver with
BK_TOOL=gold2023
BK_EXAMINATION=LTLFireability
BK_BIN_PATH=/home/mcc/BenchKit/bin/
BK_TIME_CONFINEMENT=3600
BK_INPUT=FunctionPointer-PT-c004
Not applying reductions.
Model is PT
LTLFireability PT
Running Version 202304061127
[2024-05-24 05:33:55] [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]
[2024-05-24 05:33:55] [INFO ] Parsing pnml file : /home/mcc/execution/model.pnml
[2024-05-24 05:33:55] [INFO ] Load time of PNML (sax parser for PT used): 336 ms
[2024-05-24 05:33:55] [INFO ] Transformed 2826 places.
[2024-05-24 05:33:55] [INFO ] Transformed 8960 transitions.
[2024-05-24 05:33:55] [INFO ] Parsed PT model containing 2826 places and 8960 transitions and 36096 arcs in 444 ms.
Parsed 16 properties from file /home/mcc/execution/LTLFireability.xml in 9 ms.
Working with output stream class java.io.PrintStream
Initial state reduction rules removed 3 formulas.
Deduced a syphon composed of 1198 places in 37 ms
Reduce places removed 1198 places and 2998 transitions.
FORMULA FunctionPointer-PT-c004-LTLFireability-01 TRUE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-07 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-09 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-10 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
FORMULA FunctionPointer-PT-c004-LTLFireability-11 FALSE TECHNIQUES TOPOLOGICAL INITIAL_STATE
Support contains 26 out of 1628 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 1628/1628 places, 5962/5962 transitions.
Reduce places removed 17 places and 0 transitions.
Iterating post reduction 0 with 17 rules applied. Total rules applied 17 place count 1611 transition count 5962
Discarding 289 places :
Symmetric choice reduction at 1 with 289 rule applications. Total rules 306 place count 1322 transition count 3804
Iterating global reduction 1 with 289 rules applied. Total rules applied 595 place count 1322 transition count 3804
Ensure Unique test removed 426 transitions
Reduce isomorphic transitions removed 426 transitions.
Iterating post reduction 1 with 426 rules applied. Total rules applied 1021 place count 1322 transition count 3378
Discarding 146 places :
Symmetric choice reduction at 2 with 146 rule applications. Total rules 1167 place count 1176 transition count 3086
Iterating global reduction 2 with 146 rules applied. Total rules applied 1313 place count 1176 transition count 3086
Ensure Unique test removed 92 transitions
Reduce isomorphic transitions removed 92 transitions.
Iterating post reduction 2 with 92 rules applied. Total rules applied 1405 place count 1176 transition count 2994
Discarding 13 places :
Symmetric choice reduction at 3 with 13 rule applications. Total rules 1418 place count 1163 transition count 2968
Iterating global reduction 3 with 13 rules applied. Total rules applied 1431 place count 1163 transition count 2968
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1443 place count 1151 transition count 2944
Iterating global reduction 3 with 12 rules applied. Total rules applied 1455 place count 1151 transition count 2944
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1467 place count 1139 transition count 2920
Iterating global reduction 3 with 12 rules applied. Total rules applied 1479 place count 1139 transition count 2920
Discarding 12 places :
Symmetric choice reduction at 3 with 12 rule applications. Total rules 1491 place count 1127 transition count 2896
Iterating global reduction 3 with 12 rules applied. Total rules applied 1503 place count 1127 transition count 2896
Discarding 11 places :
Symmetric choice reduction at 3 with 11 rule applications. Total rules 1514 place count 1116 transition count 2874
Iterating global reduction 3 with 11 rules applied. Total rules applied 1525 place count 1116 transition count 2874
Discarding 10 places :
Symmetric choice reduction at 3 with 10 rule applications. Total rules 1535 place count 1106 transition count 2854
Iterating global reduction 3 with 10 rules applied. Total rules applied 1545 place count 1106 transition count 2854
Discarding 9 places :
Symmetric choice reduction at 3 with 9 rule applications. Total rules 1554 place count 1097 transition count 2836
Iterating global reduction 3 with 9 rules applied. Total rules applied 1563 place count 1097 transition count 2836
Discarding 31 places :
Symmetric choice reduction at 3 with 31 rule applications. Total rules 1594 place count 1066 transition count 2722
Iterating global reduction 3 with 31 rules applied. Total rules applied 1625 place count 1066 transition count 2722
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1668 place count 1023 transition count 2550
Iterating global reduction 3 with 43 rules applied. Total rules applied 1711 place count 1023 transition count 2550
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1754 place count 980 transition count 2428
Iterating global reduction 3 with 43 rules applied. Total rules applied 1797 place count 980 transition count 2428
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1840 place count 937 transition count 2342
Iterating global reduction 3 with 43 rules applied. Total rules applied 1883 place count 937 transition count 2342
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 1926 place count 894 transition count 2256
Iterating global reduction 3 with 43 rules applied. Total rules applied 1969 place count 894 transition count 2256
Discarding 43 places :
Symmetric choice reduction at 3 with 43 rule applications. Total rules 2012 place count 851 transition count 2170
Iterating global reduction 3 with 43 rules applied. Total rules applied 2055 place count 851 transition count 2170
Discarding 42 places :
Symmetric choice reduction at 3 with 42 rule applications. Total rules 2097 place count 809 transition count 2086
Iterating global reduction 3 with 42 rules applied. Total rules applied 2139 place count 809 transition count 2086
Discarding 18 places :
Symmetric choice reduction at 3 with 18 rule applications. Total rules 2157 place count 791 transition count 2050
Iterating global reduction 3 with 18 rules applied. Total rules applied 2175 place count 791 transition count 2050
Applied a total of 2175 rules in 1272 ms. Remains 791 /1628 variables (removed 837) and now considering 2050/5962 (removed 3912) transitions.
[2024-05-24 05:33:57] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
// Phase 1: matrix 1375 rows 791 cols
[2024-05-24 05:33:57] [INFO ] Computed 2 invariants in 38 ms
[2024-05-24 05:33:57] [INFO ] Implicit Places using invariants in 593 ms returned []
[2024-05-24 05:33:57] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
[2024-05-24 05:33:57] [INFO ] Invariant cache hit.
[2024-05-24 05:33:58] [INFO ] State equation strengthened by 327 read => feed constraints.
[2024-05-24 05:33:59] [INFO ] Implicit Places using invariants and state equation in 1981 ms returned []
Implicit Place search using SMT with State Equation took 2600 ms to find 0 implicit places.
[2024-05-24 05:33:59] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
[2024-05-24 05:33:59] [INFO ] Invariant cache hit.
[2024-05-24 05:34:00] [INFO ] Dead Transitions using invariants and state equation in 655 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 791/1628 places, 2050/5962 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 4530 ms. Remains : 791/1628 places, 2050/5962 transitions.
Support contains 26 out of 791 places after structural reductions.
[2024-05-24 05:34:00] [INFO ] Flatten gal took : 147 ms
[2024-05-24 05:34:00] [INFO ] Flatten gal took : 101 ms
[2024-05-24 05:34:01] [INFO ] Input system was already deterministic with 2050 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 530 ms. (steps per millisecond=18 ) properties (out of 24) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 23) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 22) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=52 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=111 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 8 ms. (steps per millisecond=125 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=90 ) properties (out of 21) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=83 ) properties (out of 21) seen :0
Running SMT prover for 21 properties.
[2024-05-24 05:34:01] [INFO ] Flow matrix only has 1375 transitions (discarded 675 similar events)
[2024-05-24 05:34:01] [INFO ] Invariant cache hit.
[2024-05-24 05:34:02] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:34:05] [INFO ] After 3861ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:20
[2024-05-24 05:34:06] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:06] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:34:09] [INFO ] After 2583ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :20
[2024-05-24 05:34:09] [INFO ] State equation strengthened by 327 read => feed constraints.
[2024-05-24 05:34:11] [INFO ] After 2258ms SMT Verify possible using 327 Read/Feed constraints in natural domain returned unsat :1 sat :20
[2024-05-24 05:34:11] [INFO ] Deduced a trap composed of 135 places in 179 ms of which 5 ms to minimize.
[2024-05-24 05:34:12] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 265 ms
[2024-05-24 05:34:13] [INFO ] After 4776ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :20
Attempting to minimize the solution found.
Minimization took 1425 ms.
[2024-05-24 05:34:15] [INFO ] After 9409ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :20
Fused 21 Parikh solutions to 20 different solutions.
Parikh walk visited 0 properties in 147 ms.
Support contains 23 out of 791 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 790 transition count 2048
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 790 transition count 2048
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 790 transition count 2046
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 788 transition count 2042
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 788 transition count 2042
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 788 transition count 2038
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 787 transition count 2036
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 787 transition count 2036
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 786 transition count 2034
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 786 transition count 2034
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 20 place count 782 transition count 2018
Iterating global reduction 2 with 4 rules applied. Total rules applied 24 place count 782 transition count 2018
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 28 place count 778 transition count 2002
Iterating global reduction 2 with 4 rules applied. Total rules applied 32 place count 778 transition count 2002
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 36 place count 774 transition count 1994
Iterating global reduction 2 with 4 rules applied. Total rules applied 40 place count 774 transition count 1994
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 44 place count 770 transition count 1986
Iterating global reduction 2 with 4 rules applied. Total rules applied 48 place count 770 transition count 1986
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 52 place count 766 transition count 1978
Iterating global reduction 2 with 4 rules applied. Total rules applied 56 place count 766 transition count 1978
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 60 place count 762 transition count 1970
Iterating global reduction 2 with 4 rules applied. Total rules applied 64 place count 762 transition count 1970
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 68 place count 758 transition count 1962
Iterating global reduction 2 with 4 rules applied. Total rules applied 72 place count 758 transition count 1962
Drop transitions removed 34 transitions
Redundant transition composition rules discarded 34 transitions
Iterating global reduction 2 with 34 rules applied. Total rules applied 106 place count 758 transition count 1928
Applied a total of 106 rules in 630 ms. Remains 758 /791 variables (removed 33) and now considering 1928/2050 (removed 122) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 631 ms. Remains : 758/791 places, 1928/2050 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 194 ms. (steps per millisecond=51 ) properties (out of 20) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 19) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 19) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 18) seen :0
Running SMT prover for 18 properties.
[2024-05-24 05:34:16] [INFO ] Flow matrix only has 1298 transitions (discarded 630 similar events)
// Phase 1: matrix 1298 rows 758 cols
[2024-05-24 05:34:16] [INFO ] Computed 2 invariants in 32 ms
[2024-05-24 05:34:16] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:34:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:34:19] [INFO ] After 3082ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:18
[2024-05-24 05:34:19] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:19] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-24 05:34:22] [INFO ] After 2272ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :18
[2024-05-24 05:34:22] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-24 05:34:24] [INFO ] After 2365ms SMT Verify possible using 315 Read/Feed constraints in natural domain returned unsat :0 sat :18
[2024-05-24 05:34:25] [INFO ] Deduced a trap composed of 139 places in 176 ms of which 1 ms to minimize.
[2024-05-24 05:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 266 ms
[2024-05-24 05:34:25] [INFO ] Deduced a trap composed of 135 places in 194 ms of which 2 ms to minimize.
[2024-05-24 05:34:25] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 284 ms
[2024-05-24 05:34:26] [INFO ] Deduced a trap composed of 135 places in 256 ms of which 0 ms to minimize.
[2024-05-24 05:34:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 343 ms
[2024-05-24 05:34:27] [INFO ] After 5552ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :18
Attempting to minimize the solution found.
Minimization took 1680 ms.
[2024-05-24 05:34:29] [INFO ] After 10003ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :18
Parikh walk visited 0 properties in 83 ms.
Support contains 21 out of 758 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 758/758 places, 1928/1928 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 757 transition count 1926
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 757 transition count 1926
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 3 place count 756 transition count 1924
Iterating global reduction 0 with 1 rules applied. Total rules applied 4 place count 756 transition count 1924
Applied a total of 4 rules in 161 ms. Remains 756 /758 variables (removed 2) and now considering 1924/1928 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 161 ms. Remains : 756/758 places, 1924/1928 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 189 ms. (steps per millisecond=52 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 18) seen :1
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 131311 steps, run timeout after 3001 ms. (steps per millisecond=43 ) properties seen :{}
Probabilistic random walk after 131311 steps, saw 85249 distinct states, run finished after 3002 ms. (steps per millisecond=43 ) properties seen :0
Running SMT prover for 17 properties.
[2024-05-24 05:34:33] [INFO ] Flow matrix only has 1296 transitions (discarded 628 similar events)
// Phase 1: matrix 1296 rows 756 cols
[2024-05-24 05:34:33] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:34:33] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:34:36] [INFO ] After 2873ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-24 05:34:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:34:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:34:38] [INFO ] After 2080ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-24 05:34:38] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-24 05:34:40] [INFO ] After 2326ms SMT Verify possible using 315 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2024-05-24 05:34:41] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 1 ms to minimize.
[2024-05-24 05:34:41] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 271 ms
[2024-05-24 05:34:43] [INFO ] After 4400ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1136 ms.
[2024-05-24 05:34:44] [INFO ] After 8055ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 56 ms.
Support contains 20 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1924/1924 transitions.
Applied a total of 0 rules in 123 ms. Remains 756 /756 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 123 ms. Remains : 756/756 places, 1924/1924 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 202 ms. (steps per millisecond=49 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 11 ms. (steps per millisecond=91 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=55 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1000 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=142 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 7 ms. (steps per millisecond=143 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=66 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=200 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 4 ms. (steps per millisecond=250 ) properties (out of 17) seen :0
Incomplete Best-First random walk after 1001 steps, including 2 resets, run finished after 6 ms. (steps per millisecond=166 ) properties (out of 17) seen :0
Interrupted probabilistic random walk after 117891 steps, run timeout after 3001 ms. (steps per millisecond=39 ) properties seen :{}
Probabilistic random walk after 117891 steps, saw 76541 distinct states, run finished after 3001 ms. (steps per millisecond=39 ) properties seen :0
Running SMT prover for 17 properties.
[2024-05-24 05:34:47] [INFO ] Flow matrix only has 1296 transitions (discarded 628 similar events)
[2024-05-24 05:34:47] [INFO ] Invariant cache hit.
[2024-05-24 05:34:48] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:34:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:34:50] [INFO ] After 2876ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-24 05:34:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:34:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:34:53] [INFO ] After 2068ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-24 05:34:53] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-24 05:34:55] [INFO ] After 2278ms SMT Verify possible using 315 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2024-05-24 05:34:55] [INFO ] Deduced a trap composed of 131 places in 194 ms of which 1 ms to minimize.
[2024-05-24 05:34:56] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 282 ms
[2024-05-24 05:34:57] [INFO ] After 4380ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 1158 ms.
[2024-05-24 05:34:58] [INFO ] After 8049ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
Parikh walk visited 0 properties in 68 ms.
Support contains 20 out of 756 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1924/1924 transitions.
Applied a total of 0 rules in 126 ms. Remains 756 /756 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 126 ms. Remains : 756/756 places, 1924/1924 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 756/756 places, 1924/1924 transitions.
Applied a total of 0 rules in 124 ms. Remains 756 /756 variables (removed 0) and now considering 1924/1924 (removed 0) transitions.
[2024-05-24 05:34:59] [INFO ] Flow matrix only has 1296 transitions (discarded 628 similar events)
[2024-05-24 05:34:59] [INFO ] Invariant cache hit.
[2024-05-24 05:34:59] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-24 05:34:59] [INFO ] Flow matrix only has 1296 transitions (discarded 628 similar events)
[2024-05-24 05:34:59] [INFO ] Invariant cache hit.
[2024-05-24 05:34:59] [INFO ] State equation strengthened by 315 read => feed constraints.
[2024-05-24 05:35:01] [INFO ] Implicit Places using invariants and state equation in 1778 ms returned []
Implicit Place search using SMT with State Equation took 2127 ms to find 0 implicit places.
[2024-05-24 05:35:01] [INFO ] Redundant transitions in 116 ms returned []
[2024-05-24 05:35:01] [INFO ] Flow matrix only has 1296 transitions (discarded 628 similar events)
[2024-05-24 05:35:01] [INFO ] Invariant cache hit.
[2024-05-24 05:35:01] [INFO ] Dead Transitions using invariants and state equation in 637 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3013 ms. Remains : 756/756 places, 1924/1924 transitions.
Graph (trivial) has 1141 edges and 756 vertex of which 192 / 756 are part of one of the 64 SCC in 5 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 500 transitions
Reduce isomorphic transitions removed 820 transitions.
Drop transitions removed 27 transitions
Trivial Post-agglo rules discarded 27 transitions
Performed 27 trivial Post agglomeration. Transition count delta: 27
Iterating post reduction 0 with 27 rules applied. Total rules applied 28 place count 628 transition count 1077
Reduce places removed 27 places and 0 transitions.
Iterating post reduction 1 with 27 rules applied. Total rules applied 55 place count 601 transition count 1077
Performed 114 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 114 Pre rules applied. Total rules applied 55 place count 601 transition count 963
Deduced a syphon composed of 114 places in 0 ms
Reduce places removed 114 places and 0 transitions.
Iterating global reduction 2 with 228 rules applied. Total rules applied 283 place count 487 transition count 963
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 346 place count 424 transition count 900
Iterating global reduction 2 with 63 rules applied. Total rules applied 409 place count 424 transition count 900
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 535 place count 424 transition count 774
Performed 138 Post agglomeration using F-continuation condition.Transition count delta: 138
Deduced a syphon composed of 138 places in 0 ms
Reduce places removed 138 places and 0 transitions.
Iterating global reduction 3 with 276 rules applied. Total rules applied 811 place count 286 transition count 636
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 874 place count 223 transition count 510
Iterating global reduction 3 with 63 rules applied. Total rules applied 937 place count 223 transition count 510
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 938 place count 223 transition count 509
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1000 place count 161 transition count 385
Iterating global reduction 4 with 62 rules applied. Total rules applied 1062 place count 161 transition count 385
Discarding 62 places :
Symmetric choice reduction at 4 with 62 rule applications. Total rules 1124 place count 99 transition count 261
Iterating global reduction 4 with 62 rules applied. Total rules applied 1186 place count 99 transition count 261
Ensure Unique test removed 62 transitions
Reduce isomorphic transitions removed 62 transitions.
Iterating post reduction 4 with 62 rules applied. Total rules applied 1248 place count 99 transition count 199
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1250 place count 98 transition count 198
Performed 14 Post agglomeration using F-continuation condition.Transition count delta: -1
Deduced a syphon composed of 14 places in 0 ms
Reduce places removed 14 places and 0 transitions.
Iterating global reduction 5 with 28 rules applied. Total rules applied 1278 place count 84 transition count 199
Drop transitions removed 11 transitions
Redundant transition composition rules discarded 11 transitions
Iterating global reduction 5 with 11 rules applied. Total rules applied 1289 place count 84 transition count 188
Applied a total of 1289 rules in 93 ms. Remains 84 /756 variables (removed 672) and now considering 188/1924 (removed 1736) transitions.
Running SMT prover for 17 properties.
// Phase 1: matrix 188 rows 84 cols
[2024-05-24 05:35:02] [INFO ] Computed 2 invariants in 2 ms
[2024-05-24 05:35:02] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:35:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:35:02] [INFO ] After 259ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:17
[2024-05-24 05:35:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:35:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:35:02] [INFO ] After 174ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :17
[2024-05-24 05:35:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:35:02] [INFO ] After 149ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :17
[2024-05-24 05:35:02] [INFO ] After 361ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :17
Attempting to minimize the solution found.
Minimization took 141 ms.
[2024-05-24 05:35:03] [INFO ] After 763ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :17
FORMULA FunctionPointer-PT-c004-LTLFireability-15 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
FORMULA FunctionPointer-PT-c004-LTLFireability-05 FALSE TECHNIQUES REACHABILITY_KNOWLEDGE
Successfully simplified 1 atomic propositions for a total of 9 simplifications.
Computed a total of 192 stabilizing places and 512 stable transitions
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Support contains 2 out of 791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 775 transition count 2016
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 775 transition count 2016
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 775 transition count 2006
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 759 transition count 1972
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 759 transition count 1972
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 759 transition count 1968
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 746 transition count 1928
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 746 transition count 1928
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 119 place count 731 transition count 1880
Iterating global reduction 2 with 15 rules applied. Total rules applied 134 place count 731 transition count 1880
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 151 place count 714 transition count 1834
Iterating global reduction 2 with 17 rules applied. Total rules applied 168 place count 714 transition count 1834
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 187 place count 695 transition count 1784
Iterating global reduction 2 with 19 rules applied. Total rules applied 206 place count 695 transition count 1784
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 224 place count 677 transition count 1740
Iterating global reduction 2 with 18 rules applied. Total rules applied 242 place count 677 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 260 place count 659 transition count 1702
Iterating global reduction 2 with 18 rules applied. Total rules applied 278 place count 659 transition count 1702
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 295 place count 642 transition count 1666
Iterating global reduction 2 with 17 rules applied. Total rules applied 312 place count 642 transition count 1666
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 323 place count 631 transition count 1642
Iterating global reduction 2 with 11 rules applied. Total rules applied 334 place count 631 transition count 1642
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 342 place count 623 transition count 1626
Iterating global reduction 2 with 8 rules applied. Total rules applied 350 place count 623 transition count 1626
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 355 place count 618 transition count 1616
Iterating global reduction 2 with 5 rules applied. Total rules applied 360 place count 618 transition count 1616
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 362 place count 616 transition count 1612
Iterating global reduction 2 with 2 rules applied. Total rules applied 364 place count 616 transition count 1612
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 365 place count 615 transition count 1610
Iterating global reduction 2 with 1 rules applied. Total rules applied 366 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 614 transition count 1608
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 2 with 4 rules applied. Total rules applied 372 place count 614 transition count 1604
Applied a total of 372 rules in 616 ms. Remains 614 /791 variables (removed 177) and now considering 1604/2050 (removed 446) transitions.
[2024-05-24 05:35:03] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 05:35:03] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 05:35:04] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-24 05:35:04] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:04] [INFO ] Invariant cache hit.
[2024-05-24 05:35:04] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:35:06] [INFO ] Implicit Places using invariants and state equation in 2057 ms returned []
Implicit Place search using SMT with State Equation took 2411 ms to find 0 implicit places.
[2024-05-24 05:35:06] [INFO ] Redundant transitions in 88 ms returned []
[2024-05-24 05:35:06] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:06] [INFO ] Invariant cache hit.
[2024-05-24 05:35:06] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 614/791 places, 1604/2050 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3660 ms. Remains : 614/791 places, 1604/2050 transitions.
ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2ANTLR Tool version 4.9.3 used for code generation does not match the current runtime version 4.7.2ANTLR Runtime version 4.9.3 used for parser compilation does not match the current runtime version 4.7.2Stuttering acceptance computed with spot in 207 ms :[(NOT p0), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-00 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=1 dest: 1}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s535 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant, very-weak, weak, inherently-weak], stateDesc=[null, null][true, true]]
Product exploration explored 100000 steps with 0 reset in 530 ms.
Product exploration explored 100000 steps with 1 reset in 523 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 78 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 79 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 27 ms. (steps per millisecond=370 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 536138 steps, run timeout after 3001 ms. (steps per millisecond=178 ) properties seen :{}
Probabilistic random walk after 536138 steps, saw 347987 distinct states, run finished after 3001 ms. (steps per millisecond=178 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:35:11] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:11] [INFO ] Invariant cache hit.
[2024-05-24 05:35:11] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:35:11] [INFO ] After 413ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:35:12] [INFO ] After 329ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:12] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:35:12] [INFO ] After 206ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:12] [INFO ] After 384ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 59 ms.
[2024-05-24 05:35:12] [INFO ] After 877ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 0 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Graph (complete) has 2680 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 54 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 54 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 641642 steps, run timeout after 3001 ms. (steps per millisecond=213 ) properties seen :{}
Probabilistic random walk after 641642 steps, saw 393442 distinct states, run finished after 3003 ms. (steps per millisecond=213 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:35:15] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 05:35:15] [INFO ] Computed 3 invariants in 11 ms
[2024-05-24 05:35:15] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:16] [INFO ] After 337ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:16] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:16] [INFO ] After 247ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:16] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:16] [INFO ] After 127ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:16] [INFO ] After 243ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 122 ms.
[2024-05-24 05:35:16] [INFO ] After 695ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 50 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 50 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 05:35:16] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:16] [INFO ] Invariant cache hit.
[2024-05-24 05:35:17] [INFO ] Implicit Places using invariants in 255 ms returned []
[2024-05-24 05:35:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:17] [INFO ] Invariant cache hit.
[2024-05-24 05:35:17] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:17] [INFO ] Implicit Places using invariants and state equation in 726 ms returned []
Implicit Place search using SMT with State Equation took 985 ms to find 0 implicit places.
[2024-05-24 05:35:17] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 05:35:17] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:17] [INFO ] Invariant cache hit.
[2024-05-24 05:35:18] [INFO ] Dead Transitions using invariants and state equation in 412 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1480 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 25 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 05:35:18] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 05:35:18] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:35:18] [INFO ] After 8ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 05:35:18] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:35:18] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:18] [INFO ] After 29ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:18] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:35:18] [INFO ] After 8ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:18] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:18] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 05:35:18] [INFO ] After 44ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 231 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 63 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 86 ms :[(NOT p0), (NOT p0)]
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 78 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 05:35:18] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 05:35:18] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:35:19] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-24 05:35:19] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:19] [INFO ] Invariant cache hit.
[2024-05-24 05:35:19] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:35:20] [INFO ] Implicit Places using invariants and state equation in 1401 ms returned []
Implicit Place search using SMT with State Equation took 1775 ms to find 0 implicit places.
[2024-05-24 05:35:20] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 05:35:20] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:20] [INFO ] Invariant cache hit.
[2024-05-24 05:35:21] [INFO ] Dead Transitions using invariants and state equation in 544 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2445 ms. Remains : 614/614 places, 1604/1604 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 72 ms :[(NOT p0), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 5 ms. (steps per millisecond=2000 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 555707 steps, run timeout after 3001 ms. (steps per millisecond=185 ) properties seen :{}
Probabilistic random walk after 555707 steps, saw 360686 distinct states, run finished after 3001 ms. (steps per millisecond=185 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:35:24] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:24] [INFO ] Invariant cache hit.
[2024-05-24 05:35:24] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:35:24] [INFO ] After 401ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:25] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:25] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:35:25] [INFO ] After 332ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:25] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:35:25] [INFO ] After 208ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:25] [INFO ] After 370ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 66 ms.
[2024-05-24 05:35:25] [INFO ] After 893ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Graph (complete) has 2680 edges and 614 vertex of which 422 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 422 transition count 1220
Applied a total of 385 rules in 50 ms. Remains 422 /614 variables (removed 192) and now considering 1220/1604 (removed 384) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 61 ms. Remains : 422/614 places, 1220/1604 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 50 ms. (steps per millisecond=200 ) properties (out of 1) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 9 ms. (steps per millisecond=1111 ) properties (out of 1) seen :0
Interrupted probabilistic random walk after 625186 steps, run timeout after 3001 ms. (steps per millisecond=208 ) properties seen :{}
Probabilistic random walk after 625186 steps, saw 383351 distinct states, run finished after 3001 ms. (steps per millisecond=208 ) properties seen :0
Running SMT prover for 1 properties.
[2024-05-24 05:35:28] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
// Phase 1: matrix 689 rows 422 cols
[2024-05-24 05:35:28] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 05:35:29] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:29] [INFO ] After 324ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:29] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:35:29] [INFO ] After 254ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:29] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:29] [INFO ] After 120ms SMT Verify possible using 75 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:29] [INFO ] After 236ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 118 ms.
[2024-05-24 05:35:29] [INFO ] After 684ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Parikh walk visited 0 properties in 1 ms.
Support contains 2 out of 422 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 57 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 58 ms. Remains : 422/422 places, 1220/1220 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 422/422 places, 1220/1220 transitions.
Applied a total of 0 rules in 44 ms. Remains 422 /422 variables (removed 0) and now considering 1220/1220 (removed 0) transitions.
[2024-05-24 05:35:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:30] [INFO ] Invariant cache hit.
[2024-05-24 05:35:30] [INFO ] Implicit Places using invariants in 251 ms returned []
[2024-05-24 05:35:30] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:30] [INFO ] Invariant cache hit.
[2024-05-24 05:35:30] [INFO ] State equation strengthened by 75 read => feed constraints.
[2024-05-24 05:35:31] [INFO ] Implicit Places using invariants and state equation in 769 ms returned []
Implicit Place search using SMT with State Equation took 1021 ms to find 0 implicit places.
[2024-05-24 05:35:31] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 05:35:31] [INFO ] Flow matrix only has 689 transitions (discarded 531 similar events)
[2024-05-24 05:35:31] [INFO ] Invariant cache hit.
[2024-05-24 05:35:31] [INFO ] Dead Transitions using invariants and state equation in 405 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1506 ms. Remains : 422/422 places, 1220/1220 transitions.
Ensure Unique test removed 531 transitions
Reduce isomorphic transitions removed 531 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 541 rules applied. Total rules applied 541 place count 422 transition count 679
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 551 place count 412 transition count 679
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 551 place count 412 transition count 606
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 697 place count 339 transition count 606
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 2 with 254 rules applied. Total rules applied 951 place count 212 transition count 479
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1015 place count 148 transition count 351
Iterating global reduction 2 with 64 rules applied. Total rules applied 1079 place count 148 transition count 351
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1080 place count 148 transition count 350
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1143 place count 85 transition count 224
Iterating global reduction 3 with 63 rules applied. Total rules applied 1206 place count 85 transition count 224
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1269 place count 22 transition count 98
Iterating global reduction 3 with 63 rules applied. Total rules applied 1332 place count 22 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1395 place count 22 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1395 place count 22 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1397 place count 21 transition count 34
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1399 place count 20 transition count 33
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1401 place count 19 transition count 33
Applied a total of 1401 rules in 36 ms. Remains 19 /422 variables (removed 403) and now considering 33/1220 (removed 1187) transitions.
Running SMT prover for 1 properties.
// Phase 1: matrix 33 rows 19 cols
[2024-05-24 05:35:31] [INFO ] Computed 3 invariants in 0 ms
[2024-05-24 05:35:31] [INFO ] [Real]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:35:31] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1
[2024-05-24 05:35:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:35:31] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:31] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:1
[2024-05-24 05:35:31] [INFO ] [Nat]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 05:35:31] [INFO ] After 9ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:31] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :1
[2024-05-24 05:35:31] [INFO ] After 5ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :1
Attempting to minimize the solution found.
Minimization took 2 ms.
[2024-05-24 05:35:31] [INFO ] After 36ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :1
Knowledge obtained : [p0, (X p0), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 2 states, 3 edges and 1 AP (stutter insensitive) to 2 states, 3 edges and 1 AP (stutter insensitive).
Stuttering acceptance computed with spot in 80 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 76 ms :[(NOT p0), (NOT p0)]
Stuttering acceptance computed with spot in 75 ms :[(NOT p0), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 374 ms.
Product exploration explored 100000 steps with 1 reset in 545 ms.
Built C files in :
/tmp/ltsmin2494664468771366709
[2024-05-24 05:35:32] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:35:33] [INFO ] Built C files in 36ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2494664468771366709
Running compilation step : cd /tmp/ltsmin2494664468771366709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2970 ms.
Running link step : cd /tmp/ltsmin2494664468771366709;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 55 ms.
Running LTSmin : cd /tmp/ltsmin2494664468771366709;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10178099676460409564.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 2 out of 614 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 614/614 places, 1604/1604 transitions.
Applied a total of 0 rules in 95 ms. Remains 614 /614 variables (removed 0) and now considering 1604/1604 (removed 0) transitions.
[2024-05-24 05:35:48] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
// Phase 1: matrix 1071 rows 614 cols
[2024-05-24 05:35:48] [INFO ] Computed 2 invariants in 9 ms
[2024-05-24 05:35:48] [INFO ] Implicit Places using invariants in 371 ms returned []
[2024-05-24 05:35:48] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:48] [INFO ] Invariant cache hit.
[2024-05-24 05:35:48] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:35:49] [INFO ] Implicit Places using invariants and state equation in 1430 ms returned []
Implicit Place search using SMT with State Equation took 1804 ms to find 0 implicit places.
[2024-05-24 05:35:49] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 05:35:49] [INFO ] Flow matrix only has 1071 transitions (discarded 533 similar events)
[2024-05-24 05:35:49] [INFO ] Invariant cache hit.
[2024-05-24 05:35:50] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2451 ms. Remains : 614/614 places, 1604/1604 transitions.
Built C files in :
/tmp/ltsmin8757043400921285229
[2024-05-24 05:35:50] [INFO ] Too many transitions (1604) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:35:50] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin8757043400921285229
Running compilation step : cd /tmp/ltsmin8757043400921285229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2735 ms.
Running link step : cd /tmp/ltsmin8757043400921285229;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin8757043400921285229;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased3249185778658906504.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:36:05] [INFO ] Flatten gal took : 66 ms
[2024-05-24 05:36:05] [INFO ] Flatten gal took : 70 ms
[2024-05-24 05:36:05] [INFO ] Time to serialize gal into /tmp/LTL3248045184085408497.gal : 10 ms
[2024-05-24 05:36:05] [INFO ] Time to serialize properties into /tmp/LTL16629459892735873169.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3248045184085408497.gal' '-t' 'CGAL' '-hoa' '/tmp/aut10672130773540016664.hoa' '-atoms' '/tmp/LTL16629459892735873169.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL16629459892735873169.prop.
Loaded 1 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut10672130773540016664.hoa
Detected timeout of ITS tools.
[2024-05-24 05:36:20] [INFO ] Flatten gal took : 66 ms
[2024-05-24 05:36:21] [INFO ] Flatten gal took : 48 ms
[2024-05-24 05:36:21] [INFO ] Time to serialize gal into /tmp/LTL3085565757926183920.gal : 7 ms
[2024-05-24 05:36:21] [INFO ] Time to serialize properties into /tmp/LTL17297297320300683616.ltl : 10 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3085565757926183920.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17297297320300683616.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1638<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1638<1))"
Detected timeout of ITS tools.
[2024-05-24 05:36:36] [INFO ] Flatten gal took : 47 ms
[2024-05-24 05:36:36] [INFO ] Applying decomposition
[2024-05-24 05:36:36] [INFO ] Flatten gal took : 45 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7864572942292023741.txt' '-o' '/tmp/graph7864572942292023741.bin' '-w' '/tmp/graph7864572942292023741.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7864572942292023741.bin' '-l' '-1' '-v' '-w' '/tmp/graph7864572942292023741.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:36:36] [INFO ] Decomposing Gal with order
[2024-05-24 05:36:36] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:36:36] [INFO ] Removed a total of 2664 redundant transitions.
[2024-05-24 05:36:36] [INFO ] Flatten gal took : 149 ms
[2024-05-24 05:36:36] [INFO ] Fuse similar labels procedure discarded/fused a total of 1101 labels/synchronizations in 86 ms.
[2024-05-24 05:36:36] [INFO ] Time to serialize gal into /tmp/LTL12635791519792181830.gal : 13 ms
[2024-05-24 05:36:36] [INFO ] Time to serialize properties into /tmp/LTL13857099036288868489.ltl : 78 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12635791519792181830.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL13857099036288868489.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(F("((i4.u1.s1<1)||(i24.i1.u146.l1638<1))"))))
Formula 0 simplified : FG!"((i4.u1.s1<1)||(i24.i1.u146.l1638<1))"
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin3308905975227541064
[2024-05-24 05:36:51] [INFO ] Built C files in 20ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3308905975227541064
Running compilation step : cd /tmp/ltsmin3308905975227541064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2860 ms.
Running link step : cd /tmp/ltsmin3308905975227541064;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 41 ms.
Running LTSmin : cd /tmp/ltsmin3308905975227541064;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-00 finished in 123774 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(!p1))||G(!p1)))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 776 transition count 2010
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 761 transition count 1978
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 761 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 761 transition count 1974
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 749 transition count 1936
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 749 transition count 1936
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 735 transition count 1890
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 735 transition count 1890
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 140 place count 719 transition count 1846
Iterating global reduction 2 with 16 rules applied. Total rules applied 156 place count 719 transition count 1846
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 703 transition count 1808
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 703 transition count 1808
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 687 transition count 1772
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 236 place count 671 transition count 1736
Iterating global reduction 2 with 16 rules applied. Total rules applied 252 place count 671 transition count 1736
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 268 place count 655 transition count 1700
Iterating global reduction 2 with 16 rules applied. Total rules applied 284 place count 655 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 294 place count 645 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 645 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 638 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 638 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 322 place count 634 transition count 1654
Iterating global reduction 2 with 4 rules applied. Total rules applied 326 place count 634 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 330 place count 630 transition count 1646
Iterating global reduction 2 with 4 rules applied. Total rules applied 334 place count 630 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 628 transition count 1642
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 628 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 340 place count 626 transition count 1638
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 626 transition count 1638
Applied a total of 342 rules in 287 ms. Remains 626 /791 variables (removed 165) and now considering 1638/2050 (removed 412) transitions.
[2024-05-24 05:37:07] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-24 05:37:07] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:37:07] [INFO ] Implicit Places using invariants in 372 ms returned []
[2024-05-24 05:37:07] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:37:07] [INFO ] Invariant cache hit.
[2024-05-24 05:37:07] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:09] [INFO ] Implicit Places using invariants and state equation in 1608 ms returned []
Implicit Place search using SMT with State Equation took 1986 ms to find 0 implicit places.
[2024-05-24 05:37:09] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:37:09] [INFO ] Invariant cache hit.
[2024-05-24 05:37:09] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 626/791 places, 1638/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2818 ms. Remains : 626/791 places, 1638/2050 transitions.
Stuttering acceptance computed with spot in 131 ms :[p1, p1, p1]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s550 1)), p1:(AND (GEQ s0 1) (GEQ s544 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 411 ms.
Product exploration explored 100000 steps with 0 reset in 567 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 94 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 99 ms :[p1, p1, p1]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 172 ms. (steps per millisecond=58 ) properties (out of 4) 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 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 203637 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203637 steps, saw 132192 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:37:14] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:37:14] [INFO ] Invariant cache hit.
[2024-05-24 05:37:14] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:37:14] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:14] [INFO ] After 473ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:15] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:37:15] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:37:15] [INFO ] After 865ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:15] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:16] [INFO ] After 783ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:16] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 0 ms to minimize.
[2024-05-24 05:37:16] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2024-05-24 05:37:17] [INFO ] After 1358ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 276 ms.
[2024-05-24 05:37:17] [INFO ] After 2647ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1632
Applied a total of 6 rules in 146 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1638 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 626/626 places, 1632/1638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 101 ms. (steps per millisecond=99 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 248172 steps, run timeout after 3001 ms. (steps per millisecond=82 ) properties seen :{}
Probabilistic random walk after 248172 steps, saw 161094 distinct states, run finished after 3003 ms. (steps per millisecond=82 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:37:20] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
// Phase 1: matrix 1089 rows 626 cols
[2024-05-24 05:37:20] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:37:21] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:21] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:21] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:37:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:22] [INFO ] After 943ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:23] [INFO ] After 685ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:23] [INFO ] Deduced a trap composed of 131 places in 144 ms of which 0 ms to minimize.
[2024-05-24 05:37:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 217 ms
[2024-05-24 05:37:23] [INFO ] After 1351ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 234 ms.
[2024-05-24 05:37:24] [INFO ] After 2690ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 74 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 626/626 places, 1632/1632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 78 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
[2024-05-24 05:37:24] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:37:24] [INFO ] Invariant cache hit.
[2024-05-24 05:37:24] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-24 05:37:24] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:37:24] [INFO ] Invariant cache hit.
[2024-05-24 05:37:24] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:26] [INFO ] Implicit Places using invariants and state equation in 1810 ms returned []
Implicit Place search using SMT with State Equation took 2181 ms to find 0 implicit places.
[2024-05-24 05:37:26] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:37:26] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:37:26] [INFO ] Invariant cache hit.
[2024-05-24 05:37:27] [INFO ] Dead Transitions using invariants and state equation in 537 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2839 ms. Remains : 626/626 places, 1632/1632 transitions.
Graph (trivial) has 964 edges and 626 vertex of which 192 / 626 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 498 transition count 884
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 27 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 179 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 242 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 305 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 431 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 687 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 751 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 815 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 879 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 942 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1005 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1068 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1131 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1131 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1133 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1135 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1139 place count 24 transition count 45
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1142 place count 24 transition count 42
Applied a total of 1142 rules in 34 ms. Remains 24 /626 variables (removed 602) and now considering 42/1632 (removed 1590) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 42 rows 24 cols
[2024-05-24 05:37:27] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:37:27] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:37:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:37:27] [INFO ] After 9ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-24 05:37:27] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:37:27] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:27] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:37:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:37:27] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:27] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:27] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 05:37:27] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 113 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 113 ms :[p1, p1, p1]
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Applied a total of 0 rules in 17 ms. Remains 626 /626 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2024-05-24 05:37:27] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-24 05:37:27] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 05:37:27] [INFO ] Implicit Places using invariants in 358 ms returned []
[2024-05-24 05:37:27] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:37:27] [INFO ] Invariant cache hit.
[2024-05-24 05:37:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:29] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1793 ms to find 0 implicit places.
[2024-05-24 05:37:29] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:37:29] [INFO ] Invariant cache hit.
[2024-05-24 05:37:29] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2335 ms. Remains : 626/626 places, 1638/1638 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 116 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 125 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 219418 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 219418 steps, saw 142433 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:37:33] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:37:33] [INFO ] Invariant cache hit.
[2024-05-24 05:37:33] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:37:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:37:33] [INFO ] After 470ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:37:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:34] [INFO ] After 870ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:34] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:35] [INFO ] After 793ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:35] [INFO ] Deduced a trap composed of 131 places in 143 ms of which 0 ms to minimize.
[2024-05-24 05:37:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-24 05:37:36] [INFO ] After 1364ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 279 ms.
[2024-05-24 05:37:36] [INFO ] After 2660ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1632
Applied a total of 6 rules in 148 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1638 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 149 ms. Remains : 626/626 places, 1632/1638 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 160 ms. (steps per millisecond=62 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) seen :0
Interrupted probabilistic random walk after 220183 steps, run timeout after 3001 ms. (steps per millisecond=73 ) properties seen :{}
Probabilistic random walk after 220183 steps, saw 142929 distinct states, run finished after 3001 ms. (steps per millisecond=73 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:37:39] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
// Phase 1: matrix 1089 rows 626 cols
[2024-05-24 05:37:39] [INFO ] Computed 2 invariants in 7 ms
[2024-05-24 05:37:40] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:37:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:40] [INFO ] After 443ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:37:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:41] [INFO ] After 921ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:41] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:42] [INFO ] After 630ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:42] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 0 ms to minimize.
[2024-05-24 05:37:42] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 228 ms
[2024-05-24 05:37:42] [INFO ] After 1287ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 223 ms.
[2024-05-24 05:37:43] [INFO ] After 2585ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 77 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 626/626 places, 1632/1632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 78 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
[2024-05-24 05:37:43] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:37:43] [INFO ] Invariant cache hit.
[2024-05-24 05:37:43] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-24 05:37:43] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:37:43] [INFO ] Invariant cache hit.
[2024-05-24 05:37:43] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:37:45] [INFO ] Implicit Places using invariants and state equation in 1527 ms returned []
Implicit Place search using SMT with State Equation took 1876 ms to find 0 implicit places.
[2024-05-24 05:37:45] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 05:37:45] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:37:45] [INFO ] Invariant cache hit.
[2024-05-24 05:37:45] [INFO ] Dead Transitions using invariants and state equation in 543 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2531 ms. Remains : 626/626 places, 1632/1632 transitions.
Graph (trivial) has 964 edges and 626 vertex of which 192 / 626 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 498 transition count 884
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 27 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 179 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 242 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 305 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 431 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 687 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 751 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 815 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 879 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 942 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1005 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1068 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1131 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1131 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1133 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1135 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1139 place count 24 transition count 45
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1142 place count 24 transition count 42
Applied a total of 1142 rules in 38 ms. Remains 24 /626 variables (removed 602) and now considering 42/1632 (removed 1590) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 42 rows 24 cols
[2024-05-24 05:37:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:37:45] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:37:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:45] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-24 05:37:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:37:45] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:45] [INFO ] After 38ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:37:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:37:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:37:45] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:45] [INFO ] After 10ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:37:45] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 10 ms.
[2024-05-24 05:37:45] [INFO ] After 81ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 120 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 115 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 124 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 117 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 0 reset in 430 ms.
Product exploration explored 100000 steps with 0 reset in 405 ms.
Built C files in :
/tmp/ltsmin5900498481430637065
[2024-05-24 05:37:47] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5900498481430637065
Running compilation step : cd /tmp/ltsmin5900498481430637065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2844 ms.
Running link step : cd /tmp/ltsmin5900498481430637065;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin5900498481430637065;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16743428674510317396.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Applied a total of 0 rules in 20 ms. Remains 626 /626 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2024-05-24 05:38:02] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-24 05:38:02] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:38:02] [INFO ] Implicit Places using invariants in 360 ms returned []
[2024-05-24 05:38:02] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:38:02] [INFO ] Invariant cache hit.
[2024-05-24 05:38:03] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:38:04] [INFO ] Implicit Places using invariants and state equation in 1482 ms returned []
Implicit Place search using SMT with State Equation took 1844 ms to find 0 implicit places.
[2024-05-24 05:38:04] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:38:04] [INFO ] Invariant cache hit.
[2024-05-24 05:38:04] [INFO ] Dead Transitions using invariants and state equation in 508 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2373 ms. Remains : 626/626 places, 1638/1638 transitions.
Built C files in :
/tmp/ltsmin15290718867986319061
[2024-05-24 05:38:04] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15290718867986319061
Running compilation step : cd /tmp/ltsmin15290718867986319061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2791 ms.
Running link step : cd /tmp/ltsmin15290718867986319061;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin15290718867986319061;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9371332277259313555.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:38:19] [INFO ] Flatten gal took : 43 ms
[2024-05-24 05:38:20] [INFO ] Flatten gal took : 46 ms
[2024-05-24 05:38:20] [INFO ] Time to serialize gal into /tmp/LTL18119766294218529943.gal : 7 ms
[2024-05-24 05:38:20] [INFO ] Time to serialize properties into /tmp/LTL4981246098772918874.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18119766294218529943.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14481949474999231730.hoa' '-atoms' '/tmp/LTL4981246098772918874.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL4981246098772918874.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14481949474999231730.hoa
Detected timeout of ITS tools.
[2024-05-24 05:38:35] [INFO ] Flatten gal took : 37 ms
[2024-05-24 05:38:35] [INFO ] Flatten gal took : 37 ms
[2024-05-24 05:38:35] [INFO ] Time to serialize gal into /tmp/LTL13187847281335354257.gal : 8 ms
[2024-05-24 05:38:35] [INFO ] Time to serialize properties into /tmp/LTL11449112053791094412.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13187847281335354257.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11449112053791094412.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s0<1)||(l1657<1))"))||((X("((s0<1)||(l1657<1))"))&&("((s0<1)||(l1817<1))"))))))
Formula 0 simplified : G(F!"((s0<1)||(l1657<1))" & FG(!"((s0<1)||(l1817<1))" | X!"((s0<1)||(l1657<1))"))
Detected timeout of ITS tools.
[2024-05-24 05:38:50] [INFO ] Flatten gal took : 37 ms
[2024-05-24 05:38:50] [INFO ] Applying decomposition
[2024-05-24 05:38:50] [INFO ] Flatten gal took : 36 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9617153205381760319.txt' '-o' '/tmp/graph9617153205381760319.bin' '-w' '/tmp/graph9617153205381760319.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9617153205381760319.bin' '-l' '-1' '-v' '-w' '/tmp/graph9617153205381760319.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:38:50] [INFO ] Decomposing Gal with order
[2024-05-24 05:38:50] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:38:50] [INFO ] Removed a total of 2724 redundant transitions.
[2024-05-24 05:38:50] [INFO ] Flatten gal took : 98 ms
[2024-05-24 05:38:50] [INFO ] Fuse similar labels procedure discarded/fused a total of 1121 labels/synchronizations in 55 ms.
[2024-05-24 05:38:50] [INFO ] Time to serialize gal into /tmp/LTL18352151698479973635.gal : 9 ms
[2024-05-24 05:38:50] [INFO ] Time to serialize properties into /tmp/LTL8888745919048912202.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18352151698479973635.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL8888745919048912202.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i0.u0.s0<1)||(i23.i1.u150.l1657<1))"))||((X("((i0.u0.s0<1)||(i23.i1.u150.l1657<1))"))&&("((i0.u0.s0<1)||(i23.i1.u151.l181...167
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i23.i1.u150.l1657<1))" & FG(!"((i0.u0.s0<1)||(i23.i1.u151.l1817<1))" | X!"((i0.u0.s0<1)||(i23.i1.u150.l1657<1))...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin11741331670248793103
[2024-05-24 05:39:05] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11741331670248793103
Running compilation step : cd /tmp/ltsmin11741331670248793103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2822 ms.
Running link step : cd /tmp/ltsmin11741331670248793103;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin11741331670248793103;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-02 finished in 133859 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F((F((p1&&F(G(p1))))&&p0)))'
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 17 places :
Symmetric choice reduction at 0 with 17 rule applications. Total rules 17 place count 774 transition count 2014
Iterating global reduction 0 with 17 rules applied. Total rules applied 34 place count 774 transition count 2014
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 44 place count 774 transition count 2004
Discarding 17 places :
Symmetric choice reduction at 1 with 17 rule applications. Total rules 61 place count 757 transition count 1968
Iterating global reduction 1 with 17 rules applied. Total rules applied 78 place count 757 transition count 1968
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 82 place count 757 transition count 1964
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 96 place count 743 transition count 1920
Iterating global reduction 2 with 14 rules applied. Total rules applied 110 place count 743 transition count 1920
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 126 place count 727 transition count 1868
Iterating global reduction 2 with 16 rules applied. Total rules applied 142 place count 727 transition count 1868
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 160 place count 709 transition count 1820
Iterating global reduction 2 with 18 rules applied. Total rules applied 178 place count 709 transition count 1820
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 198 place count 689 transition count 1768
Iterating global reduction 2 with 20 rules applied. Total rules applied 218 place count 689 transition count 1768
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 237 place count 670 transition count 1722
Iterating global reduction 2 with 19 rules applied. Total rules applied 256 place count 670 transition count 1722
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 275 place count 651 transition count 1682
Iterating global reduction 2 with 19 rules applied. Total rules applied 294 place count 651 transition count 1682
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 312 place count 633 transition count 1644
Iterating global reduction 2 with 18 rules applied. Total rules applied 330 place count 633 transition count 1644
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 341 place count 622 transition count 1620
Iterating global reduction 2 with 11 rules applied. Total rules applied 352 place count 622 transition count 1620
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 360 place count 614 transition count 1604
Iterating global reduction 2 with 8 rules applied. Total rules applied 368 place count 614 transition count 1604
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 373 place count 609 transition count 1594
Iterating global reduction 2 with 5 rules applied. Total rules applied 378 place count 609 transition count 1594
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 380 place count 607 transition count 1590
Iterating global reduction 2 with 2 rules applied. Total rules applied 382 place count 607 transition count 1590
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 383 place count 606 transition count 1588
Iterating global reduction 2 with 1 rules applied. Total rules applied 384 place count 606 transition count 1588
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 385 place count 605 transition count 1586
Iterating global reduction 2 with 1 rules applied. Total rules applied 386 place count 605 transition count 1586
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 388 place count 605 transition count 1584
Applied a total of 388 rules in 429 ms. Remains 605 /791 variables (removed 186) and now considering 1584/2050 (removed 466) transitions.
[2024-05-24 05:39:21] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
// Phase 1: matrix 1057 rows 605 cols
[2024-05-24 05:39:21] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 05:39:21] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-24 05:39:21] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 05:39:21] [INFO ] Invariant cache hit.
[2024-05-24 05:39:21] [INFO ] State equation strengthened by 262 read => feed constraints.
[2024-05-24 05:39:23] [INFO ] Implicit Places using invariants and state equation in 1692 ms returned []
Implicit Place search using SMT with State Equation took 2003 ms to find 0 implicit places.
[2024-05-24 05:39:23] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 05:39:23] [INFO ] Flow matrix only has 1057 transitions (discarded 527 similar events)
[2024-05-24 05:39:23] [INFO ] Invariant cache hit.
[2024-05-24 05:39:23] [INFO ] Dead Transitions using invariants and state equation in 472 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 605/791 places, 1584/2050 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2939 ms. Remains : 605/791 places, 1584/2050 transitions.
Stuttering acceptance computed with spot in 134 ms :[(OR (NOT p0) (NOT p1)), (NOT p1), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-03 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}, { cond=(NOT p0), acceptance={} source=0 dest: 2}], [{ cond=p1, acceptance={} source=1 dest: 1}, { cond=(NOT p1), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p0), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s1 1) (GEQ s41 1)), p1:(OR (LT s0 1) (LT s472 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 350 ms.
Stack based approach found an accepted trace after 76 steps with 0 reset with depth 77 and stack size 77 in 0 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-03 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-03 finished in 3444 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p1||G(p2)))||F(p2)||p0))))'
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 777 transition count 2020
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 777 transition count 2020
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 777 transition count 2012
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 763 transition count 1982
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 763 transition count 1982
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 763 transition count 1978
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 752 transition count 1944
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 752 transition count 1944
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 741 transition count 1912
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 741 transition count 1912
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 727 transition count 1876
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 727 transition count 1876
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 157 place count 710 transition count 1826
Iterating global reduction 2 with 17 rules applied. Total rules applied 174 place count 710 transition count 1826
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 190 place count 694 transition count 1784
Iterating global reduction 2 with 16 rules applied. Total rules applied 206 place count 694 transition count 1784
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 222 place count 678 transition count 1750
Iterating global reduction 2 with 16 rules applied. Total rules applied 238 place count 678 transition count 1750
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 253 place count 663 transition count 1718
Iterating global reduction 2 with 15 rules applied. Total rules applied 268 place count 663 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 278 place count 653 transition count 1696
Iterating global reduction 2 with 10 rules applied. Total rules applied 288 place count 653 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 298 place count 643 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 308 place count 643 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 314 place count 637 transition count 1664
Iterating global reduction 2 with 6 rules applied. Total rules applied 320 place count 637 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 635 transition count 1660
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 635 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 634 transition count 1658
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 634 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 633 transition count 1656
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 633 transition count 1656
Applied a total of 328 rules in 287 ms. Remains 633 /791 variables (removed 158) and now considering 1656/2050 (removed 394) transitions.
[2024-05-24 05:39:24] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-24 05:39:24] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:39:24] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 05:39:24] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:39:24] [INFO ] Invariant cache hit.
[2024-05-24 05:39:25] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:39:26] [INFO ] Implicit Places using invariants and state equation in 1412 ms returned []
Implicit Place search using SMT with State Equation took 1800 ms to find 0 implicit places.
[2024-05-24 05:39:26] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:39:26] [INFO ] Invariant cache hit.
[2024-05-24 05:39:26] [INFO ] Dead Transitions using invariants and state equation in 538 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 633/791 places, 1656/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2626 ms. Remains : 633/791 places, 1656/2050 transitions.
Stuttering acceptance computed with spot in 102 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s562 1)), p2:(AND (GEQ s0 1) (GEQ s549 1)), p1:(AND (GEQ s0 1) (GEQ s559 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 370 ms.
Product exploration explored 100000 steps with 0 reset in 426 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 142 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 202031 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 202031 steps, saw 131149 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:39:31] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:39:31] [INFO ] Invariant cache hit.
[2024-05-24 05:39:31] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:39:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:39:31] [INFO ] After 567ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:39:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:39:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:39:33] [INFO ] After 1383ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:33] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:39:34] [INFO ] After 1327ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:35] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 0 ms to minimize.
[2024-05-24 05:39:35] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 270 ms
[2024-05-24 05:39:36] [INFO ] After 2631ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1091 ms.
[2024-05-24 05:39:37] [INFO ] After 5303ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 154 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 55 ms. (steps per millisecond=181 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 191428 steps, run timeout after 3001 ms. (steps per millisecond=63 ) properties seen :{}
Probabilistic random walk after 191428 steps, saw 124268 distinct states, run finished after 3001 ms. (steps per millisecond=63 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:39:40] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2024-05-24 05:39:40] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 05:39:40] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:39:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:39:41] [INFO ] After 561ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:39:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:39:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:39:42] [INFO ] After 1345ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:42] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:39:43] [INFO ] After 1145ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:44] [INFO ] Deduced a trap composed of 131 places in 168 ms of which 1 ms to minimize.
[2024-05-24 05:39:44] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 272 ms
[2024-05-24 05:39:45] [INFO ] After 2437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 735 ms.
[2024-05-24 05:39:45] [INFO ] After 4710ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 34 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 73 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 73 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2024-05-24 05:39:46] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:39:46] [INFO ] Invariant cache hit.
[2024-05-24 05:39:46] [INFO ] Implicit Places using invariants in 477 ms returned []
[2024-05-24 05:39:46] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:39:46] [INFO ] Invariant cache hit.
[2024-05-24 05:39:46] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:39:48] [INFO ] Implicit Places using invariants and state equation in 1497 ms returned []
Implicit Place search using SMT with State Equation took 2009 ms to find 0 implicit places.
[2024-05-24 05:39:48] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 05:39:48] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:39:48] [INFO ] Invariant cache hit.
[2024-05-24 05:39:48] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2683 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 739 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 1 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 31 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 35 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2024-05-24 05:39:48] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:39:48] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:39:48] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:39:48] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:39:48] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:39:48] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:39:48] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:48] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:39:48] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:48] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 05:39:48] [INFO ] After 133ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 147 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 105 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 14 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2024-05-24 05:39:49] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-24 05:39:49] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:39:49] [INFO ] Implicit Places using invariants in 378 ms returned []
[2024-05-24 05:39:49] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:39:49] [INFO ] Invariant cache hit.
[2024-05-24 05:39:50] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:39:51] [INFO ] Implicit Places using invariants and state equation in 1431 ms returned []
Implicit Place search using SMT with State Equation took 1837 ms to find 0 implicit places.
[2024-05-24 05:39:51] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:39:51] [INFO ] Invariant cache hit.
[2024-05-24 05:39:51] [INFO ] Dead Transitions using invariants and state equation in 618 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2469 ms. Remains : 633/633 places, 1656/1656 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 155 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 95 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 194805 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 194805 steps, saw 126459 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:39:55] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:39:55] [INFO ] Invariant cache hit.
[2024-05-24 05:39:55] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:39:55] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:39:55] [INFO ] After 550ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:39:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:39:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:39:57] [INFO ] After 1376ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:57] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:39:58] [INFO ] After 1293ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:39:59] [INFO ] Deduced a trap composed of 131 places in 161 ms of which 1 ms to minimize.
[2024-05-24 05:39:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 275 ms
[2024-05-24 05:40:00] [INFO ] After 2577ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1061 ms.
[2024-05-24 05:40:01] [INFO ] After 5198ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 155 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 155 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 83 ms. (steps per millisecond=120 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) 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 6) seen :0
Interrupted probabilistic random walk after 244362 steps, run timeout after 3001 ms. (steps per millisecond=81 ) properties seen :{}
Probabilistic random walk after 244362 steps, saw 158622 distinct states, run finished after 3001 ms. (steps per millisecond=81 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:40:04] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2024-05-24 05:40:04] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 05:40:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:40:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:40:05] [INFO ] After 556ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:40:05] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:40:05] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:40:06] [INFO ] After 1330ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:40:06] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:40:07] [INFO ] After 1141ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:40:08] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 3 ms to minimize.
[2024-05-24 05:40:08] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-24 05:40:09] [INFO ] After 2429ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 731 ms.
[2024-05-24 05:40:09] [INFO ] After 4679ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 6 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 73 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 73 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 86 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2024-05-24 05:40:10] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:40:10] [INFO ] Invariant cache hit.
[2024-05-24 05:40:10] [INFO ] Implicit Places using invariants in 377 ms returned []
[2024-05-24 05:40:10] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:40:10] [INFO ] Invariant cache hit.
[2024-05-24 05:40:10] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:40:11] [INFO ] Implicit Places using invariants and state equation in 1503 ms returned []
Implicit Place search using SMT with State Equation took 1903 ms to find 0 implicit places.
[2024-05-24 05:40:11] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 05:40:11] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:40:11] [INFO ] Invariant cache hit.
[2024-05-24 05:40:12] [INFO ] Dead Transitions using invariants and state equation in 581 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2610 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 739 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 31 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 28 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2024-05-24 05:40:12] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:40:12] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:40:12] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:40:12] [INFO ] After 56ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:40:12] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:40:12] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:40:12] [INFO ] After 48ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:40:12] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:40:12] [INFO ] After 21ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:40:12] [INFO ] After 47ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 05:40:12] [INFO ] After 155ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 139 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 120 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 94 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 118 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 369 ms.
Product exploration explored 100000 steps with 0 reset in 415 ms.
Built C files in :
/tmp/ltsmin2690161064568135151
[2024-05-24 05:40:14] [INFO ] Built C files in 22ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2690161064568135151
Running compilation step : cd /tmp/ltsmin2690161064568135151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2892 ms.
Running link step : cd /tmp/ltsmin2690161064568135151;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin2690161064568135151;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased16994382194812744816.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 21 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2024-05-24 05:40:29] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-24 05:40:29] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 05:40:29] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-24 05:40:29] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:40:29] [INFO ] Invariant cache hit.
[2024-05-24 05:40:29] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:40:31] [INFO ] Implicit Places using invariants and state equation in 1522 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2024-05-24 05:40:31] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:40:31] [INFO ] Invariant cache hit.
[2024-05-24 05:40:31] [INFO ] Dead Transitions using invariants and state equation in 539 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2475 ms. Remains : 633/633 places, 1656/1656 transitions.
Built C files in :
/tmp/ltsmin112920956472006100
[2024-05-24 05:40:31] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin112920956472006100
Running compilation step : cd /tmp/ltsmin112920956472006100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2778 ms.
Running link step : cd /tmp/ltsmin112920956472006100;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin112920956472006100;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased17227795804193464531.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:40:46] [INFO ] Flatten gal took : 49 ms
[2024-05-24 05:40:47] [INFO ] Flatten gal took : 43 ms
[2024-05-24 05:40:47] [INFO ] Time to serialize gal into /tmp/LTL16542118166143246396.gal : 20 ms
[2024-05-24 05:40:47] [INFO ] Time to serialize properties into /tmp/LTL16411746043134207998.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL16542118166143246396.gal' '-t' 'CGAL' '-hoa' '/tmp/aut14559585738783189591.hoa' '-atoms' '/tmp/LTL16411746043134207998.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL16411746043134207998.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut14559585738783189591.hoa
Detected timeout of ITS tools.
[2024-05-24 05:41:02] [INFO ] Flatten gal took : 48 ms
[2024-05-24 05:41:02] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:41:02] [INFO ] Time to serialize gal into /tmp/LTL11419698583487072099.gal : 7 ms
[2024-05-24 05:41:02] [INFO ] Time to serialize properties into /tmp/LTL9300567930821920422.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL11419698583487072099.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL9300567930821920422.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2144<1))")||((X(("((s0>=1)&&(l2076>=1))")||(G("((s0>=1)&&(l1636>=1))"))))||(F("((s0>=1)&&(l1636>=1))")))))))
Formula 0 simplified : G(F(!"((s0<1)||(l2144<1))" & X(!"((s0>=1)&&(l2076>=1))" & F!"((s0>=1)&&(l1636>=1))")) & FG!"((s0>=1)&&(l1636>=1))")
Detected timeout of ITS tools.
[2024-05-24 05:41:17] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:41:17] [INFO ] Applying decomposition
[2024-05-24 05:41:17] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph6848696850749464100.txt' '-o' '/tmp/graph6848696850749464100.bin' '-w' '/tmp/graph6848696850749464100.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph6848696850749464100.bin' '-l' '-1' '-v' '-w' '/tmp/graph6848696850749464100.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:41:17] [INFO ] Decomposing Gal with order
[2024-05-24 05:41:17] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:41:17] [INFO ] Removed a total of 2759 redundant transitions.
[2024-05-24 05:41:17] [INFO ] Flatten gal took : 84 ms
[2024-05-24 05:41:17] [INFO ] Fuse similar labels procedure discarded/fused a total of 1266 labels/synchronizations in 61 ms.
[2024-05-24 05:41:17] [INFO ] Time to serialize gal into /tmp/LTL161195044782043279.gal : 15 ms
[2024-05-24 05:41:17] [INFO ] Time to serialize properties into /tmp/LTL1708964378233559483.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL161195044782043279.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1708964378233559483.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...253
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.u0.s0<1)||(i28.i2.u150.l2144<1))")||((X(("((i0.u0.s0>=1)&&(i28.i2.u148.l2076>=1))")||(G("((i0.u0.s0>=1)&&(i28.i1.u145.l1...221
Formula 0 simplified : G(F(!"((i0.u0.s0<1)||(i28.i2.u150.l2144<1))" & X(!"((i0.u0.s0>=1)&&(i28.i2.u148.l2076>=1))" & F!"((i0.u0.s0>=1)&&(i28.i1.u145.l1636>...210
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin16845104670695521525
[2024-05-24 05:41:32] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16845104670695521525
Running compilation step : cd /tmp/ltsmin16845104670695521525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2826 ms.
Running link step : cd /tmp/ltsmin16845104670695521525;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 33 ms.
Running LTSmin : cd /tmp/ltsmin16845104670695521525;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '<>([]((X(((LTLAPp1==true)||[]((LTLAPp2==true))))||<>((LTLAPp2==true))||(LTLAPp0==true))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-04 finished in 143638 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))||F(G((p2&&(p2 U (!p3||G(p2))))))))'
Support contains 6 out of 791 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 13 places :
Symmetric choice reduction at 0 with 13 rule applications. Total rules 13 place count 778 transition count 2022
Iterating global reduction 0 with 13 rules applied. Total rules applied 26 place count 778 transition count 2022
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 36 place count 778 transition count 2012
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 49 place count 765 transition count 1984
Iterating global reduction 1 with 13 rules applied. Total rules applied 62 place count 765 transition count 1984
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 66 place count 765 transition count 1980
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 77 place count 754 transition count 1944
Iterating global reduction 2 with 11 rules applied. Total rules applied 88 place count 754 transition count 1944
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 101 place count 741 transition count 1900
Iterating global reduction 2 with 13 rules applied. Total rules applied 114 place count 741 transition count 1900
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 129 place count 726 transition count 1858
Iterating global reduction 2 with 15 rules applied. Total rules applied 144 place count 726 transition count 1858
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 160 place count 710 transition count 1816
Iterating global reduction 2 with 16 rules applied. Total rules applied 176 place count 710 transition count 1816
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 191 place count 695 transition count 1782
Iterating global reduction 2 with 15 rules applied. Total rules applied 206 place count 695 transition count 1782
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 221 place count 680 transition count 1752
Iterating global reduction 2 with 15 rules applied. Total rules applied 236 place count 680 transition count 1752
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 250 place count 666 transition count 1724
Iterating global reduction 2 with 14 rules applied. Total rules applied 264 place count 666 transition count 1724
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 272 place count 658 transition count 1708
Iterating global reduction 2 with 8 rules applied. Total rules applied 280 place count 658 transition count 1708
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 285 place count 653 transition count 1698
Iterating global reduction 2 with 5 rules applied. Total rules applied 290 place count 653 transition count 1698
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 292 place count 651 transition count 1694
Iterating global reduction 2 with 2 rules applied. Total rules applied 294 place count 651 transition count 1694
Drop transitions removed 10 transitions
Redundant transition composition rules discarded 10 transitions
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 651 transition count 1684
Applied a total of 304 rules in 393 ms. Remains 651 /791 variables (removed 140) and now considering 1684/2050 (removed 366) transitions.
[2024-05-24 05:41:48] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
// Phase 1: matrix 1126 rows 651 cols
[2024-05-24 05:41:48] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:41:48] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-24 05:41:48] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-24 05:41:48] [INFO ] Invariant cache hit.
[2024-05-24 05:41:48] [INFO ] State equation strengthened by 277 read => feed constraints.
[2024-05-24 05:41:50] [INFO ] Implicit Places using invariants and state equation in 1695 ms returned []
Implicit Place search using SMT with State Equation took 2058 ms to find 0 implicit places.
[2024-05-24 05:41:50] [INFO ] Redundant transitions in 31 ms returned []
[2024-05-24 05:41:50] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-24 05:41:50] [INFO ] Invariant cache hit.
[2024-05-24 05:41:50] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 651/791 places, 1684/2050 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 3042 ms. Remains : 651/791 places, 1684/2050 transitions.
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-06 automaton TGBA Formula[mat=[[{ cond=p0, acceptance={} source=0 dest: 0}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=p2, acceptance={} source=1 dest: 1}, { cond=(NOT p2), acceptance={0} source=1 dest: 1}], [{ cond=(NOT p1), acceptance={} source=2 dest: 1}, { cond=p1, acceptance={} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s4 1) (LT s585 1)), p1:(AND (GEQ s0 1) (GEQ s580 1)), p2:(OR (LT s1 1) (LT s556 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-invariant], stateDesc=[null, null, null][true, true, true]]
Product exploration explored 100000 steps with 0 reset in 408 ms.
Product exploration explored 100000 steps with 0 reset in 476 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 11 factoid took 133 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 3 states, 7 edges and 3 AP (stutter insensitive).
Stuttering acceptance computed with spot in 129 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (NOT p2), (AND (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 5) seen :1
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 4) seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:41:52] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-24 05:41:52] [INFO ] Invariant cache hit.
[2024-05-24 05:41:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:41:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:41:52] [INFO ] After 524ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:3
[2024-05-24 05:41:53] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:41:53] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:41:53] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :3
[2024-05-24 05:41:53] [INFO ] State equation strengthened by 277 read => feed constraints.
[2024-05-24 05:41:53] [INFO ] After 237ms SMT Verify possible using 277 Read/Feed constraints in natural domain returned unsat :1 sat :3
[2024-05-24 05:41:53] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 0 ms to minimize.
[2024-05-24 05:41:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 224 ms
[2024-05-24 05:41:54] [INFO ] After 704ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :3
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-24 05:41:54] [INFO ] After 1435ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :3
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 1680
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 647 transition count 1676
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 647 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 645 transition count 1668
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 645 transition count 1668
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 643 transition count 1664
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 643 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 641 transition count 1660
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 641 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 639 transition count 1656
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 639 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 637 transition count 1652
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 637 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 635 transition count 1648
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 635 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 633 transition count 1644
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 633 transition count 1644
Applied a total of 36 rules in 206 ms. Remains 633 /651 variables (removed 18) and now considering 1644/1684 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 207 ms. Remains : 633/651 places, 1644/1684 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 71 ms. (steps per millisecond=140 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 12 ms. (steps per millisecond=833 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 251470 steps, run timeout after 3001 ms. (steps per millisecond=83 ) properties seen :{}
Probabilistic random walk after 251470 steps, saw 163235 distinct states, run finished after 3001 ms. (steps per millisecond=83 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 05:41:57] [INFO ] Flow matrix only has 1098 transitions (discarded 546 similar events)
// Phase 1: matrix 1098 rows 633 cols
[2024-05-24 05:41:57] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:41:57] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:41:57] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:41:58] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:41:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:41:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:41:58] [INFO ] After 370ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 05:41:58] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:41:58] [INFO ] After 244ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:41:59] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 0 ms to minimize.
[2024-05-24 05:41:59] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 219 ms
[2024-05-24 05:41:59] [INFO ] After 713ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 183 ms.
[2024-05-24 05:41:59] [INFO ] After 1399ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 8 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1644/1644 transitions.
Applied a total of 0 rules in 82 ms. Remains 633 /633 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 633/633 places, 1644/1644 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1644/1644 transitions.
Applied a total of 0 rules in 81 ms. Remains 633 /633 variables (removed 0) and now considering 1644/1644 (removed 0) transitions.
[2024-05-24 05:41:59] [INFO ] Flow matrix only has 1098 transitions (discarded 546 similar events)
[2024-05-24 05:41:59] [INFO ] Invariant cache hit.
[2024-05-24 05:42:00] [INFO ] Implicit Places using invariants in 363 ms returned []
[2024-05-24 05:42:00] [INFO ] Flow matrix only has 1098 transitions (discarded 546 similar events)
[2024-05-24 05:42:00] [INFO ] Invariant cache hit.
[2024-05-24 05:42:00] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:42:01] [INFO ] Implicit Places using invariants and state equation in 1727 ms returned []
Implicit Place search using SMT with State Equation took 2092 ms to find 0 implicit places.
[2024-05-24 05:42:01] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:42:01] [INFO ] Flow matrix only has 1098 transitions (discarded 546 similar events)
[2024-05-24 05:42:01] [INFO ] Invariant cache hit.
[2024-05-24 05:42:02] [INFO ] Dead Transitions using invariants and state equation in 531 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2748 ms. Remains : 633/633 places, 1644/1644 transitions.
Graph (trivial) has 975 edges and 633 vertex of which 192 / 633 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 418 transitions
Reduce isomorphic transitions removed 738 transitions.
Drop transitions removed 21 transitions
Trivial Post-agglo rules discarded 21 transitions
Performed 21 trivial Post agglomeration. Transition count delta: 21
Iterating post reduction 0 with 21 rules applied. Total rules applied 22 place count 505 transition count 885
Reduce places removed 21 places and 0 transitions.
Iterating post reduction 1 with 21 rules applied. Total rules applied 43 place count 484 transition count 885
Performed 74 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 74 Pre rules applied. Total rules applied 43 place count 484 transition count 811
Deduced a syphon composed of 74 places in 0 ms
Reduce places removed 74 places and 0 transitions.
Iterating global reduction 2 with 148 rules applied. Total rules applied 191 place count 410 transition count 811
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 254 place count 347 transition count 748
Iterating global reduction 2 with 63 rules applied. Total rules applied 317 place count 347 transition count 748
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 443 place count 347 transition count 622
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 699 place count 219 transition count 494
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 763 place count 155 transition count 366
Iterating global reduction 3 with 64 rules applied. Total rules applied 827 place count 155 transition count 366
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 828 place count 155 transition count 365
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 891 place count 92 transition count 239
Iterating global reduction 4 with 63 rules applied. Total rules applied 954 place count 92 transition count 239
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1017 place count 29 transition count 113
Iterating global reduction 4 with 63 rules applied. Total rules applied 1080 place count 29 transition count 113
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1143 place count 29 transition count 50
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1143 place count 29 transition count 49
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1145 place count 28 transition count 49
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1147 place count 27 transition count 48
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1151 place count 25 transition count 48
Applied a total of 1151 rules in 33 ms. Remains 25 /633 variables (removed 608) and now considering 48/1644 (removed 1596) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 48 rows 25 cols
[2024-05-24 05:42:02] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:42:02] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:42:02] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:42:02] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:2
[2024-05-24 05:42:02] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:42:02] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:42:02] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:42:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:42:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:42:02] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 05:42:02] [INFO ] After 8ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:42:02] [INFO ] After 18ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 05:42:02] [INFO ] After 79ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Found 1 invariant AP formulas.
Knowledge obtained : [(AND p0 (NOT p1) p2), (X p2), (X (NOT (AND (NOT p0) (NOT p1)))), (X (NOT (AND (NOT p0) p1))), (X (NOT p1)), (X p0), (X (X p2)), (X (X (NOT (AND (NOT p0) (NOT p1))))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT p1))), (X (X p0)), (G (NOT (AND p1 (NOT p0))))]
False Knowledge obtained : [(F (NOT p2))]
Knowledge based reduction with 12 factoid took 181 ms. Reduced automaton from 3 states, 7 edges and 3 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 83 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 86 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Support contains 4 out of 651 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Applied a total of 0 rules in 89 ms. Remains 651 /651 variables (removed 0) and now considering 1684/1684 (removed 0) transitions.
[2024-05-24 05:42:03] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
// Phase 1: matrix 1126 rows 651 cols
[2024-05-24 05:42:03] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 05:42:03] [INFO ] Implicit Places using invariants in 320 ms returned []
[2024-05-24 05:42:03] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-24 05:42:03] [INFO ] Invariant cache hit.
[2024-05-24 05:42:03] [INFO ] State equation strengthened by 277 read => feed constraints.
[2024-05-24 05:42:05] [INFO ] Implicit Places using invariants and state equation in 1720 ms returned []
Implicit Place search using SMT with State Equation took 2050 ms to find 0 implicit places.
[2024-05-24 05:42:05] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 05:42:05] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-24 05:42:05] [INFO ] Invariant cache hit.
[2024-05-24 05:42:05] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2718 ms. Remains : 651/651 places, 1684/1684 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 105 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 92 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 76 ms. (steps per millisecond=131 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 294572 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 294572 steps, saw 191209 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:42:09] [INFO ] Flow matrix only has 1126 transitions (discarded 558 similar events)
[2024-05-24 05:42:09] [INFO ] Invariant cache hit.
[2024-05-24 05:42:09] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:42:09] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-24 05:42:09] [INFO ] After 531ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:42:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:42:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:42:10] [INFO ] After 400ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:42:10] [INFO ] State equation strengthened by 277 read => feed constraints.
[2024-05-24 05:42:10] [INFO ] After 263ms SMT Verify possible using 277 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:42:10] [INFO ] After 516ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 189 ms.
[2024-05-24 05:42:10] [INFO ] After 1229ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Graph (complete) has 2810 edges and 651 vertex of which 459 are kept as prefixes of interest. Removing 192 places using SCC suffix rule.1 ms
Discarding 192 places :
Also discarding 0 output transitions
Drop transitions removed 384 transitions
Reduce isomorphic transitions removed 384 transitions.
Iterating post reduction 0 with 384 rules applied. Total rules applied 385 place count 459 transition count 1300
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 387 place count 457 transition count 1296
Iterating global reduction 1 with 2 rules applied. Total rules applied 389 place count 457 transition count 1296
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 391 place count 455 transition count 1292
Iterating global reduction 1 with 2 rules applied. Total rules applied 393 place count 455 transition count 1292
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 395 place count 453 transition count 1286
Iterating global reduction 1 with 2 rules applied. Total rules applied 397 place count 453 transition count 1286
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 399 place count 451 transition count 1282
Iterating global reduction 1 with 2 rules applied. Total rules applied 401 place count 451 transition count 1282
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 403 place count 449 transition count 1278
Iterating global reduction 1 with 2 rules applied. Total rules applied 405 place count 449 transition count 1278
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 407 place count 447 transition count 1274
Iterating global reduction 1 with 2 rules applied. Total rules applied 409 place count 447 transition count 1274
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 411 place count 445 transition count 1268
Iterating global reduction 1 with 2 rules applied. Total rules applied 413 place count 445 transition count 1268
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 415 place count 443 transition count 1264
Iterating global reduction 1 with 2 rules applied. Total rules applied 417 place count 443 transition count 1264
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 419 place count 441 transition count 1260
Iterating global reduction 1 with 2 rules applied. Total rules applied 421 place count 441 transition count 1260
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 422 place count 440 transition count 1258
Iterating global reduction 1 with 1 rules applied. Total rules applied 423 place count 440 transition count 1258
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 424 place count 439 transition count 1256
Iterating global reduction 1 with 1 rules applied. Total rules applied 425 place count 439 transition count 1256
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 426 place count 438 transition count 1254
Iterating global reduction 1 with 1 rules applied. Total rules applied 427 place count 438 transition count 1254
Discarding 1 places :
Symmetric choice reduction at 1 with 1 rule applications. Total rules 428 place count 437 transition count 1252
Iterating global reduction 1 with 1 rules applied. Total rules applied 429 place count 437 transition count 1252
Applied a total of 429 rules in 170 ms. Remains 437 /651 variables (removed 214) and now considering 1252/1684 (removed 432) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 171 ms. Remains : 437/651 places, 1252/1684 transitions.
Incomplete random walk after 10003 steps, including 2 resets, run finished after 67 ms. (steps per millisecond=149 ) properties (out of 2) 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 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 360465 steps, run timeout after 3001 ms. (steps per millisecond=120 ) properties seen :{}
Probabilistic random walk after 360465 steps, saw 221042 distinct states, run finished after 3001 ms. (steps per millisecond=120 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:42:14] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
// Phase 1: matrix 711 rows 437 cols
[2024-05-24 05:42:14] [INFO ] Computed 3 invariants in 7 ms
[2024-05-24 05:42:14] [INFO ] [Real]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:42:14] [INFO ] After 336ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:42:14] [INFO ] [Nat]Absence check using 3 positive place invariants in 3 ms returned sat
[2024-05-24 05:42:14] [INFO ] After 284ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:42:14] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-24 05:42:15] [INFO ] After 272ms SMT Verify possible using 80 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:42:15] [INFO ] After 457ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 124 ms.
[2024-05-24 05:42:15] [INFO ] After 952ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 1 ms.
Support contains 4 out of 437 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1252/1252 transitions.
Applied a total of 0 rules in 44 ms. Remains 437 /437 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 44 ms. Remains : 437/437 places, 1252/1252 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 437/437 places, 1252/1252 transitions.
Applied a total of 0 rules in 42 ms. Remains 437 /437 variables (removed 0) and now considering 1252/1252 (removed 0) transitions.
[2024-05-24 05:42:15] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2024-05-24 05:42:15] [INFO ] Invariant cache hit.
[2024-05-24 05:42:15] [INFO ] Implicit Places using invariants in 258 ms returned []
[2024-05-24 05:42:15] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2024-05-24 05:42:15] [INFO ] Invariant cache hit.
[2024-05-24 05:42:15] [INFO ] State equation strengthened by 80 read => feed constraints.
[2024-05-24 05:42:16] [INFO ] Implicit Places using invariants and state equation in 989 ms returned []
Implicit Place search using SMT with State Equation took 1249 ms to find 0 implicit places.
[2024-05-24 05:42:16] [INFO ] Redundant transitions in 18 ms returned []
[2024-05-24 05:42:16] [INFO ] Flow matrix only has 711 transitions (discarded 541 similar events)
[2024-05-24 05:42:16] [INFO ] Invariant cache hit.
[2024-05-24 05:42:17] [INFO ] Dead Transitions using invariants and state equation in 406 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 1727 ms. Remains : 437/437 places, 1252/1252 transitions.
Ensure Unique test removed 541 transitions
Reduce isomorphic transitions removed 541 transitions.
Drop transitions removed 15 transitions
Trivial Post-agglo rules discarded 15 transitions
Performed 15 trivial Post agglomeration. Transition count delta: 15
Iterating post reduction 0 with 556 rules applied. Total rules applied 556 place count 437 transition count 696
Reduce places removed 15 places and 0 transitions.
Iterating post reduction 1 with 15 rules applied. Total rules applied 571 place count 422 transition count 696
Performed 75 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 75 Pre rules applied. Total rules applied 571 place count 422 transition count 621
Deduced a syphon composed of 75 places in 0 ms
Reduce places removed 75 places and 0 transitions.
Iterating global reduction 2 with 150 rules applied. Total rules applied 721 place count 347 transition count 621
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 2 with 258 rules applied. Total rules applied 979 place count 218 transition count 492
Discarding 64 places :
Symmetric choice reduction at 2 with 64 rule applications. Total rules 1043 place count 154 transition count 364
Iterating global reduction 2 with 64 rules applied. Total rules applied 1107 place count 154 transition count 364
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 2 with 1 rules applied. Total rules applied 1108 place count 154 transition count 363
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1171 place count 91 transition count 237
Iterating global reduction 3 with 63 rules applied. Total rules applied 1234 place count 91 transition count 237
Discarding 63 places :
Symmetric choice reduction at 3 with 63 rule applications. Total rules 1297 place count 28 transition count 111
Iterating global reduction 3 with 63 rules applied. Total rules applied 1360 place count 28 transition count 111
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 3 with 63 rules applied. Total rules applied 1423 place count 28 transition count 48
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 1423 place count 28 transition count 47
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1425 place count 27 transition count 47
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 1427 place count 26 transition count 46
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 4 with 4 rules applied. Total rules applied 1431 place count 24 transition count 46
Applied a total of 1431 rules in 22 ms. Remains 24 /437 variables (removed 413) and now considering 46/1252 (removed 1206) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 46 rows 24 cols
[2024-05-24 05:42:17] [INFO ] Computed 3 invariants in 1 ms
[2024-05-24 05:42:17] [INFO ] [Real]Absence check using 3 positive place invariants in 1 ms returned sat
[2024-05-24 05:42:17] [INFO ] After 17ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:1
[2024-05-24 05:42:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:42:17] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:42:17] [INFO ] After 52ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:42:17] [INFO ] [Nat]Absence check using 3 positive place invariants in 0 ms returned sat
[2024-05-24 05:42:17] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:42:17] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:42:17] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 05:42:17] [INFO ] After 55ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 p2), (X p2), (X p0), (X (X p2)), (X (X p0))]
False Knowledge obtained : []
Knowledge based reduction with 5 factoid took 87 ms. Reduced automaton from 2 states, 4 edges and 2 AP (stutter insensitive) to 2 states, 4 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 85 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 69 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Stuttering acceptance computed with spot in 88 ms :[(AND (NOT p0) (NOT p2)), (NOT p2)]
Product exploration explored 100000 steps with 0 reset in 410 ms.
Product exploration explored 100000 steps with 0 reset in 439 ms.
Built C files in :
/tmp/ltsmin9124720061010246412
[2024-05-24 05:42:18] [INFO ] Too many transitions (1684) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:42:18] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9124720061010246412
Running compilation step : cd /tmp/ltsmin9124720061010246412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9124720061010246412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9124720061010246412;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 4 out of 651 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 651/651 places, 1684/1684 transitions.
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 2 place count 649 transition count 1680
Iterating global reduction 0 with 2 rules applied. Total rules applied 4 place count 649 transition count 1680
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 6 place count 647 transition count 1676
Iterating global reduction 0 with 2 rules applied. Total rules applied 8 place count 647 transition count 1676
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 10 place count 645 transition count 1670
Iterating global reduction 0 with 2 rules applied. Total rules applied 12 place count 645 transition count 1670
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 14 place count 643 transition count 1666
Iterating global reduction 0 with 2 rules applied. Total rules applied 16 place count 643 transition count 1666
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 18 place count 641 transition count 1662
Iterating global reduction 0 with 2 rules applied. Total rules applied 20 place count 641 transition count 1662
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 22 place count 639 transition count 1658
Iterating global reduction 0 with 2 rules applied. Total rules applied 24 place count 639 transition count 1658
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 26 place count 637 transition count 1652
Iterating global reduction 0 with 2 rules applied. Total rules applied 28 place count 637 transition count 1652
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 30 place count 635 transition count 1648
Iterating global reduction 0 with 2 rules applied. Total rules applied 32 place count 635 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 0 with 2 rule applications. Total rules 34 place count 633 transition count 1644
Iterating global reduction 0 with 2 rules applied. Total rules applied 36 place count 633 transition count 1644
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 37 place count 632 transition count 1642
Iterating global reduction 0 with 1 rules applied. Total rules applied 38 place count 632 transition count 1642
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 39 place count 631 transition count 1640
Iterating global reduction 0 with 1 rules applied. Total rules applied 40 place count 631 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 41 place count 630 transition count 1638
Iterating global reduction 0 with 1 rules applied. Total rules applied 42 place count 630 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 43 place count 629 transition count 1636
Iterating global reduction 0 with 1 rules applied. Total rules applied 44 place count 629 transition count 1636
Applied a total of 44 rules in 284 ms. Remains 629 /651 variables (removed 22) and now considering 1636/1684 (removed 48) transitions.
[2024-05-24 05:42:21] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
// Phase 1: matrix 1093 rows 629 cols
[2024-05-24 05:42:21] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 05:42:22] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-24 05:42:22] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 05:42:22] [INFO ] Invariant cache hit.
[2024-05-24 05:42:22] [INFO ] State equation strengthened by 270 read => feed constraints.
[2024-05-24 05:42:23] [INFO ] Implicit Places using invariants and state equation in 1574 ms returned []
Implicit Place search using SMT with State Equation took 1934 ms to find 0 implicit places.
[2024-05-24 05:42:23] [INFO ] Redundant transitions in 33 ms returned []
[2024-05-24 05:42:23] [INFO ] Flow matrix only has 1093 transitions (discarded 543 similar events)
[2024-05-24 05:42:23] [INFO ] Invariant cache hit.
[2024-05-24 05:42:24] [INFO ] Dead Transitions using invariants and state equation in 505 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 629/651 places, 1636/1684 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2768 ms. Remains : 629/651 places, 1636/1684 transitions.
Built C files in :
/tmp/ltsmin3711857665931378181
[2024-05-24 05:42:24] [INFO ] Too many transitions (1636) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:42:24] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin3711857665931378181
Running compilation step : cd /tmp/ltsmin3711857665931378181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2832 ms.
Running link step : cd /tmp/ltsmin3711857665931378181;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin3711857665931378181;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10402056489615570737.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:42:39] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:42:39] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:42:39] [INFO ] Time to serialize gal into /tmp/LTL5453548087765861123.gal : 6 ms
[2024-05-24 05:42:39] [INFO ] Time to serialize properties into /tmp/LTL4116078441697401343.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL5453548087765861123.gal' '-t' 'CGAL' '-hoa' '/tmp/aut16329009899511686034.hoa' '-atoms' '/tmp/LTL4116078441697401343.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL4116078441697401343.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut16329009899511686034.hoa
Detected timeout of ITS tools.
[2024-05-24 05:42:54] [INFO ] Flatten gal took : 46 ms
[2024-05-24 05:42:54] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:42:54] [INFO ] Time to serialize gal into /tmp/LTL6155944967359373348.gal : 7 ms
[2024-05-24 05:42:54] [INFO ] Time to serialize properties into /tmp/LTL11385125750492586091.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL6155944967359373348.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11385125750492586091.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !(((G(("((s4<1)||(l2487<1))")||(G("((s0>=1)&&(l2351>=1))"))))||(F(G(("((s1<1)||(p1629<1))")&&(("((s1<1)||(p1629<1))")U((!("((s1>=1)&&(...203
Formula 0 simplified : F(!"((s4<1)||(l2487<1))" & F!"((s0>=1)&&(l2351>=1))") & GF(!"((s1<1)||(p1629<1))" | (!"((s1<1)||(p1629<1))" M "((s1>=1)&&(l2089>=1))...158
Detected timeout of ITS tools.
[2024-05-24 05:43:09] [INFO ] Flatten gal took : 40 ms
[2024-05-24 05:43:09] [INFO ] Applying decomposition
[2024-05-24 05:43:09] [INFO ] Flatten gal took : 40 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph18125825469956091640.txt' '-o' '/tmp/graph18125825469956091640.bin' '-w' '/tmp/graph18125825469956091640.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph18125825469956091640.bin' '-l' '-1' '-v' '-w' '/tmp/graph18125825469956091640.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:43:09] [INFO ] Decomposing Gal with order
[2024-05-24 05:43:09] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:43:09] [INFO ] Removed a total of 2822 redundant transitions.
[2024-05-24 05:43:10] [INFO ] Flatten gal took : 77 ms
[2024-05-24 05:43:10] [INFO ] Fuse similar labels procedure discarded/fused a total of 1148 labels/synchronizations in 49 ms.
[2024-05-24 05:43:10] [INFO ] Time to serialize gal into /tmp/LTL18244215001701732607.gal : 10 ms
[2024-05-24 05:43:10] [INFO ] Time to serialize properties into /tmp/LTL18055392607470657004.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL18244215001701732607.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL18055392607470657004.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !(((G(("((i1.u1.s4<1)||(i25.i0.i3.u165.l2487<1))")||(G("((i1.u1.s0>=1)&&(i25.i1.i1.u162.l2351>=1))"))))||(F(G(("((i0.u0.s1<1)||(i25.i0...329
Formula 0 simplified : F(!"((i1.u1.s4<1)||(i25.i0.i3.u165.l2487<1))" & F!"((i1.u1.s0>=1)&&(i25.i1.i1.u162.l2351>=1))") & GF(!"((i0.u0.s1<1)||(i25.i0.i1.u15...263
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin7000975991678944658
[2024-05-24 05:43:25] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin7000975991678944658
Running compilation step : cd /tmp/ltsmin7000975991678944658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin7000975991678944658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin7000975991678944658;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 FunctionPointer-PT-c004-LTLFireability-06 finished in 100268 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(G(p1))))))'
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 775 transition count 2016
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 775 transition count 2016
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 775 transition count 2006
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 759 transition count 1974
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 759 transition count 1974
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 759 transition count 1970
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 746 transition count 1930
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 746 transition count 1930
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 119 place count 731 transition count 1880
Iterating global reduction 2 with 15 rules applied. Total rules applied 134 place count 731 transition count 1880
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 151 place count 714 transition count 1834
Iterating global reduction 2 with 17 rules applied. Total rules applied 168 place count 714 transition count 1834
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 187 place count 695 transition count 1784
Iterating global reduction 2 with 19 rules applied. Total rules applied 206 place count 695 transition count 1784
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 224 place count 677 transition count 1740
Iterating global reduction 2 with 18 rules applied. Total rules applied 242 place count 677 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 260 place count 659 transition count 1702
Iterating global reduction 2 with 18 rules applied. Total rules applied 278 place count 659 transition count 1702
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 296 place count 641 transition count 1664
Iterating global reduction 2 with 18 rules applied. Total rules applied 314 place count 641 transition count 1664
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 325 place count 630 transition count 1640
Iterating global reduction 2 with 11 rules applied. Total rules applied 336 place count 630 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 344 place count 622 transition count 1624
Iterating global reduction 2 with 8 rules applied. Total rules applied 352 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 357 place count 617 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 362 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 364 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 366 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 369 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 613 transition count 1606
Applied a total of 370 rules in 278 ms. Remains 613 /791 variables (removed 178) and now considering 1606/2050 (removed 444) transitions.
[2024-05-24 05:43:28] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 05:43:28] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 05:43:28] [INFO ] Implicit Places using invariants in 312 ms returned []
[2024-05-24 05:43:28] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:43:28] [INFO ] Invariant cache hit.
[2024-05-24 05:43:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:43:30] [INFO ] Implicit Places using invariants and state equation in 1449 ms returned []
Implicit Place search using SMT with State Equation took 1763 ms to find 0 implicit places.
[2024-05-24 05:43:30] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:43:30] [INFO ] Invariant cache hit.
[2024-05-24 05:43:30] [INFO ] Dead Transitions using invariants and state equation in 511 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 613/791 places, 1606/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2555 ms. Remains : 613/791 places, 1606/2050 transitions.
Stuttering acceptance computed with spot in 522 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s240 1)), p1:(AND (GEQ s0 1) (GEQ s533 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 377 ms.
Product exploration explored 100000 steps with 1 reset in 389 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 166 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 286764 steps, run timeout after 3001 ms. (steps per millisecond=95 ) properties seen :{}
Probabilistic random walk after 286764 steps, saw 186141 distinct states, run finished after 3001 ms. (steps per millisecond=95 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:43:35] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:43:35] [INFO ] Invariant cache hit.
[2024-05-24 05:43:35] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:43:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:43:36] [INFO ] After 571ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:43:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:43:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:43:36] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:43:36] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:43:36] [INFO ] After 310ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:43:37] [INFO ] After 561ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 213 ms.
[2024-05-24 05:43:37] [INFO ] After 1424ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 152 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 613/613 places, 1602/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 284255 steps, run timeout after 3001 ms. (steps per millisecond=94 ) properties seen :{}
Probabilistic random walk after 284255 steps, saw 184514 distinct states, run finished after 3001 ms. (steps per millisecond=94 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:43:40] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-24 05:43:40] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 05:43:40] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:43:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:43:41] [INFO ] After 666ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:43:41] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:43:41] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:43:41] [INFO ] After 476ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:43:41] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:43:42] [INFO ] After 501ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:43:42] [INFO ] After 864ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 247 ms.
[2024-05-24 05:43:43] [INFO ] After 1706ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 94 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 94 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 71 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2024-05-24 05:43:43] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:43:43] [INFO ] Invariant cache hit.
[2024-05-24 05:43:43] [INFO ] Implicit Places using invariants in 282 ms returned []
[2024-05-24 05:43:43] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:43:43] [INFO ] Invariant cache hit.
[2024-05-24 05:43:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:43:44] [INFO ] Implicit Places using invariants and state equation in 1354 ms returned []
Implicit Place search using SMT with State Equation took 1650 ms to find 0 implicit places.
[2024-05-24 05:43:44] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 05:43:44] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:43:44] [INFO ] Invariant cache hit.
[2024-05-24 05:43:45] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2281 ms. Remains : 613/613 places, 1602/1602 transitions.
Graph (trivial) has 938 edges and 613 vertex of which 189 / 613 are part of one of the 63 SCC in 1 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 721 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 487 transition count 871
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 477 transition count 871
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 477 transition count 798
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 404 transition count 798
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 229 place count 342 transition count 736
Iterating global reduction 2 with 62 rules applied. Total rules applied 291 place count 342 transition count 736
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 415 place count 342 transition count 612
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 669 place count 215 transition count 485
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 733 place count 151 transition count 357
Iterating global reduction 3 with 64 rules applied. Total rules applied 797 place count 151 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 861 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 924 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 987 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1050 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1113 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1113 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1117 place count 23 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1118 place count 23 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1119 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1120 place count 22 transition count 37
Applied a total of 1120 rules in 29 ms. Remains 22 /613 variables (removed 591) and now considering 37/1602 (removed 1565) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-24 05:43:45] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:43:45] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:43:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:43:45] [INFO ] After 59ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:43:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:43:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:43:45] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:43:45] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:43:45] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:43:45] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 05:43:45] [INFO ] After 64ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 75 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 137 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 128 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 13 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-24 05:43:46] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 05:43:46] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 05:43:46] [INFO ] Implicit Places using invariants in 299 ms returned []
[2024-05-24 05:43:46] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:43:46] [INFO ] Invariant cache hit.
[2024-05-24 05:43:46] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:43:47] [INFO ] Implicit Places using invariants and state equation in 1560 ms returned []
Implicit Place search using SMT with State Equation took 1910 ms to find 0 implicit places.
[2024-05-24 05:43:47] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:43:47] [INFO ] Invariant cache hit.
[2024-05-24 05:43:48] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2446 ms. Remains : 613/613 places, 1606/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 101 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 130 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 91 ms. (steps per millisecond=109 ) properties (out of 2) seen :0
Finished Best-First random walk after 6867 steps, including 2 resets, run visited all 2 properties in 13 ms. (steps per millisecond=528 )
Parikh walk visited 0 properties in 0 ms.
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : [(F (NOT p0)), (F (AND (NOT p0) (NOT p1)))]
Knowledge based reduction with 3 factoid took 152 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 141 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 147 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 197 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 381 ms.
Product exploration explored 100000 steps with 0 reset in 395 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 154 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 248 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2024-05-24 05:43:50] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 05:43:50] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-24 05:43:50] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 05:43:51] [INFO ] Dead Transitions using invariants and state equation in 766 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 1086 ms. Remains : 613/613 places, 1602/1606 transitions.
Built C files in :
/tmp/ltsmin4008463651660421167
[2024-05-24 05:43:51] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin4008463651660421167
Running compilation step : cd /tmp/ltsmin4008463651660421167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2950 ms.
Running link step : cd /tmp/ltsmin4008463651660421167;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 31 ms.
Running LTSmin : cd /tmp/ltsmin4008463651660421167;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9630545451889247566.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 20 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-24 05:44:06] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 05:44:06] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 05:44:06] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-24 05:44:06] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:44:06] [INFO ] Invariant cache hit.
[2024-05-24 05:44:07] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:44:08] [INFO ] Implicit Places using invariants and state equation in 1563 ms returned []
Implicit Place search using SMT with State Equation took 1857 ms to find 0 implicit places.
[2024-05-24 05:44:08] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:44:08] [INFO ] Invariant cache hit.
[2024-05-24 05:44:09] [INFO ] Dead Transitions using invariants and state equation in 517 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2395 ms. Remains : 613/613 places, 1606/1606 transitions.
Built C files in :
/tmp/ltsmin12401916809660671944
[2024-05-24 05:44:09] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12401916809660671944
Running compilation step : cd /tmp/ltsmin12401916809660671944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin12401916809660671944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin12401916809660671944;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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)
[2024-05-24 05:44:12] [INFO ] Flatten gal took : 38 ms
[2024-05-24 05:44:12] [INFO ] Flatten gal took : 39 ms
[2024-05-24 05:44:12] [INFO ] Time to serialize gal into /tmp/LTL12966562248058960626.gal : 9 ms
[2024-05-24 05:44:12] [INFO ] Time to serialize properties into /tmp/LTL15882054977093266339.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12966562248058960626.gal' '-t' 'CGAL' '-hoa' '/tmp/aut12727183025251259722.hoa' '-atoms' '/tmp/LTL15882054977093266339.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...320
Loading property file /tmp/LTL15882054977093266339.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut12727183025251259722.hoa
Detected timeout of ITS tools.
[2024-05-24 05:44:27] [INFO ] Flatten gal took : 37 ms
[2024-05-24 05:44:27] [INFO ] Flatten gal took : 38 ms
[2024-05-24 05:44:27] [INFO ] Time to serialize gal into /tmp/LTL3862618668082027769.gal : 6 ms
[2024-05-24 05:44:27] [INFO ] Time to serialize properties into /tmp/LTL10522968267817848180.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL3862618668082027769.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10522968267817848180.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l618<1))"))||(X(X(G("((s0>=1)&&(p1569>=1))")))))))
Formula 0 simplified : F(G!"((s1<1)||(l618<1))" & XXF!"((s0>=1)&&(p1569>=1))")
Detected timeout of ITS tools.
[2024-05-24 05:44:42] [INFO ] Flatten gal took : 36 ms
[2024-05-24 05:44:42] [INFO ] Applying decomposition
[2024-05-24 05:44:42] [INFO ] Flatten gal took : 34 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9410236608894089376.txt' '-o' '/tmp/graph9410236608894089376.bin' '-w' '/tmp/graph9410236608894089376.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9410236608894089376.bin' '-l' '-1' '-v' '-w' '/tmp/graph9410236608894089376.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:44:42] [INFO ] Decomposing Gal with order
[2024-05-24 05:44:42] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:44:42] [INFO ] Removed a total of 2665 redundant transitions.
[2024-05-24 05:44:42] [INFO ] Flatten gal took : 62 ms
[2024-05-24 05:44:42] [INFO ] Fuse similar labels procedure discarded/fused a total of 1134 labels/synchronizations in 34 ms.
[2024-05-24 05:44:42] [INFO ] Time to serialize gal into /tmp/LTL13502729009474364396.gal : 7 ms
[2024-05-24 05:44:42] [INFO ] Time to serialize properties into /tmp/LTL7639286997138307001.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13502729009474364396.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7639286997138307001.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G((F("((i5.i0.u0.s1<1)||(i9.u68.l618<1))"))||(X(X(G("((i1.u1.s0>=1)&&(i27.i1.u146.p1569>=1))")))))))
Formula 0 simplified : F(G!"((i5.i0.u0.s1<1)||(i9.u68.l618<1))" & XXF!"((i1.u1.s0>=1)&&(i27.i1.u146.p1569>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin6476907029692368115
[2024-05-24 05:44:57] [INFO ] Built C files in 24ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6476907029692368115
Running compilation step : cd /tmp/ltsmin6476907029692368115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2795 ms.
Running link step : cd /tmp/ltsmin6476907029692368115;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 38 ms.
Running LTSmin : cd /tmp/ltsmin6476907029692368115;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-08 finished in 104757 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X((F(p0)&&X(X(G(p1)))))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 40 place count 776 transition count 2008
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 55 place count 761 transition count 1976
Iterating global reduction 1 with 15 rules applied. Total rules applied 70 place count 761 transition count 1976
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 74 place count 761 transition count 1972
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 86 place count 749 transition count 1936
Iterating global reduction 2 with 12 rules applied. Total rules applied 98 place count 749 transition count 1936
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 112 place count 735 transition count 1892
Iterating global reduction 2 with 14 rules applied. Total rules applied 126 place count 735 transition count 1892
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 142 place count 719 transition count 1848
Iterating global reduction 2 with 16 rules applied. Total rules applied 158 place count 719 transition count 1848
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 176 place count 701 transition count 1800
Iterating global reduction 2 with 18 rules applied. Total rules applied 194 place count 701 transition count 1800
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 211 place count 684 transition count 1758
Iterating global reduction 2 with 17 rules applied. Total rules applied 228 place count 684 transition count 1758
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 245 place count 667 transition count 1722
Iterating global reduction 2 with 17 rules applied. Total rules applied 262 place count 667 transition count 1722
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 278 place count 651 transition count 1688
Iterating global reduction 2 with 16 rules applied. Total rules applied 294 place count 651 transition count 1688
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 305 place count 640 transition count 1664
Iterating global reduction 2 with 11 rules applied. Total rules applied 316 place count 640 transition count 1664
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 324 place count 632 transition count 1648
Iterating global reduction 2 with 8 rules applied. Total rules applied 332 place count 632 transition count 1648
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 337 place count 627 transition count 1638
Iterating global reduction 2 with 5 rules applied. Total rules applied 342 place count 627 transition count 1638
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 344 place count 625 transition count 1634
Iterating global reduction 2 with 2 rules applied. Total rules applied 346 place count 625 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 347 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 348 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 349 place count 623 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 350 place count 623 transition count 1630
Applied a total of 350 rules in 286 ms. Remains 623 /791 variables (removed 168) and now considering 1630/2050 (removed 420) transitions.
[2024-05-24 05:45:13] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-24 05:45:13] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 05:45:13] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-24 05:45:13] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 05:45:13] [INFO ] Invariant cache hit.
[2024-05-24 05:45:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:15] [INFO ] Implicit Places using invariants and state equation in 1610 ms returned []
Implicit Place search using SMT with State Equation took 1968 ms to find 0 implicit places.
[2024-05-24 05:45:15] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 05:45:15] [INFO ] Invariant cache hit.
[2024-05-24 05:45:15] [INFO ] Dead Transitions using invariants and state equation in 484 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 623/791 places, 1630/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2738 ms. Remains : 623/791 places, 1630/2050 transitions.
Stuttering acceptance computed with spot in 289 ms :[(OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), (OR (NOT p1) (NOT p0)), (NOT p0), (NOT p1), (NOT p1), true]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-12 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 1}], [{ cond=true, acceptance={} source=1 dest: 2}], [{ cond=(NOT p0), acceptance={} source=2 dest: 3}, { cond=true, acceptance={} source=2 dest: 4}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 5}], [{ cond=p1, acceptance={} source=5 dest: 5}, { cond=(NOT p1), acceptance={} source=5 dest: 6}], [{ cond=true, acceptance={0} source=6 dest: 6}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s550 1)), p1:(OR (LT s0 1) (LT s551 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null, null, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 435 ms.
Product exploration explored 100000 steps with 0 reset in 485 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 76 ms. Reduced automaton from 7 states, 9 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 261 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 170 ms. (steps per millisecond=58 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 32 ms. (steps per millisecond=312 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) 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 4) 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 4) seen :0
Interrupted probabilistic random walk after 204338 steps, run timeout after 3001 ms. (steps per millisecond=68 ) properties seen :{}
Probabilistic random walk after 204338 steps, saw 132645 distinct states, run finished after 3001 ms. (steps per millisecond=68 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:45:20] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 05:45:20] [INFO ] Invariant cache hit.
[2024-05-24 05:45:20] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:21] [INFO ] After 569ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:22] [INFO ] After 898ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:22] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:22] [INFO ] After 662ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:23] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 0 ms to minimize.
[2024-05-24 05:45:23] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 240 ms
[2024-05-24 05:45:23] [INFO ] After 1344ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 298 ms.
[2024-05-24 05:45:23] [INFO ] After 2704ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 24 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 623 transition count 1624
Applied a total of 6 rules in 169 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 169 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 141 ms. (steps per millisecond=70 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 213744 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 213744 steps, saw 138750 distinct states, run finished after 3001 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:45:27] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-24 05:45:27] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 05:45:27] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:45:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:45:27] [INFO ] After 573ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:45:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:28] [INFO ] After 841ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:28] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:29] [INFO ] After 678ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:29] [INFO ] After 1074ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 539 ms.
[2024-05-24 05:45:30] [INFO ] After 2614ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 85 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 85 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 79 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-24 05:45:30] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:45:30] [INFO ] Invariant cache hit.
[2024-05-24 05:45:31] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-24 05:45:31] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:45:31] [INFO ] Invariant cache hit.
[2024-05-24 05:45:31] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:32] [INFO ] Implicit Places using invariants and state equation in 1653 ms returned []
Implicit Place search using SMT with State Equation took 2012 ms to find 0 implicit places.
[2024-05-24 05:45:32] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:45:32] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:45:32] [INFO ] Invariant cache hit.
[2024-05-24 05:45:33] [INFO ] Dead Transitions using invariants and state equation in 530 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2663 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 32 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-24 05:45:33] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:45:33] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:45:33] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:45:33] [INFO ] After 16ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-24 05:45:33] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:45:33] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:33] [INFO ] After 49ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:45:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:33] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:33] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:33] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 18 ms.
[2024-05-24 05:45:33] [INFO ] After 92ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) p1), true, (X (X (NOT p0)))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 82 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 281 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 240 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
[2024-05-24 05:45:34] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-24 05:45:34] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:45:34] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:34] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:34] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:45:36] [INFO ] [Real]Absence check using state equation in 1604 ms returned sat
[2024-05-24 05:45:36] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:45:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 34 ms returned sat
[2024-05-24 05:45:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:37] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:45:38] [INFO ] [Nat]Absence check using state equation in 427 ms returned sat
[2024-05-24 05:45:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:38] [INFO ] [Nat]Added 268 Read/Feed constraints in 126 ms returned sat
[2024-05-24 05:45:38] [INFO ] Deduced a trap composed of 131 places in 151 ms of which 0 ms to minimize.
[2024-05-24 05:45:38] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 393 ms
[2024-05-24 05:45:38] [INFO ] Computed and/alt/rep : 208/306/208 causal constraints (skipped 878 transitions) in 204 ms.
[2024-05-24 05:45:39] [INFO ] Added : 13 causal constraints over 3 iterations in 487 ms. Result :sat
Could not prove EG (NOT p0)
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Applied a total of 0 rules in 18 ms. Remains 623 /623 variables (removed 0) and now considering 1630/1630 (removed 0) transitions.
[2024-05-24 05:45:39] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 05:45:39] [INFO ] Invariant cache hit.
[2024-05-24 05:45:39] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-24 05:45:39] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 05:45:39] [INFO ] Invariant cache hit.
[2024-05-24 05:45:39] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:40] [INFO ] Implicit Places using invariants and state equation in 1569 ms returned []
Implicit Place search using SMT with State Equation took 1930 ms to find 0 implicit places.
[2024-05-24 05:45:40] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 05:45:40] [INFO ] Invariant cache hit.
[2024-05-24 05:45:41] [INFO ] Dead Transitions using invariants and state equation in 542 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2494 ms. Remains : 623/623 places, 1630/1630 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 89 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Incomplete random walk after 10003 steps, including 2 resets, run finished after 149 ms. (steps per millisecond=67 ) properties (out of 4) 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 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 195143 steps, run timeout after 3001 ms. (steps per millisecond=65 ) properties seen :{}
Probabilistic random walk after 195143 steps, saw 126680 distinct states, run finished after 3001 ms. (steps per millisecond=65 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:45:45] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
[2024-05-24 05:45:45] [INFO ] Invariant cache hit.
[2024-05-24 05:45:45] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:45] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:45:45] [INFO ] After 551ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:45] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:45] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:46] [INFO ] After 890ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:46] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:47] [INFO ] After 721ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:47] [INFO ] Deduced a trap composed of 135 places in 161 ms of which 0 ms to minimize.
[2024-05-24 05:45:47] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 239 ms
[2024-05-24 05:45:48] [INFO ] After 1428ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 304 ms.
[2024-05-24 05:45:48] [INFO ] After 2779ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 26 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1630/1630 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 623 transition count 1624
Applied a total of 6 rules in 150 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1630 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 150 ms. Remains : 623/623 places, 1624/1630 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 138 ms. (steps per millisecond=72 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 193240 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 193240 steps, saw 125444 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:45:51] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
// Phase 1: matrix 1085 rows 623 cols
[2024-05-24 05:45:51] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:45:52] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:52] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:45:52] [INFO ] After 566ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:52] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:52] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:45:53] [INFO ] After 847ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:53] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:54] [INFO ] After 735ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:54] [INFO ] After 1163ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 559 ms.
[2024-05-24 05:45:55] [INFO ] After 2727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Fused 4 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 8 ms.
Support contains 3 out of 623 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 78 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 78 ms. Remains : 623/623 places, 1624/1624 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 623/623 places, 1624/1624 transitions.
Applied a total of 0 rules in 74 ms. Remains 623 /623 variables (removed 0) and now considering 1624/1624 (removed 0) transitions.
[2024-05-24 05:45:55] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:45:55] [INFO ] Invariant cache hit.
[2024-05-24 05:45:55] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-24 05:45:55] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:45:55] [INFO ] Invariant cache hit.
[2024-05-24 05:45:56] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:45:57] [INFO ] Implicit Places using invariants and state equation in 1631 ms returned []
Implicit Place search using SMT with State Equation took 1994 ms to find 0 implicit places.
[2024-05-24 05:45:57] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 05:45:57] [INFO ] Flow matrix only has 1085 transitions (discarded 539 similar events)
[2024-05-24 05:45:57] [INFO ] Invariant cache hit.
[2024-05-24 05:45:58] [INFO ] Dead Transitions using invariants and state equation in 554 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2666 ms. Remains : 623/623 places, 1624/1624 transitions.
Graph (trivial) has 956 edges and 623 vertex of which 192 / 623 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 411 transitions
Reduce isomorphic transitions removed 731 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 495 transition count 882
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 484 transition count 882
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 23 place count 484 transition count 806
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 175 place count 408 transition count 806
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 238 place count 345 transition count 743
Iterating global reduction 2 with 63 rules applied. Total rules applied 301 place count 345 transition count 743
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 427 place count 345 transition count 617
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 681 place count 218 transition count 490
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 745 place count 154 transition count 362
Iterating global reduction 3 with 64 rules applied. Total rules applied 809 place count 154 transition count 362
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 810 place count 154 transition count 361
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 873 place count 91 transition count 235
Iterating global reduction 4 with 63 rules applied. Total rules applied 936 place count 91 transition count 235
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 999 place count 28 transition count 109
Iterating global reduction 4 with 63 rules applied. Total rules applied 1062 place count 28 transition count 109
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1125 place count 28 transition count 46
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1125 place count 28 transition count 45
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1127 place count 27 transition count 45
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1129 place count 26 transition count 44
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1133 place count 24 transition count 44
Applied a total of 1133 rules in 29 ms. Remains 24 /623 variables (removed 599) and now considering 44/1624 (removed 1580) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 44 rows 24 cols
[2024-05-24 05:45:58] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 05:45:58] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:45:58] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 3 ms returned sat
[2024-05-24 05:45:58] [INFO ] After 13ms SMT Verify possible using state equation in real domain returned unsat :0 sat :2 real:2
[2024-05-24 05:45:58] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:45:58] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:58] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:45:58] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:45:58] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:45:58] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:58] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:45:58] [INFO ] After 26ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 05:45:58] [INFO ] After 78ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND p1 (NOT p0)), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 82 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 273 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
[2024-05-24 05:45:58] [INFO ] Flow matrix only has 1088 transitions (discarded 542 similar events)
// Phase 1: matrix 1088 rows 623 cols
[2024-05-24 05:45:58] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:45:59] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:45:59] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:45:59] [INFO ] [Real]Adding state equation constraints to refine reachable states.
[2024-05-24 05:46:01] [INFO ] [Real]Absence check using state equation in 1551 ms returned sat
[2024-05-24 05:46:01] [INFO ] Solution in real domain found non-integer solution.
[2024-05-24 05:46:02] [INFO ] [Nat]Absence check using 1 positive place invariants in 32 ms returned sat
[2024-05-24 05:46:02] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:46:02] [INFO ] [Nat]Adding state equation constraints to refine reachable states.
[2024-05-24 05:46:02] [INFO ] [Nat]Absence check using state equation in 394 ms returned sat
[2024-05-24 05:46:02] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:46:02] [INFO ] [Nat]Added 268 Read/Feed constraints in 119 ms returned sat
[2024-05-24 05:46:02] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 0 ms to minimize.
[2024-05-24 05:46:03] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 378 ms
[2024-05-24 05:46:03] [INFO ] Computed and/alt/rep : 208/306/208 causal constraints (skipped 878 transitions) in 107 ms.
[2024-05-24 05:46:03] [INFO ] Added : 13 causal constraints over 3 iterations in 356 ms. Result :sat
Could not prove EG (NOT p0)
Stuttering acceptance computed with spot in 264 ms :[(NOT p1), (OR (NOT p1) (NOT p0)), (OR (NOT p1) (NOT p0)), (OR (NOT p0) (NOT p1)), (OR (NOT p0) (NOT p1)), true, (OR (NOT p0) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 392 ms.
Stack based approach found an accepted trace after 250 steps with 0 reset with depth 251 and stack size 251 in 1 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-12 FALSE TECHNIQUES STACK_TEST
Treatment of property FunctionPointer-PT-c004-LTLFireability-12 finished in 51265 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2020
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2020
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 776 transition count 2012
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 762 transition count 1982
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 762 transition count 1982
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 750 transition count 1942
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 750 transition count 1942
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 737 transition count 1898
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 737 transition count 1898
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 129 place count 724 transition count 1868
Iterating global reduction 1 with 13 rules applied. Total rules applied 142 place count 724 transition count 1868
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 157 place count 709 transition count 1832
Iterating global reduction 1 with 15 rules applied. Total rules applied 172 place count 709 transition count 1832
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 188 place count 693 transition count 1790
Iterating global reduction 1 with 16 rules applied. Total rules applied 204 place count 693 transition count 1790
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 220 place count 677 transition count 1754
Iterating global reduction 1 with 16 rules applied. Total rules applied 236 place count 677 transition count 1754
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 252 place count 661 transition count 1718
Iterating global reduction 1 with 16 rules applied. Total rules applied 268 place count 661 transition count 1718
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 277 place count 652 transition count 1696
Iterating global reduction 1 with 9 rules applied. Total rules applied 286 place count 652 transition count 1696
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 293 place count 645 transition count 1682
Iterating global reduction 1 with 7 rules applied. Total rules applied 300 place count 645 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 307 place count 638 transition count 1668
Iterating global reduction 1 with 7 rules applied. Total rules applied 314 place count 638 transition count 1668
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 318 place count 634 transition count 1660
Iterating global reduction 1 with 4 rules applied. Total rules applied 322 place count 634 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 324 place count 632 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 326 place count 632 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 328 place count 630 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 330 place count 630 transition count 1652
Applied a total of 330 rules in 271 ms. Remains 630 /791 variables (removed 161) and now considering 1652/2050 (removed 398) transitions.
[2024-05-24 05:46:04] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
// Phase 1: matrix 1103 rows 630 cols
[2024-05-24 05:46:04] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:46:04] [INFO ] Implicit Places using invariants in 302 ms returned []
[2024-05-24 05:46:04] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-24 05:46:04] [INFO ] Invariant cache hit.
[2024-05-24 05:46:05] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:46:06] [INFO ] Implicit Places using invariants and state equation in 1561 ms returned []
Implicit Place search using SMT with State Equation took 1864 ms to find 0 implicit places.
[2024-05-24 05:46:06] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-24 05:46:06] [INFO ] Invariant cache hit.
[2024-05-24 05:46:06] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 630/791 places, 1652/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2675 ms. Remains : 630/791 places, 1652/2050 transitions.
Stuttering acceptance computed with spot in 101 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-13 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: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s544 1)), p1:(AND (GEQ s0 1) (GEQ s540 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 433 ms.
Product exploration explored 100000 steps with 0 reset in 450 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 76 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 41 ms :[true, (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 307724 steps, run timeout after 3001 ms. (steps per millisecond=102 ) properties seen :{}
Probabilistic random walk after 307724 steps, saw 199743 distinct states, run finished after 3012 ms. (steps per millisecond=102 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:46:11] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-24 05:46:11] [INFO ] Invariant cache hit.
[2024-05-24 05:46:11] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:46:11] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:46:11] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:46:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:46:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:46:12] [INFO ] After 719ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:12] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:46:12] [INFO ] After 515ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:12] [INFO ] After 720ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 144 ms.
[2024-05-24 05:46:12] [INFO ] After 1699ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1652/1652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1644
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1644
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1638
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1636
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1618
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 618 transition count 1612
Applied a total of 36 rules in 315 ms. Remains 618 /630 variables (removed 12) and now considering 1612/1652 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 315 ms. Remains : 618/630 places, 1612/1652 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 69 ms. (steps per millisecond=144 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 278985 steps, run timeout after 3001 ms. (steps per millisecond=92 ) properties seen :{}
Probabilistic random walk after 278985 steps, saw 181093 distinct states, run finished after 3001 ms. (steps per millisecond=92 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:46:16] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 618 cols
[2024-05-24 05:46:16] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 05:46:16] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:46:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:46:16] [INFO ] After 114ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:46:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:46:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 2 ms returned sat
[2024-05-24 05:46:17] [INFO ] After 679ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:17] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:46:17] [INFO ] After 386ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:18] [INFO ] Deduced a trap composed of 135 places in 163 ms of which 1 ms to minimize.
[2024-05-24 05:46:18] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 244 ms
[2024-05-24 05:46:18] [INFO ] After 837ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 194 ms.
[2024-05-24 05:46:18] [INFO ] After 1848ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 79 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 618/618 places, 1612/1612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 72 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 05:46:18] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:46:18] [INFO ] Invariant cache hit.
[2024-05-24 05:46:18] [INFO ] Implicit Places using invariants in 361 ms returned []
[2024-05-24 05:46:18] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:46:18] [INFO ] Invariant cache hit.
[2024-05-24 05:46:19] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:46:20] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1814 ms to find 0 implicit places.
[2024-05-24 05:46:20] [INFO ] Redundant transitions in 30 ms returned []
[2024-05-24 05:46:20] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:46:20] [INFO ] Invariant cache hit.
[2024-05-24 05:46:20] [INFO ] Dead Transitions using invariants and state equation in 485 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2414 ms. Remains : 618/618 places, 1612/1612 transitions.
Graph (trivial) has 944 edges and 618 vertex of which 192 / 618 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 490 transition count 876
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 479 transition count 876
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 23 place count 479 transition count 803
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 169 place count 406 transition count 803
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 232 place count 343 transition count 740
Iterating global reduction 2 with 63 rules applied. Total rules applied 295 place count 343 transition count 740
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 421 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 677 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 741 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 805 place count 151 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 870 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 933 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 996 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1059 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1122 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1122 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1124 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 23 transition count 39
Applied a total of 1126 rules in 32 ms. Remains 23 /618 variables (removed 595) and now considering 39/1612 (removed 1573) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 23 cols
[2024-05-24 05:46:20] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:46:20] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:46:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:46:20] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:46:20] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:46:20] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:46:20] [INFO ] After 12ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:20] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:46:20] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:20] [INFO ] After 13ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 05:46:21] [INFO ] After 54ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 90 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 62 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 45 ms :[true, (OR (NOT p0) p1)]
Support contains 3 out of 630 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 1652/1652 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 630 transition count 1646
Applied a total of 6 rules in 171 ms. Remains 630 /630 variables (removed 0) and now considering 1646/1652 (removed 6) transitions.
[2024-05-24 05:46:21] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
// Phase 1: matrix 1100 rows 630 cols
[2024-05-24 05:46:21] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:46:21] [INFO ] Implicit Places using invariants in 309 ms returned []
[2024-05-24 05:46:21] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-24 05:46:21] [INFO ] Invariant cache hit.
[2024-05-24 05:46:21] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:46:23] [INFO ] Implicit Places using invariants and state equation in 1584 ms returned []
Implicit Place search using SMT with State Equation took 1897 ms to find 0 implicit places.
[2024-05-24 05:46:23] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 05:46:23] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-24 05:46:23] [INFO ] Invariant cache hit.
[2024-05-24 05:46:23] [INFO ] Dead Transitions using invariants and state equation in 545 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/630 places, 1646/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2647 ms. Remains : 630/630 places, 1646/1652 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 71 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 50 ms :[true, (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 87 ms. (steps per millisecond=114 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 295318 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295318 steps, saw 191693 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:46:27] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-24 05:46:27] [INFO ] Invariant cache hit.
[2024-05-24 05:46:27] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:46:27] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:46:27] [INFO ] After 99ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:46:27] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:46:27] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 6 ms returned sat
[2024-05-24 05:46:28] [INFO ] After 647ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:28] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:46:28] [INFO ] After 658ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:28] [INFO ] After 849ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 138 ms.
[2024-05-24 05:46:29] [INFO ] After 1757ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1646/1646 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1638
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1614
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 618 transition count 1612
Applied a total of 32 rules in 319 ms. Remains 618 /630 variables (removed 12) and now considering 1612/1646 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 320 ms. Remains : 618/630 places, 1612/1646 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 70 ms. (steps per millisecond=142 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 13 ms. (steps per millisecond=769 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 14 ms. (steps per millisecond=714 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 295267 steps, run timeout after 3001 ms. (steps per millisecond=98 ) properties seen :{}
Probabilistic random walk after 295267 steps, saw 191661 distinct states, run finished after 3001 ms. (steps per millisecond=98 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:46:32] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 618 cols
[2024-05-24 05:46:32] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 05:46:32] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:46:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:46:32] [INFO ] After 106ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:46:32] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:46:32] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:46:33] [INFO ] After 642ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:33] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:46:33] [INFO ] After 361ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:34] [INFO ] Deduced a trap composed of 135 places in 155 ms of which 3 ms to minimize.
[2024-05-24 05:46:34] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 235 ms
[2024-05-24 05:46:34] [INFO ] After 802ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 190 ms.
[2024-05-24 05:46:34] [INFO ] After 1745ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 82 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 82 ms. Remains : 618/618 places, 1612/1612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 75 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 05:46:34] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:46:34] [INFO ] Invariant cache hit.
[2024-05-24 05:46:34] [INFO ] Implicit Places using invariants in 348 ms returned []
[2024-05-24 05:46:34] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:46:34] [INFO ] Invariant cache hit.
[2024-05-24 05:46:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:46:36] [INFO ] Implicit Places using invariants and state equation in 1550 ms returned []
Implicit Place search using SMT with State Equation took 1900 ms to find 0 implicit places.
[2024-05-24 05:46:36] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 05:46:36] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:46:36] [INFO ] Invariant cache hit.
[2024-05-24 05:46:36] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2532 ms. Remains : 618/618 places, 1612/1612 transitions.
Graph (trivial) has 944 edges and 618 vertex of which 192 / 618 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 490 transition count 876
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 479 transition count 876
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 23 place count 479 transition count 803
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 169 place count 406 transition count 803
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 232 place count 343 transition count 740
Iterating global reduction 2 with 63 rules applied. Total rules applied 295 place count 343 transition count 740
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 421 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 677 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 741 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 805 place count 151 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 870 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 933 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 996 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1059 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1122 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1122 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1124 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 23 transition count 39
Applied a total of 1126 rules in 31 ms. Remains 23 /618 variables (removed 595) and now considering 39/1612 (removed 1573) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 23 cols
[2024-05-24 05:46:36] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 05:46:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:46:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:46:36] [INFO ] After 22ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:46:36] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:46:36] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:46:37] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:46:37] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:46:37] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 05:46:37] [INFO ] After 53ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 87 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 42 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 51 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 40 ms :[true, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 409 ms.
Product exploration explored 100000 steps with 0 reset in 508 ms.
Built C files in :
/tmp/ltsmin15299819957466462948
[2024-05-24 05:46:38] [INFO ] Too many transitions (1646) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:46:38] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15299819957466462948
Running compilation step : cd /tmp/ltsmin15299819957466462948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2932 ms.
Running link step : cd /tmp/ltsmin15299819957466462948;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 35 ms.
Running LTSmin : cd /tmp/ltsmin15299819957466462948;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10984308487060689971.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 1646/1646 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1638
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1614
Applied a total of 30 rules in 263 ms. Remains 618 /630 variables (removed 12) and now considering 1614/1646 (removed 32) transitions.
[2024-05-24 05:46:53] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-24 05:46:53] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:46:53] [INFO ] Implicit Places using invariants in 393 ms returned []
[2024-05-24 05:46:53] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-24 05:46:53] [INFO ] Invariant cache hit.
[2024-05-24 05:46:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:46:55] [INFO ] Implicit Places using invariants and state equation in 1471 ms returned []
Implicit Place search using SMT with State Equation took 1865 ms to find 0 implicit places.
[2024-05-24 05:46:55] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 05:46:55] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-24 05:46:55] [INFO ] Invariant cache hit.
[2024-05-24 05:46:55] [INFO ] Dead Transitions using invariants and state equation in 540 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/630 places, 1614/1646 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2704 ms. Remains : 618/630 places, 1614/1646 transitions.
Built C files in :
/tmp/ltsmin5580812465474050063
[2024-05-24 05:46:55] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:46:55] [INFO ] Built C files in 17ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin5580812465474050063
Running compilation step : cd /tmp/ltsmin5580812465474050063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2996 ms.
Running link step : cd /tmp/ltsmin5580812465474050063;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 44 ms.
Running LTSmin : cd /tmp/ltsmin5580812465474050063;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased5086008408084384783.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:47:11] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:47:11] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:47:11] [INFO ] Time to serialize gal into /tmp/LTL341282808771903587.gal : 5 ms
[2024-05-24 05:47:11] [INFO ] Time to serialize properties into /tmp/LTL6412395241829255266.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL341282808771903587.gal' '-t' 'CGAL' '-hoa' '/tmp/aut810736964353117313.hoa' '-atoms' '/tmp/LTL6412395241829255266.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...315
Loading property file /tmp/LTL6412395241829255266.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut810736964353117313.hoa
Detected timeout of ITS tools.
[2024-05-24 05:47:26] [INFO ] Flatten gal took : 36 ms
[2024-05-24 05:47:26] [INFO ] Flatten gal took : 36 ms
[2024-05-24 05:47:26] [INFO ] Time to serialize gal into /tmp/LTL9717206404175881386.gal : 6 ms
[2024-05-24 05:47:26] [INFO ] Time to serialize properties into /tmp/LTL16896671643487046969.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9717206404175881386.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL16896671643487046969.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((X(!("((s0>=1)&&(l1415>=1))")))U((X(G(!("((s0>=1)&&(l1415>=1))"))))||((!("((s1>=1)&&(l1786>=1))"))&&(X(!("((s0>=1)&&(l1415>=1))"...189
Formula 0 simplified : F(!"((s0<1)||(l1505<1))" | (X"((s0>=1)&&(l1415>=1))" R (XF"((s0>=1)&&(l1415>=1))" & ("((s1>=1)&&(l1786>=1))" | X"((s0>=1)&&(l1415>=1...162
Detected timeout of ITS tools.
[2024-05-24 05:47:41] [INFO ] Flatten gal took : 38 ms
[2024-05-24 05:47:41] [INFO ] Applying decomposition
[2024-05-24 05:47:41] [INFO ] Flatten gal took : 37 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph11232865786981881503.txt' '-o' '/tmp/graph11232865786981881503.bin' '-w' '/tmp/graph11232865786981881503.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph11232865786981881503.bin' '-l' '-1' '-v' '-w' '/tmp/graph11232865786981881503.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:47:41] [INFO ] Decomposing Gal with order
[2024-05-24 05:47:41] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:47:41] [INFO ] Removed a total of 2747 redundant transitions.
[2024-05-24 05:47:41] [INFO ] Flatten gal took : 60 ms
[2024-05-24 05:47:41] [INFO ] Fuse similar labels procedure discarded/fused a total of 1148 labels/synchronizations in 38 ms.
[2024-05-24 05:47:41] [INFO ] Time to serialize gal into /tmp/LTL15980894411121394036.gal : 10 ms
[2024-05-24 05:47:41] [INFO ] Time to serialize properties into /tmp/LTL11925320047504736960.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL15980894411121394036.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11925320047504736960.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((G(((X(!("((i0.u0.s0>=1)&&(i22.i0.u152.l1415>=1))")))U((X(G(!("((i0.u0.s0>=1)&&(i22.i0.u152.l1415>=1))"))))||((!("((i2.u1.s1>=1)&&(i...279
Formula 0 simplified : F(!"((i0.u0.s0<1)||(i22.i0.u153.l1505<1))" | (X"((i0.u0.s0>=1)&&(i22.i0.u152.l1415>=1))" R (XF"((i0.u0.s0>=1)&&(i22.i0.u152.l1415>=1...252
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2565793249881240054
[2024-05-24 05:47:56] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2565793249881240054
Running compilation step : cd /tmp/ltsmin2565793249881240054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin2565793249881240054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin2565793249881240054;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 FunctionPointer-PT-c004-LTLFireability-13 finished in 115483 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(X(X(X((G(p0)||G(p1))))))'
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 6 transitions
Reduce isomorphic transitions removed 6 transitions.
Iterating post reduction 0 with 6 rules applied. Total rules applied 36 place count 776 transition count 2012
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 52 place count 760 transition count 1978
Iterating global reduction 1 with 16 rules applied. Total rules applied 68 place count 760 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 760 transition count 1974
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 86 place count 746 transition count 1930
Iterating global reduction 2 with 14 rules applied. Total rules applied 100 place count 746 transition count 1930
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 116 place count 730 transition count 1878
Iterating global reduction 2 with 16 rules applied. Total rules applied 132 place count 730 transition count 1878
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 150 place count 712 transition count 1830
Iterating global reduction 2 with 18 rules applied. Total rules applied 168 place count 712 transition count 1830
Discarding 20 places :
Symmetric choice reduction at 2 with 20 rule applications. Total rules 188 place count 692 transition count 1778
Iterating global reduction 2 with 20 rules applied. Total rules applied 208 place count 692 transition count 1778
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 227 place count 673 transition count 1732
Iterating global reduction 2 with 19 rules applied. Total rules applied 246 place count 673 transition count 1732
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 265 place count 654 transition count 1692
Iterating global reduction 2 with 19 rules applied. Total rules applied 284 place count 654 transition count 1692
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 302 place count 636 transition count 1654
Iterating global reduction 2 with 18 rules applied. Total rules applied 320 place count 636 transition count 1654
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 331 place count 625 transition count 1630
Iterating global reduction 2 with 11 rules applied. Total rules applied 342 place count 625 transition count 1630
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 350 place count 617 transition count 1614
Iterating global reduction 2 with 8 rules applied. Total rules applied 358 place count 617 transition count 1614
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 362 place count 613 transition count 1606
Iterating global reduction 2 with 4 rules applied. Total rules applied 366 place count 613 transition count 1606
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 368 place count 611 transition count 1602
Iterating global reduction 2 with 2 rules applied. Total rules applied 370 place count 611 transition count 1602
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 371 place count 610 transition count 1600
Iterating global reduction 2 with 1 rules applied. Total rules applied 372 place count 610 transition count 1600
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 373 place count 609 transition count 1598
Iterating global reduction 2 with 1 rules applied. Total rules applied 374 place count 609 transition count 1598
Applied a total of 374 rules in 258 ms. Remains 609 /791 variables (removed 182) and now considering 1598/2050 (removed 452) transitions.
[2024-05-24 05:47:59] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
// Phase 1: matrix 1068 rows 609 cols
[2024-05-24 05:47:59] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:48:00] [INFO ] Implicit Places using invariants in 376 ms returned []
[2024-05-24 05:48:00] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-24 05:48:00] [INFO ] Invariant cache hit.
[2024-05-24 05:48:00] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:01] [INFO ] Implicit Places using invariants and state equation in 1656 ms returned []
Implicit Place search using SMT with State Equation took 2035 ms to find 0 implicit places.
[2024-05-24 05:48:01] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-24 05:48:01] [INFO ] Invariant cache hit.
[2024-05-24 05:48:02] [INFO ] Dead Transitions using invariants and state equation in 514 ms found 0 transitions.
Starting structural reductions in LTL mode, iteration 1 : 609/791 places, 1598/2050 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2809 ms. Remains : 609/791 places, 1598/2050 transitions.
Stuttering acceptance computed with spot in 282 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-14 automaton TGBA Formula[mat=[[{ cond=true, acceptance={0} source=0 dest: 0}], [{ cond=(NOT p1), acceptance={} source=1 dest: 0}, { cond=p1, acceptance={} source=1 dest: 1}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 0}, { cond=(AND (NOT p0) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 p1), acceptance={} source=2 dest: 2}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={} source=3 dest: 0}, { cond=p0, acceptance={} source=3 dest: 3}], [{ cond=true, acceptance={} source=4 dest: 2}], [{ cond=true, acceptance={} source=5 dest: 4}], [{ cond=true, acceptance={} source=6 dest: 5}]], initial=6, aps=[p1:(OR (AND (GEQ s0 1) (GEQ s522 1)) (AND (GEQ s0 1) (GEQ s523 1))), p0:(OR (LT s0 1) (LT s522 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, null, null, null][false, false, false, false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 388 ms.
Product exploration explored 100000 steps with 0 reset in 398 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 1679 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 12 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 246 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10002 steps, including 2 resets, run finished after 178 ms. (steps per millisecond=56 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 26 ms. (steps per millisecond=384 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 183403 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 183403 steps, saw 119060 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:48:08] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-24 05:48:08] [INFO ] Invariant cache hit.
[2024-05-24 05:48:08] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:48:08] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 5 ms returned sat
[2024-05-24 05:48:09] [INFO ] After 149ms SMT Verify possible using all constraints in real domain returned unsat :1 sat :0 real:5
[2024-05-24 05:48:09] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:48:09] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:10] [INFO ] After 1079ms SMT Verify possible using state equation in natural domain returned unsat :1 sat :5
[2024-05-24 05:48:10] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:11] [INFO ] After 888ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :1 sat :5
[2024-05-24 05:48:11] [INFO ] Deduced a trap composed of 131 places in 149 ms of which 1 ms to minimize.
[2024-05-24 05:48:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 254 ms
[2024-05-24 05:48:12] [INFO ] After 1847ms SMT Verify possible using trap constraints in natural domain returned unsat :1 sat :5
Attempting to minimize the solution found.
Minimization took 606 ms.
[2024-05-24 05:48:12] [INFO ] After 3714ms SMT Verify possible using all constraints in natural domain returned unsat :1 sat :5
Fused 6 Parikh solutions to 4 different solutions.
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 609 transition count 1596
Applied a total of 2 rules in 147 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1598 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 609/609 places, 1596/1598 transitions.
Incomplete random walk after 10005 steps, including 2 resets, run finished after 112 ms. (steps per millisecond=89 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 5) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 5) seen :0
Interrupted probabilistic random walk after 199959 steps, run timeout after 3001 ms. (steps per millisecond=66 ) properties seen :{}
Probabilistic random walk after 199959 steps, saw 129803 distinct states, run finished after 3001 ms. (steps per millisecond=66 ) properties seen :0
Running SMT prover for 5 properties.
[2024-05-24 05:48:16] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-24 05:48:16] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 05:48:16] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:48:16] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:16] [INFO ] After 140ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 05:48:16] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:48:16] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:17] [INFO ] After 1017ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 05:48:17] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:18] [INFO ] After 790ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 05:48:18] [INFO ] After 1437ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 670 ms.
[2024-05-24 05:48:19] [INFO ] After 3298ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Fused 5 Parikh solutions to 3 different solutions.
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 74 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 609/609 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 74 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-24 05:48:19] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-24 05:48:19] [INFO ] Invariant cache hit.
[2024-05-24 05:48:20] [INFO ] Implicit Places using invariants in 347 ms returned []
[2024-05-24 05:48:20] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-24 05:48:20] [INFO ] Invariant cache hit.
[2024-05-24 05:48:20] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:21] [INFO ] Implicit Places using invariants and state equation in 1705 ms returned []
Implicit Place search using SMT with State Equation took 2061 ms to find 0 implicit places.
[2024-05-24 05:48:21] [INFO ] Redundant transitions in 22 ms returned []
[2024-05-24 05:48:21] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-24 05:48:21] [INFO ] Invariant cache hit.
[2024-05-24 05:48:22] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2696 ms. Remains : 609/609 places, 1596/1596 transitions.
Graph (trivial) has 936 edges and 609 vertex of which 192 / 609 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 721 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 481 transition count 865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 471 transition count 865
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 21 place count 471 transition count 798
Deduced a syphon composed of 67 places in 0 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 155 place count 404 transition count 798
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 218 place count 341 transition count 735
Iterating global reduction 2 with 63 rules applied. Total rules applied 281 place count 341 transition count 735
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 407 place count 341 transition count 609
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 665 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 729 place count 148 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 793 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 148 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 794 place count 148 transition count 350
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 796 place count 147 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 859 place count 84 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 922 place count 84 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 985 place count 21 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1048 place count 21 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1111 place count 21 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1111 place count 21 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1113 place count 20 transition count 34
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1117 place count 20 transition count 30
Applied a total of 1117 rules in 29 ms. Remains 20 /609 variables (removed 589) and now considering 30/1596 (removed 1566) transitions.
Running SMT prover for 5 properties.
// Phase 1: matrix 30 rows 20 cols
[2024-05-24 05:48:22] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 05:48:22] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:48:22] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:22] [INFO ] After 39ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:5
[2024-05-24 05:48:22] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:48:22] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:22] [INFO ] After 18ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :5
[2024-05-24 05:48:22] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:48:22] [INFO ] After 11ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :5
[2024-05-24 05:48:22] [INFO ] After 25ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :5
Attempting to minimize the solution found.
Minimization took 11 ms.
[2024-05-24 05:48:22] [INFO ] After 93ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :5
Found 1 invariant AP formulas.
Knowledge obtained : [(AND (NOT p1) p0), true, (G (NOT (AND (NOT p0) (NOT p1))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 100 ms. Reduced automaton from 7 states, 12 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 344 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 285 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Applied a total of 0 rules in 18 ms. Remains 609 /609 variables (removed 0) and now considering 1598/1598 (removed 0) transitions.
[2024-05-24 05:48:23] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
// Phase 1: matrix 1068 rows 609 cols
[2024-05-24 05:48:23] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:48:23] [INFO ] Implicit Places using invariants in 369 ms returned []
[2024-05-24 05:48:23] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-24 05:48:23] [INFO ] Invariant cache hit.
[2024-05-24 05:48:23] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:25] [INFO ] Implicit Places using invariants and state equation in 1447 ms returned []
Implicit Place search using SMT with State Equation took 1828 ms to find 0 implicit places.
[2024-05-24 05:48:25] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-24 05:48:25] [INFO ] Invariant cache hit.
[2024-05-24 05:48:25] [INFO ] Dead Transitions using invariants and state equation in 474 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2323 ms. Remains : 609/609 places, 1598/1598 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 90 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 276 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 132 ms. (steps per millisecond=75 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 258565 steps, run timeout after 3001 ms. (steps per millisecond=86 ) properties seen :{}
Probabilistic random walk after 258565 steps, saw 167841 distinct states, run finished after 3001 ms. (steps per millisecond=86 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 05:48:29] [INFO ] Flow matrix only has 1068 transitions (discarded 530 similar events)
[2024-05-24 05:48:29] [INFO ] Invariant cache hit.
[2024-05-24 05:48:29] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:48:29] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:29] [INFO ] After 119ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:48:29] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:48:29] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:30] [INFO ] After 697ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 05:48:30] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:30] [INFO ] After 665ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:48:31] [INFO ] Deduced a trap composed of 131 places in 146 ms of which 0 ms to minimize.
[2024-05-24 05:48:31] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2024-05-24 05:48:31] [INFO ] After 1499ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 379 ms.
[2024-05-24 05:48:32] [INFO ] After 2712ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 609 transition count 1596
Applied a total of 2 rules in 151 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1598 (removed 2) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 609/609 places, 1596/1598 transitions.
Incomplete random walk after 10004 steps, including 2 resets, run finished after 137 ms. (steps per millisecond=73 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 3) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 3) seen :0
Interrupted probabilistic random walk after 216494 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 216494 steps, saw 140536 distinct states, run finished after 3001 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 3 properties.
[2024-05-24 05:48:35] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-24 05:48:35] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 05:48:35] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:48:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:48:35] [INFO ] After 123ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:48:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:48:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:48:36] [INFO ] After 704ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 05:48:36] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:36] [INFO ] After 564ms SMT Verify possible using 266 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:48:37] [INFO ] Deduced a trap composed of 131 places in 145 ms of which 1 ms to minimize.
[2024-05-24 05:48:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 253 ms
[2024-05-24 05:48:37] [INFO ] After 1316ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 480 ms.
[2024-05-24 05:48:38] [INFO ] After 2632ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 72 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 72 ms. Remains : 609/609 places, 1596/1596 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 609/609 places, 1596/1596 transitions.
Applied a total of 0 rules in 74 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1596 (removed 0) transitions.
[2024-05-24 05:48:38] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-24 05:48:38] [INFO ] Invariant cache hit.
[2024-05-24 05:48:38] [INFO ] Implicit Places using invariants in 332 ms returned []
[2024-05-24 05:48:38] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-24 05:48:38] [INFO ] Invariant cache hit.
[2024-05-24 05:48:38] [INFO ] State equation strengthened by 266 read => feed constraints.
[2024-05-24 05:48:40] [INFO ] Implicit Places using invariants and state equation in 1694 ms returned []
Implicit Place search using SMT with State Equation took 2028 ms to find 0 implicit places.
[2024-05-24 05:48:40] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-24 05:48:40] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
[2024-05-24 05:48:40] [INFO ] Invariant cache hit.
[2024-05-24 05:48:40] [INFO ] Dead Transitions using invariants and state equation in 521 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2667 ms. Remains : 609/609 places, 1596/1596 transitions.
Graph (trivial) has 936 edges and 609 vertex of which 192 / 609 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 401 transitions
Reduce isomorphic transitions removed 721 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 481 transition count 865
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 471 transition count 865
Performed 67 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 67 Pre rules applied. Total rules applied 21 place count 471 transition count 798
Deduced a syphon composed of 67 places in 1 ms
Reduce places removed 67 places and 0 transitions.
Iterating global reduction 2 with 134 rules applied. Total rules applied 155 place count 404 transition count 798
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 218 place count 341 transition count 735
Iterating global reduction 2 with 63 rules applied. Total rules applied 281 place count 341 transition count 735
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 407 place count 341 transition count 609
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 665 place count 212 transition count 480
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 729 place count 148 transition count 352
Iterating global reduction 3 with 64 rules applied. Total rules applied 793 place count 148 transition count 352
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 794 place count 148 transition count 351
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 4 with 1 Pre rules applied. Total rules applied 794 place count 148 transition count 350
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 4 with 2 rules applied. Total rules applied 796 place count 147 transition count 350
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 859 place count 84 transition count 224
Iterating global reduction 4 with 63 rules applied. Total rules applied 922 place count 84 transition count 224
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 985 place count 21 transition count 98
Iterating global reduction 4 with 63 rules applied. Total rules applied 1048 place count 21 transition count 98
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1111 place count 21 transition count 35
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1111 place count 21 transition count 34
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1113 place count 20 transition count 34
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 5 with 4 rules applied. Total rules applied 1117 place count 20 transition count 30
Applied a total of 1117 rules in 32 ms. Remains 20 /609 variables (removed 589) and now considering 30/1596 (removed 1566) transitions.
Running SMT prover for 3 properties.
// Phase 1: matrix 30 rows 20 cols
[2024-05-24 05:48:40] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 05:48:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:48:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:48:40] [INFO ] After 27ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:3
[2024-05-24 05:48:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:48:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:48:41] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :3
[2024-05-24 05:48:41] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:48:41] [INFO ] After 6ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :3
[2024-05-24 05:48:41] [INFO ] After 14ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :3
Attempting to minimize the solution found.
Minimization took 7 ms.
[2024-05-24 05:48:41] [INFO ] After 61ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :3
Knowledge obtained : [(AND (NOT p1) p0), true]
False Knowledge obtained : []
Knowledge based reduction with 2 factoid took 101 ms. Reduced automaton from 7 states, 11 edges and 2 AP (stutter sensitive) to 7 states, 11 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 260 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 265 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Stuttering acceptance computed with spot in 279 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Product exploration explored 100000 steps with 0 reset in 383 ms.
Product exploration explored 100000 steps with 0 reset in 492 ms.
Applying partial POR strategy [true, true, false, true, false, false, false]
Stuttering acceptance computed with spot in 234 ms :[true, (NOT p1), (AND (NOT p1) (NOT p0)), (NOT p0), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0)), (AND (NOT p1) (NOT p0))]
Support contains 3 out of 609 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 609/609 places, 1598/1598 transitions.
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 0 with 2 rules applied. Total rules applied 2 place count 609 transition count 1596
Applied a total of 2 rules in 156 ms. Remains 609 /609 variables (removed 0) and now considering 1596/1598 (removed 2) transitions.
[2024-05-24 05:48:43] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 05:48:43] [INFO ] Flow matrix only has 1067 transitions (discarded 529 similar events)
// Phase 1: matrix 1067 rows 609 cols
[2024-05-24 05:48:43] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:48:43] [INFO ] Dead Transitions using invariants and state equation in 501 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 609/609 places, 1596/1598 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 694 ms. Remains : 609/609 places, 1596/1598 transitions.
Built C files in :
/tmp/ltsmin17303547678048941051
[2024-05-24 05:48:43] [INFO ] Built C files in 19ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin17303547678048941051
Running compilation step : cd /tmp/ltsmin17303547678048941051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2823 ms.
Running link step : cd /tmp/ltsmin17303547678048941051;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 40 ms.
Running LTSmin : cd /tmp/ltsmin17303547678048941051;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9065429859223589175.hoa' '--buchi-type=spotba'
LTSmin run took 10120 ms.
FORMULA FunctionPointer-PT-c004-LTLFireability-14 FALSE TECHNIQUES EXPLICIT LTSMIN SAT_SMT
Treatment of property FunctionPointer-PT-c004-LTLFireability-14 finished in 57214 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(p0)))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G(F(((!p0&&X(!p1))||G(!p1)))))'
Found a Shortening insensitive property : FunctionPointer-PT-c004-LTLFireability-02
Stuttering acceptance computed with spot in 118 ms :[p1, p1, p1]
Support contains 3 out of 791 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2018
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2018
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 776 transition count 2010
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 53 place count 761 transition count 1978
Iterating global reduction 1 with 15 rules applied. Total rules applied 68 place count 761 transition count 1978
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 72 place count 761 transition count 1974
Discarding 12 places :
Symmetric choice reduction at 2 with 12 rule applications. Total rules 84 place count 749 transition count 1936
Iterating global reduction 2 with 12 rules applied. Total rules applied 96 place count 749 transition count 1936
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 110 place count 735 transition count 1890
Iterating global reduction 2 with 14 rules applied. Total rules applied 124 place count 735 transition count 1890
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 140 place count 719 transition count 1846
Iterating global reduction 2 with 16 rules applied. Total rules applied 156 place count 719 transition count 1846
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 172 place count 703 transition count 1808
Iterating global reduction 2 with 16 rules applied. Total rules applied 188 place count 703 transition count 1808
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 204 place count 687 transition count 1772
Iterating global reduction 2 with 16 rules applied. Total rules applied 220 place count 687 transition count 1772
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 236 place count 671 transition count 1736
Iterating global reduction 2 with 16 rules applied. Total rules applied 252 place count 671 transition count 1736
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 268 place count 655 transition count 1700
Iterating global reduction 2 with 16 rules applied. Total rules applied 284 place count 655 transition count 1700
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 294 place count 645 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 304 place count 645 transition count 1676
Discarding 7 places :
Symmetric choice reduction at 2 with 7 rule applications. Total rules 311 place count 638 transition count 1662
Iterating global reduction 2 with 7 rules applied. Total rules applied 318 place count 638 transition count 1662
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 322 place count 634 transition count 1654
Iterating global reduction 2 with 4 rules applied. Total rules applied 326 place count 634 transition count 1654
Discarding 4 places :
Symmetric choice reduction at 2 with 4 rule applications. Total rules 330 place count 630 transition count 1646
Iterating global reduction 2 with 4 rules applied. Total rules applied 334 place count 630 transition count 1646
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 336 place count 628 transition count 1642
Iterating global reduction 2 with 2 rules applied. Total rules applied 338 place count 628 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 340 place count 626 transition count 1638
Iterating global reduction 2 with 2 rules applied. Total rules applied 342 place count 626 transition count 1638
Applied a total of 342 rules in 312 ms. Remains 626 /791 variables (removed 165) and now considering 1638/2050 (removed 412) transitions.
[2024-05-24 05:48:57] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-24 05:48:57] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:48:57] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-24 05:48:57] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:48:57] [INFO ] Invariant cache hit.
[2024-05-24 05:48:58] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:48:59] [INFO ] Implicit Places using invariants and state equation in 1583 ms returned []
Implicit Place search using SMT with State Equation took 1936 ms to find 0 implicit places.
[2024-05-24 05:48:59] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:48:59] [INFO ] Invariant cache hit.
[2024-05-24 05:48:59] [INFO ] Dead Transitions using invariants and state equation in 513 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 626/791 places, 1638/2050 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2764 ms. Remains : 626/791 places, 1638/2050 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-02 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 p1), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p1)), acceptance={} source=1 dest: 1}, { cond=(AND p0 p1), acceptance={0} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p1)), acceptance={} source=1 dest: 2}, { cond=(AND (NOT p0) p1), acceptance={0} source=1 dest: 2}], [{ cond=(AND p0 p1), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) p1), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(AND (GEQ s0 1) (GEQ s550 1)), p1:(AND (GEQ s0 1) (GEQ s544 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, cl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 398 ms.
Product exploration explored 100000 steps with 0 reset in 555 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 87 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 126 ms :[p1, p1, p1]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 136 ms. (steps per millisecond=73 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 209150 steps, run timeout after 3001 ms. (steps per millisecond=69 ) properties seen :{}
Probabilistic random walk after 209150 steps, saw 135769 distinct states, run finished after 3001 ms. (steps per millisecond=69 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:49:04] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:49:04] [INFO ] Invariant cache hit.
[2024-05-24 05:49:04] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:49:04] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:04] [INFO ] After 466ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:04] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:49:04] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:05] [INFO ] After 854ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:05] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:06] [INFO ] After 768ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:06] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 1 ms to minimize.
[2024-05-24 05:49:06] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 229 ms
[2024-05-24 05:49:07] [INFO ] After 1326ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 268 ms.
[2024-05-24 05:49:07] [INFO ] After 2591ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1632
Applied a total of 6 rules in 147 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1638 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 148 ms. Remains : 626/626 places, 1632/1638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 96 ms. (steps per millisecond=104 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 218328 steps, run timeout after 3001 ms. (steps per millisecond=72 ) properties seen :{}
Probabilistic random walk after 218328 steps, saw 141726 distinct states, run finished after 3002 ms. (steps per millisecond=72 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:49:10] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
// Phase 1: matrix 1089 rows 626 cols
[2024-05-24 05:49:10] [INFO ] Computed 2 invariants in 6 ms
[2024-05-24 05:49:10] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:49:10] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:11] [INFO ] After 446ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:11] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:49:11] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:49:12] [INFO ] After 912ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:12] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:12] [INFO ] After 668ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:13] [INFO ] Deduced a trap composed of 131 places in 133 ms of which 0 ms to minimize.
[2024-05-24 05:49:13] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 204 ms
[2024-05-24 05:49:13] [INFO ] After 1314ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 236 ms.
[2024-05-24 05:49:13] [INFO ] After 2599ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 77 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 626/626 places, 1632/1632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 79 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
[2024-05-24 05:49:14] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:49:14] [INFO ] Invariant cache hit.
[2024-05-24 05:49:14] [INFO ] Implicit Places using invariants in 355 ms returned []
[2024-05-24 05:49:14] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:49:14] [INFO ] Invariant cache hit.
[2024-05-24 05:49:14] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:17] [INFO ] Implicit Places using invariants and state equation in 2742 ms returned []
Implicit Place search using SMT with State Equation took 3100 ms to find 0 implicit places.
[2024-05-24 05:49:17] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 05:49:17] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:49:17] [INFO ] Invariant cache hit.
[2024-05-24 05:49:17] [INFO ] Dead Transitions using invariants and state equation in 528 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 3744 ms. Remains : 626/626 places, 1632/1632 transitions.
Graph (trivial) has 964 edges and 626 vertex of which 192 / 626 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 498 transition count 884
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 27 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 179 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 242 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 305 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 431 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 687 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 751 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 815 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 879 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 942 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1005 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1068 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1131 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1131 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1133 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1135 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1139 place count 24 transition count 45
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1142 place count 24 transition count 42
Applied a total of 1142 rules in 29 ms. Remains 24 /626 variables (removed 602) and now considering 42/1632 (removed 1590) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 42 rows 24 cols
[2024-05-24 05:49:17] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:49:17] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:49:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:49:17] [INFO ] After 10ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-24 05:49:17] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:49:17] [INFO ] After 3ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:17] [INFO ] After 48ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:17] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:49:17] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:49:17] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:17] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:17] [INFO ] After 30ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 13 ms.
[2024-05-24 05:49:17] [INFO ] After 90ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 119 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 117 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 132 ms :[p1, p1, p1]
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Applied a total of 0 rules in 13 ms. Remains 626 /626 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2024-05-24 05:49:18] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-24 05:49:18] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 05:49:18] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-24 05:49:18] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:49:18] [INFO ] Invariant cache hit.
[2024-05-24 05:49:18] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:20] [INFO ] Implicit Places using invariants and state equation in 1711 ms returned []
Implicit Place search using SMT with State Equation took 2086 ms to find 0 implicit places.
[2024-05-24 05:49:20] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:49:20] [INFO ] Invariant cache hit.
[2024-05-24 05:49:20] [INFO ] Dead Transitions using invariants and state equation in 510 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2611 ms. Remains : 626/626 places, 1638/1638 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 105 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 110 ms :[p1, p1, p1]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 121 ms. (steps per millisecond=82 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 223222 steps, run timeout after 3001 ms. (steps per millisecond=74 ) properties seen :{}
Probabilistic random walk after 223222 steps, saw 144902 distinct states, run finished after 3002 ms. (steps per millisecond=74 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:49:24] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:49:24] [INFO ] Invariant cache hit.
[2024-05-24 05:49:24] [INFO ] [Real]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:49:24] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:24] [INFO ] After 483ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:24] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:49:24] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:25] [INFO ] After 893ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:25] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:26] [INFO ] After 832ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:26] [INFO ] Deduced a trap composed of 131 places in 163 ms of which 0 ms to minimize.
[2024-05-24 05:49:26] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 252 ms
[2024-05-24 05:49:27] [INFO ] After 1434ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 295 ms.
[2024-05-24 05:49:27] [INFO ] After 2773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 7 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 626 transition count 1632
Applied a total of 6 rules in 151 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1638 (removed 6) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 626/626 places, 1632/1638 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 110 ms. (steps per millisecond=90 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 19 ms. (steps per millisecond=526 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 4) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 18 ms. (steps per millisecond=555 ) properties (out of 4) seen :0
Interrupted probabilistic random walk after 237691 steps, run timeout after 3001 ms. (steps per millisecond=79 ) properties seen :{}
Probabilistic random walk after 237691 steps, saw 154292 distinct states, run finished after 3001 ms. (steps per millisecond=79 ) properties seen :0
Running SMT prover for 4 properties.
[2024-05-24 05:49:30] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
// Phase 1: matrix 1089 rows 626 cols
[2024-05-24 05:49:30] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:49:31] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:49:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:31] [INFO ] After 469ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:49:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:32] [INFO ] After 967ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:32] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:33] [INFO ] After 706ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:33] [INFO ] Deduced a trap composed of 131 places in 155 ms of which 1 ms to minimize.
[2024-05-24 05:49:33] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 231 ms
[2024-05-24 05:49:33] [INFO ] After 1401ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 249 ms.
[2024-05-24 05:49:34] [INFO ] After 2773ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 77 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 77 ms. Remains : 626/626 places, 1632/1632 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 626/626 places, 1632/1632 transitions.
Applied a total of 0 rules in 72 ms. Remains 626 /626 variables (removed 0) and now considering 1632/1632 (removed 0) transitions.
[2024-05-24 05:49:34] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:49:34] [INFO ] Invariant cache hit.
[2024-05-24 05:49:34] [INFO ] Implicit Places using invariants in 359 ms returned []
[2024-05-24 05:49:34] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:49:34] [INFO ] Invariant cache hit.
[2024-05-24 05:49:35] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:36] [INFO ] Implicit Places using invariants and state equation in 1632 ms returned []
Implicit Place search using SMT with State Equation took 1993 ms to find 0 implicit places.
[2024-05-24 05:49:36] [INFO ] Redundant transitions in 27 ms returned []
[2024-05-24 05:49:36] [INFO ] Flow matrix only has 1089 transitions (discarded 543 similar events)
[2024-05-24 05:49:36] [INFO ] Invariant cache hit.
[2024-05-24 05:49:36] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2642 ms. Remains : 626/626 places, 1632/1632 transitions.
Graph (trivial) has 964 edges and 626 vertex of which 192 / 626 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 415 transitions
Reduce isomorphic transitions removed 735 transitions.
Drop transitions removed 13 transitions
Trivial Post-agglo rules discarded 13 transitions
Performed 13 trivial Post agglomeration. Transition count delta: 13
Iterating post reduction 0 with 13 rules applied. Total rules applied 14 place count 498 transition count 884
Reduce places removed 13 places and 0 transitions.
Iterating post reduction 1 with 13 rules applied. Total rules applied 27 place count 485 transition count 884
Performed 76 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 76 Pre rules applied. Total rules applied 27 place count 485 transition count 808
Deduced a syphon composed of 76 places in 0 ms
Reduce places removed 76 places and 0 transitions.
Iterating global reduction 2 with 152 rules applied. Total rules applied 179 place count 409 transition count 808
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 242 place count 346 transition count 745
Iterating global reduction 2 with 63 rules applied. Total rules applied 305 place count 346 transition count 745
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 431 place count 346 transition count 619
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 687 place count 218 transition count 491
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 751 place count 154 transition count 363
Iterating global reduction 3 with 64 rules applied. Total rules applied 815 place count 154 transition count 363
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 816 place count 154 transition count 362
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 879 place count 91 transition count 236
Iterating global reduction 4 with 63 rules applied. Total rules applied 942 place count 91 transition count 236
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1005 place count 28 transition count 110
Iterating global reduction 4 with 63 rules applied. Total rules applied 1068 place count 28 transition count 110
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1131 place count 28 transition count 47
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1131 place count 28 transition count 46
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1133 place count 27 transition count 46
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1135 place count 26 transition count 45
Performed 2 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 2 places in 0 ms
Reduce places removed 2 places and 0 transitions.
Iterating global reduction 5 with 4 rules applied. Total rules applied 1139 place count 24 transition count 45
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1142 place count 24 transition count 42
Applied a total of 1142 rules in 32 ms. Remains 24 /626 variables (removed 602) and now considering 42/1632 (removed 1590) transitions.
Running SMT prover for 4 properties.
// Phase 1: matrix 42 rows 24 cols
[2024-05-24 05:49:36] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:49:36] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:49:36] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:49:37] [INFO ] After 11ms SMT Verify possible using state equation in real domain returned unsat :0 sat :1 real:3
[2024-05-24 05:49:37] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:49:37] [INFO ] After 2ms SMT Verify possible using 2 Read/Feed constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:37] [INFO ] After 43ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:4
[2024-05-24 05:49:37] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:49:37] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:49:37] [INFO ] After 19ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:37] [INFO ] After 12ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :4
[2024-05-24 05:49:37] [INFO ] After 27ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :4
Attempting to minimize the solution found.
Minimization took 12 ms.
[2024-05-24 05:49:37] [INFO ] After 91ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :4
Knowledge obtained : [(AND (NOT p0) (NOT p1)), (X (AND (NOT p0) (NOT p1))), (X (NOT (AND (NOT p0) p1))), (X (NOT (AND p0 (NOT p1)))), (X (NOT (AND p0 p1))), (X (X (AND (NOT p0) (NOT p1)))), (X (X (NOT (AND (NOT p0) p1)))), (X (X (NOT (AND p0 (NOT p1))))), (X (X (NOT (AND p0 p1))))]
False Knowledge obtained : []
Knowledge based reduction with 9 factoid took 107 ms. Reduced automaton from 3 states, 9 edges and 2 AP (stutter sensitive) to 3 states, 9 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 113 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 116 ms :[p1, p1, p1]
Stuttering acceptance computed with spot in 131 ms :[p1, p1, p1]
Product exploration explored 100000 steps with 0 reset in 386 ms.
Product exploration explored 100000 steps with 0 reset in 452 ms.
Built C files in :
/tmp/ltsmin6890001442929053601
[2024-05-24 05:49:38] [INFO ] Built C files in 25ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin6890001442929053601
Running compilation step : cd /tmp/ltsmin6890001442929053601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin6890001442929053601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin6890001442929053601;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 3 out of 626 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 626/626 places, 1638/1638 transitions.
Applied a total of 0 rules in 13 ms. Remains 626 /626 variables (removed 0) and now considering 1638/1638 (removed 0) transitions.
[2024-05-24 05:49:41] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
// Phase 1: matrix 1092 rows 626 cols
[2024-05-24 05:49:41] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 05:49:41] [INFO ] Implicit Places using invariants in 351 ms returned []
[2024-05-24 05:49:41] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:49:41] [INFO ] Invariant cache hit.
[2024-05-24 05:49:42] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:49:43] [INFO ] Implicit Places using invariants and state equation in 1660 ms returned []
Implicit Place search using SMT with State Equation took 2014 ms to find 0 implicit places.
[2024-05-24 05:49:43] [INFO ] Flow matrix only has 1092 transitions (discarded 546 similar events)
[2024-05-24 05:49:43] [INFO ] Invariant cache hit.
[2024-05-24 05:49:44] [INFO ] Dead Transitions using invariants and state equation in 534 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2563 ms. Remains : 626/626 places, 1638/1638 transitions.
Built C files in :
/tmp/ltsmin11064075511997234202
[2024-05-24 05:49:44] [INFO ] Built C files in 16ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin11064075511997234202
Running compilation step : cd /tmp/ltsmin11064075511997234202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2963 ms.
Running link step : cd /tmp/ltsmin11064075511997234202;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 45 ms.
Running LTSmin : cd /tmp/ltsmin11064075511997234202;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased1043595305248733604.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:49:59] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:49:59] [INFO ] Flatten gal took : 48 ms
[2024-05-24 05:49:59] [INFO ] Time to serialize gal into /tmp/LTL7137998683980003958.gal : 7 ms
[2024-05-24 05:49:59] [INFO ] Time to serialize properties into /tmp/LTL18111090873864446594.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7137998683980003958.gal' '-t' 'CGAL' '-hoa' '/tmp/aut4898447122438157507.hoa' '-atoms' '/tmp/LTL18111090873864446594.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...318
Loading property file /tmp/LTL18111090873864446594.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut4898447122438157507.hoa
Detected timeout of ITS tools.
[2024-05-24 05:50:14] [INFO ] Flatten gal took : 32 ms
[2024-05-24 05:50:14] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:50:14] [INFO ] Time to serialize gal into /tmp/LTL17433744788125708296.gal : 6 ms
[2024-05-24 05:50:14] [INFO ] Time to serialize properties into /tmp/LTL1698189619360506314.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.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17433744788125708296.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1698189619360506314.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((s0<1)||(l1657<1))"))||((X("((s0<1)||(l1657<1))"))&&("((s0<1)||(l1817<1))"))))))
Formula 0 simplified : G(F!"((s0<1)||(l1657<1))" & FG(!"((s0<1)||(l1817<1))" | X!"((s0<1)||(l1657<1))"))
Detected timeout of ITS tools.
[2024-05-24 05:50:29] [INFO ] Flatten gal took : 43 ms
[2024-05-24 05:50:29] [INFO ] Applying decomposition
[2024-05-24 05:50:29] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph9354318650878548698.txt' '-o' '/tmp/graph9354318650878548698.bin' '-w' '/tmp/graph9354318650878548698.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph9354318650878548698.bin' '-l' '-1' '-v' '-w' '/tmp/graph9354318650878548698.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:50:29] [INFO ] Decomposing Gal with order
[2024-05-24 05:50:29] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:50:29] [INFO ] Removed a total of 2724 redundant transitions.
[2024-05-24 05:50:29] [INFO ] Flatten gal took : 59 ms
[2024-05-24 05:50:29] [INFO ] Fuse similar labels procedure discarded/fused a total of 1156 labels/synchronizations in 36 ms.
[2024-05-24 05:50:29] [INFO ] Time to serialize gal into /tmp/LTL14226838865563590937.gal : 8 ms
[2024-05-24 05:50:29] [INFO ] Time to serialize properties into /tmp/LTL1830352617411239464.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL14226838865563590937.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1830352617411239464.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(F((G("((i0.u0.s0<1)||(i23.i2.u146.l1657<1))"))||((X("((i0.u0.s0<1)||(i23.i2.u146.l1657<1))"))&&("((i0.u0.s0<1)||(i23.i2.u150.l181...167
Formula 0 simplified : G(F!"((i0.u0.s0<1)||(i23.i2.u146.l1657<1))" & FG(!"((i0.u0.s0<1)||(i23.i2.u150.l1817<1))" | X!"((i0.u0.s0<1)||(i23.i2.u146.l1657<1))...158
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin1120502127361702593
[2024-05-24 05:50:44] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1120502127361702593
Running compilation step : cd /tmp/ltsmin1120502127361702593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2926 ms.
Running link step : cd /tmp/ltsmin1120502127361702593;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin1120502127361702593;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(([]((LTLAPp0==true))||(X((LTLAPp0==true))&&(LTLAPp1==true)))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-02 finished in 123074 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(F(G((X((p1||G(p2)))||F(p2)||p0))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLFireability-04
Stuttering acceptance computed with spot in 133 ms :[(AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 14 places :
Symmetric choice reduction at 0 with 14 rule applications. Total rules 14 place count 777 transition count 2020
Iterating global reduction 0 with 14 rules applied. Total rules applied 28 place count 777 transition count 2020
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 36 place count 777 transition count 2012
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 50 place count 763 transition count 1982
Iterating global reduction 1 with 14 rules applied. Total rules applied 64 place count 763 transition count 1982
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 68 place count 763 transition count 1978
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 79 place count 752 transition count 1944
Iterating global reduction 2 with 11 rules applied. Total rules applied 90 place count 752 transition count 1944
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 101 place count 741 transition count 1912
Iterating global reduction 2 with 11 rules applied. Total rules applied 112 place count 741 transition count 1912
Discarding 14 places :
Symmetric choice reduction at 2 with 14 rule applications. Total rules 126 place count 727 transition count 1876
Iterating global reduction 2 with 14 rules applied. Total rules applied 140 place count 727 transition count 1876
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 157 place count 710 transition count 1826
Iterating global reduction 2 with 17 rules applied. Total rules applied 174 place count 710 transition count 1826
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 190 place count 694 transition count 1784
Iterating global reduction 2 with 16 rules applied. Total rules applied 206 place count 694 transition count 1784
Discarding 16 places :
Symmetric choice reduction at 2 with 16 rule applications. Total rules 222 place count 678 transition count 1750
Iterating global reduction 2 with 16 rules applied. Total rules applied 238 place count 678 transition count 1750
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 253 place count 663 transition count 1718
Iterating global reduction 2 with 15 rules applied. Total rules applied 268 place count 663 transition count 1718
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 278 place count 653 transition count 1696
Iterating global reduction 2 with 10 rules applied. Total rules applied 288 place count 653 transition count 1696
Discarding 10 places :
Symmetric choice reduction at 2 with 10 rule applications. Total rules 298 place count 643 transition count 1676
Iterating global reduction 2 with 10 rules applied. Total rules applied 308 place count 643 transition count 1676
Discarding 6 places :
Symmetric choice reduction at 2 with 6 rule applications. Total rules 314 place count 637 transition count 1664
Iterating global reduction 2 with 6 rules applied. Total rules applied 320 place count 637 transition count 1664
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 322 place count 635 transition count 1660
Iterating global reduction 2 with 2 rules applied. Total rules applied 324 place count 635 transition count 1660
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 325 place count 634 transition count 1658
Iterating global reduction 2 with 1 rules applied. Total rules applied 326 place count 634 transition count 1658
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 327 place count 633 transition count 1656
Iterating global reduction 2 with 1 rules applied. Total rules applied 328 place count 633 transition count 1656
Applied a total of 328 rules in 305 ms. Remains 633 /791 variables (removed 158) and now considering 1656/2050 (removed 394) transitions.
[2024-05-24 05:51:00] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-24 05:51:00] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:51:00] [INFO ] Implicit Places using invariants in 391 ms returned []
[2024-05-24 05:51:00] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:51:00] [INFO ] Invariant cache hit.
[2024-05-24 05:51:01] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:02] [INFO ] Implicit Places using invariants and state equation in 1688 ms returned []
Implicit Place search using SMT with State Equation took 2088 ms to find 0 implicit places.
[2024-05-24 05:51:02] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:51:02] [INFO ] Invariant cache hit.
[2024-05-24 05:51:03] [INFO ] Dead Transitions using invariants and state equation in 527 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 633/791 places, 1656/2050 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2922 ms. Remains : 633/791 places, 1656/2050 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-04 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={} source=0 dest: 1}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={} source=0 dest: 2}], [{ cond=(AND p0 (NOT p2)), acceptance={} source=1 dest: 1}, { cond=(AND (NOT p0) (NOT p2)), acceptance={} source=1 dest: 2}], [{ cond=(AND p0 (NOT p2) p1), acceptance={} source=2 dest: 1}, { cond=(AND p0 (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 1}, { cond=(AND (NOT p0) (NOT p2) p1), acceptance={} source=2 dest: 2}, { cond=(AND (NOT p0) (NOT p2) (NOT p1)), acceptance={0} source=2 dest: 2}]], initial=0, aps=[p0:(OR (LT s0 1) (LT s562 1)), p2:(AND (GEQ s0 1) (GEQ s549 1)), p1:(AND (GEQ s0 1) (GEQ s559 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 421 ms.
Product exploration explored 100000 steps with 0 reset in 484 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 152 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 106 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 174 ms. (steps per millisecond=57 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 21 ms. (steps per millisecond=476 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 203441 steps, run timeout after 3001 ms. (steps per millisecond=67 ) properties seen :{}
Probabilistic random walk after 203441 steps, saw 132064 distinct states, run finished after 3001 ms. (steps per millisecond=67 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:51:07] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:51:07] [INFO ] Invariant cache hit.
[2024-05-24 05:51:07] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:51:07] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:51:08] [INFO ] After 605ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:51:08] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:51:08] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:51:10] [INFO ] After 1486ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:10] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:11] [INFO ] After 1416ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:11] [INFO ] Deduced a trap composed of 131 places in 158 ms of which 0 ms to minimize.
[2024-05-24 05:51:11] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 285 ms
[2024-05-24 05:51:12] [INFO ] After 2785ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1105 ms.
[2024-05-24 05:51:13] [INFO ] After 5569ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 63 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 158 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 159 ms. (steps per millisecond=62 ) properties (out of 6) 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 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 62 ms. (steps per millisecond=161 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 46 ms. (steps per millisecond=217 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 40 ms. (steps per millisecond=250 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 192325 steps, run timeout after 3001 ms. (steps per millisecond=64 ) properties seen :{}
Probabilistic random walk after 192325 steps, saw 124850 distinct states, run finished after 3001 ms. (steps per millisecond=64 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:51:17] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2024-05-24 05:51:17] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 05:51:17] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:51:17] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:51:18] [INFO ] After 603ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:51:18] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:51:18] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:51:19] [INFO ] After 1398ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:19] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:20] [INFO ] After 1194ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:21] [INFO ] Deduced a trap composed of 131 places in 184 ms of which 0 ms to minimize.
[2024-05-24 05:51:21] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 290 ms
[2024-05-24 05:51:22] [INFO ] After 2569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 775 ms.
[2024-05-24 05:51:23] [INFO ] After 4916ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 17 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 79 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 81 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 80 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2024-05-24 05:51:23] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:51:23] [INFO ] Invariant cache hit.
[2024-05-24 05:51:23] [INFO ] Implicit Places using invariants in 375 ms returned []
[2024-05-24 05:51:23] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:51:23] [INFO ] Invariant cache hit.
[2024-05-24 05:51:23] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:25] [INFO ] Implicit Places using invariants and state equation in 1822 ms returned []
Implicit Place search using SMT with State Equation took 2199 ms to find 0 implicit places.
[2024-05-24 05:51:25] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-24 05:51:25] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:51:25] [INFO ] Invariant cache hit.
[2024-05-24 05:51:26] [INFO ] Dead Transitions using invariants and state equation in 546 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2868 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 are part of one of the 64 SCC in 1 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 739 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 31 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 31 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2024-05-24 05:51:26] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:51:26] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:51:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:51:26] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:51:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:51:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:51:26] [INFO ] After 27ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:26] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:51:26] [INFO ] After 22ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:26] [INFO ] After 49ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 21 ms.
[2024-05-24 05:51:26] [INFO ] After 128ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p2) (NOT p1)), (X (AND p0 (NOT p2) (NOT p1))), (X (NOT (AND p0 (NOT p2) p1))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) (NOT p2) p1))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))), (X (X (AND p0 (NOT p2) (NOT p1)))), (X (X (NOT (AND p0 (NOT p2) p1)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) (NOT p2) p1)))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 145 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 114 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 122 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 22 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2024-05-24 05:51:26] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-24 05:51:26] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 05:51:27] [INFO ] Implicit Places using invariants in 381 ms returned []
[2024-05-24 05:51:27] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:51:27] [INFO ] Invariant cache hit.
[2024-05-24 05:51:27] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:28] [INFO ] Implicit Places using invariants and state equation in 1647 ms returned []
Implicit Place search using SMT with State Equation took 2032 ms to find 0 implicit places.
[2024-05-24 05:51:28] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:51:28] [INFO ] Invariant cache hit.
[2024-05-24 05:51:29] [INFO ] Dead Transitions using invariants and state equation in 526 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2581 ms. Remains : 633/633 places, 1656/1656 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 137 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 153 ms. (steps per millisecond=65 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 24 ms. (steps per millisecond=416 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 25 ms. (steps per millisecond=400 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 23 ms. (steps per millisecond=434 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 185749 steps, run timeout after 3001 ms. (steps per millisecond=61 ) properties seen :{}
Probabilistic random walk after 185749 steps, saw 120580 distinct states, run finished after 3001 ms. (steps per millisecond=61 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:51:32] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:51:32] [INFO ] Invariant cache hit.
[2024-05-24 05:51:32] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:51:32] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:51:33] [INFO ] After 596ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:51:33] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:51:33] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:51:34] [INFO ] After 1360ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:35] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:36] [INFO ] After 1289ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:36] [INFO ] Deduced a trap composed of 131 places in 152 ms of which 0 ms to minimize.
[2024-05-24 05:51:36] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 262 ms
[2024-05-24 05:51:37] [INFO ] After 2596ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 1070 ms.
[2024-05-24 05:51:38] [INFO ] After 5220ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Fused 6 Parikh solutions to 5 different solutions.
Parikh walk visited 0 properties in 39 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Drop transitions removed 8 transitions
Redundant transition composition rules discarded 8 transitions
Iterating global reduction 0 with 8 rules applied. Total rules applied 8 place count 633 transition count 1648
Applied a total of 8 rules in 158 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1656 (removed 8) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 158 ms. Remains : 633/633 places, 1648/1656 transitions.
Incomplete random walk after 10002 steps, including 2 resets, run finished after 66 ms. (steps per millisecond=151 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 15 ms. (steps per millisecond=666 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) 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 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 6) seen :0
Interrupted probabilistic random walk after 214726 steps, run timeout after 3001 ms. (steps per millisecond=71 ) properties seen :{}
Probabilistic random walk after 214726 steps, saw 139388 distinct states, run finished after 3004 ms. (steps per millisecond=71 ) properties seen :0
Running SMT prover for 6 properties.
[2024-05-24 05:51:42] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
// Phase 1: matrix 1101 rows 633 cols
[2024-05-24 05:51:42] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 05:51:42] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:51:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:51:42] [INFO ] After 555ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:51:42] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:51:42] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:51:44] [INFO ] After 1339ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:44] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:45] [INFO ] After 1143ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:45] [INFO ] Deduced a trap composed of 131 places in 157 ms of which 1 ms to minimize.
[2024-05-24 05:51:45] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 257 ms
[2024-05-24 05:51:46] [INFO ] After 2441ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 734 ms.
[2024-05-24 05:51:47] [INFO ] After 4705ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Parikh walk visited 0 properties in 27 ms.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 79 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 79 ms. Remains : 633/633 places, 1648/1648 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 633/633 places, 1648/1648 transitions.
Applied a total of 0 rules in 75 ms. Remains 633 /633 variables (removed 0) and now considering 1648/1648 (removed 0) transitions.
[2024-05-24 05:51:47] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:51:47] [INFO ] Invariant cache hit.
[2024-05-24 05:51:47] [INFO ] Implicit Places using invariants in 365 ms returned []
[2024-05-24 05:51:47] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:51:47] [INFO ] Invariant cache hit.
[2024-05-24 05:51:48] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:51:49] [INFO ] Implicit Places using invariants and state equation in 1809 ms returned []
Implicit Place search using SMT with State Equation took 2176 ms to find 0 implicit places.
[2024-05-24 05:51:49] [INFO ] Redundant transitions in 32 ms returned []
[2024-05-24 05:51:49] [INFO ] Flow matrix only has 1101 transitions (discarded 547 similar events)
[2024-05-24 05:51:49] [INFO ] Invariant cache hit.
[2024-05-24 05:51:50] [INFO ] Dead Transitions using invariants and state equation in 547 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2843 ms. Remains : 633/633 places, 1648/1648 transitions.
Graph (trivial) has 972 edges and 633 vertex of which 192 / 633 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 419 transitions
Reduce isomorphic transitions removed 739 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 505 transition count 899
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 495 transition count 899
Performed 80 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 80 Pre rules applied. Total rules applied 21 place count 495 transition count 819
Deduced a syphon composed of 80 places in 0 ms
Reduce places removed 80 places and 0 transitions.
Iterating global reduction 2 with 160 rules applied. Total rules applied 181 place count 415 transition count 819
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 244 place count 352 transition count 756
Iterating global reduction 2 with 63 rules applied. Total rules applied 307 place count 352 transition count 756
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 433 place count 352 transition count 630
Performed 129 Post agglomeration using F-continuation condition.Transition count delta: 129
Deduced a syphon composed of 129 places in 0 ms
Reduce places removed 129 places and 0 transitions.
Iterating global reduction 3 with 258 rules applied. Total rules applied 691 place count 223 transition count 501
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 755 place count 159 transition count 373
Iterating global reduction 3 with 64 rules applied. Total rules applied 819 place count 159 transition count 373
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 820 place count 159 transition count 372
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 883 place count 96 transition count 246
Iterating global reduction 4 with 63 rules applied. Total rules applied 946 place count 96 transition count 246
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 1009 place count 33 transition count 120
Iterating global reduction 4 with 63 rules applied. Total rules applied 1072 place count 33 transition count 120
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1135 place count 33 transition count 57
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1135 place count 33 transition count 56
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1137 place count 32 transition count 56
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1139 place count 31 transition count 55
Performed 3 Post agglomeration using F-continuation condition.Transition count delta: 0
Deduced a syphon composed of 3 places in 0 ms
Reduce places removed 3 places and 0 transitions.
Iterating global reduction 5 with 6 rules applied. Total rules applied 1145 place count 28 transition count 55
Drop transitions removed 3 transitions
Redundant transition composition rules discarded 3 transitions
Iterating global reduction 5 with 3 rules applied. Total rules applied 1148 place count 28 transition count 52
Applied a total of 1148 rules in 34 ms. Remains 28 /633 variables (removed 605) and now considering 52/1648 (removed 1596) transitions.
Running SMT prover for 6 properties.
// Phase 1: matrix 52 rows 28 cols
[2024-05-24 05:51:50] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 05:51:50] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:51:50] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:51:50] [INFO ] After 46ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:6
[2024-05-24 05:51:50] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:51:50] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:51:50] [INFO ] After 31ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:50] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:51:50] [INFO ] After 23ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :6
[2024-05-24 05:51:50] [INFO ] After 52ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :6
Attempting to minimize the solution found.
Minimization took 23 ms.
[2024-05-24 05:51:50] [INFO ] After 154ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :6
Knowledge obtained : [(AND p0 (NOT p1) (NOT p2)), (X (AND p0 (NOT p1) (NOT p2))), (X (AND p0 (NOT p2))), (X (NOT (AND (NOT p0) p1 (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p1) (NOT p2)))), (X (NOT (AND (NOT p0) (NOT p2)))), (X (NOT (AND p0 p1 (NOT p2)))), (X (X (AND p0 (NOT p1) (NOT p2)))), (X (X (AND p0 (NOT p2)))), (X (X (NOT (AND (NOT p0) p1 (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p1) (NOT p2))))), (X (X (NOT (AND (NOT p0) (NOT p2))))), (X (X (NOT (AND p0 p1 (NOT p2)))))]
False Knowledge obtained : []
Knowledge based reduction with 13 factoid took 165 ms. Reduced automaton from 3 states, 9 edges and 3 AP (stutter sensitive) to 3 states, 9 edges and 3 AP (stutter sensitive).
Stuttering acceptance computed with spot in 134 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 117 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Stuttering acceptance computed with spot in 127 ms :[(AND (NOT p0) (NOT p1) (NOT p2)), (AND (NOT p0) (NOT p2) (NOT p1)), (AND (NOT p0) (NOT p2) (NOT p1))]
Product exploration explored 100000 steps with 0 reset in 439 ms.
Product exploration explored 100000 steps with 0 reset in 507 ms.
Built C files in :
/tmp/ltsmin12332727513183842403
[2024-05-24 05:51:52] [INFO ] Built C files in 15ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12332727513183842403
Running compilation step : cd /tmp/ltsmin12332727513183842403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2997 ms.
Running link step : cd /tmp/ltsmin12332727513183842403;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 39 ms.
Running LTSmin : cd /tmp/ltsmin12332727513183842403;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15665781108344604358.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 633 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 633/633 places, 1656/1656 transitions.
Applied a total of 0 rules in 18 ms. Remains 633 /633 variables (removed 0) and now considering 1656/1656 (removed 0) transitions.
[2024-05-24 05:52:07] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
// Phase 1: matrix 1105 rows 633 cols
[2024-05-24 05:52:07] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:52:07] [INFO ] Implicit Places using invariants in 379 ms returned []
[2024-05-24 05:52:07] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:52:07] [INFO ] Invariant cache hit.
[2024-05-24 05:52:07] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:52:09] [INFO ] Implicit Places using invariants and state equation in 1511 ms returned []
Implicit Place search using SMT with State Equation took 1892 ms to find 0 implicit places.
[2024-05-24 05:52:09] [INFO ] Flow matrix only has 1105 transitions (discarded 551 similar events)
[2024-05-24 05:52:09] [INFO ] Invariant cache hit.
[2024-05-24 05:52:09] [INFO ] Dead Transitions using invariants and state equation in 519 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2433 ms. Remains : 633/633 places, 1656/1656 transitions.
Built C files in :
/tmp/ltsmin1320091289056979776
[2024-05-24 05:52:09] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin1320091289056979776
Running compilation step : cd /tmp/ltsmin1320091289056979776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2986 ms.
Running link step : cd /tmp/ltsmin1320091289056979776;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 43 ms.
Running LTSmin : cd /tmp/ltsmin1320091289056979776;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased12657055429969973468.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:52:24] [INFO ] Flatten gal took : 37 ms
[2024-05-24 05:52:24] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:52:24] [INFO ] Time to serialize gal into /tmp/LTL17013353464874573692.gal : 6 ms
[2024-05-24 05:52:24] [INFO ] Time to serialize properties into /tmp/LTL2739243720766107008.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL17013353464874573692.gal' '-t' 'CGAL' '-hoa' '/tmp/aut13467850689830575253.hoa' '-atoms' '/tmp/LTL2739243720766107008.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2739243720766107008.prop.
Loaded 3 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut13467850689830575253.hoa
Detected timeout of ITS tools.
[2024-05-24 05:52:40] [INFO ] Flatten gal took : 31 ms
[2024-05-24 05:52:40] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:52:40] [INFO ] Time to serialize gal into /tmp/LTL8915510869552692502.gal : 6 ms
[2024-05-24 05:52:40] [INFO ] Time to serialize properties into /tmp/LTL17280144387266002540.ltl : 3 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL8915510869552692502.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL17280144387266002540.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((F(G(("((s0<1)||(l2144<1))")||((X(("((s0>=1)&&(l2076>=1))")||(G("((s0>=1)&&(l1636>=1))"))))||(F("((s0>=1)&&(l1636>=1))")))))))
Formula 0 simplified : G(F(!"((s0<1)||(l2144<1))" & X(!"((s0>=1)&&(l2076>=1))" & F!"((s0>=1)&&(l1636>=1))")) & FG!"((s0>=1)&&(l1636>=1))")
Detected timeout of ITS tools.
[2024-05-24 05:52:55] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:52:55] [INFO ] Applying decomposition
[2024-05-24 05:52:55] [INFO ] Flatten gal took : 35 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7618750709408747418.txt' '-o' '/tmp/graph7618750709408747418.bin' '-w' '/tmp/graph7618750709408747418.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7618750709408747418.bin' '-l' '-1' '-v' '-w' '/tmp/graph7618750709408747418.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:52:55] [INFO ] Decomposing Gal with order
[2024-05-24 05:52:55] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:52:55] [INFO ] Removed a total of 2762 redundant transitions.
[2024-05-24 05:52:55] [INFO ] Flatten gal took : 97 ms
[2024-05-24 05:52:55] [INFO ] Fuse similar labels procedure discarded/fused a total of 1229 labels/synchronizations in 37 ms.
[2024-05-24 05:52:55] [INFO ] Time to serialize gal into /tmp/LTL13713743952725434169.gal : 8 ms
[2024-05-24 05:52:55] [INFO ] Time to serialize properties into /tmp/LTL10866072802285796908.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13713743952725434169.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL10866072802285796908.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...256
Read 1 LTL properties
Checking formula 0 : !((F(G(("((i0.u0.s0<1)||(i26.i2.u160.l2144<1))")||((X(("((i0.u0.s0>=1)&&(i26.i2.u159.l2076>=1))")||(G("((i0.u0.s0>=1)&&(i26.i1.u155.l1...221
Formula 0 simplified : G(F(!"((i0.u0.s0<1)||(i26.i2.u160.l2144<1))" & X(!"((i0.u0.s0>=1)&&(i26.i2.u159.l2076>=1))" & F!"((i0.u0.s0>=1)&&(i26.i1.u155.l1636>...210
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin9016296114832699688
[2024-05-24 05:53:10] [INFO ] Built C files in 13ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin9016296114832699688
Running compilation step : cd /tmp/ltsmin9016296114832699688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
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/ltsmin9016296114832699688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' killed by timeout after 3 SECONDS
java.lang.RuntimeException: Compilation or link of executable timed out.java.util.concurrent.TimeoutException: Subprocess running cd /tmp/ltsmin9016296114832699688;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c' 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 FunctionPointer-PT-c004-LTLFireability-04 finished in 133496 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!((G((G(p1)||p0))||F(G((p2&&(p2 U (!p3||G(p2))))))))'
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((F(p0)||X(X(G(p1))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLFireability-08
Stuttering acceptance computed with spot in 172 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 791 places. Attempting structural reductions.
Starting structural reductions in LI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 16 places :
Symmetric choice reduction at 0 with 16 rule applications. Total rules 16 place count 775 transition count 2016
Iterating global reduction 0 with 16 rules applied. Total rules applied 32 place count 775 transition count 2016
Ensure Unique test removed 10 transitions
Reduce isomorphic transitions removed 10 transitions.
Iterating post reduction 0 with 10 rules applied. Total rules applied 42 place count 775 transition count 2006
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 58 place count 759 transition count 1974
Iterating global reduction 1 with 16 rules applied. Total rules applied 74 place count 759 transition count 1974
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 78 place count 759 transition count 1970
Discarding 13 places :
Symmetric choice reduction at 2 with 13 rule applications. Total rules 91 place count 746 transition count 1930
Iterating global reduction 2 with 13 rules applied. Total rules applied 104 place count 746 transition count 1930
Discarding 15 places :
Symmetric choice reduction at 2 with 15 rule applications. Total rules 119 place count 731 transition count 1880
Iterating global reduction 2 with 15 rules applied. Total rules applied 134 place count 731 transition count 1880
Discarding 17 places :
Symmetric choice reduction at 2 with 17 rule applications. Total rules 151 place count 714 transition count 1834
Iterating global reduction 2 with 17 rules applied. Total rules applied 168 place count 714 transition count 1834
Discarding 19 places :
Symmetric choice reduction at 2 with 19 rule applications. Total rules 187 place count 695 transition count 1784
Iterating global reduction 2 with 19 rules applied. Total rules applied 206 place count 695 transition count 1784
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 224 place count 677 transition count 1740
Iterating global reduction 2 with 18 rules applied. Total rules applied 242 place count 677 transition count 1740
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 260 place count 659 transition count 1702
Iterating global reduction 2 with 18 rules applied. Total rules applied 278 place count 659 transition count 1702
Discarding 18 places :
Symmetric choice reduction at 2 with 18 rule applications. Total rules 296 place count 641 transition count 1664
Iterating global reduction 2 with 18 rules applied. Total rules applied 314 place count 641 transition count 1664
Discarding 11 places :
Symmetric choice reduction at 2 with 11 rule applications. Total rules 325 place count 630 transition count 1640
Iterating global reduction 2 with 11 rules applied. Total rules applied 336 place count 630 transition count 1640
Discarding 8 places :
Symmetric choice reduction at 2 with 8 rule applications. Total rules 344 place count 622 transition count 1624
Iterating global reduction 2 with 8 rules applied. Total rules applied 352 place count 622 transition count 1624
Discarding 5 places :
Symmetric choice reduction at 2 with 5 rule applications. Total rules 357 place count 617 transition count 1614
Iterating global reduction 2 with 5 rules applied. Total rules applied 362 place count 617 transition count 1614
Discarding 2 places :
Symmetric choice reduction at 2 with 2 rule applications. Total rules 364 place count 615 transition count 1610
Iterating global reduction 2 with 2 rules applied. Total rules applied 366 place count 615 transition count 1610
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 367 place count 614 transition count 1608
Iterating global reduction 2 with 1 rules applied. Total rules applied 368 place count 614 transition count 1608
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 369 place count 613 transition count 1606
Iterating global reduction 2 with 1 rules applied. Total rules applied 370 place count 613 transition count 1606
Applied a total of 370 rules in 301 ms. Remains 613 /791 variables (removed 178) and now considering 1606/2050 (removed 444) transitions.
[2024-05-24 05:53:14] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 05:53:14] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:53:14] [INFO ] Implicit Places using invariants in 314 ms returned []
[2024-05-24 05:53:14] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:53:14] [INFO ] Invariant cache hit.
[2024-05-24 05:53:14] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:16] [INFO ] Implicit Places using invariants and state equation in 1567 ms returned []
Implicit Place search using SMT with State Equation took 1882 ms to find 0 implicit places.
[2024-05-24 05:53:16] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:53:16] [INFO ] Invariant cache hit.
[2024-05-24 05:53:16] [INFO ] Dead Transitions using invariants and state equation in 494 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 613/791 places, 1606/2050 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2683 ms. Remains : 613/791 places, 1606/2050 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-08 automaton TGBA Formula[mat=[[{ cond=true, acceptance={} source=0 dest: 0}, { cond=(NOT p0), acceptance={} source=0 dest: 1}], [{ cond=(NOT p0), acceptance={} source=1 dest: 2}], [{ cond=(AND (NOT p0) (NOT p1)), acceptance={} source=2 dest: 3}], [{ cond=(NOT p0), acceptance={0} source=3 dest: 3}]], initial=0, aps=[p0:(OR (LT s1 1) (LT s240 1)), p1:(AND (GEQ s0 1) (GEQ s533 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, no-univ-branch, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null, null][false, false, false, false]]
Product exploration explored 100000 steps with 0 reset in 362 ms.
Product exploration explored 100000 steps with 0 reset in 417 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 102 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10001 steps, including 2 resets, run finished after 74 ms. (steps per millisecond=135 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 304402 steps, run timeout after 3001 ms. (steps per millisecond=101 ) properties seen :{}
Probabilistic random walk after 304402 steps, saw 197587 distinct states, run finished after 3003 ms. (steps per millisecond=101 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:53:20] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:53:20] [INFO ] Invariant cache hit.
[2024-05-24 05:53:20] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:53:20] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:53:21] [INFO ] After 585ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:53:21] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:53:21] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:53:21] [INFO ] After 538ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:21] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:22] [INFO ] After 323ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:22] [INFO ] After 574ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 228 ms.
[2024-05-24 05:53:22] [INFO ] After 1454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 146 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 147 ms. Remains : 613/613 places, 1602/1606 transitions.
Incomplete random walk after 10001 steps, including 2 resets, run finished after 86 ms. (steps per millisecond=116 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 29 ms. (steps per millisecond=344 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 301138 steps, run timeout after 3001 ms. (steps per millisecond=100 ) properties seen :{}
Probabilistic random walk after 301138 steps, saw 195470 distinct states, run finished after 3001 ms. (steps per millisecond=100 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:53:26] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-24 05:53:26] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:53:26] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:53:26] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:53:26] [INFO ] After 661ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:53:26] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:53:26] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:53:27] [INFO ] After 509ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:27] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:27] [INFO ] After 527ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:28] [INFO ] After 900ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 258 ms.
[2024-05-24 05:53:28] [INFO ] After 1781ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 73 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 75 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 69 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2024-05-24 05:53:28] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:53:28] [INFO ] Invariant cache hit.
[2024-05-24 05:53:29] [INFO ] Implicit Places using invariants in 310 ms returned []
[2024-05-24 05:53:29] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:53:29] [INFO ] Invariant cache hit.
[2024-05-24 05:53:29] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:30] [INFO ] Implicit Places using invariants and state equation in 1450 ms returned []
Implicit Place search using SMT with State Equation took 1762 ms to find 0 implicit places.
[2024-05-24 05:53:30] [INFO ] Redundant transitions in 25 ms returned []
[2024-05-24 05:53:30] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:53:30] [INFO ] Invariant cache hit.
[2024-05-24 05:53:31] [INFO ] Dead Transitions using invariants and state equation in 532 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2398 ms. Remains : 613/613 places, 1602/1602 transitions.
Graph (trivial) has 938 edges and 613 vertex of which 189 / 613 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 721 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 487 transition count 871
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 477 transition count 871
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 477 transition count 798
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 404 transition count 798
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 229 place count 342 transition count 736
Iterating global reduction 2 with 62 rules applied. Total rules applied 291 place count 342 transition count 736
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 415 place count 342 transition count 612
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 669 place count 215 transition count 485
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 733 place count 151 transition count 357
Iterating global reduction 3 with 64 rules applied. Total rules applied 797 place count 151 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 861 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 924 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 987 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1050 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1113 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1113 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1117 place count 23 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1118 place count 23 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1119 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1120 place count 22 transition count 37
Applied a total of 1120 rules in 31 ms. Remains 22 /613 variables (removed 591) and now considering 37/1602 (removed 1565) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-24 05:53:31] [INFO ] Computed 2 invariants in 0 ms
[2024-05-24 05:53:31] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:53:31] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:53:31] [INFO ] After 44ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:53:31] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:53:31] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:53:31] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:31] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:53:31] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:31] [INFO ] After 11ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 05:53:31] [INFO ] After 62ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 83 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 153 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 151 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 17 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-24 05:53:31] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 05:53:31] [INFO ] Computed 2 invariants in 12 ms
[2024-05-24 05:53:31] [INFO ] Implicit Places using invariants in 294 ms returned []
[2024-05-24 05:53:31] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:53:31] [INFO ] Invariant cache hit.
[2024-05-24 05:53:32] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:33] [INFO ] Implicit Places using invariants and state equation in 1576 ms returned []
Implicit Place search using SMT with State Equation took 1872 ms to find 0 implicit places.
[2024-05-24 05:53:33] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:53:33] [INFO ] Invariant cache hit.
[2024-05-24 05:53:33] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2413 ms. Remains : 613/613 places, 1606/1606 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 79 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 164 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 90 ms. (steps per millisecond=111 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 22 ms. (steps per millisecond=454 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 268289 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268289 steps, saw 174151 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:53:37] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:53:37] [INFO ] Invariant cache hit.
[2024-05-24 05:53:37] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:53:37] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:53:37] [INFO ] After 545ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:53:38] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:53:38] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:53:38] [INFO ] After 539ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:38] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:38] [INFO ] After 314ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:39] [INFO ] After 569ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 224 ms.
[2024-05-24 05:53:39] [INFO ] After 1454ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 150 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 152 ms. Remains : 613/613 places, 1602/1606 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 84 ms. (steps per millisecond=119 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 20 ms. (steps per millisecond=500 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 274986 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 274986 steps, saw 178497 distinct states, run finished after 3001 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:53:42] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-24 05:53:42] [INFO ] Computed 2 invariants in 16 ms
[2024-05-24 05:53:42] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:53:42] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:53:43] [INFO ] After 606ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:53:43] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:53:43] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:53:43] [INFO ] After 506ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:43] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:44] [INFO ] After 513ms SMT Verify possible using 265 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:44] [INFO ] After 884ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 260 ms.
[2024-05-24 05:53:45] [INFO ] After 1766ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 70 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 70 ms. Remains : 613/613 places, 1602/1602 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 613/613 places, 1602/1602 transitions.
Applied a total of 0 rules in 69 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1602 (removed 0) transitions.
[2024-05-24 05:53:45] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:53:45] [INFO ] Invariant cache hit.
[2024-05-24 05:53:45] [INFO ] Implicit Places using invariants in 305 ms returned []
[2024-05-24 05:53:45] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:53:45] [INFO ] Invariant cache hit.
[2024-05-24 05:53:45] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:53:46] [INFO ] Implicit Places using invariants and state equation in 1322 ms returned []
Implicit Place search using SMT with State Equation took 1628 ms to find 0 implicit places.
[2024-05-24 05:53:46] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 05:53:46] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
[2024-05-24 05:53:46] [INFO ] Invariant cache hit.
[2024-05-24 05:53:47] [INFO ] Dead Transitions using invariants and state equation in 516 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2251 ms. Remains : 613/613 places, 1602/1602 transitions.
Graph (trivial) has 938 edges and 613 vertex of which 189 / 613 are part of one of the 63 SCC in 0 ms
Free SCC test removed 126 places
Drop transitions removed 315 transitions
Ensure Unique test removed 406 transitions
Reduce isomorphic transitions removed 721 transitions.
Drop transitions removed 10 transitions
Trivial Post-agglo rules discarded 10 transitions
Performed 10 trivial Post agglomeration. Transition count delta: 10
Iterating post reduction 0 with 10 rules applied. Total rules applied 11 place count 487 transition count 871
Reduce places removed 10 places and 0 transitions.
Iterating post reduction 1 with 10 rules applied. Total rules applied 21 place count 477 transition count 871
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 21 place count 477 transition count 798
Deduced a syphon composed of 73 places in 1 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 167 place count 404 transition count 798
Discarding 62 places :
Symmetric choice reduction at 2 with 62 rule applications. Total rules 229 place count 342 transition count 736
Iterating global reduction 2 with 62 rules applied. Total rules applied 291 place count 342 transition count 736
Ensure Unique test removed 124 transitions
Reduce isomorphic transitions removed 124 transitions.
Iterating post reduction 2 with 124 rules applied. Total rules applied 415 place count 342 transition count 612
Performed 127 Post agglomeration using F-continuation condition.Transition count delta: 127
Deduced a syphon composed of 127 places in 0 ms
Reduce places removed 127 places and 0 transitions.
Iterating global reduction 3 with 254 rules applied. Total rules applied 669 place count 215 transition count 485
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 733 place count 151 transition count 357
Iterating global reduction 3 with 64 rules applied. Total rules applied 797 place count 151 transition count 357
Ensure Unique test removed 1 transitions
Reduce isomorphic transitions removed 1 transitions.
Iterating post reduction 3 with 1 rules applied. Total rules applied 798 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 861 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 924 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 987 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1050 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1113 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1113 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1115 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1117 place count 23 transition count 39
Drop transitions removed 1 transitions
Redundant transition composition rules discarded 1 transitions
Iterating global reduction 5 with 1 rules applied. Total rules applied 1118 place count 23 transition count 38
Free-agglomeration rule applied 1 times.
Iterating global reduction 5 with 1 rules applied. Total rules applied 1119 place count 23 transition count 37
Reduce places removed 1 places and 0 transitions.
Iterating post reduction 5 with 1 rules applied. Total rules applied 1120 place count 22 transition count 37
Applied a total of 1120 rules in 34 ms. Remains 22 /613 variables (removed 591) and now considering 37/1602 (removed 1565) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 37 rows 22 cols
[2024-05-24 05:53:47] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:53:47] [INFO ] [Real]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:53:47] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:53:47] [INFO ] After 40ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:53:47] [INFO ] [Nat]Absence check using 1 positive place invariants in 1 ms returned sat
[2024-05-24 05:53:47] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:53:47] [INFO ] After 16ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:47] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:53:47] [INFO ] After 7ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:53:47] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 8 ms.
[2024-05-24 05:53:47] [INFO ] After 71ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X p0), (X (X (NOT (AND (NOT p0) (NOT p1)))))]
False Knowledge obtained : []
Knowledge based reduction with 3 factoid took 84 ms. Reduced automaton from 4 states, 5 edges and 2 AP (stutter sensitive) to 4 states, 5 edges and 2 AP (stutter sensitive).
Stuttering acceptance computed with spot in 163 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 168 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Stuttering acceptance computed with spot in 140 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Product exploration explored 100000 steps with 0 reset in 380 ms.
Product exploration explored 100000 steps with 0 reset in 430 ms.
Applying partial POR strategy [false, false, true, true]
Stuttering acceptance computed with spot in 173 ms :[(AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (AND (NOT p0) (NOT p1)), (NOT p0)]
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Drop transitions removed 4 transitions
Redundant transition composition rules discarded 4 transitions
Iterating global reduction 0 with 4 rules applied. Total rules applied 4 place count 613 transition count 1602
Applied a total of 4 rules in 159 ms. Remains 613 /613 variables (removed 0) and now considering 1602/1606 (removed 4) transitions.
[2024-05-24 05:53:49] [INFO ] Redundant transitions in 24 ms returned []
[2024-05-24 05:53:49] [INFO ] Flow matrix only has 1070 transitions (discarded 532 similar events)
// Phase 1: matrix 1070 rows 613 cols
[2024-05-24 05:53:49] [INFO ] Computed 2 invariants in 10 ms
[2024-05-24 05:53:49] [INFO ] Dead Transitions using invariants and state equation in 500 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 613/613 places, 1602/1606 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 697 ms. Remains : 613/613 places, 1602/1606 transitions.
Built C files in :
/tmp/ltsmin16136520599620841814
[2024-05-24 05:53:49] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin16136520599620841814
Running compilation step : cd /tmp/ltsmin16136520599620841814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2985 ms.
Running link step : cd /tmp/ltsmin16136520599620841814;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 42 ms.
Running LTSmin : cd /tmp/ltsmin16136520599620841814;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased15795803611989486719.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 4 out of 613 places. Attempting structural reductions.
Starting structural reductions in LTL mode, iteration 0 : 613/613 places, 1606/1606 transitions.
Applied a total of 0 rules in 19 ms. Remains 613 /613 variables (removed 0) and now considering 1606/1606 (removed 0) transitions.
[2024-05-24 05:54:05] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
// Phase 1: matrix 1072 rows 613 cols
[2024-05-24 05:54:05] [INFO ] Computed 2 invariants in 11 ms
[2024-05-24 05:54:05] [INFO ] Implicit Places using invariants in 293 ms returned []
[2024-05-24 05:54:05] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:54:05] [INFO ] Invariant cache hit.
[2024-05-24 05:54:05] [INFO ] State equation strengthened by 265 read => feed constraints.
[2024-05-24 05:54:06] [INFO ] Implicit Places using invariants and state equation in 1532 ms returned []
Implicit Place search using SMT with State Equation took 1827 ms to find 0 implicit places.
[2024-05-24 05:54:06] [INFO ] Flow matrix only has 1072 transitions (discarded 534 similar events)
[2024-05-24 05:54:06] [INFO ] Invariant cache hit.
[2024-05-24 05:54:07] [INFO ] Dead Transitions using invariants and state equation in 525 ms found 0 transitions.
Finished structural reductions in LTL mode , in 1 iterations and 2371 ms. Remains : 613/613 places, 1606/1606 transitions.
Built C files in :
/tmp/ltsmin12320725343899716286
[2024-05-24 05:54:07] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12320725343899716286
Running compilation step : cd /tmp/ltsmin12320725343899716286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2899 ms.
Running link step : cd /tmp/ltsmin12320725343899716286;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin12320725343899716286;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--hoa' '/tmp/stateBased9485725488106042521.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:54:22] [INFO ] Flatten gal took : 32 ms
[2024-05-24 05:54:22] [INFO ] Flatten gal took : 31 ms
[2024-05-24 05:54:22] [INFO ] Time to serialize gal into /tmp/LTL13416335509823550219.gal : 5 ms
[2024-05-24 05:54:22] [INFO ] Time to serialize properties into /tmp/LTL2912296291282222167.prop : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL13416335509823550219.gal' '-t' 'CGAL' '-hoa' '/tmp/aut17706316747904737718.hoa' '-atoms' '/tmp/LTL2912296291282222167.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...319
Loading property file /tmp/LTL2912296291282222167.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut17706316747904737718.hoa
Detected timeout of ITS tools.
[2024-05-24 05:54:37] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:54:37] [INFO ] Flatten gal took : 34 ms
[2024-05-24 05:54:37] [INFO ] Time to serialize gal into /tmp/LTL9206372463543506649.gal : 5 ms
[2024-05-24 05:54:37] [INFO ] Time to serialize properties into /tmp/LTL11263314122174461769.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9206372463543506649.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL11263314122174461769.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G((F("((s1<1)||(l618<1))"))||(X(X(G("((s0>=1)&&(p1569>=1))")))))))
Formula 0 simplified : F(G!"((s1<1)||(l618<1))" & XXF!"((s0>=1)&&(p1569>=1))")
Detected timeout of ITS tools.
[2024-05-24 05:54:52] [INFO ] Flatten gal took : 33 ms
[2024-05-24 05:54:52] [INFO ] Applying decomposition
[2024-05-24 05:54:52] [INFO ] Flatten gal took : 33 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph13386690780155412182.txt' '-o' '/tmp/graph13386690780155412182.bin' '-w' '/tmp/graph13386690780155412182.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph13386690780155412182.bin' '-l' '-1' '-v' '-w' '/tmp/graph13386690780155412182.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:54:52] [INFO ] Decomposing Gal with order
[2024-05-24 05:54:52] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:54:53] [INFO ] Removed a total of 2666 redundant transitions.
[2024-05-24 05:54:53] [INFO ] Flatten gal took : 56 ms
[2024-05-24 05:54:53] [INFO ] Fuse similar labels procedure discarded/fused a total of 1167 labels/synchronizations in 42 ms.
[2024-05-24 05:54:53] [INFO ] Time to serialize gal into /tmp/LTL7990395960267959097.gal : 8 ms
[2024-05-24 05:54:53] [INFO ] Time to serialize properties into /tmp/LTL1624046026860233929.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL7990395960267959097.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL1624046026860233929.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...254
Read 1 LTL properties
Checking formula 0 : !((G((F("((i1.u1.s1<1)||(i15.u96.l618<1))"))||(X(X(G("((i0.u0.s0>=1)&&(i26.i1.u152.p1569>=1))")))))))
Formula 0 simplified : F(G!"((i1.u1.s1<1)||(i15.u96.l618<1))" & XXF!"((i0.u0.s0>=1)&&(i26.i1.u152.p1569>=1))")
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin10663915151570043477
[2024-05-24 05:55:08] [INFO ] Built C files in 14ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin10663915151570043477
Running compilation step : cd /tmp/ltsmin10663915151570043477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2788 ms.
Running link step : cd /tmp/ltsmin10663915151570043477;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 34 ms.
Running LTSmin : cd /tmp/ltsmin10663915151570043477;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[]((<>((LTLAPp0==true))||X(X([]((LTLAPp1==true))))))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-08 finished in 129742 ms.
Running Spot : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.ltl.spot.binaries_1.0.0.202304061127/bin/ltl2tgba-linux64' '--check=stutter' '--hoaf=tv' '-f' '!(G((p0&&(X(!p1) U ((!p2&&X(!p1))||X(G(!p1)))))))'
Found a Lengthening insensitive property : FunctionPointer-PT-c004-LTLFireability-13
Stuttering acceptance computed with spot in 97 ms :[true, (OR (NOT p0) p1), (OR (NOT p0) p1)]
Support contains 3 out of 791 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in LI_LTL mode, iteration 0 : 791/791 places, 2050/2050 transitions.
Discarding 15 places :
Symmetric choice reduction at 0 with 15 rule applications. Total rules 15 place count 776 transition count 2020
Iterating global reduction 0 with 15 rules applied. Total rules applied 30 place count 776 transition count 2020
Ensure Unique test removed 8 transitions
Reduce isomorphic transitions removed 8 transitions.
Iterating post reduction 0 with 8 rules applied. Total rules applied 38 place count 776 transition count 2012
Discarding 14 places :
Symmetric choice reduction at 1 with 14 rule applications. Total rules 52 place count 762 transition count 1982
Iterating global reduction 1 with 14 rules applied. Total rules applied 66 place count 762 transition count 1982
Discarding 12 places :
Symmetric choice reduction at 1 with 12 rule applications. Total rules 78 place count 750 transition count 1942
Iterating global reduction 1 with 12 rules applied. Total rules applied 90 place count 750 transition count 1942
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 103 place count 737 transition count 1898
Iterating global reduction 1 with 13 rules applied. Total rules applied 116 place count 737 transition count 1898
Discarding 13 places :
Symmetric choice reduction at 1 with 13 rule applications. Total rules 129 place count 724 transition count 1868
Iterating global reduction 1 with 13 rules applied. Total rules applied 142 place count 724 transition count 1868
Discarding 15 places :
Symmetric choice reduction at 1 with 15 rule applications. Total rules 157 place count 709 transition count 1832
Iterating global reduction 1 with 15 rules applied. Total rules applied 172 place count 709 transition count 1832
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 188 place count 693 transition count 1790
Iterating global reduction 1 with 16 rules applied. Total rules applied 204 place count 693 transition count 1790
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 220 place count 677 transition count 1754
Iterating global reduction 1 with 16 rules applied. Total rules applied 236 place count 677 transition count 1754
Discarding 16 places :
Symmetric choice reduction at 1 with 16 rule applications. Total rules 252 place count 661 transition count 1718
Iterating global reduction 1 with 16 rules applied. Total rules applied 268 place count 661 transition count 1718
Discarding 9 places :
Symmetric choice reduction at 1 with 9 rule applications. Total rules 277 place count 652 transition count 1696
Iterating global reduction 1 with 9 rules applied. Total rules applied 286 place count 652 transition count 1696
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 293 place count 645 transition count 1682
Iterating global reduction 1 with 7 rules applied. Total rules applied 300 place count 645 transition count 1682
Discarding 7 places :
Symmetric choice reduction at 1 with 7 rule applications. Total rules 307 place count 638 transition count 1668
Iterating global reduction 1 with 7 rules applied. Total rules applied 314 place count 638 transition count 1668
Discarding 4 places :
Symmetric choice reduction at 1 with 4 rule applications. Total rules 318 place count 634 transition count 1660
Iterating global reduction 1 with 4 rules applied. Total rules applied 322 place count 634 transition count 1660
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 324 place count 632 transition count 1656
Iterating global reduction 1 with 2 rules applied. Total rules applied 326 place count 632 transition count 1656
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 328 place count 630 transition count 1652
Iterating global reduction 1 with 2 rules applied. Total rules applied 330 place count 630 transition count 1652
Applied a total of 330 rules in 293 ms. Remains 630 /791 variables (removed 161) and now considering 1652/2050 (removed 398) transitions.
[2024-05-24 05:55:23] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
// Phase 1: matrix 1103 rows 630 cols
[2024-05-24 05:55:23] [INFO ] Computed 2 invariants in 17 ms
[2024-05-24 05:55:24] [INFO ] Implicit Places using invariants in 324 ms returned []
[2024-05-24 05:55:24] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-24 05:55:24] [INFO ] Invariant cache hit.
[2024-05-24 05:55:24] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:55:25] [INFO ] Implicit Places using invariants and state equation in 1319 ms returned []
Implicit Place search using SMT with State Equation took 1665 ms to find 0 implicit places.
[2024-05-24 05:55:25] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-24 05:55:25] [INFO ] Invariant cache hit.
[2024-05-24 05:55:26] [INFO ] Dead Transitions using invariants and state equation in 541 ms found 0 transitions.
Starting structural reductions in LI_LTL mode, iteration 1 : 630/791 places, 1652/2050 transitions.
Finished structural reductions in LI_LTL mode , in 1 iterations and 2501 ms. Remains : 630/791 places, 1652/2050 transitions.
Running random walk in product with property : FunctionPointer-PT-c004-LTLFireability-13 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: 2}], [{ cond=(OR (NOT p0) p1), acceptance={} source=2 dest: 0}, { cond=(AND p0 (NOT p1)), acceptance={} source=2 dest: 2}]], initial=1, aps=[p0:(OR (LT s0 1) (LT s544 1)), p1:(AND (GEQ s0 1) (GEQ s540 1))], nbAcceptance=1, properties=[trans-labels, explicit-labels, trans-acc, complete, deterministic, no-univ-branch, unambiguous, semi-deterministic, stutter-sensitive, very-weak, weak, inherently-weak, sl-invariant], stateDesc=[null, null, null][false, false, false]]
Product exploration explored 100000 steps with 0 reset in 428 ms.
Product exploration explored 100000 steps with 0 reset in 525 ms.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge sufficient to adopt a stutter insensitive property.
Knowledge based reduction with 6 factoid took 111 ms. Reduced automaton from 3 states, 5 edges and 2 AP (stutter sensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 60 ms :[true, (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 268378 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 268378 steps, saw 174210 distinct states, run finished after 3003 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:55:30] [INFO ] Flow matrix only has 1103 transitions (discarded 549 similar events)
[2024-05-24 05:55:30] [INFO ] Invariant cache hit.
[2024-05-24 05:55:30] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:55:30] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:55:30] [INFO ] After 113ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:55:30] [INFO ] [Nat]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:55:30] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:55:31] [INFO ] After 725ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:31] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:55:31] [INFO ] After 520ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:32] [INFO ] After 739ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 153 ms.
[2024-05-24 05:55:32] [INFO ] After 1727ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 3 ms.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1652/1652 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1650
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1650
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1648
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1644
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1644
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1640
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1638
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1638
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1636
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1636
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1628
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1628
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1618
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 2 with 6 rules applied. Total rules applied 36 place count 618 transition count 1612
Applied a total of 36 rules in 332 ms. Remains 618 /630 variables (removed 12) and now considering 1612/1652 (removed 40) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 332 ms. Remains : 618/630 places, 1612/1652 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 85 ms. (steps per millisecond=117 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 273598 steps, run timeout after 3001 ms. (steps per millisecond=91 ) properties seen :{}
Probabilistic random walk after 273598 steps, saw 177595 distinct states, run finished after 3003 ms. (steps per millisecond=91 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:55:35] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 618 cols
[2024-05-24 05:55:35] [INFO ] Computed 2 invariants in 8 ms
[2024-05-24 05:55:35] [INFO ] [Real]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:55:35] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:55:35] [INFO ] After 132ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:55:35] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:55:35] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:55:36] [INFO ] After 636ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:36] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:55:36] [INFO ] After 363ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:37] [INFO ] Deduced a trap composed of 135 places in 141 ms of which 1 ms to minimize.
[2024-05-24 05:55:37] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 213 ms
[2024-05-24 05:55:37] [INFO ] After 766ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 184 ms.
[2024-05-24 05:55:37] [INFO ] After 1691ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 6 ms.
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 73 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 74 ms. Remains : 618/618 places, 1612/1612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 73 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 05:55:37] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:55:37] [INFO ] Invariant cache hit.
[2024-05-24 05:55:38] [INFO ] Implicit Places using invariants in 373 ms returned []
[2024-05-24 05:55:38] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:55:38] [INFO ] Invariant cache hit.
[2024-05-24 05:55:38] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:55:39] [INFO ] Implicit Places using invariants and state equation in 1600 ms returned []
Implicit Place search using SMT with State Equation took 1975 ms to find 0 implicit places.
[2024-05-24 05:55:39] [INFO ] Redundant transitions in 28 ms returned []
[2024-05-24 05:55:39] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:55:39] [INFO ] Invariant cache hit.
[2024-05-24 05:55:40] [INFO ] Dead Transitions using invariants and state equation in 523 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2614 ms. Remains : 618/618 places, 1612/1612 transitions.
Graph (trivial) has 944 edges and 618 vertex of which 192 / 618 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 490 transition count 876
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 479 transition count 876
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 23 place count 479 transition count 803
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 169 place count 406 transition count 803
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 232 place count 343 transition count 740
Iterating global reduction 2 with 63 rules applied. Total rules applied 295 place count 343 transition count 740
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 421 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 677 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 741 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 805 place count 151 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 870 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 933 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 996 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1059 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1122 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1122 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1124 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 23 transition count 39
Applied a total of 1126 rules in 34 ms. Remains 23 /618 variables (removed 595) and now considering 39/1612 (removed 1573) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 23 cols
[2024-05-24 05:55:40] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:55:40] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:55:40] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:55:40] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:55:40] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:55:40] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:55:40] [INFO ] After 11ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:40] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:55:40] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:40] [INFO ] After 15ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 6 ms.
[2024-05-24 05:55:40] [INFO ] After 56ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 82 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 48 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 46 ms :[true, (OR (NOT p0) p1)]
Support contains 3 out of 630 places. Attempting structural reductions.
Property had overlarge support with respect to TGBA, discarding it for now.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 1652/1652 transitions.
Drop transitions removed 6 transitions
Redundant transition composition rules discarded 6 transitions
Iterating global reduction 0 with 6 rules applied. Total rules applied 6 place count 630 transition count 1646
Applied a total of 6 rules in 163 ms. Remains 630 /630 variables (removed 0) and now considering 1646/1652 (removed 6) transitions.
[2024-05-24 05:55:40] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
// Phase 1: matrix 1100 rows 630 cols
[2024-05-24 05:55:40] [INFO ] Computed 2 invariants in 13 ms
[2024-05-24 05:55:41] [INFO ] Implicit Places using invariants in 356 ms returned []
[2024-05-24 05:55:41] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-24 05:55:41] [INFO ] Invariant cache hit.
[2024-05-24 05:55:41] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:55:42] [INFO ] Implicit Places using invariants and state equation in 1456 ms returned []
Implicit Place search using SMT with State Equation took 1821 ms to find 0 implicit places.
[2024-05-24 05:55:42] [INFO ] Redundant transitions in 26 ms returned []
[2024-05-24 05:55:42] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-24 05:55:42] [INFO ] Invariant cache hit.
[2024-05-24 05:55:43] [INFO ] Dead Transitions using invariants and state equation in 522 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 630/630 places, 1646/1652 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2546 ms. Remains : 630/630 places, 1646/1652 transitions.
Computed a total of 192 stabilizing places and 512 stable transitions
Computed a total of 192 stabilizing places and 512 stable transitions
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 84 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 51 ms :[true, (OR (NOT p0) p1)]
Incomplete random walk after 10000 steps, including 2 resets, run finished after 92 ms. (steps per millisecond=108 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 16 ms. (steps per millisecond=625 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 269937 steps, run timeout after 3001 ms. (steps per millisecond=89 ) properties seen :{}
Probabilistic random walk after 269937 steps, saw 175221 distinct states, run finished after 3001 ms. (steps per millisecond=89 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:55:46] [INFO ] Flow matrix only has 1100 transitions (discarded 546 similar events)
[2024-05-24 05:55:46] [INFO ] Invariant cache hit.
[2024-05-24 05:55:46] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:55:46] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:55:46] [INFO ] After 107ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:55:46] [INFO ] [Nat]Absence check using 1 positive place invariants in 4 ms returned sat
[2024-05-24 05:55:46] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:55:47] [INFO ] After 661ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:47] [INFO ] State equation strengthened by 271 read => feed constraints.
[2024-05-24 05:55:47] [INFO ] After 651ms SMT Verify possible using 271 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:48] [INFO ] After 834ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 132 ms.
[2024-05-24 05:55:48] [INFO ] After 1741ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 2 ms.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 630/630 places, 1646/1646 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1638
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1614
Drop transitions removed 2 transitions
Redundant transition composition rules discarded 2 transitions
Iterating global reduction 2 with 2 rules applied. Total rules applied 32 place count 618 transition count 1612
Applied a total of 32 rules in 301 ms. Remains 618 /630 variables (removed 12) and now considering 1612/1646 (removed 34) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 301 ms. Remains : 618/630 places, 1612/1646 transitions.
Incomplete random walk after 10000 steps, including 2 resets, run finished after 88 ms. (steps per millisecond=113 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10001 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Incomplete Best-First random walk after 10000 steps, including 2 resets, run finished after 17 ms. (steps per millisecond=588 ) properties (out of 2) seen :0
Interrupted probabilistic random walk after 281394 steps, run timeout after 3001 ms. (steps per millisecond=93 ) properties seen :{}
Probabilistic random walk after 281394 steps, saw 182655 distinct states, run finished after 3001 ms. (steps per millisecond=93 ) properties seen :0
Running SMT prover for 2 properties.
[2024-05-24 05:55:51] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
// Phase 1: matrix 1079 rows 618 cols
[2024-05-24 05:55:51] [INFO ] Computed 2 invariants in 5 ms
[2024-05-24 05:55:51] [INFO ] [Real]Absence check using 1 positive place invariants in 2 ms returned sat
[2024-05-24 05:55:51] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:55:51] [INFO ] After 102ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:55:51] [INFO ] [Nat]Absence check using 1 positive place invariants in 3 ms returned sat
[2024-05-24 05:55:51] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:55:52] [INFO ] After 664ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:52] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:55:52] [INFO ] After 385ms SMT Verify possible using 268 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:53] [INFO ] Deduced a trap composed of 135 places in 154 ms of which 1 ms to minimize.
[2024-05-24 05:55:53] [INFO ] Trap strengthening (SAT) tested/added 2/1 trap constraints in 237 ms
[2024-05-24 05:55:53] [INFO ] After 830ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 193 ms.
[2024-05-24 05:55:53] [INFO ] After 1807ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Parikh walk visited 0 properties in 4 ms.
Support contains 3 out of 618 places. Attempting structural reductions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 68 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 68 ms. Remains : 618/618 places, 1612/1612 transitions.
Starting structural reductions in REACHABILITY mode, iteration 0 : 618/618 places, 1612/1612 transitions.
Applied a total of 0 rules in 74 ms. Remains 618 /618 variables (removed 0) and now considering 1612/1612 (removed 0) transitions.
[2024-05-24 05:55:53] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:55:53] [INFO ] Invariant cache hit.
[2024-05-24 05:55:54] [INFO ] Implicit Places using invariants in 341 ms returned []
[2024-05-24 05:55:54] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:55:54] [INFO ] Invariant cache hit.
[2024-05-24 05:55:54] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:55:55] [INFO ] Implicit Places using invariants and state equation in 1403 ms returned []
Implicit Place search using SMT with State Equation took 1753 ms to find 0 implicit places.
[2024-05-24 05:55:55] [INFO ] Redundant transitions in 23 ms returned []
[2024-05-24 05:55:55] [INFO ] Flow matrix only has 1079 transitions (discarded 533 similar events)
[2024-05-24 05:55:55] [INFO ] Invariant cache hit.
[2024-05-24 05:55:56] [INFO ] Dead Transitions using invariants and state equation in 520 ms found 0 transitions.
Finished structural reductions in REACHABILITY mode , in 1 iterations and 2382 ms. Remains : 618/618 places, 1612/1612 transitions.
Graph (trivial) has 944 edges and 618 vertex of which 192 / 618 are part of one of the 64 SCC in 0 ms
Free SCC test removed 128 places
Drop transitions removed 320 transitions
Ensure Unique test removed 405 transitions
Reduce isomorphic transitions removed 725 transitions.
Drop transitions removed 11 transitions
Trivial Post-agglo rules discarded 11 transitions
Performed 11 trivial Post agglomeration. Transition count delta: 11
Iterating post reduction 0 with 11 rules applied. Total rules applied 12 place count 490 transition count 876
Reduce places removed 11 places and 0 transitions.
Iterating post reduction 1 with 11 rules applied. Total rules applied 23 place count 479 transition count 876
Performed 73 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 2 with 73 Pre rules applied. Total rules applied 23 place count 479 transition count 803
Deduced a syphon composed of 73 places in 0 ms
Reduce places removed 73 places and 0 transitions.
Iterating global reduction 2 with 146 rules applied. Total rules applied 169 place count 406 transition count 803
Discarding 63 places :
Symmetric choice reduction at 2 with 63 rule applications. Total rules 232 place count 343 transition count 740
Iterating global reduction 2 with 63 rules applied. Total rules applied 295 place count 343 transition count 740
Ensure Unique test removed 126 transitions
Reduce isomorphic transitions removed 126 transitions.
Iterating post reduction 2 with 126 rules applied. Total rules applied 421 place count 343 transition count 614
Performed 128 Post agglomeration using F-continuation condition.Transition count delta: 128
Deduced a syphon composed of 128 places in 0 ms
Reduce places removed 128 places and 0 transitions.
Iterating global reduction 3 with 256 rules applied. Total rules applied 677 place count 215 transition count 486
Discarding 64 places :
Symmetric choice reduction at 3 with 64 rule applications. Total rules 741 place count 151 transition count 358
Iterating global reduction 3 with 64 rules applied. Total rules applied 805 place count 151 transition count 358
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 3 with 2 rules applied. Total rules applied 807 place count 151 transition count 356
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 870 place count 88 transition count 230
Iterating global reduction 4 with 63 rules applied. Total rules applied 933 place count 88 transition count 230
Discarding 63 places :
Symmetric choice reduction at 4 with 63 rule applications. Total rules 996 place count 25 transition count 104
Iterating global reduction 4 with 63 rules applied. Total rules applied 1059 place count 25 transition count 104
Ensure Unique test removed 63 transitions
Reduce isomorphic transitions removed 63 transitions.
Iterating post reduction 4 with 63 rules applied. Total rules applied 1122 place count 25 transition count 41
Performed 1 Pre agglomeration using Quasi-Persistent + Divergent Free condition..
Pre-agglomeration after 5 with 1 Pre rules applied. Total rules applied 1122 place count 25 transition count 40
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1124 place count 24 transition count 40
Performed 1 Post agglomeration using F-continuation condition.Transition count delta: 1
Deduced a syphon composed of 1 places in 0 ms
Reduce places removed 1 places and 0 transitions.
Iterating global reduction 5 with 2 rules applied. Total rules applied 1126 place count 23 transition count 39
Applied a total of 1126 rules in 28 ms. Remains 23 /618 variables (removed 595) and now considering 39/1612 (removed 1573) transitions.
Running SMT prover for 2 properties.
// Phase 1: matrix 39 rows 23 cols
[2024-05-24 05:55:56] [INFO ] Computed 2 invariants in 1 ms
[2024-05-24 05:55:56] [INFO ] [Real]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:55:56] [INFO ] [Real]Absence check using 1 positive and 1 generalized place invariants in 1 ms returned sat
[2024-05-24 05:55:56] [INFO ] After 19ms SMT Verify possible using all constraints in real domain returned unsat :0 sat :0 real:2
[2024-05-24 05:55:56] [INFO ] [Nat]Absence check using 1 positive place invariants in 0 ms returned sat
[2024-05-24 05:55:56] [INFO ] [Nat]Absence check using 1 positive and 1 generalized place invariants in 0 ms returned sat
[2024-05-24 05:55:56] [INFO ] After 13ms SMT Verify possible using state equation in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:56] [INFO ] State equation strengthened by 2 read => feed constraints.
[2024-05-24 05:55:56] [INFO ] After 5ms SMT Verify possible using 2 Read/Feed constraints in natural domain returned unsat :0 sat :2
[2024-05-24 05:55:56] [INFO ] After 12ms SMT Verify possible using trap constraints in natural domain returned unsat :0 sat :2
Attempting to minimize the solution found.
Minimization took 5 ms.
[2024-05-24 05:55:56] [INFO ] After 50ms SMT Verify possible using all constraints in natural domain returned unsat :0 sat :2
Knowledge obtained : [(AND p0 (NOT p1)), (X (AND p0 (NOT p1))), (X (NOT (OR (NOT p0) p1))), true, (X (X (AND p0 (NOT p1)))), (X (X (NOT (OR (NOT p0) p1))))]
False Knowledge obtained : []
Knowledge based reduction with 6 factoid took 64 ms. Reduced automaton from 2 states, 3 edges and 2 AP (stutter insensitive) to 2 states, 3 edges and 2 AP (stutter insensitive).
Stuttering acceptance computed with spot in 52 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 67 ms :[true, (OR (NOT p0) p1)]
Stuttering acceptance computed with spot in 57 ms :[true, (OR (NOT p0) p1)]
Product exploration explored 100000 steps with 0 reset in 375 ms.
Product exploration explored 100000 steps with 0 reset in 420 ms.
Built C files in :
/tmp/ltsmin49924206115445686
[2024-05-24 05:55:57] [INFO ] Too many transitions (1646) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:55:57] [INFO ] Built C files in 12ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin49924206115445686
Running compilation step : cd /tmp/ltsmin49924206115445686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2968 ms.
Running link step : cd /tmp/ltsmin49924206115445686;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 46 ms.
Running LTSmin : cd /tmp/ltsmin49924206115445686;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased10615277667164433819.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Support contains 3 out of 630 places. Attempting structural reductions.
Starting structural reductions in SI_LTL mode, iteration 0 : 630/630 places, 1646/1646 transitions.
Discarding 1 places :
Symmetric choice reduction at 0 with 1 rule applications. Total rules 1 place count 629 transition count 1644
Iterating global reduction 0 with 1 rules applied. Total rules applied 2 place count 629 transition count 1644
Ensure Unique test removed 2 transitions
Reduce isomorphic transitions removed 2 transitions.
Iterating post reduction 0 with 2 rules applied. Total rules applied 4 place count 629 transition count 1642
Discarding 2 places :
Symmetric choice reduction at 1 with 2 rule applications. Total rules 6 place count 627 transition count 1638
Iterating global reduction 1 with 2 rules applied. Total rules applied 8 place count 627 transition count 1638
Ensure Unique test removed 4 transitions
Reduce isomorphic transitions removed 4 transitions.
Iterating post reduction 1 with 4 rules applied. Total rules applied 12 place count 627 transition count 1634
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 13 place count 626 transition count 1632
Iterating global reduction 2 with 1 rules applied. Total rules applied 14 place count 626 transition count 1632
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 15 place count 625 transition count 1630
Iterating global reduction 2 with 1 rules applied. Total rules applied 16 place count 625 transition count 1630
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 17 place count 624 transition count 1626
Iterating global reduction 2 with 1 rules applied. Total rules applied 18 place count 624 transition count 1626
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 19 place count 623 transition count 1624
Iterating global reduction 2 with 1 rules applied. Total rules applied 20 place count 623 transition count 1624
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 21 place count 622 transition count 1622
Iterating global reduction 2 with 1 rules applied. Total rules applied 22 place count 622 transition count 1622
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 23 place count 621 transition count 1620
Iterating global reduction 2 with 1 rules applied. Total rules applied 24 place count 621 transition count 1620
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 25 place count 620 transition count 1618
Iterating global reduction 2 with 1 rules applied. Total rules applied 26 place count 620 transition count 1618
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 27 place count 619 transition count 1616
Iterating global reduction 2 with 1 rules applied. Total rules applied 28 place count 619 transition count 1616
Discarding 1 places :
Symmetric choice reduction at 2 with 1 rule applications. Total rules 29 place count 618 transition count 1614
Iterating global reduction 2 with 1 rules applied. Total rules applied 30 place count 618 transition count 1614
Applied a total of 30 rules in 233 ms. Remains 618 /630 variables (removed 12) and now considering 1614/1646 (removed 32) transitions.
[2024-05-24 05:56:12] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
// Phase 1: matrix 1080 rows 618 cols
[2024-05-24 05:56:12] [INFO ] Computed 2 invariants in 14 ms
[2024-05-24 05:56:12] [INFO ] Implicit Places using invariants in 370 ms returned []
[2024-05-24 05:56:12] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-24 05:56:12] [INFO ] Invariant cache hit.
[2024-05-24 05:56:13] [INFO ] State equation strengthened by 268 read => feed constraints.
[2024-05-24 05:56:14] [INFO ] Implicit Places using invariants and state equation in 1484 ms returned []
Implicit Place search using SMT with State Equation took 1854 ms to find 0 implicit places.
[2024-05-24 05:56:14] [INFO ] Redundant transitions in 29 ms returned []
[2024-05-24 05:56:14] [INFO ] Flow matrix only has 1080 transitions (discarded 534 similar events)
[2024-05-24 05:56:14] [INFO ] Invariant cache hit.
[2024-05-24 05:56:14] [INFO ] Dead Transitions using invariants and state equation in 482 ms found 0 transitions.
Starting structural reductions in SI_LTL mode, iteration 1 : 618/630 places, 1614/1646 transitions.
Finished structural reductions in SI_LTL mode , in 1 iterations and 2604 ms. Remains : 618/630 places, 1614/1646 transitions.
Built C files in :
/tmp/ltsmin12339065866503927952
[2024-05-24 05:56:14] [INFO ] Too many transitions (1614) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:56:14] [INFO ] Built C files in 23ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin12339065866503927952
Running compilation step : cd /tmp/ltsmin12339065866503927952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2812 ms.
Running link step : cd /tmp/ltsmin12339065866503927952;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin12339065866503927952;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--hoa' '/tmp/stateBased14386534678149520075.hoa' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
[2024-05-24 05:56:29] [INFO ] Flatten gal took : 36 ms
[2024-05-24 05:56:29] [INFO ] Flatten gal took : 35 ms
[2024-05-24 05:56:29] [INFO ] Time to serialize gal into /tmp/LTL9849275011564704371.gal : 14 ms
[2024-05-24 05:56:29] [INFO ] Time to serialize properties into /tmp/LTL4767401255925027103.prop : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL9849275011564704371.gal' '-t' 'CGAL' '-hoa' '/tmp/aut9087649511769711291.hoa' '-atoms' '/tmp/LTL4767401255925027103.prop' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...317
Loading property file /tmp/LTL4767401255925027103.prop.
Loaded 2 atomic propositions.
Checking formula 0 provided in automaton : /tmp/aut9087649511769711291.hoa
Detected timeout of ITS tools.
[2024-05-24 05:56:45] [INFO ] Flatten gal took : 32 ms
[2024-05-24 05:56:45] [INFO ] Flatten gal took : 31 ms
[2024-05-24 05:56:45] [INFO ] Time to serialize gal into /tmp/LTL12308052593190268817.gal : 5 ms
[2024-05-24 05:56:45] [INFO ] Time to serialize properties into /tmp/LTL7938429037579652705.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL12308052593190268817.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL7938429037579652705.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...276
Read 1 LTL properties
Checking formula 0 : !((G(((X(!("((s0>=1)&&(l1415>=1))")))U((X(G(!("((s0>=1)&&(l1415>=1))"))))||((!("((s1>=1)&&(l1786>=1))"))&&(X(!("((s0>=1)&&(l1415>=1))"...189
Formula 0 simplified : F(!"((s0<1)||(l1505<1))" | (X"((s0>=1)&&(l1415>=1))" R (XF"((s0>=1)&&(l1415>=1))" & ("((s1>=1)&&(l1786>=1))" | X"((s0>=1)&&(l1415>=1...162
Detected timeout of ITS tools.
[2024-05-24 05:57:00] [INFO ] Flatten gal took : 31 ms
[2024-05-24 05:57:00] [INFO ] Applying decomposition
[2024-05-24 05:57:00] [INFO ] Flatten gal took : 32 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph7561241826375640956.txt' '-o' '/tmp/graph7561241826375640956.bin' '-w' '/tmp/graph7561241826375640956.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph7561241826375640956.bin' '-l' '-1' '-v' '-w' '/tmp/graph7561241826375640956.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:57:00] [INFO ] Decomposing Gal with order
[2024-05-24 05:57:00] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:57:00] [INFO ] Removed a total of 2744 redundant transitions.
[2024-05-24 05:57:00] [INFO ] Flatten gal took : 51 ms
[2024-05-24 05:57:00] [INFO ] Fuse similar labels procedure discarded/fused a total of 1167 labels/synchronizations in 29 ms.
[2024-05-24 05:57:00] [INFO ] Time to serialize gal into /tmp/LTL2609277951070746381.gal : 8 ms
[2024-05-24 05:57:00] [INFO ] Time to serialize properties into /tmp/LTL12219127160827907118.ltl : 0 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTL2609277951070746381.gal' '-t' 'CGAL' '-LTL' '/tmp/LTL12219127160827907118.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...255
Read 1 LTL properties
Checking formula 0 : !((G(((X(!("((i0.u0.s0>=1)&&(i30.i0.u152.l1415>=1))")))U((X(G(!("((i0.u0.s0>=1)&&(i30.i0.u152.l1415>=1))"))))||((!("((i11.i0.u1.s1>=1)...283
Formula 0 simplified : F(!"((i0.u0.s0<1)||(i30.i0.u155.l1505<1))" | (X"((i0.u0.s0>=1)&&(i30.i0.u152.l1415>=1))" R (XF"((i0.u0.s0>=1)&&(i30.i0.u152.l1415>=1...256
Detected timeout of ITS tools.
Built C files in :
/tmp/ltsmin2045847434785177323
[2024-05-24 05:57:15] [INFO ] Built C files in 11ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin2045847434785177323
Running compilation step : cd /tmp/ltsmin2045847434785177323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '3' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
Compilation finished in 2813 ms.
Running link step : cd /tmp/ltsmin2045847434785177323;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 36 ms.
Running LTSmin : cd /tmp/ltsmin2045847434785177323;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](((X(!(LTLAPp0==true)) U (X([](!(LTLAPp0==true)))||(!(LTLAPp1==true)&&X(!(LTLAPp0==true)))))&&(LTLAPp2==true)))' '--buchi-type=spotba'
WARNING : LTS min runner thread was asked to interrupt. Dying gracefully.
Treatment of property FunctionPointer-PT-c004-LTLFireability-13 finished in 127267 ms.
[2024-05-24 05:57:30] [INFO ] Flatten gal took : 47 ms
Using solver Z3 to compute partial order matrices.
Built C files in :
/tmp/ltsmin15240145573943013930
[2024-05-24 05:57:30] [INFO ] Too many transitions (2050) to apply POR reductions. Disabling POR matrices.
[2024-05-24 05:57:30] [INFO ] Applying decomposition
[2024-05-24 05:57:30] [INFO ] Built C files in 44ms conformant to PINS (ltsmin variant)in folder :/tmp/ltsmin15240145573943013930
Running compilation step : cd /tmp/ltsmin15240145573943013930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/limit_time.pl' '120' 'gcc' '-c' '-I/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/include/' '-I.' '-std=c99' '-fPIC' '-O0' 'model.c'
[2024-05-24 05:57:30] [INFO ] Flatten gal took : 50 ms
Converted graph to binary with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/convert-linux64' '-i' '/tmp/graph8703667399626651058.txt' '-o' '/tmp/graph8703667399626651058.bin' '-w' '/tmp/graph8703667399626651058.weights'
Built communities with : '/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.louvain.binaries_1.0.0.202304061127/bin/louvain-linux64' '/tmp/graph8703667399626651058.bin' '-l' '-1' '-v' '-w' '/tmp/graph8703667399626651058.weights' '-q' '0' '-e' '0.001'
[2024-05-24 05:57:30] [INFO ] Decomposing Gal with order
[2024-05-24 05:57:30] [INFO ] Rewriting arrays to variables to allow decomposition.
[2024-05-24 05:57:31] [INFO ] Removed a total of 3436 redundant transitions.
[2024-05-24 05:57:31] [INFO ] Flatten gal took : 87 ms
[2024-05-24 05:57:31] [INFO ] Fuse similar labels procedure discarded/fused a total of 1567 labels/synchronizations in 59 ms.
[2024-05-24 05:57:31] [INFO ] Time to serialize gal into /tmp/LTLFireability15442295430844009034.gal : 21 ms
[2024-05-24 05:57:31] [INFO ] Time to serialize properties into /tmp/LTLFireability6675178616521950769.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability15442295430844009034.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability6675178616521950769.ltl' '-c' '-stutter-deadlock'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...277
Read 6 LTL properties
Checking formula 0 : !((G(F("((i1.u1.s1<1)||(i0.u201.l1638<1))"))))
Formula 0 simplified : FG!"((i1.u1.s1<1)||(i0.u201.l1638<1))"
Compilation finished in 4122 ms.
Running link step : cd /tmp/ltsmin15240145573943013930;'gcc' '-shared' '-o' 'gal.so' 'model.o'
Link finished in 47 ms.
Running LTSmin : cd /tmp/ltsmin15240145573943013930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
WARNING : LTSmin timed out (>600 s) on command cd /tmp/ltsmin15240145573943013930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '-p' '--pins-guards' '--when' '--ltl' '[](<>((LTLAPp0==true)))' '--buchi-type=spotba'
Running LTSmin : cd /tmp/ltsmin15240145573943013930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))' '--buchi-type=spotba'
pins2lts-mc-linux64, 0.000: Registering PINS so language module
pins2lts-mc-linux64( 0/ 8), 0.003: Loading model from ./gal.so
pins2lts-mc-linux64( 5/ 8), 0.014: library has no initializer
pins2lts-mc-linux64( 5/ 8), 0.014: loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: completed loading model GAL
pins2lts-mc-linux64( 5/ 8), 0.019: LTL layer: formula: [](<>(((!(LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))
pins2lts-mc-linux64( 5/ 8), 0.019: "[](<>(((!(LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))" is not a file, parsing as formula...
pins2lts-mc-linux64( 5/ 8), 0.020: Using Spin LTL semantics
pins2lts-mc-linux64( 0/ 8), 0.024: library has no initializer
pins2lts-mc-linux64( 0/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 2/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 7/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 6/ 8), 0.022: loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 3/ 8), 0.024: loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.023: library has no initializer
pins2lts-mc-linux64( 4/ 8), 0.023: loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.022: library has no initializer
pins2lts-mc-linux64( 1/ 8), 0.035: loading model GAL
pins2lts-mc-linux64( 0/ 8), 0.046: completed loading model GAL
pins2lts-mc-linux64( 2/ 8), 0.048: completed loading model GAL
pins2lts-mc-linux64( 7/ 8), 0.057: completed loading model GAL
pins2lts-mc-linux64( 4/ 8), 0.077: completed loading model GAL
pins2lts-mc-linux64( 1/ 8), 0.079: completed loading model GAL
pins2lts-mc-linux64( 3/ 8), 0.086: completed loading model GAL
pins2lts-mc-linux64( 6/ 8), 0.087: completed loading model GAL
pins2lts-mc-linux64( 0/ 8), 1.223: There are 2066 state labels and 1 edge labels
pins2lts-mc-linux64( 0/ 8), 1.223: State length is 792, there are 2061 groups
pins2lts-mc-linux64( 0/ 8), 1.223: Running cndfs using 8 cores
pins2lts-mc-linux64( 0/ 8), 1.223: Using a tree table with 2^27 elements
pins2lts-mc-linux64( 0/ 8), 1.223: Successor permutation: dynamic
pins2lts-mc-linux64( 0/ 8), 1.223: Global bits: 2, count bits: 0, local bits: 0
pins2lts-mc-linux64( 1/ 8), 1.433: [Blue] ~120 levels ~960 states ~3728 transitions
pins2lts-mc-linux64( 1/ 8), 1.599: [Blue] ~240 levels ~1920 states ~7376 transitions
pins2lts-mc-linux64( 1/ 8), 1.936: [Blue] ~480 levels ~3840 states ~14672 transitions
pins2lts-mc-linux64( 1/ 8), 2.848: [Blue] ~960 levels ~7680 states ~29264 transitions
pins2lts-mc-linux64( 1/ 8), 5.605: [Blue] ~1920 levels ~15360 states ~58448 transitions
pins2lts-mc-linux64( 1/ 8), 11.244: [Blue] ~3840 levels ~30720 states ~116816 transitions
pins2lts-mc-linux64( 1/ 8), 21.120: [Blue] ~7680 levels ~61440 states ~233552 transitions
pins2lts-mc-linux64( 1/ 8), 37.005: [Blue] ~15360 levels ~122880 states ~467024 transitions
pins2lts-mc-linux64( 6/ 8), 65.099: [Blue] ~30720 levels ~245760 states ~737888 transitions
pins2lts-mc-linux64( 1/ 8), 104.810: [Blue] ~61440 levels ~491520 states ~1867856 transitions
pins2lts-mc-linux64( 1/ 8), 166.297: [Blue] ~122880 levels ~983040 states ~3735632 transitions
pins2lts-mc-linux64( 1/ 8), 233.356: [Blue] ~245760 levels ~1966080 states ~7471184 transitions
pins2lts-mc-linux64( 1/ 8), 358.509: [Blue] ~491520 levels ~3932160 states ~14942288 transitions
pins2lts-mc-linux64( 2/ 8), 511.584: Error: tree leafs table full! Change -s/--ratio.
pins2lts-mc-linux64( 0/ 8), 511.699:
pins2lts-mc-linux64( 0/ 8), 511.699: Explored 6050813 states 29811878 transitions, fanout: 4.927
pins2lts-mc-linux64( 0/ 8), 511.699: Total exploration time 510.420 sec (510.290 sec minimum, 510.370 sec on average)
pins2lts-mc-linux64( 0/ 8), 511.699: States per second: 11855, Transitions per second: 58407
pins2lts-mc-linux64( 0/ 8), 511.699:
pins2lts-mc-linux64( 0/ 8), 511.699: State space has 27869365 states, 0 are accepting
pins2lts-mc-linux64( 0/ 8), 511.699: cndfs_1 (permutation: dynamic) stats:
pins2lts-mc-linux64( 0/ 8), 511.699: blue states: 6050813 (21.71%), transitions: 0 (per worker)
pins2lts-mc-linux64( 0/ 8), 511.699: red states: 0 (0.00%), bogus: 0 (0.00%), transitions: 0, waits: 0 (0.00 sec)
pins2lts-mc-linux64( 0/ 8), 511.699: all-red states: 0 (0.00%), bogus 0 (0.00%)
pins2lts-mc-linux64( 0/ 8), 511.699:
pins2lts-mc-linux64( 0/ 8), 511.699: Total memory used for local state coloring: 92.3MB
pins2lts-mc-linux64( 0/ 8), 511.699:
pins2lts-mc-linux64( 0/ 8), 511.699: Queue width: 8B, total height: 6050813, memory: 46.16MB
pins2lts-mc-linux64( 0/ 8), 511.699: Tree memory: 468.6MB, 17.6 B/state, compr.: 0.6%
pins2lts-mc-linux64( 0/ 8), 511.699: Tree fill ratio (roots/leafs): 20.0%/99.0%
pins2lts-mc-linux64( 0/ 8), 511.699: Stored 2126 string chucks using 0MB
pins2lts-mc-linux64( 0/ 8), 511.699: Total memory used for chunk indexing: 0MB
pins2lts-mc-linux64( 0/ 8), 511.699: Est. total memory use: 514.8MB (~1070.2MB paged-in)
WARNING : LTS min runner thread failed on error :java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15240145573943013930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
java.lang.RuntimeException: Unexpected exception when executing ltsmin :cd /tmp/ltsmin15240145573943013930;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.ltsmin.binaries_1.0.0.202304061127/bin/pins2lts-mc-linux64' './gal.so' '--threads=8' '--when' '--ltl' '[](<>(((!(LTLAPp1==true)&&X(!(LTLAPp2==true)))||[](!(LTLAPp2==true)))))' '--buchi-type=spotba'
255
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner.checkProperty(LTSminRunner.java:240)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.checkProperties(LTSminRunner.java:175)
at fr.lip6.move.gal.application.runner.ltsmin.LTSminRunner$1.run(LTSminRunner.java:113)
at java.base/java.lang.Thread.run(Thread.java:833)
Detected timeout of ITS tools.
[2024-05-24 06:25:22] [INFO ] Flatten gal took : 45 ms
[2024-05-24 06:25:22] [INFO ] Time to serialize gal into /tmp/LTLFireability11942205264857041247.gal : 8 ms
[2024-05-24 06:25:22] [INFO ] Time to serialize properties into /tmp/LTLFireability5843276225406069470.ltl : 1 ms
Invoking ITS tools like this :cd /home/mcc/execution;'/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64' '--gc-threshold' '2000000' '-i' '/tmp/LTLFireability11942205264857041247.gal' '-t' 'CGAL' '-LTL' '/tmp/LTLFireability5843276225406069470.ltl' '-c' '-stutter-deadlock' '--gen-order' 'FOLLOW'
its-ltl command run as :
/home/mcc/BenchKit/itstools/itstools/plugins/fr.lip6.move.gal.itstools.binaries_1.0.0.202304061127/bin/its-ltl-linux64 --gc-threshold 2000000 -i /tmp/L...298
Read 6 LTL properties
Checking formula 0 : !((G(F("((s1<1)||(l1638<1))"))))
Formula 0 simplified : FG!"((s1<1)||(l1638<1))"
TIME LIMIT: Killed by timeout after 3600 seconds
MemTotal: 16393216 kB
MemFree: 593196 kB
After kill :
MemTotal: 16393216 kB
MemFree: 16030692 kB
BK_TIME_CONFINEMENT_REACHED
--------------------
content from stderr:
+ export BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
+ BINDIR=/home/mcc/BenchKit/bin//../itstools/bin//../
++ pwd
+ export MODEL=/home/mcc/execution
+ MODEL=/home/mcc/execution
+ [[ LTLFireability = StateSpace ]]
+ /home/mcc/BenchKit/bin//../itstools/bin//..//runeclipse.sh /home/mcc/execution LTLFireability -its -ltsmin -greatspnpath /home/mcc/BenchKit/bin//../itstools/bin//..//greatspn/ -order META -manyOrder -smt -timeout 3600
+ ulimit -s 65536
+ [[ -z '' ]]
+ export LTSMIN_MEM_SIZE=8589934592
+ LTSMIN_MEM_SIZE=8589934592
+ export PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ PYTHONPATH=/home/mcc/BenchKit/itstools/pylibs
+ export LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
+ LD_LIBRARY_PATH=/home/mcc/BenchKit/itstools/pylibs:
++ sed s/.jar//
++ perl -pe 's/.*\.//g'
++ ls /home/mcc/BenchKit/bin//../itstools/bin//..//itstools/plugins/fr.lip6.move.gal.application.pnmcc_1.0.0.202304061127.jar
+ VERSION=202304061127
+ echo 'Running Version 202304061127'
+ /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="FunctionPointer-PT-c004"
export BK_EXAMINATION="LTLFireability"
export BK_TOOL="gold2023"
export BK_RESULT_DIR="/tmp/BK_RESULTS/OUTPUTS"
export BK_TIME_CONFINEMENT="3600"
export BK_MEMORY_CONFINEMENT="16384"
export BK_BIN_PATH="/home/mcc/BenchKit/bin/"
# this is specific to your benchmark or test
export BIN_DIR="$HOME/BenchKit/bin"
# remove the execution directoty if it exists (to avoid increse of .vmdk images)
if [ -d execution ] ; then
rm -rf execution
fi
# this is for BenchKit: explicit launching of the test
echo "====================================================================="
echo " Generated by BenchKit 2-5568"
echo " Executing tool gold2023"
echo " Input is FunctionPointer-PT-c004, 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 r197-tall-171640625000178"
echo "====================================================================="
echo
echo "--------------------"
echo "preparation of the directory to be used:"
tar xzf /home/mcc/BenchKit/INPUTS/FunctionPointer-PT-c004.tgz
mv FunctionPointer-PT-c004 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 ;